发布求助
文献互助 智能选刊 最新文献

2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing最新文献

筛选
英文 中文
Sparse Matrix Computations Using the Quadtree Storage Format 使用四叉树存储格式的稀疏矩阵计算
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.55
I. Šimeček
{"title":"Sparse Matrix Computations Using the Quadtree Storage Format","authors":"I. Šimeček","doi":"10.1109/SYNASC.2009.55","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.55","url":null,"abstract":"Computations with sparse matrices are widespread in scientific projects. Used data format affects strongly the performance. Efficient formats for storing sparse matrices are still under development, since the computation using widely-used formats (like XY or CSR) is slow and specialized formats (like SPARSITY or CARB) have a large transformation overhead.In this paper, we represent some improvements to the quadtree storage format. We also compare the performance during the execution of some basic routines from the linear algebra using widely-used formats and the quadtree storage format.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"520 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129385834","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}
引用次数: 18
Simplification and Generalization in CIRC 中国保监会的简化与概化
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.54
Eugen-Ioan Goriac, Georgiana Caltais, D. Lucanu
{"title":"Simplification and Generalization in CIRC","authors":"Eugen-Ioan Goriac, Georgiana Caltais, D. Lucanu","doi":"10.1109/SYNASC.2009.54","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.54","url":null,"abstract":"CIRC is an automated theorem prover based on the circular coinduction principle. The tool is used for the verification of programs, behavioral equivalence checking, and proving properties over infinite data structures. In this paper we present two extensions of CIRC that handle the case when the prover indicates an infinite execution for a certain goal. The first extension involves goal simplification rules and a procedure for checking that the new execution is indeed a proof, while the second one refers to finding and proving a generalization of the goal. Each of the extensions is presented based on a case study: Binary Process Algebra (BPA) for checking the proof correctness and Streams for using generalization.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116700650","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
A Methodology for Concurrent Languages Development Based on Denotational Semantics 基于指称语义的并发语言开发方法
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.31
Gabriel Ciobanu, E. Todoran
{"title":"A Methodology for Concurrent Languages Development Based on Denotational Semantics","authors":"Gabriel Ciobanu, E. Todoran","doi":"10.1109/SYNASC.2009.31","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.31","url":null,"abstract":"By using the \"continuation semantics for concurrency\" (CSC) technique [6] denotational semantics can be used both as a method for formal specification and as a general method for designing tractable compositional prototypes for concurrent languages [8]. A denotational specification produces as final yield an element of a classic power domain structure. A denotational prototype designed with CSC produces incrementally a single execution trace and uses a random number generator to model the nondeterminism of a \"real\" concurrent system. In this paper we present a methodology for concurrent languages development based on denotational semantics. The main step of this methodology is the establishment of the formal relationship between a denotational prototype and a corresponding denotational specification. We illustrate this methodology on the particular example of a CSP-like language extended with communication on multiple channels in the style of Join calculus. We employ techniques from metric semantics in designing and relating the denotational prototype and the denotational specification for the language under study. We prove that the (single) trace produced by the denotational prototype is always an element of the collection of traces that is produced by the denotational specification. This result is independent of the random number generator that is given as a parameter to the denotational prototype.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115656999","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}
引用次数: 1
Dynamic Customization of Data Structures Instances Using an Agent Based Approach 使用基于代理的方法动态定制数据结构实例
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.25
I. Czibula, G. Czibula, A. Guran
{"title":"Dynamic Customization of Data Structures Instances Using an Agent Based Approach","authors":"I. Czibula, G. Czibula, A. Guran","doi":"10.1109/SYNASC.2009.25","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.25","url":null,"abstract":"Abstract data types (ADTs) represent the core for any software application, and a proper use of them is an essential requirement for developing a robust and efficient system. Moreover, a proper instantiation of a data structure that implements an abstract data type can greatly impact the performance of the system. In this paper we propose a learning approach for the dynamic configuration of data structures instances in a software system. In order to adapt a data structure to the system’s current execution context, a neural network will be used and an agent based system is proposed. We experimentally evaluate our system on a case study, emphasizing the advantages of the proposed approach.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114796087","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}
引用次数: 1
SMT Solvers for Testing, Program Analysis and Verification at Microsoft 微软测试，程序分析和验证的SMT求解器
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.64
N. Bjørner
{"title":"SMT Solvers for Testing, Program Analysis and Verification at Microsoft","authors":"N. Bjørner","doi":"10.1109/SYNASC.2009.64","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.64","url":null,"abstract":"Modern program analysis and model-based tools are increasingly complex and multi-faceted software systems.However, at their core is invariably a component using logic for describing states and transformations between system states.The system Z3, developed at Microsoft Research, is a Satisfiability Modulo Theories (SMT) solver.It provides logic inference capabilities that are critical for the functionality of these systems.The tutorial exemplifies a number of applications of Z3 at Microsoft.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132490672","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
Alleviating Urban Traffic Congestion by Means of Adaptive Routing 基于自适应路由的城市交通拥堵缓解研究
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.46
C. Gratie, A. Florea
{"title":"Alleviating Urban Traffic Congestion by Means of Adaptive Routing","authors":"C. Gratie, A. Florea","doi":"10.1109/SYNASC.2009.46","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.46","url":null,"abstract":"Traffic congestion is an important problem of today's urban life. Various approaches have been analyzed for solving this problem, most solutions addressing only a specific cause of the congestion. This paper focuses on rush hour congestion and aims to address its cause, the fact that many drivers need to reach the same destination and use the same routes, most frequently the shortest ones.A simple solution would be a collaborative behavior from the drivers, so as to ensure that some of the drivers choose slightly longer routes in order to avoid congestion. This paper aims to investigate the improvement potential of using intelligent routing, while offering (as much as possible) the fastest available routes to the drivers.A simple yet effective routing algorithm is proposed and tested by means of a multi-agent system on top of a traffic simulator. Experimental results conform to the expected behavior of the algorithm and are meant to provide reference values for further research.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134548939","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
Satisfiability and Theories 满意度和理论
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.65
A. Voronkov
{"title":"Satisfiability and Theories","authors":"A. Voronkov","doi":"10.1109/SYNASC.2009.65","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.65","url":null,"abstract":"We give a simple introduction to satisfiability modulo theories intended fornon-specialists. No previous background is assumed.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"105 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133173715","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
Formal Proof of Theorems on Genetic Regulatory Networks 遗传调控网络定理的形式化证明
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.44
Maxime Dénès, Benjamin Lesage, Yves Bertot, A. Richard
{"title":"Formal Proof of Theorems on Genetic Regulatory Networks","authors":"Maxime Dénès, Benjamin Lesage, Yves Bertot, A. Richard","doi":"10.1109/SYNASC.2009.44","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.44","url":null,"abstract":"We describe the formal verification of two theorems of theoretical biology. These theorems concern genetic regulatory networks: they give, in a discrete modeling framework, relations between the topology and the dynamics of these biological networks. In the considered discrete modeling framework, the dynamics is described by a transition graph, where vertices are vectors indicating the expression level of each gene, and where edges represent the evolution of these expression levels. The topology is also described by a graph, called interaction graph, where vertices are genes and where edges correspond to influences between genes. The two results we formalize show that circuits of some kind must be present in the interaction graph if some behaviors are possible in the transition graph. This work was performed with the ssreflect extension of the Coq system.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131366664","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
Fault Tolerance Using a Front-End Service for Large Scale Distributed Systems 基于前端服务的大规模分布式系统容错
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.13
Marieta Nastase, C. Dobre, Florin Pop, V. Cristea
{"title":"Fault Tolerance Using a Front-End Service for Large Scale Distributed Systems","authors":"Marieta Nastase, C. Dobre, Florin Pop, V. Cristea","doi":"10.1109/SYNASC.2009.13","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.13","url":null,"abstract":"In this paper we present a solution to ensuring a high degree of availability and reliability in service-based large scale distributed systems. The proposed architecture is based on a set of replicated services running in a fault-tolerant container and a proxy service able to mask possible faults, completely transparent for a client. The solution not only masks possible faults but also optimizes the access to the distributed services and their replicas using a load-balancing strategy, whilst ensuring a high degree of scalability. The advantages of the proposed architecture were evaluated using a pilot implementation. The obtained results prove that the solution ensures a high degree of availability and reliability for a wide range of service-based distributed systems.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131679920","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}
引用次数: 11
Relational Operators in Heterogeneous Random Databases 异构随机数据库中的关系算子
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.50
Letitia Velcescu, L. Vasile
{"title":"Relational Operators in Heterogeneous Random Databases","authors":"Letitia Velcescu, L. Vasile","doi":"10.1109/SYNASC.2009.50","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.50","url":null,"abstract":"In this paper, we investigate the sizes of some approximate relational operations results, focusing on join, outer join and difference. We extend the notion of random database, in which the records are random vectors following a certain probability distribution, to heterogeneous random databases, in which each column can have its own unidimensional distribution. In this framework, we will investigate if the results already existing for the homogeneous databases remain true. Our approach follows three steps. First, we build up the histograms for some relational operations on heterogeneous tables with specific distributions, then we apply the chi square test of goodness of fit and, in the end, we prove the result that sets the limits for which the cardinality of the self-join can be approximated by a Poisson distribution.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"180 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124498706","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
首页 上一页 下一页 尾页
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学术官方微信