Pub Date : 2019-09-01DOI: 10.1109/SYNASC49474.2019.00033
Noémi Gaskó, M. Suciu, Tamás Képes, R. Lung
The problem of Network Influence Maximization is approached by an Extremal Optimization algorithm called Shapley value Extremal Optimization (SvEO). The influence maximization problem for the independent cascade model is considered as a cooperative game. In this cooperative game players seek to choose seeder nodes to maximize the value of the game computed as the size of the influence set of their cascade model by maximizing their average marginal contribution to all possible player coalitions (i.e. subsets of the seeder set). SvEO is compared with other influence maximization algorithms by means of numerical experiments, with promising results. Possible implications of the use of the Shapley value are discussed using a network constructed from highly cited publication data in the field of computer science.
{"title":"Shapley Value and Extremal Optimization for the Network Influence Maximization Problem","authors":"Noémi Gaskó, M. Suciu, Tamás Képes, R. Lung","doi":"10.1109/SYNASC49474.2019.00033","DOIUrl":"https://doi.org/10.1109/SYNASC49474.2019.00033","url":null,"abstract":"The problem of Network Influence Maximization is approached by an Extremal Optimization algorithm called Shapley value Extremal Optimization (SvEO). The influence maximization problem for the independent cascade model is considered as a cooperative game. In this cooperative game players seek to choose seeder nodes to maximize the value of the game computed as the size of the influence set of their cascade model by maximizing their average marginal contribution to all possible player coalitions (i.e. subsets of the seeder set). SvEO is compared with other influence maximization algorithms by means of numerical experiments, with promising results. Possible implications of the use of the Shapley value are discussed using a network constructed from highly cited publication data in the field of computer science.","PeriodicalId":102054,"journal":{"name":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"154 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":"132455098","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.00057
Alina Carunta, Mihai Plesu
The aim of this poster is to present a work in progress aiming to investigate the applicability of some recent algorithms proposed for functional motif finding in biological networks to infer information about antimicrobial resistance patterns.
{"title":"Motif Detection in Biological Networks","authors":"Alina Carunta, Mihai Plesu","doi":"10.1109/SYNASC49474.2019.00057","DOIUrl":"https://doi.org/10.1109/SYNASC49474.2019.00057","url":null,"abstract":"The aim of this poster is to present a work in progress aiming to investigate the applicability of some recent algorithms proposed for functional motif finding in biological networks to infer information about antimicrobial resistance patterns.","PeriodicalId":102054,"journal":{"name":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"29 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":"116060015","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.00056
Bogdan-Petru Butunoi
The recent increased availability of insulin pumps and continuous glucose monitors(CGM) created a new focus in current research: the development of a close-loop system that would become the perfect artificial pancreas. So far, there are some community projects that try to achieve this goal. If our hypothesis is supported, then artificial intelligence could solve this problem once and for all. Artificial intelligence could help the patient maintain the blood glucose level as stable as possible, while requiring little to no interaction from the user. Such a closed-loop system may improve the quality of life for the patient and prevent the long-term side effects of diabetes.
{"title":"Artificial Intelligence Improving the Life of Type 1 Diabetes","authors":"Bogdan-Petru Butunoi","doi":"10.1109/SYNASC49474.2019.00056","DOIUrl":"https://doi.org/10.1109/SYNASC49474.2019.00056","url":null,"abstract":"The recent increased availability of insulin pumps and continuous glucose monitors(CGM) created a new focus in current research: the development of a close-loop system that would become the perfect artificial pancreas. So far, there are some community projects that try to achieve this goal. If our hypothesis is supported, then artificial intelligence could solve this problem once and for all. Artificial intelligence could help the patient maintain the blood glucose level as stable as possible, while requiring little to no interaction from the user. Such a closed-loop system may improve the quality of life for the patient and prevent the long-term side effects of diabetes.","PeriodicalId":102054,"journal":{"name":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"39 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":"123490872","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.00023
Mihaita Dragan, I. Tomescu
The degree distance of a connected graph G, denoted by D'(G) was proposed by Gutman and independently by Dobrynin and Kochetova as a weighted version of the Wiener index. In a previous paper [ Utilitas Mathematica, 97:7(2015), 161-181] Tomescu and Kanwal determined four unicyclic connected graphs having smallest degree distances. Here seven bicyclic connected graphs of order having smallest degree distances are determined provided n?19.
{"title":"Bicyclic Connected Graphs Having Smallest Degree Distances","authors":"Mihaita Dragan, I. Tomescu","doi":"10.1109/SYNASC49474.2019.00023","DOIUrl":"https://doi.org/10.1109/SYNASC49474.2019.00023","url":null,"abstract":"The degree distance of a connected graph G, denoted by D'(G) was proposed by Gutman and independently by Dobrynin and Kochetova as a weighted version of the Wiener index. In a previous paper [ Utilitas Mathematica, 97:7(2015), 161-181] Tomescu and Kanwal determined four unicyclic connected graphs having smallest degree distances. Here seven bicyclic connected graphs of order having smallest degree distances are determined provided n?19.","PeriodicalId":102054,"journal":{"name":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"25 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":"123628783","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.00040
E. Zieniuk, Marta Kapturczak, K. Szerszeń
In this paper, the idea of modeling and solving boundary value problems, with the uncertainly defined boundary shape, is presented. For this purpose, the modification of the method of parametric integral equations system (PIES) is proposed. During tests, based on examples of exactly defined problems, its advantages over alternative methods have been repeatedly emphasized. That is why, it was decided to modify this method for solving uncertainly defined problems. For modeling uncertainty of the boundary shape and for numerical calculations the modification of directed interval arithmetic was proposed. Obtained numerical interval solutions will be compared with interval analytical solutions. Such solutions can be obtained using classical and directed interval arithmetic, as well as the modification of directed interval arithmetic.
{"title":"Interval Arithmetics in Modeling and Solving Uncertainly Defined Boundary Value Problems of Elasticity","authors":"E. Zieniuk, Marta Kapturczak, K. Szerszeń","doi":"10.1109/SYNASC49474.2019.00040","DOIUrl":"https://doi.org/10.1109/SYNASC49474.2019.00040","url":null,"abstract":"In this paper, the idea of modeling and solving boundary value problems, with the uncertainly defined boundary shape, is presented. For this purpose, the modification of the method of parametric integral equations system (PIES) is proposed. During tests, based on examples of exactly defined problems, its advantages over alternative methods have been repeatedly emphasized. That is why, it was decided to modify this method for solving uncertainly defined problems. For modeling uncertainty of the boundary shape and for numerical calculations the modification of directed interval arithmetic was proposed. Obtained numerical interval solutions will be compared with interval analytical solutions. Such solutions can be obtained using classical and directed interval arithmetic, as well as the modification of directed interval arithmetic.","PeriodicalId":102054,"journal":{"name":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"20 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":"124051011","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.00009
F. S. Boer, M. Bonsangue
In the symbolic execution of a program real values are replaced by so-called symbolic values. Consequently, programming expressions cannot be evaluated, and thus the state, i.e., the assignment of values to program variables, in a symbolic execution is replaced by a substitution which assigns to each program variable an expression. The goal of symbolic execution is to generate a path condition that specifies concrete input values for which the actual execution of the program follows the same path (as generated by the symbolic execution). In the full version of this abstract we provide a formal definition of symbolic execution in terms of a symbolic transition system and prove its correctness with respect to an operational semantics which models the execution on concrete values. Our approach is modular, starting with a formal model for a basic programming language with a statically fixed number of programming variables. This model is extended to a programming language with recursive procedures which are called by a call-by-value parameter mechanism. Finally, we show how to extend this latter model of symbolic execution to arrays and object-oriented languages which feature dynamically allocated variables.
{"title":"On the Nature of Symbolic Execution","authors":"F. S. Boer, M. Bonsangue","doi":"10.1109/SYNASC49474.2019.00009","DOIUrl":"https://doi.org/10.1109/SYNASC49474.2019.00009","url":null,"abstract":"In the symbolic execution of a program real values are replaced by so-called symbolic values. Consequently, programming expressions cannot be evaluated, and thus the state, i.e., the assignment of values to program variables, in a symbolic execution is replaced by a substitution which assigns to each program variable an expression. The goal of symbolic execution is to generate a path condition that specifies concrete input values for which the actual execution of the program follows the same path (as generated by the symbolic execution). In the full version of this abstract we provide a formal definition of symbolic execution in terms of a symbolic transition system and prove its correctness with respect to an operational semantics which models the execution on concrete values. Our approach is modular, starting with a formal model for a basic programming language with a statically fixed number of programming variables. This model is extended to a programming language with recursive procedures which are called by a call-by-value parameter mechanism. Finally, we show how to extend this latter model of symbolic execution to arrays and object-oriented languages which feature dynamically allocated variables.","PeriodicalId":102054,"journal":{"name":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"19 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":"124093384","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.00026
C. Paduraru, Bogdan Ghimis, Miruna Paduraru
In computer science, Virtual Organisms (VO) are structures capable of populating the level between hardware and adaptive software agents. This paper discusses the applicability of this concept to the publisher-subscriber paradigm by having a VO as the broker inside the network. When considering long distances between publishers and subscribers, the VO's (or broker's) usage is to optimize their connection experience. Thus, the VO's cells can be used as either mirroring nodes to support streaming applications, or just as nodes managing traffic flow optimizations in the publisher-subscriber paradigm. The paper also presents a novel greedy algorithm and workflows for choosing the intermediate path nodes connecting entities in the network through the VO's cells. The evaluation section shows how it can be applied to optimize routing traffic in cloud computing for gaming using a real dataset, and also introduces the concept of predictive reconfiguration for VOs.
{"title":"Implementation of Publisher-Subscriber Paradigm Using Virtual Organisms","authors":"C. Paduraru, Bogdan Ghimis, Miruna Paduraru","doi":"10.1109/SYNASC49474.2019.00026","DOIUrl":"https://doi.org/10.1109/SYNASC49474.2019.00026","url":null,"abstract":"In computer science, Virtual Organisms (VO) are structures capable of populating the level between hardware and adaptive software agents. This paper discusses the applicability of this concept to the publisher-subscriber paradigm by having a VO as the broker inside the network. When considering long distances between publishers and subscribers, the VO's (or broker's) usage is to optimize their connection experience. Thus, the VO's cells can be used as either mirroring nodes to support streaming applications, or just as nodes managing traffic flow optimizations in the publisher-subscriber paradigm. The paper also presents a novel greedy algorithm and workflows for choosing the intermediate path nodes connecting entities in the network through the VO's cells. The evaluation section shows how it can be applied to optimize routing traffic in cloud computing for gaming using a real dataset, and also introduces the concept of predictive reconfiguration for VOs.","PeriodicalId":102054,"journal":{"name":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"31 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":"125728503","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.00048
Esmitt Ramírez, C. Sánchez, D. Gil
The usage of medical images is part of the clinical daily in several healthcare centers around the world. Particularly, Computer Tomography (CT) images are an important key in the early detection of suspicious lung lesions. The CT image exploration allows the detection of lung lesions before any invasive procedure (e.g. bronchoscopy, biopsy). The effective localization of lesions is performed using different image processing and computer vision techniques. Lately, the usage of deep learning models into medical imaging from detection to prediction shown that is a powerful tool for Computer-aided software. In this paper, we present an approach to localize pulmonary lung lesion using fuzzy deep learning. Our approach uses a simple convolutional neural network based using the LIDC-IDRI dataset. Each image is divided into patches associated a probability vector (fuzzy) according their belonging to anatomical structures on a CT. We showcase our approach as part of a full CAD system to exploration, planning, guiding and detection of pulmonary lesions.
{"title":"Localizing Pulmonary Lesions Using Fuzzy Deep Learning","authors":"Esmitt Ramírez, C. Sánchez, D. Gil","doi":"10.1109/SYNASC49474.2019.00048","DOIUrl":"https://doi.org/10.1109/SYNASC49474.2019.00048","url":null,"abstract":"The usage of medical images is part of the clinical daily in several healthcare centers around the world. Particularly, Computer Tomography (CT) images are an important key in the early detection of suspicious lung lesions. The CT image exploration allows the detection of lung lesions before any invasive procedure (e.g. bronchoscopy, biopsy). The effective localization of lesions is performed using different image processing and computer vision techniques. Lately, the usage of deep learning models into medical imaging from detection to prediction shown that is a powerful tool for Computer-aided software. In this paper, we present an approach to localize pulmonary lung lesion using fuzzy deep learning. Our approach uses a simple convolutional neural network based using the LIDC-IDRI dataset. Each image is divided into patches associated a probability vector (fuzzy) according their belonging to anatomical structures on a CT. We showcase our approach as part of a full CAD system to exploration, planning, guiding and detection of pulmonary lesions.","PeriodicalId":102054,"journal":{"name":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"71 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":"129017221","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.00024
R. Mincu, Camelia Obreja, Alexandru Popa
Graph colorings are a major area of study in graph theory involving the constrained assignment of labels (colors) to vertices or edges. There are many types of colorings defined in the literature. The most common type of coloring is the proper vertex k-coloring which is defined as a vertex coloring from a set of k colors such that no two adjacent vertices share a common color. Our central focus in this paper is a variant of the proper vertex k-coloring problem, termed graceful coloring introduced by Gary Chartrand in 2015. 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. In this work we find the graceful chromatic number, the minimum k for which a graph has a graceful k-coloring, 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.
{"title":"The Graceful Chromatic Number for Some Particular Classes of Graphs","authors":"R. Mincu, Camelia Obreja, Alexandru Popa","doi":"10.1109/SYNASC49474.2019.00024","DOIUrl":"https://doi.org/10.1109/SYNASC49474.2019.00024","url":null,"abstract":"Graph colorings are a major area of study in graph theory involving the constrained assignment of labels (colors) to vertices or edges. There are many types of colorings defined in the literature. The most common type of coloring is the proper vertex k-coloring which is defined as a vertex coloring from a set of k colors such that no two adjacent vertices share a common color. Our central focus in this paper is a variant of the proper vertex k-coloring problem, termed graceful coloring introduced by Gary Chartrand in 2015. 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. In this work we find the graceful chromatic number, the minimum k for which a graph has a graceful k-coloring, 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.","PeriodicalId":102054,"journal":{"name":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"55 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":"126630335","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.00031
Nicolae-Eugen Croitoru
This paper contains an investigation into the GA population dynamics induced by very high mutation operator probabilities (≈ 0.95). Drawing inspiration from Consensus Sequence Plots and Estimation of Distribution Algorithms, population distribution natϊve changes are computed between successive generations. This metric is used to characterise multiple parameter variants for a Simple Genetic Algorithm, contrasting low-and high-probability mutation, and low-and high-entropy mutation.
{"title":"Population Distribution Dynamics in Genetic Algorithms with High-Probability Mutation","authors":"Nicolae-Eugen Croitoru","doi":"10.1109/SYNASC49474.2019.00031","DOIUrl":"https://doi.org/10.1109/SYNASC49474.2019.00031","url":null,"abstract":"This paper contains an investigation into the GA population dynamics induced by very high mutation operator probabilities (≈ 0.95). Drawing inspiration from Consensus Sequence Plots and Estimation of Distribution Algorithms, population distribution natϊve changes are computed between successive generations. This metric is used to characterise multiple parameter variants for a Simple Genetic Algorithm, contrasting low-and high-probability mutation, and low-and high-entropy mutation.","PeriodicalId":102054,"journal":{"name":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"19 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":"127113531","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
扫码关注我们
求助内容：
应助结果提醒方式：