Service Semantic Link Network (S-SLN) is the semantic model for effectively managing Web service resources by dependency relationship among services. In this paper, we provided an effective method for automatic discovering S-SLN based on graphical structure representation of the dependencies embedded in probability model. Markov network is an undirected graph whose links represent probability dependencies. We first learned Markov network structure from Web services data, and then transformed the undirected Markov network structure into directed graph structure of S-SLN based on the joint probability distribution. Finally, experimental results show the effectiveness of the method.
{"title":"Service Semantic Link Network Discovery Based on Markov Structure","authors":"Anping Zhao, Zhixing Huang, Yuhui Qiu","doi":"10.1109/SKG.2010.8","DOIUrl":"https://doi.org/10.1109/SKG.2010.8","url":null,"abstract":"Service Semantic Link Network (S-SLN) is the semantic model for effectively managing Web service resources by dependency relationship among services. In this paper, we provided an effective method for automatic discovering S-SLN based on graphical structure representation of the dependencies embedded in probability model. Markov network is an undirected graph whose links represent probability dependencies. We first learned Markov network structure from Web services data, and then transformed the undirected Markov network structure into directed graph structure of S-SLN based on the joint probability distribution. Finally, experimental results show the effectiveness of the method.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"49 18","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113957739","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}
Chaogang Tang, Qing Li, Yan Xiong, An Liu, Shiting Wen
How to repair a failed composite service with end-to-end constraints is a big concern for users. Just by replacing a failed atomic service may not solve the problem, due to constraints violation or unavailability of remote services (server crash down, network disconnect, and so on). In this paper we propose an approach for service replacement based on constraints partition in web service composition. We propose to replace a failed service and (several) related services as a whole in the composition by other alternative services. The approach is divided into three steps, namely, decomposing the global constraints, filtering the candidates and replacing the failed service. We evaluate our approach by comparing it with other approaches. The results of experiments show that our approach outperforms the others, especially when the number of candidate services is large.
{"title":"Constraints Partition Based Service Process Replacement with End-to-End QoS Constraints","authors":"Chaogang Tang, Qing Li, Yan Xiong, An Liu, Shiting Wen","doi":"10.1109/SKG.2010.83","DOIUrl":"https://doi.org/10.1109/SKG.2010.83","url":null,"abstract":"How to repair a failed composite service with end-to-end constraints is a big concern for users. Just by replacing a failed atomic service may not solve the problem, due to constraints violation or unavailability of remote services (server crash down, network disconnect, and so on). In this paper we propose an approach for service replacement based on constraints partition in web service composition. We propose to replace a failed service and (several) related services as a whole in the composition by other alternative services. The approach is divided into three steps, namely, decomposing the global constraints, filtering the candidates and replacing the failed service. We evaluate our approach by comparing it with other approaches. The results of experiments show that our approach outperforms the others, especially when the number of candidate services is large.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128563322","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}
According to multimedia data transmission in multipath networks, a novel Multipath Video-on-demand Transmission (MVT) algorithm is proposed. With MVT model, video server marks control link and data link for data transmission. Furthermore, MVT forwards packets concurrently through multiple available paths. Compared with traditional schemes, MVT provides a more reasonable and a more flexible forwarding method. Simulations also prove that MVT obtains balanced link utilization and achieves lower jitter than traditional VOD forwarding technology.
{"title":"A Novel Multipath Video-on-demand Transmission Algorithm","authors":"L. Han, Jinkuan Wang","doi":"10.1109/SKG.2010.56","DOIUrl":"https://doi.org/10.1109/SKG.2010.56","url":null,"abstract":"According to multimedia data transmission in multipath networks, a novel Multipath Video-on-demand Transmission (MVT) algorithm is proposed. With MVT model, video server marks control link and data link for data transmission. Furthermore, MVT forwards packets concurrently through multiple available paths. Compared with traditional schemes, MVT provides a more reasonable and a more flexible forwarding method. Simulations also prove that MVT obtains balanced link utilization and achieves lower jitter than traditional VOD forwarding technology.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121930613","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}
Relevance vector machines have been successfully used in many domains, while their application in software reliability prediction is still quite rare. In this work, we propose to apply support vector regression (SVR) to build software reliability prediction model (RVMSRPM). We also compare the prediction accuracy of software reliability prediction models based on RVM, SVM, ANN and three traditional NHPP models. Experimental results show that our proposed RVM-based software reliability prediction model could achieve a higher prediction accuracy compared with these models.
{"title":"Software Reliability Prediction Model Based on Relevance Vector Machine","authors":"Qiuhong Zheng","doi":"10.1109/SKG.2010.49","DOIUrl":"https://doi.org/10.1109/SKG.2010.49","url":null,"abstract":"Relevance vector machines have been successfully used in many domains, while their application in software reliability prediction is still quite rare. In this work, we propose to apply support vector regression (SVR) to build software reliability prediction model (RVMSRPM). We also compare the prediction accuracy of software reliability prediction models based on RVM, SVM, ANN and three traditional NHPP models. Experimental results show that our proposed RVM-based software reliability prediction model could achieve a higher prediction accuracy compared with these models.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123079957","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}
There is a very important class of applications which is named Many-Task Computing (MTC). For a lot of MTC applications, a large number of independent tasks which differ significantly on task complexities will be generated. This brings a great challenge for grids to achieve a high performance for such MTC applications. In this paper, we describe the TCE algorithm, a scheduling algorithm based on Task Complexity Estimating which reduces the overhead by applying task bundling. We also present a task complexity model for task complexity estimating in order that after task bundling loads among computing nodes can be well balanced. The TCE algorithm greatly exceeded the other scheduling algorithms involved in performance evaluation on speedup and efficiency, and it achieved a performance close to that in the ideal condition. It is demonstrated that by applying the TCE algorithm the overhead cost can be reduced significantly and that load balance can be well guaranteed, so that grids can achieve a high performance for MTC applications.
{"title":"A Scheduling Algorithm Based on Task Complexity Estimating for Many-Task Computing","authors":"Yingnan Li, Xianguo Wu, Jian Xiao, Yu Zhang, Huashan Yu","doi":"10.1109/SKG.2010.21","DOIUrl":"https://doi.org/10.1109/SKG.2010.21","url":null,"abstract":"There is a very important class of applications which is named Many-Task Computing (MTC). For a lot of MTC applications, a large number of independent tasks which differ significantly on task complexities will be generated. This brings a great challenge for grids to achieve a high performance for such MTC applications. In this paper, we describe the TCE algorithm, a scheduling algorithm based on Task Complexity Estimating which reduces the overhead by applying task bundling. We also present a task complexity model for task complexity estimating in order that after task bundling loads among computing nodes can be well balanced. The TCE algorithm greatly exceeded the other scheduling algorithms involved in performance evaluation on speedup and efficiency, and it achieved a performance close to that in the ideal condition. It is demonstrated that by applying the TCE algorithm the overhead cost can be reduced significantly and that load balance can be well guaranteed, so that grids can achieve a high performance for MTC applications.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114364479","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}
Resources in grid are distributed, heterogeneous, autonomous and unpredictable. Resource Management (RM) is required to integrate and manage them to provide efficient and reliable services for users. To have an overview of the stat-of-the-art of Grid Resource Management, this paper does a taxonomy and survey of related researches. The context (refers to initial design objectives of Grid in this paper) and resource allocation models are exploited as the criteria of taxonomy. And we mainly focus on the researches on grid resource management in recent several years.
{"title":"A Taxonomy and Survey of Resource Management in Grid","authors":"Bo Wang, Gang Chen, Hao Luo, Weimin Zheng","doi":"10.1109/SKG.2010.47","DOIUrl":"https://doi.org/10.1109/SKG.2010.47","url":null,"abstract":"Resources in grid are distributed, heterogeneous, autonomous and unpredictable. Resource Management (RM) is required to integrate and manage them to provide efficient and reliable services for users. To have an overview of the stat-of-the-art of Grid Resource Management, this paper does a taxonomy and survey of related researches. The context (refers to initial design objectives of Grid in this paper) and resource allocation models are exploited as the criteria of taxonomy. And we mainly focus on the researches on grid resource management in recent several years.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134062714","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}
Image segmentation is critical to image processing and pattern recognition, An image segmentation system is proposed for the segmentation of color image based on neural networks. First, we introduce BP Neural network, it has the capacity of parallel computing, distributed saving, self-studying, fault-to-learnt and nonlinear function approximating. So it widely used in image segmentation, but it also has some unavoidable defects. Based on this, a new method of image segmentation based on both Wavelet Decomposition and self-organizing map neural network (short for SOM-NN) is proposed. It has a greater ability on resisting noise, improving the convergence and so on. Color prototypes provide a good estimate for object colors. The image pixels are classified by the matching of color prototypes. The experimental results show that the system has the desired ability for the segmentation of color image in a variety of vision tasks.
{"title":"The Research of Image Segmentation Based on Improved Neural Network Algorithm","authors":"Lijun Zhang, Xiuchun Deng","doi":"10.1109/SKG.2010.68","DOIUrl":"https://doi.org/10.1109/SKG.2010.68","url":null,"abstract":"Image segmentation is critical to image processing and pattern recognition, An image segmentation system is proposed for the segmentation of color image based on neural networks. First, we introduce BP Neural network, it has the capacity of parallel computing, distributed saving, self-studying, fault-to-learnt and nonlinear function approximating. So it widely used in image segmentation, but it also has some unavoidable defects. Based on this, a new method of image segmentation based on both Wavelet Decomposition and self-organizing map neural network (short for SOM-NN) is proposed. It has a greater ability on resisting noise, improving the convergence and so on. Color prototypes provide a good estimate for object colors. The image pixels are classified by the matching of color prototypes. The experimental results show that the system has the desired ability for the segmentation of color image in a variety of vision tasks.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":" 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132125327","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 social network of the Internet is interpreted as the consequences of invisible connection between humans. In the graph based studies the nodes are human beings and the edges represent various social relationships. SLN is a loosely coupled, self-organized semantic data model that link resources semantically. The interactions among users can be interpreted via SLN formation and evolution The interactive as well as intertwined behaviours are the foundation of network itself, at the same time, they shape the way how and where the network will evolve, enrich the semantics of the network and expand the network scale. This paper proposes a network growth model of SLN based on the semantics similarity and popularity of nodes. In our model, the nodes are Twitter blogs and are with semantics, the links are subscribing hyperlinks between blogs. The probability of link establishment between two nodes then calculated from the parameters given above. The data and experiments are based on Twitter blogs, which are the continuous results of interactions by users globally. We crawled the publicly accessible user interaction on blogs, obtaining a portion of the network’s links between blogs and the hierarchy of each blog may exist in the whole scenarios. Results show that the statistic properties of SLN are in close analogy with that of social network. The studied network contains a number of high-degree nodes, these nodes are the cores which small groups strongly clustered, and low-degree nodes at the fringes of the network. However, some nodes with too much semantics (especially under one category) are in decreased chances of having links from newly added nodes. The reason may lies in that the over-abundant semantics remains confusion for knowledge acquiring.
{"title":"User Interaction Based Network Growth Model of Semantic Link Network","authors":"Wei Ren, Zhixing Huang, Yuhui Qiu","doi":"10.1109/SKG.2010.14","DOIUrl":"https://doi.org/10.1109/SKG.2010.14","url":null,"abstract":"The social network of the Internet is interpreted as the consequences of invisible connection between humans. In the graph based studies the nodes are human beings and the edges represent various social relationships. SLN is a loosely coupled, self-organized semantic data model that link resources semantically. The interactions among users can be interpreted via SLN formation and evolution The interactive as well as intertwined behaviours are the foundation of network itself, at the same time, they shape the way how and where the network will evolve, enrich the semantics of the network and expand the network scale. This paper proposes a network growth model of SLN based on the semantics similarity and popularity of nodes. In our model, the nodes are Twitter blogs and are with semantics, the links are subscribing hyperlinks between blogs. The probability of link establishment between two nodes then calculated from the parameters given above. The data and experiments are based on Twitter blogs, which are the continuous results of interactions by users globally. We crawled the publicly accessible user interaction on blogs, obtaining a portion of the network’s links between blogs and the hierarchy of each blog may exist in the whole scenarios. Results show that the statistic properties of SLN are in close analogy with that of social network. The studied network contains a number of high-degree nodes, these nodes are the cores which small groups strongly clustered, and low-degree nodes at the fringes of the network. However, some nodes with too much semantics (especially under one category) are in decreased chances of having links from newly added nodes. The reason may lies in that the over-abundant semantics remains confusion for knowledge acquiring.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129037948","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}
Although many projects, especially grid workflow projects, are trying to make grid application development easier and quicker, the process-based application description model adopted by most of the grid-enabled applications still bothers scientists who are the main users of grid and usually beginner in programming. In this paper, a data dependency based application description model, which describes an application by dependency among data items in the application is discussed, a grid application description language is proposed for scientific computing, and an engine for supporting its execution is designed and implemented. Tests show that grid-enabled scientific applications can be developed in the data dependency based application model more easily and quickly.
{"title":"Data Dependency Based Application Description Model in Grid and Its Usage in Scientific Computing","authors":"Zhenchun Huang, Shifeng Shang","doi":"10.1109/SKG.2010.76","DOIUrl":"https://doi.org/10.1109/SKG.2010.76","url":null,"abstract":"Although many projects, especially grid workflow projects, are trying to make grid application development easier and quicker, the process-based application description model adopted by most of the grid-enabled applications still bothers scientists who are the main users of grid and usually beginner in programming. In this paper, a data dependency based application description model, which describes an application by dependency among data items in the application is discussed, a grid application description language is proposed for scientific computing, and an engine for supporting its execution is designed and implemented. Tests show that grid-enabled scientific applications can be developed in the data dependency based application model more easily and quickly.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114250069","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}
With the permeation of information technology into the physical world and human society, we are on the way to a Cyber Physical Society (CPSocio). A CPSocio inter-connects the nature, the cyber space, and the society, so as to provide human beings with a better living and working environment. Researches on CPSocio will lead to a new revolution of information science and technology. In realizing CPSocio, semantics is the most fundamental problem. It is the foundation of all the intelligent activities such as communication, interaction, and cooperation in CPSocio. We are facing various scientific challenges to understand and clarify principles and models of the computing in CPSocio. In this paper we focus on the interactive computing model of Cyber Physical Society, discussing a possible architecture and computing model that enable future intelligent distributed services in CPSocio. The proposed model focuses on the interactive computation emerged from self-interpretation, self-organization and interactions of individual objects. Selfinterpretation enables objects to actively express their own semantic information to others. Interaction among objects will help achieving computing solutions in open, dynamic, limited and heterogeneous environments with partial available information and services. The model aims at providing a feasible framework for systematically tackling key problems and building intelligent services in CPSocio.
{"title":"The Interactive Computing Model for Cyber Physical Society","authors":"Xiaoping Sun, H. Zhuge, Xiaorui Jiang","doi":"10.1109/SKG.2010.9","DOIUrl":"https://doi.org/10.1109/SKG.2010.9","url":null,"abstract":"With the permeation of information technology into the physical world and human society, we are on the way to a Cyber Physical Society (CPSocio). A CPSocio inter-connects the nature, the cyber space, and the society, so as to provide human beings with a better living and working environment. Researches on CPSocio will lead to a new revolution of information science and technology. In realizing CPSocio, semantics is the most fundamental problem. It is the foundation of all the intelligent activities such as communication, interaction, and cooperation in CPSocio. We are facing various scientific challenges to understand and clarify principles and models of the computing in CPSocio. In this paper we focus on the interactive computing model of Cyber Physical Society, discussing a possible architecture and computing model that enable future intelligent distributed services in CPSocio. The proposed model focuses on the interactive computation emerged from self-interpretation, self-organization and interactions of individual objects. Selfinterpretation enables objects to actively express their own semantic information to others. Interaction among objects will help achieving computing solutions in open, dynamic, limited and heterogeneous environments with partial available information and services. The model aims at providing a feasible framework for systematically tackling key problems and building intelligent services in CPSocio.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"692 13","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120881791","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
扫码关注我们
求助内容：
应助结果提醒方式：