S. Bhowmick, L. Gruenwald, M. Iwaihara, S. Chatvichienchai
Data integration has been a long standing challenge to the database and data mining communities. This need has become critical in numerous contexts, including building e-commerce market places, sharing data from scientific research, and improving homeland security. However, these important activities are hampered by legitimate and widespread concerns of data privacy. It is necessary to develop solutions that enable integration of data, especially in the domains of national priorities, while effective privacy control of the data. In this paper, we present an architecture and key research issues for building such a privacy preserving data integration system called PRIVATE-IYE.
{"title":"PRIVATE-IYE: A Framework for Privacy Preserving Data Integration","authors":"S. Bhowmick, L. Gruenwald, M. Iwaihara, S. Chatvichienchai","doi":"10.1109/ICDEW.2006.117","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.117","url":null,"abstract":"Data integration has been a long standing challenge to the database and data mining communities. This need has become critical in numerous contexts, including building e-commerce market places, sharing data from scientific research, and improving homeland security. However, these important activities are hampered by legitimate and widespread concerns of data privacy. It is necessary to develop solutions that enable integration of data, especially in the domains of national priorities, while effective privacy control of the data. In this paper, we present an architecture and key research issues for building such a privacy preserving data integration system called PRIVATE-IYE.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116056489","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}
The advances of video technology and video-related applications demand appropriate video semantic models for representing video data and their semantics, and supporting powerful semantic queries on them. In this paper, we propose such a model named SemTTE. The model incorporates features of temporal structure and typed events of video contents. It organizes the whole video into a tree of events, and provides mechanisms for users to define domain-specific constraints. As a result, the contents and semantics of the video can be better represented and queried. For constraints enforcement, an efficient on-line method is proposed.
{"title":"Model Video Semantics with Constraints Considering Temporal Structure and Typed Events","authors":"Yu Wang, Lizhu Zhou, Jianyong Wang","doi":"10.1109/ICDEW.2006.94","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.94","url":null,"abstract":"The advances of video technology and video-related applications demand appropriate video semantic models for representing video data and their semantics, and supporting powerful semantic queries on them. In this paper, we propose such a model named SemTTE. The model incorporates features of temporal structure and typed events of video contents. It organizes the whole video into a tree of events, and provides mechanisms for users to define domain-specific constraints. As a result, the contents and semantics of the video can be better represented and queried. For constraints enforcement, an efficient on-line method is proposed.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116405484","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}
L.E. Olson, M. Winslett, G. Tonti, Nathan Seeley, Andrzej Uszok, J. Bradshaw
Like other open computing environments, web services need a scalable method of determining authorized users. We present desiderata for authorization facilities for web services, and analyze potential ways of satisfying them. We propose a third-party authorization system for web services based on trust negotiation, discuss its implementation using the TrustBuilder runtime system for trust negotiation, and present performance results from a stock trading application.
{"title":"Trust Negotiation as an Authorization Service forWeb Services","authors":"L.E. Olson, M. Winslett, G. Tonti, Nathan Seeley, Andrzej Uszok, J. Bradshaw","doi":"10.1109/ICDEW.2006.154","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.154","url":null,"abstract":"Like other open computing environments, web services need a scalable method of determining authorized users. We present desiderata for authorization facilities for web services, and analyze potential ways of satisfying them. We propose a third-party authorization system for web services based on trust negotiation, discuss its implementation using the TrustBuilder runtime system for trust negotiation, and present performance results from a stock trading application.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123008262","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}
As document providers can express more contextualized and complex information, semi-structured documents are becoming a major source of information in many areas, e.g., in digital libraries, e-commerce or Web applications. A particular characteristic of such document collections is the existence of some structure or metadata along with the data. In this scenario, clustering methods that can take advantage of such structural information to better organize such collections are highly relevant. Semi-structured documents pose new challenges to document clustering methods, however, since it is not clear how this structural information can be used to improve the quality of the generated clustering models. On the other hand, recently there has a growing interest in the semi-supervised clustering task, in which a little amount of prior knowledge is provided to guide the algorithm to a better clustering model. A particular type of semi-supervision is in the form of user-provided constraints defined over pairs of objects, where each pair informs if its objects must be in the same or in different clusters. In this paper, we consider the problem of constrained clustering in documents that present some form of structural information. We consider the existence of a particular form of information to be clustered: textual documents that present a logical structure represented in XML format. We define and extend methods to improve the quality of clustering results by using such structural information to guide the execution of the constrained clustering algorithm. Experimental results on the OHSUMED document collection show the effectiveness of our approach.
{"title":"Semi-Supervised Clustering of XML Documents: Getting the Most from Structural Information","authors":"Eduardo Goncalves da Silva, M. Mattoso, G. Xexéo","doi":"10.1109/ICDEW.2006.136","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.136","url":null,"abstract":"As document providers can express more contextualized and complex information, semi-structured documents are becoming a major source of information in many areas, e.g., in digital libraries, e-commerce or Web applications. A particular characteristic of such document collections is the existence of some structure or metadata along with the data. In this scenario, clustering methods that can take advantage of such structural information to better organize such collections are highly relevant. Semi-structured documents pose new challenges to document clustering methods, however, since it is not clear how this structural information can be used to improve the quality of the generated clustering models. On the other hand, recently there has a growing interest in the semi-supervised clustering task, in which a little amount of prior knowledge is provided to guide the algorithm to a better clustering model. A particular type of semi-supervision is in the form of user-provided constraints defined over pairs of objects, where each pair informs if its objects must be in the same or in different clusters. In this paper, we consider the problem of constrained clustering in documents that present some form of structural information. We consider the existence of a particular form of information to be clustered: textual documents that present a logical structure represented in XML format. We define and extend methods to improve the quality of clustering results by using such structural information to guide the execution of the constrained clustering algorithm. Experimental results on the OHSUMED document collection show the effectiveness of our approach.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129916546","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}
The dream of pervasive multimedia retrieval and reuse will not be realized without incorporating semantics in the multimedia database. As video data is penetrating many information systems, the need for database support for video data evolves. Hence, we propose an innovative database modeling mechanism called Hierarchical Markov Model Mediator (HMMM) which integrates lowlevel features, semantic concepts, and high-level user perceptions for modeling and indexing multiple-level video objects to facilitate temporal pattern retrieval. Different from the existing database modeling methods, our approach carries a stochastic and dynamic process in both search and similarity calculation. In the retrieval of semantic event patterns, HMMM always tries to traverse the right path and therefore it can assist in retrieving more accurate patterns quickly with lower computational costs. Moreover, HMMM supports feedbacks and learning strategies, which can proficiently assure the continuous improvements of the overall performance.
{"title":"Video Database Modeling and Temporal Pattern Retrieval using Hierarchical Markov Model Mediator","authors":"Na Zhao, Shu‐Ching Chen, M. Shyu","doi":"10.1109/icdew.2006.162","DOIUrl":"https://doi.org/10.1109/icdew.2006.162","url":null,"abstract":"The dream of pervasive multimedia retrieval and reuse will not be realized without incorporating semantics in the multimedia database. As video data is penetrating many information systems, the need for database support for video data evolves. Hence, we propose an innovative database modeling mechanism called Hierarchical Markov Model Mediator (HMMM) which integrates lowlevel features, semantic concepts, and high-level user perceptions for modeling and indexing multiple-level video objects to facilitate temporal pattern retrieval. Different from the existing database modeling methods, our approach carries a stochastic and dynamic process in both search and similarity calculation. In the retrieval of semantic event patterns, HMMM always tries to traverse the right path and therefore it can assist in retrieving more accurate patterns quickly with lower computational costs. Moreover, HMMM supports feedbacks and learning strategies, which can proficiently assure the continuous improvements of the overall performance.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130606069","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}
To realize the Semantic Web, it will be necessary to make existing database content available for emerging Semantic Web applications, such as web agents and services, which use ontologies to formally define the semantics of their data. Our research in the design and implementation of an ontology-based system, OntoGrate, addresses the critical and challenging problem of supporting human experts in multiple domains to interactively integrate information that is heterogenous in both structure and semantics. Databases, knowledge bases, the World Wide Web, and the emerging Semantic Web are some of the resources for which scalable integration remains a challenge. To integrate databases into the Semantic Web, we use Semantic Web ontologies to incorporate database schemas. An expressive first order ontology language, Web-PDDL, is used to define the structure, semantics, and mappings of data resources. A powerful inference engine, OntoEngine, can be used for query answering and data translation. In this paper, besides introducing new ideas in the OntoGrate system, we will elaborate on two case studies for which our system works well.
{"title":"Integrating Databases into the Semantic Web through an Ontology-Based Framework","authors":"D. Dou, P. LePendu, Shiwoong Kim, Peishen Qi","doi":"10.1109/ICDEW.2006.68","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.68","url":null,"abstract":"To realize the Semantic Web, it will be necessary to make existing database content available for emerging Semantic Web applications, such as web agents and services, which use ontologies to formally define the semantics of their data. Our research in the design and implementation of an ontology-based system, OntoGrate, addresses the critical and challenging problem of supporting human experts in multiple domains to interactively integrate information that is heterogenous in both structure and semantics. Databases, knowledge bases, the World Wide Web, and the emerging Semantic Web are some of the resources for which scalable integration remains a challenge. To integrate databases into the Semantic Web, we use Semantic Web ontologies to incorporate database schemas. An expressive first order ontology language, Web-PDDL, is used to define the structure, semantics, and mappings of data resources. A powerful inference engine, OntoEngine, can be used for query answering and data translation. In this paper, besides introducing new ideas in the OntoGrate system, we will elaborate on two case studies for which our system works well.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130432816","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 paper describes a declarative and unifying approach, based on XQuery and XML Schema, to modeling and accessing the variety of data source types found in a typical enterprise. These include relational, Web service, function-based (a.k.a. servicebased), and file-based data sources. The approach that we detail here is based on introspection of data source meta-information and generation of metadata artifacts that conform to a common model and that provide a uniform framework in which the data sources become available to an XQuery-based query processor. We explain how our approach addresses various aspects of data sources, including data source connectivity, data typing, integrity constraints, access control, and the need for performant access. We also explain why XQuery and XML Schema can serve as an excellent vehicle for data and metadata integration. The approach described in this paper is used in BEA's AquaLogic Data Services Platform product and serves as the substrate for its data service modeling concepts.
{"title":"Your Enterprise on XQuery and XML Schema: XML-based Data and Metadata Integration","authors":"P. Reveliotis, M. Carey","doi":"10.1109/ICDEW.2006.167","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.167","url":null,"abstract":"This paper describes a declarative and unifying approach, based on XQuery and XML Schema, to modeling and accessing the variety of data source types found in a typical enterprise. These include relational, Web service, function-based (a.k.a. servicebased), and file-based data sources. The approach that we detail here is based on introspection of data source meta-information and generation of metadata artifacts that conform to a common model and that provide a uniform framework in which the data sources become available to an XQuery-based query processor. We explain how our approach addresses various aspects of data sources, including data source connectivity, data typing, integrity constraints, access control, and the need for performant access. We also explain why XQuery and XML Schema can serve as an excellent vehicle for data and metadata integration. The approach described in this paper is used in BEA's AquaLogic Data Services Platform product and serves as the substrate for its data service modeling concepts.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126590253","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}
S. Bowers, Bertram Ludäscher, A. Ngu, T. Critchlow
Data-centric scientific workflows are often modeled as dataflow process networks. The simplicity of the dataflow framework facilitates workflow design, analysis, and optimization. However, modeling "control-flow intensive" tasks using dataflow constructs often leads to overly complicated workflows that are hard to comprehend, reuse, and maintain. We describe a generic framework, based on scientific workflow templates and frames, for embedding control-flow intensive subtasks within dataflow process networks. This approach can seamlessly handle complex control-flow without sacrificing the benefits of dataflow. We illustrate our approach with a real-world scientific workflow from the astrophysics domain, requiring remote execution and file transfer in a semi-reliable environment. For such workflows, we also describe a 3-layered architecture based on frames and templates where the top-layer consists of an overall dataflow process network, the second layer consists of a tranducer template for modeling the desired control-flow behavior, and the bottom layer consists of frames inside the template that are specialized by embedding the desired component implementation. Our approach can enable scientific workflows that are more robust (faulttolerance strategies can be defined by control-flow driven transducer templates) and at the same time more reusable, since the embedding of frames and templates yields more structured and modular workflow designs.
{"title":"Enabling ScientificWorkflow Reuse through Structured Composition of Dataflow and Control-Flow","authors":"S. Bowers, Bertram Ludäscher, A. Ngu, T. Critchlow","doi":"10.1109/ICDEW.2006.55","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.55","url":null,"abstract":"Data-centric scientific workflows are often modeled as dataflow process networks. The simplicity of the dataflow framework facilitates workflow design, analysis, and optimization. However, modeling \"control-flow intensive\" tasks using dataflow constructs often leads to overly complicated workflows that are hard to comprehend, reuse, and maintain. We describe a generic framework, based on scientific workflow templates and frames, for embedding control-flow intensive subtasks within dataflow process networks. This approach can seamlessly handle complex control-flow without sacrificing the benefits of dataflow. We illustrate our approach with a real-world scientific workflow from the astrophysics domain, requiring remote execution and file transfer in a semi-reliable environment. For such workflows, we also describe a 3-layered architecture based on frames and templates where the top-layer consists of an overall dataflow process network, the second layer consists of a tranducer template for modeling the desired control-flow behavior, and the bottom layer consists of frames inside the template that are specialized by embedding the desired component implementation. Our approach can enable scientific workflows that are more robust (faulttolerance strategies can be defined by control-flow driven transducer templates) and at the same time more reusable, since the embedding of frames and templates yields more structured and modular workflow designs.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130829331","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 paper proposes an algorithm to identify popular paths in a transportation system, while the privacy of drivers is preserved. A popular path is one of the most frequently used routes between any two points in a road map. In order to identify popular paths with privacy protection, the algorithm figures out what information is useless for identifying popular paths, and this information is not revealed to the data mining system so that privacy is preserved. In addition, the system does not record the identifications of the vehicles. Moreover, in the mining process, the database does not contain complete path information. The experimental results verify the correctness of the proposed algorithm and show that the proposed algorithm is scalable.
{"title":"Mining Popular Paths in a Transportation Database System with Privacy Protection","authors":"Chi Hong Cheong, M. Wong","doi":"10.1109/ICDEW.2006.91","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.91","url":null,"abstract":"This paper proposes an algorithm to identify popular paths in a transportation system, while the privacy of drivers is preserved. A popular path is one of the most frequently used routes between any two points in a road map. In order to identify popular paths with privacy protection, the algorithm figures out what information is useless for identifying popular paths, and this information is not revealed to the data mining system so that privacy is preserved. In addition, the system does not record the identifications of the vehicles. Moreover, in the mining process, the database does not contain complete path information. The experimental results verify the correctness of the proposed algorithm and show that the proposed algorithm is scalable.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133003843","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}
Scientific and engineering experiments often produce large volumes of data that must be processed and visualised in near-realtime. An example of this, described in this paper, is microphone array processing of data from wind tunnels for aeroacoustic measurements. The overall turnaround time from data acquisition and movement, to data processing and visualization is often inhibited by factors such as manual data movement, system interoperability issues, manual resource discovery for job scheduling, and disparate physical locality between the experiment and scientist or engineer post-event. Workflow frameworks and runtimes can enable rapid composition and execution of complex scientific workflows. In this paper we explore two approaches based on Windows Workflow Foundation, a component of Microsoft WinFX. In our first approach, we present a framework for users to compose sequential workflows and access Globus grid services seamlessly using a .NET-based Commodity Grid Toolkit (MyCoG.NET). We demonstrate how application specific activity sets can be developed and extended by users. In our second approach we highlight how it can be advantageous to keep databases as central to the complete workflow enactment. These two approaches are demonstrated in the context of a wind tunnel Grid system being developed to help experimental aerodynamicists orchestrate such workflows.
科学和工程实验经常产生大量的数据，这些数据必须在接近实时的情况下进行处理和可视化。本文描述的一个例子是对风洞数据的传声器阵列处理，用于气动声学测量。从数据采集和移动到数据处理和可视化的总体周转时间通常受到一些因素的限制，例如手动数据移动、系统互操作性问题、作业调度的手动资源发现，以及实验和科学家或工程师之间的不同物理位置。工作流框架和运行时可以支持复杂的科学工作流的快速组合和执行。在本文中，我们探讨了基于Windows Workflow Foundation (Microsoft WinFX的一个组件)的两种方法。在我们的第一种方法中，我们为用户提供了一个框架，使用户可以使用基于。net的商品网格工具包(MyCoG.NET)来组合连续的工作流和无缝地访问Globus网格服务。我们将演示用户如何开发和扩展特定于应用程序的活动集。在我们的第二种方法中，我们强调了将数据库作为整个工作流制定的中心是如何有利的。这两种方法在风洞网格系统的背景下进行了演示，该系统正在开发中，以帮助实验空气动力学家协调此类工作流程。
{"title":"Leveraging Windows Workflow Foundation for Scientific Workflows in Wind Tunnel Applications","authors":"A. Paventhan, Kenji Takeda, S. Cox, D. Nicole","doi":"10.1109/ICDEW.2006.71","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.71","url":null,"abstract":"Scientific and engineering experiments often produce large volumes of data that must be processed and visualised in near-realtime. An example of this, described in this paper, is microphone array processing of data from wind tunnels for aeroacoustic measurements. The overall turnaround time from data acquisition and movement, to data processing and visualization is often inhibited by factors such as manual data movement, system interoperability issues, manual resource discovery for job scheduling, and disparate physical locality between the experiment and scientist or engineer post-event. Workflow frameworks and runtimes can enable rapid composition and execution of complex scientific workflows. In this paper we explore two approaches based on Windows Workflow Foundation, a component of Microsoft WinFX. In our first approach, we present a framework for users to compose sequential workflows and access Globus grid services seamlessly using a .NET-based Commodity Grid Toolkit (MyCoG.NET). We demonstrate how application specific activity sets can be developed and extended by users. In our second approach we highlight how it can be advantageous to keep databases as central to the complete workflow enactment. These two approaches are demonstrated in the context of a wind tunnel Grid system being developed to help experimental aerodynamicists orchestrate such workflows.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124188956","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
扫码关注我们
求助内容：
应助结果提醒方式：