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

ARTIST Methodology and Framework: A Novel Approach for the Migration of Legacy Software on the Cloud 艺术家方法论和框架:在云上迁移遗留软件的一种新方法

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

A. Menychtas, Christina Santzaridou, George Kousiouris, T. Varvarigou, Leire Orue-Echevarria Arrieta, Juncal Alonso, Jesús Gorroñogoitia, H. Brunelière, Oliver Strauß, Tatiana Senkova, B. Pellens, P. Stuer

{"title":"ARTIST Methodology and Framework: A Novel Approach for the Migration of Legacy Software on the Cloud","authors":"A. Menychtas, Christina Santzaridou, George Kousiouris, T. Varvarigou, Leire Orue-Echevarria Arrieta, Juncal Alonso, Jesús Gorroñogoitia, H. Brunelière, Oliver Strauß, Tatiana Senkova, B. Pellens, P. Stuer","doi":"10.1109/SYNASC.2013.62","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.62","url":null,"abstract":"Nowadays Cloud Computing is considered as the ideal environment for engineering, hosting and provisioning applications. A continuously increasing set of cloud-based solutions is available to application owners and developers to tailor their applications exploiting the advanced features of this paradigm for elasticity, high availability and performance. Although these offerings provide many benefits to new applications, they also incorporate constrains to the modernization and migration of legacy applications by obliging the use of specific technologies and explicit architectural design approaches. The modernization and adaptation of legacy applications to cloud environments is a great challenge for all involved stakeholders, not only from the technical perspective, but also in business level with the need to adapt the business processes and models of the modernized application that will be offered from now on, as a service. In this paper we present a novel model-driven approach for the migration of legacy applications in modern cloud environments which covers all aspects and phases of the migration process, as well as an integrated framework that supports all migration process.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"40 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":"129270573","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}

引用次数: 46

An Efficient Computational Framework for Studying Dynamical Systems 研究动力系统的有效计算框架

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

Islam ElShaarawy, W. Gomaa

引用次数: 2

Context Matching for Ambient Intelligence Applications 环境智能应用中的上下文匹配

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

Andrei Olaru

{"title":"Context Matching for Ambient Intelligence Applications","authors":"Andrei Olaru","doi":"10.1109/SYNASC.2013.42","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.42","url":null,"abstract":"Reliable and scalable Ambient Intelligence means a distributed system of agents that are capable of working together or autonomously, depending on the requirements of the situation. In previous research we have argued in favor of the use of a representation for context information that can be distributed among agents, so that each agent knows only the information that is relevant to its activity. Recognizing interesting information or relevant situations is done by using context patterns -- graph patterns with potentially unknown nodes and edges labeled with regular expressions. In this context, a major challenge is for agents to use a graph matching algorithm that is adequate to the possibilities of the devices on which the agents are running. Moreover, it is necessary that the algorithm is able to provide partial matches. This paper presents an algorithm specifically designed for this problem, that uses growing partial matches to obtain the maximum sub-graph of the context graph that matches (part of) the context pattern. Experiments were performed with the algorithm and its performance has been compared with that of other algorithms adapted to our problem.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"28 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":"116127575","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

Cph CT Toolbox: CT Reconstruction for Education, Research and Industrial Applications Cph CT工具箱:用于教育、研究和工业应用的CT重建

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

J. Bardino, Martin Rehr, B. Vinter

引用次数: 2

Fresh-Variable Automata: Application to Service Composition 新变量自动机:在服务组合中的应用

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

W. Belkhir, Yannick Chevalier, M. Rusinowitch

引用次数: 7

Algorithm for Cooperative CPU-GPU Computing CPU-GPU协同计算算法

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

Razvan-Mihai Aciu, H. Ciocarlie

引用次数: 3

Engineering Hoare Logic-Based Program Verification in K Framework 基于K框架的工程系统逻辑程序验证

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

Andrei Arusoaie

引用次数: 2

Efficient Computation of the Isotropy Group of a Finite Graph: A Combinatorial Approach 有限图各向同性群的有效计算:一种组合方法

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

Marcin Gąsiorek

{"title":"Efficient Computation of the Isotropy Group of a Finite Graph: A Combinatorial Approach","authors":"Marcin Gąsiorek","doi":"10.1109/SYNASC.2013.21","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.21","url":null,"abstract":"We continue a Coxeter spectral study of finite posets and edge-bipartite graphs (a class of signed graphs in the sense of Harary and Zaslavsky). Here we are interested in two problems. First: whether the incidence matrices CI and CJ of two connected positive posets I and J are Z-congruent if and only if the Coxeter spectra of I and J coincide. Second: the problem if any square integer matrix A E Mn(Z) is Z-congruent with its transpose Atr. We show that these problems can be effectively solved using the right action * : Mn(Z) × Gl(n, Z)D → Mn(Z), A → A * B := Btr · A · B, of the isotropy group Gl(n, Z)D of a simply laced Dynkin diagram D E {An, Dn, E6, E7, E8}. We present an efficient algorithm for computing the isotropy group Gl(n, Z)D. In particular, we show that symbolic and numerical computer calculations in Python and Cython allow us to present a complete description of the isotropy group Gl(n, Z)D with |D| ≤ 10. Furthermore, we discuss optimisation techniques that are important from the calculation efficiency point of view.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"1 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":"129662193","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}

引用次数: 19

Assessing SLA Compliance from Palladio Component Models 从Palladio组件模型评估SLA遵从性

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

Juan F. Pérez, G. Casale

{"title":"Assessing SLA Compliance from Palladio Component Models","authors":"Juan F. Pérez, G. Casale","doi":"10.1109/SYNASC.2013.60","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.60","url":null,"abstract":"Service providers face the challenge of meeting service-level agreements (SLAs) under uncertainty on the application actual performance. The performance heavily depends on the characteristics of the hardware on which the application is deployed, on the application architecture, as well as on the user workload. Although many models have been proposed for the performance prediction of software applications, most of them focus on average measures, e.g., mean response times. However, SLAs are often set in terms of percentiles, such that a given portion of requests receive a predefined service level, e.g., 95% of the requests should face a response time of at most 10 ms. To enable the effective prediction of this type of measures, in this paper we use fluid models for the computation of the probability distribution of performance measures relevant for SLAs. Our models are automatically built from a Palladio Component Model (PCM) instance, thus allowing the SLA assessment directly from the PCM specification. This provides an scalable alternative for SLA assessment within the PCM framework, as currently this is supported by means of simulation only.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"2013 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":"127417300","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}

引用次数: 48

Ontology-Based Recommender for Distributed Machine Learning Environment 基于本体的分布式机器学习环境推荐

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

Daniel Pop, Caius Bogdanescu

引用次数: 0