Nowadays, thanks to the massive usage of the Cloud, different providers offer storage as a service solutions. Each of these solutions is characterized by different storage capacity and features. They are also offered according to various business models, typically, users can choose between free plans (with a limited amount of space) and paid plans. Free plans users, when the storage capacity lowers, tend to subscribe to new free plans from other providers, thus increasing the so called data fragmentation. This phenomenon heavily increases the file management complexity. This paper proposes a solution to the data fragmentation problem, by describing an innovative approach which allows to deploy a distributed file system on top of different SaaS storage accounts, offered by different providers. This approach, not only lowers the complexity of data management by providing a single transparent storage solution to the user, but it is also able to provide features like full-text search, file classification and categorization, data analytics (MapReduce) on top of these SaaS storage accounts. Furthermore, this approach proposes a new way to address data privacy and security issues, typically connected to SaaS storage accounts.
{"title":"A Distributed File System over Heterogeneous SaaS Storage Platforms","authors":"Marco Scavuzzo","doi":"10.1109/SYNASC.2014.62","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.62","url":null,"abstract":"Nowadays, thanks to the massive usage of the Cloud, different providers offer storage as a service solutions. Each of these solutions is characterized by different storage capacity and features. They are also offered according to various business models, typically, users can choose between free plans (with a limited amount of space) and paid plans. Free plans users, when the storage capacity lowers, tend to subscribe to new free plans from other providers, thus increasing the so called data fragmentation. This phenomenon heavily increases the file management complexity. This paper proposes a solution to the data fragmentation problem, by describing an innovative approach which allows to deploy a distributed file system on top of different SaaS storage accounts, offered by different providers. This approach, not only lowers the complexity of data management by providing a single transparent storage solution to the user, but it is also able to provide features like full-text search, file classification and categorization, data analytics (MapReduce) on top of these SaaS storage accounts. Furthermore, this approach proposes a new way to address data privacy and security issues, typically connected to SaaS storage accounts.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130503928","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}
This contribution deals with systematic exploitation of logical reduction techniques to databases. The particular applications are views and updates over distributed databases. Logical reduction techniques come in two favors. The first one: the syntactically defined translation schemes, which describe transformations of database schemes. They give rise to two induced maps, translations and transductions. Transductions describe the induced transformation of database instances and the translations describe the induced transformations of queries. The second one: Feferman-Vaught reductions, which are applied in situations, where a relational structure is pieced together from a set of sub-structures. The reduction describes how the queries over the structure can be computed from queries over the components and queries over the index set. Combination and development of these techniques allow us to generalize the propagation technique for relational algebra and the incremental re-computation technique for some kinds of Data log programs to cases of definable sets of tuples to be deleted or inserted.
{"title":"Views and Updates over Distributed Databases","authors":"E. Ravve","doi":"10.1109/SYNASC.2014.53","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.53","url":null,"abstract":"This contribution deals with systematic exploitation of logical reduction techniques to databases. The particular applications are views and updates over distributed databases. Logical reduction techniques come in two favors. The first one: the syntactically defined translation schemes, which describe transformations of database schemes. They give rise to two induced maps, translations and transductions. Transductions describe the induced transformation of database instances and the translations describe the induced transformations of queries. The second one: Feferman-Vaught reductions, which are applied in situations, where a relational structure is pieced together from a set of sub-structures. The reduction describes how the queries over the structure can be computed from queries over the components and queries over the index set. Combination and development of these techniques allow us to generalize the propagation technique for relational algebra and the incremental re-computation technique for some kinds of Data log programs to cases of definable sets of tuples to be deleted or inserted.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130559523","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}
In this paper a new algorithm RS-PEAK will be presented for locating peak values of the Riemann zeta function on the critical line. The method based on earlier results of Andrew M. Odlyzko, Tadej Kotnik, and on a recently achieved results of solving simultaneous Diophantine approximation problems. Until 2014 only a few hundred values were known where the Riemann-Siegel Z-function (i.e: Z(t)) larger than 1000, mainly found by Ghaith Ayesh Hiary and Jonathan Bober. By applying the algorithm RS-PEAK thousands of large values can be produced where |Z(t)| > 1000 within a few hours on a single desktop PC. The aim of this paper is to describe the RS-PEAK algorithm by which many large values of Z(t) can be generated in order to be able to reveal new behaviours of the Riemann zeta function. Using RS-PEAK more than 20 000 values had been found during a two weeks period where |Z(t)| > 1000. The largest known Z(t) values are presented where log |Z(t)|/log(t) > 32=205.
{"title":"Fast Method for Locating Peak Values of the Riemann Zeta Function on the Critical Line","authors":"Norbert Tihanyi","doi":"10.1109/SYNASC.2014.20","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.20","url":null,"abstract":"In this paper a new algorithm RS-PEAK will be presented for locating peak values of the Riemann zeta function on the critical line. The method based on earlier results of Andrew M. Odlyzko, Tadej Kotnik, and on a recently achieved results of solving simultaneous Diophantine approximation problems. Until 2014 only a few hundred values were known where the Riemann-Siegel Z-function (i.e: Z(t)) larger than 1000, mainly found by Ghaith Ayesh Hiary and Jonathan Bober. By applying the algorithm RS-PEAK thousands of large values can be produced where |Z(t)| > 1000 within a few hours on a single desktop PC. The aim of this paper is to describe the RS-PEAK algorithm by which many large values of Z(t) can be generated in order to be able to reveal new behaviours of the Riemann zeta function. Using RS-PEAK more than 20 000 values had been found during a two weeks period where |Z(t)| > 1000. The largest known Z(t) values are presented where log |Z(t)|/log(t) > 32=205.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130585091","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}
This short note describes the first step of the application of the geometric algebra (GA) to the computational origami system called Eos. Main results are the formalization of GA in Isabelle/HOL and the re-statement of Huzita's basic fold operations in equalities in GA. By solving the equalities we can obtain the fold line (s) that are used in each step of origami construction.
{"title":"Huzita's Basic Origami Fold in Geometric Algebra","authors":"T. Ida","doi":"10.1109/SYNASC.2014.9","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.9","url":null,"abstract":"This short note describes the first step of the application of the geometric algebra (GA) to the computational origami system called Eos. Main results are the formalization of GA in Isabelle/HOL and the re-statement of Huzita's basic fold operations in equalities in GA. By solving the equalities we can obtain the fold line (s) that are used in each step of origami construction.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126533258","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}
Cloud computing is a revolutionary paradigm that allows to acquire infinite resources on demand and pay only for the actual use. Together with novel software development methodologies, such as Agile and DevOps, the cloud can really help companies in responding to market demand for continuous delivering innovative services, enabling the shift from a silo based release process, where customers, developers and system administrators are almost conflicting among each other, to a unified process, where the shared final objective is that of making the product available to the user. There are two main challenges that have to be faced when approaching the cloud. First of all, the heterogeneity of the offer. More and more cloud services are growing from different providers with no standard yet defined, driving companies towards the lock-in problem. Second, having the possibility to scale from 10s to 1000s of machines implies huge effort in IT management without smart automation systems. This paper is an attempt to review some of the tools among the currently available ones that may help companies simplifying their application release process.
{"title":"Application Deployment and Management in the Cloud","authors":"Marco Miglierina","doi":"10.1109/SYNASC.2014.63","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.63","url":null,"abstract":"Cloud computing is a revolutionary paradigm that allows to acquire infinite resources on demand and pay only for the actual use. Together with novel software development methodologies, such as Agile and DevOps, the cloud can really help companies in responding to market demand for continuous delivering innovative services, enabling the shift from a silo based release process, where customers, developers and system administrators are almost conflicting among each other, to a unified process, where the shared final objective is that of making the product available to the user. There are two main challenges that have to be faced when approaching the cloud. First of all, the heterogeneity of the offer. More and more cloud services are growing from different providers with no standard yet defined, driving companies towards the lock-in problem. Second, having the possibility to scale from 10s to 1000s of machines implies huge effort in IT management without smart automation systems. This paper is an attempt to review some of the tools among the currently available ones that may help companies simplifying their application release process.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125758125","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}
Previous work identifying depth-optimal n-channel sorting networks for 9 ≤ n ≤ 16 is based on exploiting symmetries of the first two layers. However, the naive generate-and-test approach typically applied does not scale. This paper revisits the problem of generating two-layer prefixes modulo symmetries. An improved notion of symmetry is provided and a novel technique based on regular languages and graph isomorphism is shown to generate the set of non-symmetric representations. An empirical evaluation demonstrates that the new method outperforms the generate-and-test approach by orders of magnitude and easily scales until n = 40.
{"title":"The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes","authors":"M. Codish, L. Cruz-Filipe, Peter Schneider-Kamp","doi":"10.1109/SYNASC.2014.55","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.55","url":null,"abstract":"Previous work identifying depth-optimal n-channel sorting networks for 9 ≤ n ≤ 16 is based on exploiting symmetries of the first two layers. However, the naive generate-and-test approach typically applied does not scale. This paper revisits the problem of generating two-layer prefixes modulo symmetries. An improved notion of symmetry is provided and a novel technique based on regular languages and graph isomorphism is shown to generate the set of non-symmetric representations. An empirical evaluation demonstrates that the new method outperforms the generate-and-test approach by orders of magnitude and easily scales until n = 40.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129282437","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}
We design a new fast algorithm to automatically complete closed contours in a finite point cloud on the plane. The only input can be a scanned map with almost closed curves, a hand-drawn artistic sketch or any sparse dotted image in 2D without any extra parameters. The output is a hierarchy of closed contours that have a long enough life span (persistence) in a sequence of nested neighborhoods of the input points. We prove theoretical guarantees when, for a given noisy sample of a graph in the plane, the output contours geometrically approximate the original contours in the unknown graph.
{"title":"Auto-completion of Contours in Sketches, Maps, and Sparse 2D Images Based on Topological Persistence","authors":"V. Kurlin","doi":"10.1109/SYNASC.2014.85","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.85","url":null,"abstract":"We design a new fast algorithm to automatically complete closed contours in a finite point cloud on the plane. The only input can be a scanned map with almost closed curves, a hand-drawn artistic sketch or any sparse dotted image in 2D without any extra parameters. The output is a hierarchy of closed contours that have a long enough life span (persistence) in a sequence of nested neighborhoods of the input points. We prove theoretical guarantees when, for a given noisy sample of a graph in the plane, the output contours geometrically approximate the original contours in the unknown graph.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114454763","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
扫码关注我们
求助内容：
应助结果提醒方式：