2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)最新文献_第3页

Evolving Cellular Automata for Two-Stage Edge Detection 两阶段边缘检测的进化元胞自动机

2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2018-09-01 DOI: 10.1109/SYNASC.2018.00070

A. Enescu, A. Andreica, L. Dioşan

引用次数: 0

An Adaptive Recommender System for Human Resource Allocation in Software Projects - Initial Results on an Agent-Based Simulation 软件项目中人力资源配置的自适应推荐系统——基于agent仿真的初步结果

2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2018-09-01 DOI: 10.1109/SYNASC.2018.00056

Mihaela Ilie, S. Ilie, Ionuţ Murareţu

{"title":"An Adaptive Recommender System for Human Resource Allocation in Software Projects - Initial Results on an Agent-Based Simulation","authors":"Mihaela Ilie, S. Ilie, Ionuţ Murareţu","doi":"10.1109/SYNASC.2018.00056","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00056","url":null,"abstract":"In our previous work we have introduced a skill-based mathematical model of resource allocation. This paper extends our skill based approach by introducing adaptive skill sets for employees and a history-based initial evaluation strategy. For this purpose, the mathematical model is adjusted in order to modify skill vectors after a task allocation. In turn this enables estimations of the time to task completion based on employee history. This approach would provide the team leaders with a better view of the skill sets mastered by the team. We experimentally evaluate the impact of the skill adjustment on the project duration and cost in a simulation environment. The conclusion of the experiment is that taking into account the implicit skill gain of employees during their daily activity decreases projected costs and execution time significantly, which is this paper's contribution to the state of the art. This approach is a good way to keep the team's skill sets automatically updated. The experiment is designed as an agent society simulation and through their interactions raw data is collected in order to calculate the performance measures. A scalability experiment is also presented showing slight (1%) decreases in project duration when the task number doubles while costs decrease between 7-32%.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"11 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":"128896118","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}

引用次数: 0

Survey on Feasibility of Pattern Matching Techniques In Heterogeneous Architectures for Bioinformatics 生物信息学异构架构中模式匹配技术的可行性调查

2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2018-09-01 DOI: 10.1109/SYNASC.2018.00063

Ciprian-Petrisor Pungila, Darius Galis, V. Negru

引用次数: 0

Inferring, Learning and Modelling Complex Systems with Bayesian Networks. A Tutorial 用贝叶斯网络进行复杂系统的推理、学习和建模。一个教程

2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2018-09-01 DOI: 10.1109/SYNASC.2018.00017

Enachescu Denis, Enachescu Cornelia

引用次数: 0

Towards Performance Evaluation Programming 迈向绩效评估规划

2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2018-09-01 DOI: 10.1109/SYNASC.2018.00054

E. Todoran

