2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing最新文献_第3页

Local Rank Distance 本地等级距离

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.36

Radu Tudor Ionescu

{"title":"Local Rank Distance","authors":"Radu Tudor Ionescu","doi":"10.1109/SYNASC.2013.36","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.36","url":null,"abstract":"Researchers have developed a wide variety of methods for string data, that can be applied with success in different fields such as computational biology, natural language processing and so on. Such methods range from clustering techniques used to analyze the phylogenetic trees of different organisms, to kernel methods used to identify authorship or native language from text. Results of such methods are not perfect and can always be improved. Some of these methods are based on a distance or similarity measure for strings, such as Hamming, Levenshtein, Kendall-tau, rank distance, or string kernel. This paper aims to introduce a new distance measure, termed Local Rank Distance (LRD), inspired from the recently introduced Local Patch Dissimilarity for images. Designed to conform to more general principles and adapted to DNA strings, LRD comes to improve over state of the art methods for phylogenetic analysis. This paper shows two applications of LRD. The first application is the phylogenetic analysis of mammals. Experiments show that phylogenetic trees produced by LRD are better or at least similar to those reported in the literature. The second application is to identify native language of English learners. By working at character level, the proposed method is completely language independent and theory neutral. In conclusion, LRD can be used as a general approach to measure string similarity, despite being designed for DNA.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122121067","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}

引用次数: 17

Common Due-Date Problem: Exact Polynomial Algorithms for a Given Job Sequence 通用截止日期问题:给定作业序列的精确多项式算法

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.41

A. Awasthi, Jörg Lässig, Oliver Kramer

{"title":"Common Due-Date Problem: Exact Polynomial Algorithms for a Given Job Sequence","authors":"A. Awasthi, Jörg Lässig, Oliver Kramer","doi":"10.1109/SYNASC.2013.41","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.41","url":null,"abstract":"This paper considers the problem of scheduling jobs on single and parallel machines where all the jobs possess different processing times but a common due date. There is a penalty involved with each job if it is processed earlier or later than the due date. The objective of the problem is to find the assignment of jobs to machines, the processing sequence of jobs and the time at which they are processed, which minimizes the total penalty incurred due to tardiness or earliness of the jobs. This work presents exact polynomial algorithms for optimizing a given job sequence for single and parallel machines with the run-time complexities of O(n log n) and O(mn2 log n) respectively, where n is the number of jobs and m the number of machines. The algorithms take a sequence consisting of all the jobs (Ji, i = 1,2,...,n) as input and distribute the jobs to machines (for m>1) along with their best completion times so as to get the least possible total penalty for this sequence. We prove the optimality for the single machine case and the runtime complexities of both. Henceforth, we present the results for the benchmark problems and compare with previous work for both single and parallel machine cases, up to 200 jobs.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127047725","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}

引用次数: 6

Reducing the Number of Useless Revisions Performed by Constraint Solvers Based on AC-3 减少基于AC-3约束求解器执行的无用修正次数

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.39

Cristian Frasinaru, E. F. Olariu

引用次数: 0

Securing Communication in a Peer-to-Peer Messaging Middleware 在对等消息传递中间件中保护通信

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.50

Péter Szilágyi

{"title":"Securing Communication in a Peer-to-Peer Messaging Middleware","authors":"Péter Szilágyi","doi":"10.1109/SYNASC.2013.50","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.50","url":null,"abstract":"Traditionally, message oriented middlewares (MOM) are looked upon as either centralized systems (e.g. AMQP) or a rigidly distributed collection of machines, requiring significant configuration overhead for achieving the desired throughput under the needed security constraints. On the other end of the spectrum, peer-to-peer systems (P2P) in general achieve amazing scalability and fault tolerance, but due to their very nature, are susceptible to various attacks. Since all measures of security have considerable consequences on the system's capabilities, the securing of a peer-to-peer system requires a thorough analysis on the exact designated use-case and environment in which the network is required to operate in, as well as all the possible threats the system must be able to withstand. The paper proposes a security model that bridges the distribution concept of peer-to-peer systems with the necessities of MOMs by rigorously defining the operational environment, assumptions and requirements, on top of which a security protocol was implemented. Taking advantage of the specific use case of P2P MOMs, further optimizations are provided which provide the same security against the defined threat model, but result in significant gains with regard to the overall switching throughput of the network.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123004602","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}

引用次数: 2

Common Factors in Fraction-Free Matrix Reduction 无分式矩阵约简中的常见因子

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.17

J. Middeke, Ahmed Almohaimeed, D. J. Jeffrey

引用次数: 2

Quality Assurance for Open Source Software Configuration Management 开源软件配置管理的质量保证

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.66

Stefan Meyer, Philip D. Healy, Theo Lynn, J. Morrison

引用次数: 15

Supporting the Development and Operation of Multi-cloud Applications: The MODAClouds Approach 支持多云应用的开发和运营:modclouds方法

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.61

E. D. Nitto, M. A. D. Silva, D. Ardagna, G. Casale, Ciprian Craciun, Nicolas Ferry, Victor Muntés, Arnor Solberg

{"title":"Supporting the Development and Operation of Multi-cloud Applications: The MODAClouds Approach","authors":"E. D. Nitto, M. A. D. Silva, D. Ardagna, G. Casale, Ciprian Craciun, Nicolas Ferry, Victor Muntés, Arnor Solberg","doi":"10.1109/SYNASC.2013.61","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.61","url":null,"abstract":"Vendor lock-in and cloud outages are two important challenges that make IT managers reluctant in widely adopting the cloud within the enterprise. Vendor lock-in happens when the adoption of cloud provider-specific technologies and APIs forces consumers to stay with the same provider even if they would like to change. Cloud outages can happen to any provider, as the events of the last years have largely demonstrated, and have a critical impact on the actual reliability of cloud applications. A solution to both problems could be to support application developers and operators in the adoption of a multi-cloud approach: applications are built to run and replicate on different clouds, and mechanisms for fast switching from a cloud installation to the other are offered. In the MODAClouds project we pursue this approach and rely on model-driven development combined with risk analysis and quality prediction. In this paper we provide an overview of our approach and present the architecture of the corresponding platform.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115790618","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}

引用次数: 40

Adaptive Distributed Data Structure Management for Parallel CFD Applications 并行CFD应用的自适应分布式数据结构管理

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.73

J. Frisch, R. Mundani, E. Rank

引用次数: 5

A Systematic Approach to Computations on Decomposable Graphs 可分解图的系统计算方法

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.59

E. Ravve, Z. Volkovich

引用次数: 5

Parallel data acquisition for visualization of very large sparse matrices 用于可视化非常大的稀疏矩阵的并行数据采集

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.51

D. Langr, I. Šimeček, P. Tvrdík, T. Dytrych

引用次数: 4