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

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

筛选
英文 中文
Semantic Annotation Based Service Composition for Grid Workflow Description and Execution 基于语义标注的网格工作流描述与执行服务组合
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.11
D. Rodila, V. Bâcu, D. Gorgan
{"title":"Semantic Annotation Based Service Composition for Grid Workflow Description and Execution","authors":"D. Rodila, V. Bâcu, D. Gorgan","doi":"10.1109/SYNASC.2009.11","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.11","url":null,"abstract":"The main purpose of the research work presented in this paper was to model and implement a workflow based architecture for Web service composition which allows the integration of composed Web services in a Grid middleware. The composed Web services are integrated as computational nodes in a workflow description and execution platform. To prove the presented theoretical concepts, a prototype was also implemented based on the gProcess application [13] in which the Web services are integrated as satellite image operators in workflows used for processing satellite images. The urge for such a research work was driven by the lack of flexibility offered by the static deployed applications and the need of a dynamic approach given by Web services developed and deployed all over around the world. The proposed solution is a semi-automatic Web service composition based on predefined templates and realized in several steps: automatically search in a private registry, perform semantic annotation, automatically bind information of founded services and create a BPEL business process. This solution offers a dynamic approach and allows a high degree of reusability and interoperability in a Grid medium.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"218 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":"122382844","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
Automated Software Analysis 自动化软件分析
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.67
H. Veith
{"title":"Automated Software Analysis","authors":"H. Veith","doi":"10.1109/SYNASC.2009.67","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.67","url":null,"abstract":"Recent years have seen tremendous progress in the capabilities of software model checkers. These tools are the result of combined efforts by different communities, most notably model checking, abstract interpretation, program semantics, and decision procedures. In this tutorial, we will introduce the fundamentals of software model checking, and show how the different origins of the field combine to a common agenda.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"24 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":"116740898","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
Fairness and QoS Enhancement Models and Techniques for Peer-to-Peer Content Sharing Systems 对等内容共享系统的公平性和QoS增强模型与技术
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.16
M. Andreica, Irina Borozan, Lucian Balaceanu, N. Tapus
{"title":"Fairness and QoS Enhancement Models and Techniques for Peer-to-Peer Content Sharing Systems","authors":"M. Andreica, Irina Borozan, Lucian Balaceanu, N. Tapus","doi":"10.1109/SYNASC.2009.16","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.16","url":null,"abstract":"Peer-to-peer content sharing systems are becoming increasingly popular in many types of environments, ranging from well-known file sharing communities to scientific and professional resource sharing communities. Two important objectives in such systems are achieving system-level fairness (i.e. participants should not only maximize their benefits, but also contribute to the well-being of the community) and an improved perceived Quality of Service (QoS) at the level of the individual participants. In this paper we propose several techniques for addressing these objectives from two perspectives: the application layer and the communication architecture layer.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"17 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114113390","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
Bounded Parallelism in PowerList and ParList Theories PowerList和ParList理论中的有界并行性
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.30
Virginia Niculescu, A. Guran
{"title":"Bounded Parallelism in PowerList and ParList Theories","authors":"Virginia Niculescu, A. Guran","doi":"10.1109/SYNASC.2009.30","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.30","url":null,"abstract":"A very efficient model for recursive, data-parallel programs can be one based on PowerList, PowerArray, and ParList theories. It assures simple and correct design of this kind of programs, allowing work at a high level of abstraction. This high level of abstraction could be reconciled with performance by introducing data-distributions into these theories.%An important advantage of formally introducing distributions is that this allows us to evaluate costs, depending on the number of available processors, which is considered as a parameter. In this paper, we generalize the data distributions defined on PowerLists by introducing data distributions for parallel programs defined using ParList structures. Using these distributions we also define a possibility to transform ParList parallel programs into PowerList parallel programs, which are more efficient. This is an important advantage since PowerList programs could be efficiently mapped on real architecture (e.g. hypercubes).","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"15 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":"116616828","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
Semantic Web Service Composition Method Based on Fluent Calculus 基于Fluent微积分的语义Web服务组合方法
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.34
V. Chifu, I. Salomie, Ioana Harsa, Marius Gherga
{"title":"Semantic Web Service Composition Method Based on Fluent Calculus","authors":"V. Chifu, I. Salomie, Ioana Harsa, Marius Gherga","doi":"10.1109/SYNASC.2009.34","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.34","url":null,"abstract":"This paper presents a new approach for automatic Web service composition based on the formalism of Fluent Calculus using semantic Web service descriptions. In our approach, the Web service composition process is viewed as an AI planning problem in the Fluent Calculus formalism. To semantically describe Web services, we have used a Web service domain ontology which is then translated into a Fluent Calculus knowledge base, necessary for the composition planning phase. For verifying the composed services, the Label Transition System Analyzer (LTSA) formalism is used. The paper also presents an experimental prototype for the Fluent Calculus based Web service composition and demonstrates its effectiveness with the help of an application scenario from the social event planning domain.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"33 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":"129884788","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
A Grid Enabled Quantum Computer Simulator 启用网格的量子计算机模拟器
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.57
S. Caraiman, Alexandru Archip, V. Manta
{"title":"A Grid Enabled Quantum Computer Simulator","authors":"S. Caraiman, Alexandru Archip, V. Manta","doi":"10.1109/SYNASC.2009.57","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.57","url":null,"abstract":"Simulation of quantum computers using classical computers is a computationally hard problem, requiring a huge amount of operations and storage. Grid systems are a good choice for simulating quantum algorithms, since they provide access to high-performance computer clusters. In this paper we present the design of a message passing parallel version of the quantum computer simulator, QCL, deployed as a grid service. After describing the architecture of our grid service and the parallelization strategy for the general single qubit operator, we present the performance measurements for some test cases, showing the speedups obtained.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"48 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":"130921647","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
Approximating and Combining Equilibria in Non-cooperative Games 非合作对策的逼近与组合均衡
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.52
D. Dumitrescu, R. Lung, T. Mihoc
{"title":"Approximating and Combining Equilibria in Non-cooperative Games","authors":"D. Dumitrescu, R. Lung, T. Mihoc","doi":"10.1109/SYNASC.2009.52","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.52","url":null,"abstract":"Generative relations for different equilibria types in finite non cooperative games are proposed. These relations induce appropriate domination concepts. Using an evolutionary technique approximations for different equilibria are computed.The concept of game is extended in order to allow players to have different types of rationality. The new game allows us to combine different equilibria. Numerical experiments indicate the potential of the proposed concepts and technique and offers an inside view of the implication of the rationality in the solution concept.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"35 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":"133017844","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 Resources Allocation in Grid Enviroments 网格环境中的动态资源分配
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.20
Marius Ion, Florin Pop, C. Dobre, V. Cristea
{"title":"Dynamic Resources Allocation in Grid Enviroments","authors":"Marius Ion, Florin Pop, C. Dobre, V. Cristea","doi":"10.1109/SYNASC.2009.20","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.20","url":null,"abstract":"This paper presents DyAG, an innovative solution for dynamic allocation of resources for services workflows in Grid enviroments. The proposed solution is responsible with the efficient mapping of the services which make up a Business Process Execution Language workflow onto resources, represented by Web Services, from the Grid enviroment. The presented solution is part of a framework that aims to allow the deployment of large scale workflow enabled scientific applications from a wide range of research fields onto the Grid. A series of allocation policies is considered, but the DyAG also allows the users to dynamically change the policy employed by the scheduler at runtime, through a class loading mechanism. This allows the employment of application profiling techniques in order to finely tune the scheduler in accordance with the characteristics of the environment it is running in, either by changing the various parameters of the policies proposed, or by loading completely new policies.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"87 1-3 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":"131971283","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
Algorithms for Identifying Sequence Patterns with Several Types of Occurrence Constraints 具有多种类型发生约束的序列模式识别算法
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.38
M. Andreica, N. Tapus, Andrei Grigorean
{"title":"Algorithms for Identifying Sequence Patterns with Several Types of Occurrence Constraints","authors":"M. Andreica, N. Tapus, Andrei Grigorean","doi":"10.1109/SYNASC.2009.38","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.38","url":null,"abstract":"In this paper we present efficient algorithmic techniques for identifying several types of sequence-related patterns. We consider two main problems: finding a maximum weight contiguous subsequence which has the structure of a permutation with repetitions, and an online problem consisting of the constrained guessing of a secret sequence.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"33 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":"134097601","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
A Policy-Based Context Aware Self-Management Model 基于策略的上下文感知自我管理模型
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.28
T. Cioara, I. Anghel, I. Salomie, M. Dînsoreanu
{"title":"A Policy-Based Context Aware Self-Management Model","authors":"T. Cioara, I. Anghel, I. Salomie, M. Dînsoreanu","doi":"10.1109/SYNASC.2009.28","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.28","url":null,"abstract":"This paper proposes a generic policy based self-management model that can be used to automatically detect and repair the problems appeared during the context adaptation processes. To successfully capture and evaluate the dynamic rules that govern the context aware adaptation processes we have defined an generic context policy representation model and its associated reasoning language conversion model for run-time evaluation. To evaluate the run-time degree of respecting the context policies we define and formalize the concept of context entropy. The context information is modeled in a system programmatic manner using both the set based and ontology based representations provided by our RAP (Resources, Actors, Policies) context model. The context model artifacts are generated and administrated at run time by a management infrastructure based on BDI (Believe, Desire, Intentions) agents. The model was tested and validated within the premises of our Distributed Systems Research Laboratory smart environment.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"38 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":"129708174","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
首页 上一页 下一页 尾页
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学术官方微信