2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing最新文献

筛选
英文 中文
Evaluation of the CAP Properties on Amazon SimpleDB and Windows Azure Table Storage 对Amazon SimpleDB和Windows Azure表存储的CAP属性进行评估
Simone Benefico, Eva Gjeci, Ricardo Gonzalez Gomarasca, Eros Lever, S. Lombardo, D. Ardagna, E. D. Nitto
{"title":"Evaluation of the CAP Properties on Amazon SimpleDB and Windows Azure Table Storage","authors":"Simone Benefico, Eva Gjeci, Ricardo Gonzalez Gomarasca, Eros Lever, S. Lombardo, D. Ardagna, E. D. Nitto","doi":"10.1109/SYNASC.2012.60","DOIUrl":"https://doi.org/10.1109/SYNASC.2012.60","url":null,"abstract":"The advent of Web 2.0 and the diffusion of cloud computing technologies recently moved the focus of industry and academia to new ways to store information. Web 2.0 applications require new solutions that allow to efficiently store and compute huge amounts of data, providing high performance, high scalability and availability at low costs. Even though relational databases are mature and offer powerful tools to manage data, their scalability limits have brought some of the largest IT companies to adopt less mature solutions, known as NoSQL databases. In 2000, a conjecture, formalized afterwards as the CAP theorem, concerning the Consistency (C), Availability (A) and Partition tolerance (P) of distributed systems was formulated. In this paper we propose a methodology based on the CAP theorem and a framework for the assessment of the CAP properties of cloud NoSQL systems. Furthermore, we provide the results of an extensive set of experiments we performed on Amazon SimpleDB and Windows Azure Table Storage for comparing quantitatively Availability and Consistency of such systems.","PeriodicalId":173161,"journal":{"name":"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123063768","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
Soundness of a Logic-Based Verification Method for Imperative Loops 命令式循环的逻辑验证方法的合理性
Madalina Erascu, T. Jebelean
{"title":"Soundness of a Logic-Based Verification Method for Imperative Loops","authors":"Madalina Erascu, T. Jebelean","doi":"10.1109/SYNASC.2012.63","DOIUrl":"https://doi.org/10.1109/SYNASC.2012.63","url":null,"abstract":"We present a logic-based verification method for imperative loops (including ones with abrupt termination) and the automatic proof of its soundness. The verification method consists in generating verification conditions for total correctness of an imperative loop annotated with an invariant. We realized, in the textit{Theorem a} system (url{www.theorema.org}), the automatic proof of the soundness of verification method: if the verification conditions hold, then the imperative loop is totally correct with respect to its given invariant. The approach is simpler than the others because it is based on functional semantics (no additional theory of program execution is necessary) and produces verification conditions in the object theory of the program. The computer-supported proofs reveal the minimal collection of logical assumptions (some from natural number theory) and logical inferences (including induction) which are necessary for the soundness of the verification technique.","PeriodicalId":173161,"journal":{"name":"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125281002","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
Optimized Zero False Positives Perceptron Training for Malware Detection 针对恶意软件检测的优化零误报感知器训练
Dragos Gavrilut, Razvan Benchea, Cristina Vatamanu
{"title":"Optimized Zero False Positives Perceptron Training for Malware Detection","authors":"Dragos Gavrilut, Razvan Benchea, Cristina Vatamanu","doi":"10.1109/SYNASC.2012.34","DOIUrl":"https://doi.org/10.1109/SYNASC.2012.34","url":null,"abstract":"The increasing number of malware in the past 4 years has determined researchers to test different machine learning techniques to automate the detection system. But because of the large size of the dataset and the need of having a high detection rate, the resulted models have often produced many false positives. This paper proposes a modified version of the perceptron algorithm able to detect malware samples while training at a low rate (even zero) of false positives. A very low number of false positives is crucial because in a real life situation detecting a clean file as malware can destroy the operating system or render other programs unusable. We also provide a method of optimizing the training speed for the algorithm while maintaining the same accuracy. The resulted algorithm can be used in an ensemble or voting system to increase detection and eliminate false positives.","PeriodicalId":173161,"journal":{"name":"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128534863","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}
引用次数: 30
A Distributed Solver for Dense Linear Feasibility Systems 密集线性可行性系统的分布式求解器
Andrei Sucila, Mihai Cimpoesu
{"title":"A Distributed Solver for Dense Linear Feasibility Systems","authors":"Andrei Sucila, Mihai Cimpoesu","doi":"10.1109/SYNASC.2012.53","DOIUrl":"https://doi.org/10.1109/SYNASC.2012.53","url":null,"abstract":"The aim of this paper is to present a new hybrid solver for linear feasibility systems that uses a block-parallel scheme combined with a new variable weight projection operator which takes into account the distances to the semi spaces onto which it projects. The solver can tackle very large, dense, systems. The results of our study show that a specialized variant of the solver is more efficient at solving a certain class of dense systems in terms of resources than other variants. Furthermore, we will also show results that suggest that the distribution scheme does not greatly affect the number of required iterations for a solution to be reached.","PeriodicalId":173161,"journal":{"name":"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122272164","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
Variable Density Based Genetic Clustering 基于变密度的遗传聚类
Andrei Sorin Sabau
{"title":"Variable Density Based Genetic Clustering","authors":"Andrei Sorin Sabau","doi":"10.1109/SYNASC.2012.31","DOIUrl":"https://doi.org/10.1109/SYNASC.2012.31","url":null,"abstract":"From the existing clustering techniques, spatial density-based ones register one of the most promising results in detecting arbitrary shaped data, being robust to outliers and not restricted by various data distributions. The existing literature contains a plethora of density based algorithms but in all cases one or multiple global parameters need to be set, parameters that are seldom easy to set requiring in depth knowledge about the analyzed data. This paper proposes a parameter-free novel genetic clustering algorithm with an original method for encoding clustering solutions relying on density based clustering parameters. Within each clustering solution genotype, gene position, defined by several density based clustering attributes, plays a key role for recovering the encoded partition. Each gene defined density-based cluster can only attract object not already attracted by previously defined clusters. The proposed encoding scheme allows for always valid crossover results, with great offspring variations even when using simple crossover operators. While not requiring any input parameters, experiments involving multiple clustering validation indices as fitness criteria, across both synthetic and real data sets, show comparable results with existing density-based clustering techniques.","PeriodicalId":173161,"journal":{"name":"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"76 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132473758","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
What is an Equation? 什么是方程?
S. Marcus, S. Watt
{"title":"What is an Equation?","authors":"S. Marcus, S. Watt","doi":"10.1109/SYNASC.2012.79","DOIUrl":"https://doi.org/10.1109/SYNASC.2012.79","url":null,"abstract":"The equation concept is one of the most fundamental in mathematics, yet the word \"equation\" means different things to different people. It is used not only with various precise technical meanings, but also as a metaphor for complex situations. We review some of the history of the equation and its present meaning and use in a variety of settings. Although some languages make distinctions among ideas such equations that are always satisfied versus those that may not be, or between equations with variables and relations without, we observe that it may not be possible to decide into which of these cases a particular equality falls.","PeriodicalId":173161,"journal":{"name":"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128922947","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
Boolean Evaluation with a Pairing and Unpairing Function 用配对和解配对函数计算布尔值
Paul Tarau, Brenda Luderman
{"title":"Boolean Evaluation with a Pairing and Unpairing Function","authors":"Paul Tarau, Brenda Luderman","doi":"10.1109/SYNASC.2012.20","DOIUrl":"https://doi.org/10.1109/SYNASC.2012.20","url":null,"abstract":"A pairing function is a bijection f : N × N → N. Its inverse is called an em unpairing function. We show that boolean logic on bit vector variables can be expressed as compositions of pairing/unpairing operations which can emulate boolean evaluation of ordered binary decision trees (OBDTs) of a canonical form. Applications to enumeration and random generation of OBDTs and a generalization to Multi-Terminal Ordered OBDTs (MTOBDT) are also described. The paper is organized as a literate Haskell program (code available at http://logic.csci.unt.edu/tarau/research/2012/hOBDT.hs).","PeriodicalId":173161,"journal":{"name":"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123910045","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}
引用次数: 5
Relating Two Metric Semantics for Parallel Rewriting of Multisets 关联两个度量语义的多集并行重写
Gabriel Ciobanu, E. Todoran
{"title":"Relating Two Metric Semantics for Parallel Rewriting of Multisets","authors":"Gabriel Ciobanu, E. Todoran","doi":"10.1109/SYNASC.2012.35","DOIUrl":"https://doi.org/10.1109/SYNASC.2012.35","url":null,"abstract":"In this paper we employ the mathematical methodology of metric semantics in defining and relating a denotational and an operational semantics for an abstract concurrent language embodying the following features: parallel composition is based on maximal parallelism, and computations are specified by means of multiset rewriting rules. We relate these semantics, and compare them in terms of this combination of concepts. The semantic models are designed by using continuations for concurrency.","PeriodicalId":173161,"journal":{"name":"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114637260","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}
引用次数: 9
Nominal Fusion Calculus 名义融合演算
A. Alexandru, Gabriel Ciobanu
{"title":"Nominal Fusion Calculus","authors":"A. Alexandru, Gabriel Ciobanu","doi":"10.1109/SYNASC.2012.40","DOIUrl":"https://doi.org/10.1109/SYNASC.2012.40","url":null,"abstract":"We present a nominal semantics of the monadic version of the fusion calculus. A set of compact transition rules is given in terms of nominal logic by using a specific nominal quantifier. Based on known and new results in nominal logic, it is proved an equivalence between the new nominal semantics and the old (original) semantics of the monadic fusion calculus, emphasizing the benefits of presenting the transition rules by using nominal techniques.","PeriodicalId":173161,"journal":{"name":"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"22 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125779719","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
On Coxeter Spectral Study of Posets and a Digraph Isomorphism Problem 偏置集的Coxeter谱研究及一个有向图同构问题
Marcin Gąsiorek, D. Simson, Katarzyna Zając
{"title":"On Coxeter Spectral Study of Posets and a Digraph Isomorphism Problem","authors":"Marcin Gąsiorek, D. Simson, Katarzyna Zając","doi":"10.1109/SYNASC.2012.56","DOIUrl":"https://doi.org/10.1109/SYNASC.2012.56","url":null,"abstract":"Following the spectral graph theory and algebraic techniques in graph theory, we continue a Coxeter spectral study of finite posets and edge-bipartite graphs (or signed graphs in the sense of Harary and Zaslavsky). A connection between properties of the Coxeter spectrum and digraph isomorphism problem for Hasse digraphs of positive and non-negative posets J is also studied. In particular, we study in details a class of posets J with a non-negativity condition, in connection with the Coxeter spectral properties of the simply-laced Euclidean diagrams. We show that symbolic and numerical computer calculations in Python, C and Linux tools allow us to present a complete classification of these posets J, with at most 15 points, by means of their Coxeter spectra. The main classification ideas and the algorithms used in the classification are presented in Sections 4 and 6. We end the paper by showing how our poset classification results apply to the isomorphism problem for a special class of digraphs.","PeriodicalId":173161,"journal":{"name":"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130582742","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}
引用次数: 10
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信