2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing最新文献_第4页

Dynamic Clustering of Gene Expression Data Using a Fuzzy Approach 基于模糊方法的基因表达数据动态聚类

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.37

A. Sirbu, G. Czibula, Maria-Iuliana Bocicor

引用次数: 4

Implementing Powerlists with Bulk Synchronous Parallel ML 使用批量同步并行ML实现Powerlists

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.51

F. Loulergue, Virginia Niculescu, J. Tesson

引用次数: 5

Efficient Computation of Simplicial Homology through Acyclic Matching 非循环匹配简化同调的高效计算

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.84

Ulderico Fugacci, F. Iuricich, L. Floriani

引用次数: 8

A Lowest Level Rule Push-Relabel Algorithm for Submodular Flows and Matroid Optimization 子模块流的最低级规则推重标记算法及矩阵优化

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.21

E. F. Olariu, Cristian Frasinaru

{"title":"A Lowest Level Rule Push-Relabel Algorithm for Submodular Flows and Matroid Optimization","authors":"E. F. Olariu, Cristian Frasinaru","doi":"10.1109/SYNASC.2014.21","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.21","url":null,"abstract":"We present a new strategy for combinatorial push-relabel algorithm used in sub modular flows and matroid optimization. In the case of matroid optimization, in contrast with other known algorithms, our strategy needs no lexicographic order of the elements. Combined with a reduction of the number of active basis the resulting procedure gives a time complexity of O(n6). Moreover our rule offers more interesting properties of the treated elements and suggests the adaptation of this rule to the sub modular flow algorithm. The above strategy applied for sub modular flows gives an O(n5) time complexity procedure, which is the same with the known best complexity given by a procedure based on highest level rule. This method starts a way for a simpler algorithm for finding a feasible sub modular flow which is described in the second part of the paper. Our method for sub modular flow is based on a lowest level rule combined with a bfs-like traversal. The lowest level rule does not work alone because new (ψ- or g-) larger nodes on lower levels can appear during treatment of the current node. Therefore, it is reinforced with a bfs traversal: the new larger nodes are added to a queue - restarted with a lowest level, larger node, whenever it becomes empty. The O(n5) time complexity is the same as the best known. Our strategy brings a forest structure of the treated nodes, where the basic operations (pushes and liftings) can be easily numbered and for this reason has a better potential for future improvements.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133374838","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

Multispace, Dynamic, Fixed-Radius, All Nearest Neighbours Problem 多空间、动态、固定半径、全近邻问题

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.40

B. Papis, A. Pacut

{"title":"Multispace, Dynamic, Fixed-Radius, All Nearest Neighbours Problem","authors":"B. Papis, A. Pacut","doi":"10.1109/SYNASC.2014.40","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.40","url":null,"abstract":"We present a solution to a specific version of one of the most fundamental computer science problem - the nearest neighbour problem (NN). The new, proposed variant of the NN problem is the multispace, dynamic, fixed-radius, all nearest neighbours problem, where the NN data structure handles queries that concern different subsets of input dimensions. In other words, solutions to this problem allow searching for closest points in terms of different features. This is an important issue in the context of practical applications of incremental state abstraction techniques for high dimensional Markov Decision Processes (MDP). The proposed solution is a set of simple, one-dimensional structures, that can handle range queries for arbitrary subset of input dimensions for the Chebyshev distance. We also provide version for other metrics, and a simplified version of the algorithm that yields approximate results but runs faster. The proposed approximation is deterministic in a way that ensures that the most important (in the context of the considered state abstraction task) parts of the result are returned with no accuracy loss. The presented experimental study demonstrates improvement in comparison to some state-of-the-art algorithms on uniformly random and MDP-generated data.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123563827","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

A Practical Guide for Detecting the Java Script-Based Malware Using Hidden Markov Models and Linear Classifiers 使用隐马尔可夫模型和线性分类器检测基于Java脚本的恶意软件的实用指南

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.39

Doina Cosovan, Razvan Benchea, Dragos Gavrilut

{"title":"A Practical Guide for Detecting the Java Script-Based Malware Using Hidden Markov Models and Linear Classifiers","authors":"Doina Cosovan, Razvan Benchea, Dragos Gavrilut","doi":"10.1109/SYNASC.2014.39","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.39","url":null,"abstract":"The World Wide Web evolved so rapidly that it is no longer considered a luxury, but a necessity. That is why currently the most popular infection vectors used by cyber criminals are either web pages or commonly used documents (such as pdf files). In both of these cases, the malicious actions performed are written in Java Script. Because of this, Java Script has become the preferred language for spreading malware. In order to be able to stop malicious content from executing, detection of its infection vector is crucial. In this paper we propose various methods for detecting Java Script-based attack vectors. For achieving our goal we first need to fight metamorphism techniques usually used in Java Script malicious code, which are by no means trivial: garbage instruction insertion, variable renaming, equivalent instruction substitution, function permutation, instruction reordering, and so on. Our approach to deal with metamorphism starts with splitting the Java Script content in components and filtering the insignificant ones. We then use a data set, consisting in over one million Java Script files in order to test several machine learning algorithms such as Hidden Markov Models, linear classifiers and hybrid approaches for malware detection. Finally, we analyze these detection methods from a practical point of view, emphasizing the need for a very low false positive rate and the ability to be trained on large datasets.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126006688","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}

引用次数: 8

An Imperialistic Strategy Approach to Continuous Global Optimization Problem 连续全局优化问题的帝国策略方法

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.79

George Anescu

{"title":"An Imperialistic Strategy Approach to Continuous Global Optimization Problem","authors":"George Anescu","doi":"10.1109/SYNASC.2014.79","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.79","url":null,"abstract":"The paper is introducing the principles of a new global optimization strategy, Imperialistic Strategy (IS), applied to the Continuous Global Optimization Problem (CGOP). Inspired from existing multi-population strategies, like the Island Model (IM) approaches to parallel Evolutionary Algorithms (EA) and the Imperialistic Competitive Algorithm (ICA), the proposed IS method is considered an optimization strategy for the reason that it can integrate other well-known optimization methods, which in the context are regarded as sub-methods (although in other contexts they are prominent global optimization methods). Four optimization methods were implemented and tested in the roles of sub-methods: Genetic Algorithm (GA) (a floating-point representation variant), Differential Evolution (DE), Quantum Particle Swarm Optimization (QPSO) and Artificial Bee Colony (ABC). The optimization performances of the proposed optimization methods were compared on a test bed of 9 known multimodal optimization problems by applying an appropriate testing methodology. The obtained increased success rates of IS multi-population variants compared to the success rates of the optimization sub-methods run separately, combined with the increased computing efficiencies possible to be perceived for parallel and distributed implementations, demonstrated that IS is a promising approach to CGOP.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130402455","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}

引用次数: 3

Enhancing Dental Radiographic Images in Spline-Type Spaces 在样条空间增强牙科放射图像

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.80

D. Onchis, S. Gotia

引用次数: 0

An Ontology Selection and Ranking System Based on the Analytic Hierarchy Process 基于层次分析法的本体选择与排序系统

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.47

Adrian Groza, Irina Dragoste, Iulia Sincai, Ioana Jimborean, Vasile Moraru

引用次数: 8

CSPs and Connectedness: P/NP Dichotomy for Idempotent, Right Quasigroups csp与连通性:幂等右拟群的P/NP二分法

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.56

Robert W. McGrail, James M. Belk, Solomon Garber, J. Wood, Benjamin Fish

引用次数: 2