{"title":"Towards Performance Evaluation Programming","authors":"E. Todoran","doi":"10.1109/SYNASC.2018.00054","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00054","url":null,"abstract":"In recent work we have introduced an experimental concurrent programming language which supports a systematic approach to performance analysis and formal verification correlated with a programming style called performance evaluation programming [19]. For the purpose of formal verification, the ranges of variables must be bounded and concurrent programs are translated into corresponding (finite state) Continuous Time Markov Chains (CTMCs) which are analyzed by using the PRISM tool. Activities in a CTMC model are abstracted by their rates. In the language introduced in [19] an activity is the evaluation of a function expressed in a functional sub-language. The solution presented in [19] supports formal verification in a systematic manner, but not automatically, requiring the programmer to generate certain data for the performance evaluation experiments. In this paper we refine the design of the functional sub-language introduced in [19] by using concepts of functional programming with dependent types. We use dependent types to control the ranges of variables. The solution presented in this paper is devised to support automatic performance evaluation and formal verification of (bounded versions of) concurrent programs.","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":"124318295","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}

引用次数: 0

Proving Reachability Properties by Coinduction (Extended Abstract) 用协归纳法证明可达性(扩展摘要)

2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2018-09-01 DOI: 10.1109/SYNASC.2018.00066

D. Lucanu

{"title":"Proving Reachability Properties by Coinduction (Extended Abstract)","authors":"D. Lucanu","doi":"10.1109/SYNASC.2018.00066","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00066","url":null,"abstract":"The coinduction is dual to induction and both of them can be defined as fixed points. More precisely, a set is inductive if it is the least fixed-point (lfp) of a monotone endofunction on a complete lattice, and it is coinductive if it is the greatest fixed-point (gfp) of such a endofunction. The induction principle says that each set that is a pre-fixed point includes the lfp, and the coinduction principle says that any post-fixed point is included in the gfp. A convenient way to define (co) inductive sets is by means of rules. In contrast with the induction, which is a well-known proof principle that is taught in most undergraduate programs, the coinduction is not as widespread and its main applications includes bisimulation and behavioural equivalence. In this talk we show that the reachability properties of transition systems can be defined coinductively and we present coinductive proof systems for such properties, where the transition systems are specified by Logically constrained term rewriting systems. As an application, if the transition system describes the semantics of a programming language, then the reachability properties may be used to describe the partial correctness of programs. A main advantage of the presented proof system is that it can be automated. Logically constrained term rewriting systems are parametric in a builtin model, for which an automated theorem prover (e.g. a SMT solver) cand be used.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"15 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":"115638174","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}

引用次数: 0

Increasing Protection Against Internet Attacks through Contextual Feature Pairing 通过上下文特征配对增强对互联网攻击的保护

2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2018-09-01 DOI: 10.1109/SYNASC.2018.00072

Georgiana Ingrid Stoleru, Adrian-Stefan Popescu, Dragos Gavrilut

引用次数: 0

Face Recognition in Automotive Applications 人脸识别在汽车中的应用

2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2018-09-01 DOI: 10.1109/SYNASC.2018.00061

D. Rotar, H. Andreescu

引用次数: 2

A CiteSeerX-Based Dataset for Record Linkage and Metadata Extraction 基于citeseerx的记录链接与元数据提取数据集

2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2018-09-01 DOI: 10.1109/SYNASC.2018.00044

Z. Bodó

引用次数: 2

A Different Approach to Maximum Clique Search 最大团搜索的一种不同方法

2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2018-09-01 DOI: 10.1109/SYNASC.2018.00055

S. Szabó, Bogdán Zaválnij

{"title":"A Different Approach to Maximum Clique Search","authors":"S. Szabó, Bogdán Zaválnij","doi":"10.1109/SYNASC.2018.00055","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00055","url":null,"abstract":"The way we tackle NP-hard problems in practical setting has experienced a major shift in recent years. Our view has became more sophisticated with the emergence of the parameterized complexity paradigm. We may distinguish subclasses inside the NP-hard complexity class. The complexity of the problems in different subclasses maybe quite different. The overall conservative estimate of the running time is replaced by a more optimistic estimate. In addition the approach of parameterized algorithms is sometimes able to deal with the more complex problems by dividing the problem into harder and a simpler parts. The easier instance at many times reduces to mere preprocessing step leaving us with only the harder part. In this paper we single out the so-called maximum clique problem as a typical representative of the NP-hard complexity class. We propose an algorithm to solve the maximum clique problem motivated by the above ideas. Many of the available maximum clique solvers are descendants or refined versions of the Carraghan–Pardalos algorithm. (Patric \"Ostergaa rd's cliquer is being as an exception.) The maximum clique problem as a maximization problem can be reduced to a series of k-clique problems as decision problems. Our main observation is that this route offers a number of advantages. The structure of a k-clique decision problem is simpler than the structure of a maximization problem. It affords additional pruning opportunities based on the available value of k. A large scale numerical experiment indicates that in many occasions the combined search space of the k-clique problems is smaller than the search space of the maximization problem. The solver we propose turns out to be rather efficient. In a number of test problems it beats the best available solvers.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"61 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":"126264745","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}

引用次数: 4