Random walk graph and Markov chain based models are used heavily in many data and system analysis domains, including web, bioinformatics, and queueing. These models enable the description and analysis of various behaviors of stochastic systems. If the system being modelled has certain properties, such as if it is irreducible and aperiodic, close form formulations corresponding to its stationary behavior can be used to analyze its behavior. However, if the system does not have these properties or if the user is not interested in the stationary behavior, then an iterative approach needs to be used to determine potential outcomes based on the initial probability distribution inputs to the model. In this paper, we focus on access-privacy enabled outsourced Markov chain based data analysis applications, where a non-trusted service provider takes (hidden) user queries that are described in terms of initial state distributions, and evaluates them iteratively in an oblivious manner. We show that this iterative process can leak information regarding the possible values of the hidden input if the server has a priori knowledge about the underlying Markovian process. Hence as opposed to simple obfuscation mechanisms, we develop an algorithm based on methodical addition of extra states, which guarantees unbounded feasible regions for the inputs, thus preventing a malicious host from having an informed guess regarding the inputs.
{"title":"Access-Private Outsourcing of Markov Chain and RandomWalk based Data Analysis Applications","authors":"Ping-Min Lin, K. Candan","doi":"10.1109/ICDEW.2006.25","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.25","url":null,"abstract":"Random walk graph and Markov chain based models are used heavily in many data and system analysis domains, including web, bioinformatics, and queueing. These models enable the description and analysis of various behaviors of stochastic systems. If the system being modelled has certain properties, such as if it is irreducible and aperiodic, close form formulations corresponding to its stationary behavior can be used to analyze its behavior. However, if the system does not have these properties or if the user is not interested in the stationary behavior, then an iterative approach needs to be used to determine potential outcomes based on the initial probability distribution inputs to the model. In this paper, we focus on access-privacy enabled outsourced Markov chain based data analysis applications, where a non-trusted service provider takes (hidden) user queries that are described in terms of initial state distributions, and evaluates them iteratively in an oblivious manner. We show that this iterative process can leak information regarding the possible values of the hidden input if the server has a priori knowledge about the underlying Markovian process. Hence as opposed to simple obfuscation mechanisms, we develop an algorithm based on methodical addition of extra states, which guarantees unbounded feasible regions for the inputs, thus preventing a malicious host from having an informed guess regarding the inputs.","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":"129855916","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}
C. Dyreson, R. Snodgrass, Faiz Currim, Sabah Currim, Shailesh Joshi
The W3C XML Schema recommendation defines the structure and data types for XML documents, but lacks explicit support for time-varying XML documents or for a time-varying schema. In previous work we introduced tauXSchema which is an infrastructure and suite of tools to support the creation and validation of time-varying documents, without requiring any changes to XML Schema. In this paper we extend tauXSchema to support versioning of the schema itself. We introduce the concept of a bundle, which is an XML document that references a base (nontemporal) schema, temporal annotations describing how the document can change, and physical annotations describing where timestamps are placed. When the schema is versioned, the base schema and temporal and physical schemas can themselves be time-varying documents, each with their own (possibly versioned) schemas. We describe how the validator can be extended to validate documents in this seeming precarious situation of data that changes over time, while its schema and even its representation are also changing.
W3C XML Schema建议定义了XML文档的结构和数据类型，但缺乏对时变XML文档或时变模式的显式支持。在之前的工作中，我们介绍了tauXSchema，它是一个基础设施和工具套件，用于支持时变文档的创建和验证，而不需要对XML Schema进行任何更改。在本文中，我们扩展了tauXSchema以支持模式本身的版本控制。我们引入了包的概念，它是一个XML文档，引用基本(非时态)模式、描述文档如何更改的时态注释和描述时间戳放置位置的物理注释。当模式被版本化时，基本模式、临时模式和物理模式本身可以是随时间变化的文档，每个都有自己的(可能是版本化的)模式。我们描述了如何扩展验证器，以便在这种随着时间而变化的数据看起来不稳定的情况下验证文档，而它的模式甚至它的表示也在变化。
{"title":"Validating Quicksand: Schema Versioning in tauXSchema","authors":"C. Dyreson, R. Snodgrass, Faiz Currim, Sabah Currim, Shailesh Joshi","doi":"10.1109/ICDEW.2006.161","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.161","url":null,"abstract":"The W3C XML Schema recommendation defines the structure and data types for XML documents, but lacks explicit support for time-varying XML documents or for a time-varying schema. In previous work we introduced tauXSchema which is an infrastructure and suite of tools to support the creation and validation of time-varying documents, without requiring any changes to XML Schema. In this paper we extend tauXSchema to support versioning of the schema itself. We introduce the concept of a bundle, which is an XML document that references a base (nontemporal) schema, temporal annotations describing how the document can change, and physical annotations describing where timestamps are placed. When the schema is versioned, the base schema and temporal and physical schemas can themselves be time-varying documents, each with their own (possibly versioned) schemas. We describe how the validator can be extended to validate documents in this seeming precarious situation of data that changes over time, while its schema and even its representation are also changing.","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":"129955361","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}
A system for continuous capture and retrieval of multimedia data from a home-like ubiquitous environment is presented. A large number of cameras and microphones are used for video and audio acquisition. Pressure based sensors mounted on the house floor are used to capture footsteps as context data. Both context and content are analyzed to create indices for efficient retrieval and summarization of the video and audio data. The system can be queried based on date and time, location, persons, sounds and basic activity in terms of footsteps. Key frame extraction adaptive to the activity of a person can be used to summarize the video. The system was evaluated by means of a real-life experiment where a family lived in the house and later used the system to retrieve experiences that they had during their stay. The results of this experiment are reported and discussed. The paper concludes with suggestions for possible future directions.
{"title":"Creation of an Electronic Chronicle for a Ubiquitous Home: Sensing, Analysis and Evaluation","authors":"G. C. D. Silva, T. Yamasaki, K. Aizawa","doi":"10.1109/ICDEW.2006.44","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.44","url":null,"abstract":"A system for continuous capture and retrieval of multimedia data from a home-like ubiquitous environment is presented. A large number of cameras and microphones are used for video and audio acquisition. Pressure based sensors mounted on the house floor are used to capture footsteps as context data. Both context and content are analyzed to create indices for efficient retrieval and summarization of the video and audio data. The system can be queried based on date and time, location, persons, sounds and basic activity in terms of footsteps. Key frame extraction adaptive to the activity of a person can be used to summarize the video. The system was evaluated by means of a real-life experiment where a family lived in the house and later used the system to retrieve experiences that they had during their stay. The results of this experiment are reported and discussed. The paper concludes with suggestions for possible future directions.","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":"130802152","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}
Many desktop query and management systems offer an object oriented view of a computer, where the emphasis is on describing the information relevant to an object. However, objects may be related to each other in different ways and in different contexts. In this paper, we argue that users create and modify data as a function of activities they are involved in. We develop methods to explore objects on a desktop through activities. Our methods integrate discovered relationships between data objects based on their participation in different activities as well as other properties. Our activity model is well suited to support a query language that is able to alter the context and the definition of an activity to easily visualize complex relationships in data. We show that this new organization makes many new interesting desktop functionalities a reality.
{"title":"On Querying and Exploring Activities on a User’s Desktop","authors":"Sibel Adali, S. Pearce, M. Sapino","doi":"10.1109/ICDEW.2006.103","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.103","url":null,"abstract":"Many desktop query and management systems offer an object oriented view of a computer, where the emphasis is on describing the information relevant to an object. However, objects may be related to each other in different ways and in different contexts. In this paper, we argue that users create and modify data as a function of activities they are involved in. We develop methods to explore objects on a desktop through activities. Our methods integrate discovered relationships between data objects based on their participation in different activities as well as other properties. Our activity model is well suited to support a query language that is able to alter the context and the definition of an activity to easily visualize complex relationships in data. We show that this new organization makes many new interesting desktop functionalities a reality.","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":"133856966","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}
B. Eckman, T. Gaasterland, Z. Lacroix, L. Raschid, Ben Snyder, Maria-Esther Vidal
We address the challenges of supporting scientific workflow design for a bioinformatics pipeline (BIP) to detect alternative splicing of an organism’s genes. Scientific workflows depend significantly on the selection of the resources (data sources and applications) selected for their implementation. In addition, each implementation of a workflow may offer different costs and benefits. We present the details of a hard-coded BIP and then discuss the process of implementing a BIP on a database management system (DBMS) enabled mediator platform. Such a solution supports biologists as they customize the pipeline, choosing relevant resources and implementations for operators and applications. We discuss cost and benefit metrics to compare these alternative BIP choices.
{"title":"Implementing a Bioinformatics Pipeline (BIP) on a Mediator Platform: Comparing Cost and Quality of Alternate Choices","authors":"B. Eckman, T. Gaasterland, Z. Lacroix, L. Raschid, Ben Snyder, Maria-Esther Vidal","doi":"10.1109/ICDEW.2006.66","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.66","url":null,"abstract":"We address the challenges of supporting scientific workflow design for a bioinformatics pipeline (BIP) to detect alternative splicing of an organism’s genes. Scientific workflows depend significantly on the selection of the resources (data sources and applications) selected for their implementation. In addition, each implementation of a workflow may offer different costs and benefits. We present the details of a hard-coded BIP and then discuss the process of implementing a BIP on a database management system (DBMS) enabled mediator platform. Such a solution supports biologists as they customize the pipeline, choosing relevant resources and implementations for operators and applications. We discuss cost and benefit metrics to compare these alternative BIP choices.","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":"131264517","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}
eChronicle applications are inherently event-centric, enabling users to find and explore important events in an application domain and providing unified access to any media that document them. Today’s multimedia data management components such as multimedia databases, however, are largely media-centric, considering events - if at all - just as one of many pieces of media metadata. Obfuscating event exploration and event-driven access to media, they are only of limited use for the implementation of eChronicle applications. Using a concrete eChronicle application in the defense domain, this paper motivates the need for event-centric multimedia data management components. As a foundation, the paper proposes the multimedia event model and discusses essential design considerations for the development of that model. {rm E}’s genericity and profound adaptability to varying application needs make the model a suitable foundation for reusable multimedia data management components that are useful not only for eChronicle applications, but for any multimedia application where event-driven access to content is of interest.
{"title":"{rm E} - A Generic Event Model for Event-Centric Multimedia Data Management in eChronicle Applications","authors":"U. Westermann, R. Jain","doi":"10.1109/ICDEW.2006.1","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.1","url":null,"abstract":"eChronicle applications are inherently event-centric, enabling users to find and explore important events in an application domain and providing unified access to any media that document them. Today’s multimedia data management components such as multimedia databases, however, are largely media-centric, considering events - if at all - just as one of many pieces of media metadata. Obfuscating event exploration and event-driven access to media, they are only of limited use for the implementation of eChronicle applications. Using a concrete eChronicle application in the defense domain, this paper motivates the need for event-centric multimedia data management components. As a foundation, the paper proposes the multimedia event model and discusses essential design considerations for the development of that model. {rm E}’s genericity and profound adaptability to varying application needs make the model a suitable foundation for reusable multimedia data management components that are useful not only for eChronicle applications, but for any multimedia application where event-driven access to content is of interest.","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":"129455631","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}
Business collaborations in Virtual Organisations (VOs) demand sound security infrastructures to achieve acceptance from industry. It becomes apparent that in dynamic environments requiring swift decisions as well as quickly adapted and connected applications, traditional hard security e.g. based on static access control is no longer able to cope with security alone to meet the collaboration objective. Soft security based on trust management, e.g. provided by a reputation system, is able to address those requirements dealing with previously unknown entities and hereby complement, but not replace, established static hard security. This paper introduces a novel approach and proposed architecture for a trust management system providing reputation, rooting trust in a collaborating entity’s inherently characterizing trust parameters. Those parameters are stochastically modelled aiming at capturing the real parameter’s behaviour and aggregated with stochastic system theory. This approach is believed to retain the quality of a model with implicit semantic behaviour of trust parameters from the root of trust, the observed parameters, to the aggregated reputation provided as decision support to applications.
{"title":"A Stochastic Approach for Trust Management","authors":"J. Haller","doi":"10.1109/ICDEW.2006.20","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.20","url":null,"abstract":"Business collaborations in Virtual Organisations (VOs) demand sound security infrastructures to achieve acceptance from industry. It becomes apparent that in dynamic environments requiring swift decisions as well as quickly adapted and connected applications, traditional hard security e.g. based on static access control is no longer able to cope with security alone to meet the collaboration objective. Soft security based on trust management, e.g. provided by a reputation system, is able to address those requirements dealing with previously unknown entities and hereby complement, but not replace, established static hard security. This paper introduces a novel approach and proposed architecture for a trust management system providing reputation, rooting trust in a collaborating entity’s inherently characterizing trust parameters. Those parameters are stochastically modelled aiming at capturing the real parameter’s behaviour and aggregated with stochastic system theory. This approach is believed to retain the quality of a model with implicit semantic behaviour of trust parameters from the root of trust, the observed parameters, to the aggregated reputation provided as decision support to applications.","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":"114289489","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}
Nowadays, more and more research has focused on the trust management of the Semantic Web. Some mature technologies from many fields such as multiagent systems, social network analysis and artificial intelligence have been introduced to this field. However, some unique characteristics of the Semantic Web are more or less ignored. In this paper, we try to explore the semantic aspects of the trust management. We present DartTrust, a trust prototype for the semantic web in the application context of Traditional Chinese Medicine (TCM). We introduce RCSW - a Reputation-Chain trust model for the Semantic Web, which incorporates pairwise trust factor and reliable factor and constructs an edge-weighted graph to calculate trust ratings. We define a small trust ontology to illustrate the trust relationships. The trust ontology is described in OWL that can be understood and processed by machines. Therefore, DartTrust can provide reasoning functions and facilitate trust management with little human effort. As a demonstration of the prototype, we present its implementation on Traditional Chinese Medicine (TCM) at the end of this paper.
{"title":"Develop a Computational Trust Prototype for the Semantic Web","authors":"Yu Zhang, Huajun Chen, Zhaohui Wu, Xiaoqing Zheng","doi":"10.1109/ICDEW.2006.48","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.48","url":null,"abstract":"Nowadays, more and more research has focused on the trust management of the Semantic Web. Some mature technologies from many fields such as multiagent systems, social network analysis and artificial intelligence have been introduced to this field. However, some unique characteristics of the Semantic Web are more or less ignored. In this paper, we try to explore the semantic aspects of the trust management. We present DartTrust, a trust prototype for the semantic web in the application context of Traditional Chinese Medicine (TCM). We introduce RCSW - a Reputation-Chain trust model for the Semantic Web, which incorporates pairwise trust factor and reliable factor and constructs an edge-weighted graph to calculate trust ratings. We define a small trust ontology to illustrate the trust relationships. The trust ontology is described in OWL that can be understood and processed by machines. Therefore, DartTrust can provide reasoning functions and facilitate trust management with little human effort. As a demonstration of the prototype, we present its implementation on Traditional Chinese Medicine (TCM) at the end of this paper.","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":"114976273","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}
Organizing digital images into semantic categories is imperative for effective browsing and retrieval. In large image collections, efficient algorithms are crucial to quickly categorize new images. In this paper, we study a nearest neighbor based algorithm in image classification from a different perspective. The proposed algorithm vertically decomposes image features into separate bit vectors, one for each bit position of the values in the features, and approximates a number of candidates of nearest neighbors by examining the absolute difference of total variation between the images in the repositories and the unclassified image. Once the candidate set is obtained, the k-nearest neighbors are then searched from the set. We use a combination of global color histogram in HSV (6x3x3) color space and Gabor texture for the image features. Our experiments on Corel dataset show that our algorithm is fast and scalable for image classification even when image repositories are very large. In addition, the classification accuracy is comparable to the accuracy of the classical KNN algorithm.
{"title":"Efficient Image Classification on Vertically Decomposed Data","authors":"T. Abidin, Aijuan Dong, Honglin Li, W. Perrizo","doi":"10.1109/ICDEW.2006.52","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.52","url":null,"abstract":"Organizing digital images into semantic categories is imperative for effective browsing and retrieval. In large image collections, efficient algorithms are crucial to quickly categorize new images. In this paper, we study a nearest neighbor based algorithm in image classification from a different perspective. The proposed algorithm vertically decomposes image features into separate bit vectors, one for each bit position of the values in the features, and approximates a number of candidates of nearest neighbors by examining the absolute difference of total variation between the images in the repositories and the unclassified image. Once the candidate set is obtained, the k-nearest neighbors are then searched from the set. We use a combination of global color histogram in HSV (6x3x3) color space and Gabor texture for the image features. Our experiments on Corel dataset show that our algorithm is fast and scalable for image classification even when image repositories are very large. In addition, the classification accuracy is comparable to the accuracy of the classical KNN algorithm.","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":"133894200","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}
Web Services technology is being used for increasingly different environments than it was designed for. To facilitate discovery of Web Services in dynamic environments, both service description and distribution of descriptions must be improved. Several research efforts target semantic description of services. However, Semantic Web Service discovery in peer-to-peer-like, dynamic environments where services and registries are transient cannot be based on current mechanisms for distribution of Web Service descriptions. Based on a set of generic requirements, we introduce a conceptual architecture that aims to solve many of the problems related to Semantic Web Service discovery in dynamic environments. The architecture is based on a distributed multi-registry topology and aliveness information. We present several research problems we have identified during our initial work on this architecture.
{"title":"A Conceptual Service Discovery Architecture for Semantic Web Services in Dynamic Environments","authors":"Tommy Gagnes, T. Plagemann, E. Munthe-Kaas","doi":"10.1109/ICDEW.2006.6","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.6","url":null,"abstract":"Web Services technology is being used for increasingly different environments than it was designed for. To facilitate discovery of Web Services in dynamic environments, both service description and distribution of descriptions must be improved. Several research efforts target semantic description of services. However, Semantic Web Service discovery in peer-to-peer-like, dynamic environments where services and registries are transient cannot be based on current mechanisms for distribution of Web Service descriptions. Based on a set of generic requirements, we introduce a conceptual architecture that aims to solve many of the problems related to Semantic Web Service discovery in dynamic environments. The architecture is based on a distributed multi-registry topology and aliveness information. We present several research problems we have identified during our initial work on this architecture.","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":"116602187","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
扫码关注我们
求助内容：
应助结果提醒方式：