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

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

筛选
英文 中文
The Lucas Optimal Growth Model on Finite Horizon 有限视界上的Lucas最优增长模型
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.26
N. Bonchis
{"title":"The Lucas Optimal Growth Model on Finite Horizon","authors":"N. Bonchis","doi":"10.1109/SYNASC.2009.26","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.26","url":null,"abstract":"In this paper the Lucas optimal growth of the human capital and consumption is analyzed on finite horizon. The main purpose is the approximation of the optimal human capital and consumption evolution on infinite horizon by the finite case which can be numerically computed.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"56 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":"116016346","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
A Calculus for Imperative Programs: Formalization and Implementation 命令式程序的微积分:形式化和实现
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.42
Madalina Erascu, T. Jebelean
{"title":"A Calculus for Imperative Programs: Formalization and Implementation","authors":"Madalina Erascu, T. Jebelean","doi":"10.1109/SYNASC.2009.42","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.42","url":null,"abstract":"As an extension of our previous work on imperative program verification, we present a formalism for handling the total correctness of While loops in imperative programs, consisting in functional based definitions of the verification conditions for both partial correctness and for termination.A specific feature of our approach is the generation of verification conditions as first order formulae, including the termination condition which is expressed as an induction principle.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"147 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":"123424782","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
Immune-inspired Web Service Composition Framework 免疫启发的Web服务组合框架
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.47
C. Pop, V. Chifu, I. Salomie, M. Dînsoreanu, Iulia Vartic, Monica Vlad
{"title":"Immune-inspired Web Service Composition Framework","authors":"C. Pop, V. Chifu, I. Salomie, M. Dînsoreanu, Iulia Vartic, Monica Vlad","doi":"10.1109/SYNASC.2009.47","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.47","url":null,"abstract":"This paper presents a new Web service composition method which combines the AI planning graph technique with an immune-inspired algorithm to find the optimal composition solution. Simultaneously with the planning graph onstruction, a matrix of semantic links is built to storethe semantic links established between the services on different layers of the graph. The planning graph and the matrix of semantic links represent the main building blocks of our immune-inspired technique for finding the optimal composition solution. We use a multi-criteria function which evaluates the composition solution in terms of its QoS attributes and the quality of the semantic match between the services involved in the solution. In order to validate our approach to automatically compose Web services, we have developed an experimental framework that integrates the planning graph composition approach and the immune-inspired selection technique. We have performed our experiments on a set of Web services from two domains.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"16 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":"130711973","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
Automated Methods for Proving Program Termination and Liveness 证明程序终止和存活的自动化方法
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.70
A. Rybalchenko
{"title":"Automated Methods for Proving Program Termination and Liveness","authors":"A. Rybalchenko","doi":"10.1109/SYNASC.2009.70","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.70","url":null,"abstract":"Proving program termination is an important step towards ensuring software reliability. The programmers expect that the majority of code fragments, including procedures, event handles, or other program components, always terminates. Unfortunately, until recently there were no viable approaches for automatically proving termination of programs written in imperative programming languages.","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":"116110623","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
Matching Semantic Web Services Using Learning Accuracy 使用学习准确性匹配语义Web服务
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.33
V. Chifu, I. Salomie, E. Chifu, Roland Vachter, Alpár Kövér
{"title":"Matching Semantic Web Services Using Learning Accuracy","authors":"V. Chifu, I. Salomie, E. Chifu, Roland Vachter, Alpár Kövér","doi":"10.1109/SYNASC.2009.33","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.33","url":null,"abstract":"The automatic discovery of suitable Web services for a given task is one of the key elements in implementing the Semantic Web vision. This paper presents a new matching algorithm for Semantic Web service discovery. Our matching algorithm allows for ranking the discovered Web services according to their relevance to the service request. The learning accuracy is proposed as a suitable metric for determining the semantic similarity between a service request and the service advertisements. The semantic similarity is computed by considering the semantic information encoded in a domain ontology, including both the concept hierarchy and the properties of the concepts. Evaluating the semantic similarity between a service request and a service advertisement is based on the concepts, their semantic relations, their common and distinguishing properties, and the semantic relations between their properties.","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":"121216502","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
Superfluous S-polynomials in Strategy-Independent Groebner Bases 策略无关格罗布纳基中的多余s多项式
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.59
G. Passmore, L. D. Moura
{"title":"Superfluous S-polynomials in Strategy-Independent Groebner Bases","authors":"G. Passmore, L. D. Moura","doi":"10.1109/SYNASC.2009.59","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.59","url":null,"abstract":"Using the machinery of proof orders originally introduced by Bachmair and Dershowitz in the context of canonical equational proofs, we give an abstract, strategy-independent presentation of Groebner basis procedures and prove the correctness of two classical criteria for recognising superfluous S-polynomials, Buchberger's criteria 1 and 2, w.r.t. arbitrary fair and correct basis construction strategies. To do so, we develop a general method for proving the strategy-independent correctness of superfluous S-polynomial criteria which seems to be quite powerful. We also derive a new superfluous S-polynomial criterion which is a generalisation of Buchberger-1 and is proved to be correct strategy-independently.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"73 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":"132815923","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}
引用次数: 8
On Herbrand-like Theorems for Cut-free Modal Sequent Logics 关于无切模态序列逻辑的类herbrand定理
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.63
Alexander V. Lyaletski
{"title":"On Herbrand-like Theorems for Cut-free Modal Sequent Logics","authors":"Alexander V. Lyaletski","doi":"10.1109/SYNASC.2009.63","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.63","url":null,"abstract":"The purpose of the research presented in this paper is to extend the author's results on sequent forms of Herbrand theorems for classical and intuitionistic logics onto classical and intuitionistic modal sequent logics. It was found that the technique reported at the SYNASC 2008 symposium and based on the original notions of admissibility and compatibility can satisfactorily be applied for proving Herbrand theorems for the logics under consideration in the sequent form.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"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":"115785032","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
Distributed Scheduling Policy in Service Oriented Environments 面向服务环境中的分布式调度策略
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.24
M. Frîncu
{"title":"Distributed Scheduling Policy in Service Oriented Environments","authors":"M. Frîncu","doi":"10.1109/SYNASC.2009.24","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.24","url":null,"abstract":"Service oriented architectures become more and more popular with the emergence and consolidation of new paradigms such as Clouds and Grids. In this context scheduling becomes an important and difficult problem as services hide their actual implementation, requirements or efficiency and are spread across multiple institutions and geographical locations. This paper proposes a distributed scheduling approach based on agents where each agent handles a certain domain and manages independently the policies inside it. In its frame several scheduling algorithms are also studied, compared and some results are given.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"159 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":"122053425","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}
引用次数: 7
Cancer Prediction Modeling from Volumetric Data 基于体积数据的癌症预测建模
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.36
Marius Paltanea, S. Tabirca, Y. J. Chen, M. Tangney
{"title":"Cancer Prediction Modeling from Volumetric Data","authors":"Marius Paltanea, S. Tabirca, Y. J. Chen, M. Tangney","doi":"10.1109/SYNASC.2009.36","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.36","url":null,"abstract":"This paper introduces a method for cancer prediction based on the Fister-Panetta (FP) model for cancer growth.The FP equation includes a component for the tumor growth which describes its natural evolution without any treatment.The second component of the FP equation is represented by the contribution of the treatment scheme. Our prediction uses these two components to predict the evolution of the tumor in the near future. The prediction model uses the real information about the tumor growth in this two cases to find the best mathematical approximation with the FP equation. Then this equation is used to predict the evolution in the near future of the tumor.","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":"126914839","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 Hierarchy of Tractable Subclasses for SAT and Counting SAT Problems 可处理的SAT子类的层次结构和计算SAT问题
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.12
S. Andrei, G. Grigoraș, M. Rinard, R. Yap
{"title":"A Hierarchy of Tractable Subclasses for SAT and Counting SAT Problems","authors":"S. Andrei, G. Grigoraș, M. Rinard, R. Yap","doi":"10.1109/SYNASC.2009.12","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.12","url":null,"abstract":"Finding subclasses of formulae for which the SAT problem can be solved in polynomial time has been an important problem in computer science. We present a new hierarchy of propositional formulæ subclasses for which the SAT and counting SAT problems can be solved in polynomial time. Our tractable subclasses are those propositional formulae in conjunctive normal form where any set of k + 1 clauses are related, i.e., there exists at least one literal in one clause that appears negated in another clause of the considered set of k + 1 clauses. We say this subclass of formulæ is of rank k and it is different from previously known subclasses that are solvable in polynomial time. This is an improvement over the SAT Dichotomy Theorem and the counting SAT Dichotomy Theorem, since our subclass can be moved out from the NP-complete class to the P class. The membership problem for this new subclass can be solved in O(n*l^{k+1}), where n, l and k are the number of variables, clauses and the rank (1 ≤ k ≤ l − 1), respectively. We give an efficient algorithm to approximate the number of assignments for any arbitrary conjunctive normal form propositional formula by an upper bound.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"7 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":"134303840","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学术官方微信