Data space is a semi-structural data model for the management of large-scale heterogeneous data objects. In a data space, each data object consists of a set of attribute-value pairs to describe the internal properties of the object and their relationships to other objects. The data space model provides a flexible query language that supports attribute queries and semantic link queries. In this paper we introduce a Resource Space Model that extends the concepts of data space to make it more flexible by incorporating classification semantics. We model a data space as a set of Resource Spaces (RS) with each RS representing a kind of resources that share common attributes and can be put into the same category, either according to a user’s knowledge of the world or his query preferences. Our model is suitable for designing a user-tailored semantic view of a data space while at the same time without losing the schema-later data-centric nature. A practical query language is introduced to implement flexible query operations on the resource spaces of the data space. Examples show how the proposed model and language support both the schema query and the data query.
{"title":"A Resource Space Model for Dataspace","authors":"Xiaorui Jiang, Xiaoping Sun, H. Zhuge","doi":"10.1109/SKG.2010.10","DOIUrl":"https://doi.org/10.1109/SKG.2010.10","url":null,"abstract":"Data space is a semi-structural data model for the management of large-scale heterogeneous data objects. In a data space, each data object consists of a set of attribute-value pairs to describe the internal properties of the object and their relationships to other objects. The data space model provides a flexible query language that supports attribute queries and semantic link queries. In this paper we introduce a Resource Space Model that extends the concepts of data space to make it more flexible by incorporating classification semantics. We model a data space as a set of Resource Spaces (RS) with each RS representing a kind of resources that share common attributes and can be put into the same category, either according to a user’s knowledge of the world or his query preferences. Our model is suitable for designing a user-tailored semantic view of a data space while at the same time without losing the schema-later data-centric nature. A practical query language is introduced to implement flexible query operations on the resource spaces of the data space. Examples show how the proposed model and language support both the schema query and the data query.","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":"129295181","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 rapid development of virtualization technology as well as the good performance of computer hardware, virtual machine is beginning to gradually increase the performance of display to meet the needs of desktop users. However, there is a difference between the display mechanism in the virtual environment and the traditional environment. At present, more is focused on how to effectively and pertinently measure and assess the performance of display in virtualization environment. Taking consideration of the characteristics of display in the virtual environment, the virtual machine display performance evaluation system has following advantages: it can select a representative workload running on the VM in Domain U, make use of Tracing and Instrumentation to insert the record in the kernel of VM, log the relevant information, and then finally draw the performance-related parameters by the analysis of the recorder. This paper mainly depicts the underlying implementation details of the virtual display system in Xen and analyzes the display principle of Xen-based virtual machine. It also proposes a display latency performance model in Xen environment, which is named Vdismodel by verifying the reasonableness of the Vdismodel through a series of experiments and comparing the theoretical data and the measured data which are accessed by the virtual machine system performance evaluation.
随着虚拟化技术的飞速发展以及计算机硬件性能的良好，虚拟机开始逐步提高显示性能，以满足桌面用户的需求。但是，虚拟环境中的显示机制与传统环境中的显示机制是有区别的。如何有效、有针对性地测量和评估虚拟化环境下的显示性能，是目前研究的重点。考虑到虚拟环境中显示的特点，虚拟机显示性能评价系统具有以下优点:它可以选择一个具有代表性的工作负载运行在U域的VM上，利用Tracing and Instrumentation将记录插入到VM的内核中，记录相关信息，最后通过对记录器的分析得出与性能相关的参数。本文主要描述了Xen虚拟显示系统的底层实现细节，分析了基于Xen的虚拟机的显示原理。通过一系列实验验证了Vdismodel的合理性，并将理论数据与虚拟机系统性能评估所访问的实测数据进行了比较，提出了Xen环境下的显示延迟性能模型，命名为Vdismodel。
{"title":"Vdismodel: A Display Latency Performance Model in Virtualization Environment","authors":"Bin Zhou, Hai Jin, Pingpeng Yuan","doi":"10.1109/SKG.2010.17","DOIUrl":"https://doi.org/10.1109/SKG.2010.17","url":null,"abstract":"With the rapid development of virtualization technology as well as the good performance of computer hardware, virtual machine is beginning to gradually increase the performance of display to meet the needs of desktop users. However, there is a difference between the display mechanism in the virtual environment and the traditional environment. At present, more is focused on how to effectively and pertinently measure and assess the performance of display in virtualization environment. Taking consideration of the characteristics of display in the virtual environment, the virtual machine display performance evaluation system has following advantages: it can select a representative workload running on the VM in Domain U, make use of Tracing and Instrumentation to insert the record in the kernel of VM, log the relevant information, and then finally draw the performance-related parameters by the analysis of the recorder. This paper mainly depicts the underlying implementation details of the virtual display system in Xen and analyzes the display principle of Xen-based virtual machine. It also proposes a display latency performance model in Xen environment, which is named Vdismodel by verifying the reasonableness of the Vdismodel through a series of experiments and comparing the theoretical data and the measured data which are accessed by the virtual machine system performance evaluation.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"26 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":"124476397","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}
J. L. D. L. R. Esteva, Albert Trias i Mansilla, Raivo Ruusalepp, K. Aas, Alex Moreno, Eloy Roura, Albert Bres, Teresa Bosch
This paper describes the application of agents to automate information exchange for digital preservation. Agents are able to recommend preservation solutions and also apply them to different preservation situations. Trust models for question-routing and answer ranking that are implemented by means of agents, show greater performance than traditional keyword search methodologies.
{"title":"Agents for Social Search in Long-Term Digital Preservation","authors":"J. L. D. L. R. Esteva, Albert Trias i Mansilla, Raivo Ruusalepp, K. Aas, Alex Moreno, Eloy Roura, Albert Bres, Teresa Bosch","doi":"10.1109/SKG.2010.60","DOIUrl":"https://doi.org/10.1109/SKG.2010.60","url":null,"abstract":"This paper describes the application of agents to automate information exchange for digital preservation. Agents are able to recommend preservation solutions and also apply them to different preservation situations. Trust models for question-routing and answer ranking that are implemented by means of agents, show greater performance than traditional keyword search methodologies.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"38 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":"121162843","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}
We present an information infrastructure in which Agile Virtual Enterprise (AVE) Supported by Fourth Party Logistics (4PL), named 4PL-AVE. At first, the difference between AVE and 4PL is introduced, and then 4PL-AVE model architecture is given that consists of three-dimensional cube of life-cycle dimension, the view model dimension and universal level dimension which complete describe the 4PL-AVE gradually for analysis, design and deployment. Secondly, the project of 4PL-AVE Information Integration is proposed using process integration, workflow composition and data integration. Thirdly, we discuss the technology line to build 4PL-AVE information framework based J2EE open source architecture. Fourthly, an application instance is introduced and the time of 4PL-AVE business process is greatly reduced. In the end, we point that solving 4PL-AVE performance problem use data warehouse and data mining technology, and RFID and cloud computing technology will be widely used in 4PL-AVE.
{"title":"Research of Mobile Security Solution for Fourth Party Logistics","authors":"Z. Leina, Pan Tiejun, Yan Guoqing","doi":"10.1109/SKG.2010.65","DOIUrl":"https://doi.org/10.1109/SKG.2010.65","url":null,"abstract":"We present an information infrastructure in which Agile Virtual Enterprise (AVE) Supported by Fourth Party Logistics (4PL), named 4PL-AVE. At first, the difference between AVE and 4PL is introduced, and then 4PL-AVE model architecture is given that consists of three-dimensional cube of life-cycle dimension, the view model dimension and universal level dimension which complete describe the 4PL-AVE gradually for analysis, design and deployment. Secondly, the project of 4PL-AVE Information Integration is proposed using process integration, workflow composition and data integration. Thirdly, we discuss the technology line to build 4PL-AVE information framework based J2EE open source architecture. Fourthly, an application instance is introduced and the time of 4PL-AVE business process is greatly reduced. In the end, we point that solving 4PL-AVE performance problem use data warehouse and data mining technology, and RFID and cloud computing technology will be widely used in 4PL-AVE.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"220 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":"122462523","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}
Massive hyperlinks exist in the current web, however, advanced applications need relationships between web resources. So it is necessary to evolve hyperlinks to semantic links. Besides, there are some implicit links between resources in the current web. In this paper, we propose an approach to evolving the current web to the semantic linked web, in which relationships between resources are represented explicitly. Applications based on the semantic linked web are discussed and compared with applications on the current web. The semantic linked web can be regarded as a promising stage in the way to realize the semantic web vision.
{"title":"Are Links on the Web Enough?","authors":"Junsheng Zhang, Huilin Wang, Yunchuan Sun","doi":"10.1109/SKG.2010.13","DOIUrl":"https://doi.org/10.1109/SKG.2010.13","url":null,"abstract":"Massive hyperlinks exist in the current web, however, advanced applications need relationships between web resources. So it is necessary to evolve hyperlinks to semantic links. Besides, there are some implicit links between resources in the current web. In this paper, we propose an approach to evolving the current web to the semantic linked web, in which relationships between resources are represented explicitly. Applications based on the semantic linked web are discussed and compared with applications on the current web. The semantic linked web can be regarded as a promising stage in the way to realize the semantic web vision.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"135 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":"116021616","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}
Flash crowd has generally been agreed to be one of the main threats to the availability of web services, and application replication is a promising approach to address such problem. In this paper, we first model the workload of flash crowds according to the characteristics of their request distribution. Then a new mechanism to trigger replication service based on the gradient of cumulative request pattern is proposed. This mechanism, called hybrid adaptive selection algorithm (HASA), targets to minimize the number of discarded requests (NDR) and the spare capacity (NSC) together. Detail simulation of this mechanism with respect to interval size and thresholds of NDR and NSC shows that significant performance improvement can be obtained over the previously proposed single-targeted adaptive selection algorithms.
{"title":"Selection Policy of Rescue Servers Based on Workload Characterization of Flash Crowd","authors":"Chi-Hung Chi, Shijie Xu, Feng-Lin Li, Kwok-Yan Lam","doi":"10.1109/SKG.2010.43","DOIUrl":"https://doi.org/10.1109/SKG.2010.43","url":null,"abstract":"Flash crowd has generally been agreed to be one of the main threats to the availability of web services, and application replication is a promising approach to address such problem. In this paper, we first model the workload of flash crowds according to the characteristics of their request distribution. Then a new mechanism to trigger replication service based on the gradient of cumulative request pattern is proposed. This mechanism, called hybrid adaptive selection algorithm (HASA), targets to minimize the number of discarded requests (NDR) and the spare capacity (NSC) together. Detail simulation of this mechanism with respect to interval size and thresholds of NDR and NSC shows that significant performance improvement can be obtained over the previously proposed single-targeted adaptive selection algorithms.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"25 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":"131552969","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}
Cognition disorientation problem is one of the major problems caused by the self-learning principle in the current web based intelligent learning systems. Providing learners with the personalized learning path can effectively smooth over the problem. In this paper, we provide learners with learning paths which is based on the 3 dimensioned SLN (3d_SLN) map according to their different learning styles. 3d_SLN map is a modified version of SLN whose inferring ability is as strong as ontology for learning path recommendation while more flexible in knowledge relation constructing.
{"title":"Provide Distant Learners with the Personalized Learning Paths Based on 3d_SLN Map","authors":"Juan Yang, Zhixing Huang, Hongtao Liu","doi":"10.1109/SKG.2010.15","DOIUrl":"https://doi.org/10.1109/SKG.2010.15","url":null,"abstract":"Cognition disorientation problem is one of the major problems caused by the self-learning principle in the current web based intelligent learning systems. Providing learners with the personalized learning path can effectively smooth over the problem. In this paper, we provide learners with learning paths which is based on the 3 dimensioned SLN (3d_SLN) map according to their different learning styles. 3d_SLN map is a modified version of SLN whose inferring ability is as strong as ontology for learning path recommendation while more flexible in knowledge relation constructing.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"28 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":"128146890","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}
Different from most existing studies on Web session identification for commerce purposes, a novel dynamic real time HTTP-session processes description method is presented in this paper for detecting the anomaly HTTP traffic for network boundary. The proposed scheme doesn't rely on presupposed threshold and client/server-side data which are widely used in traditional session detection approaches. A new parameter is defined based on inter-arrival time of HTTP requests. A nonlinear algorithm is introduced for quantization. Trained by the quantized sequences, nonparametric hidden Markov model with explicit state duration is applied to cluster and scout the HTTP-session processes. A probability function is derived for predicting HTTP-session processes. The deviation between the prediction result and the real observation is used for sham Web behavior detection. Experiments based on real HTTP traces of large-scale Web proxies are implemented to valid the proposal.
{"title":"HTTP-session Model and Its Application in Anomaly HTTP Traffic Detection","authors":"Yi Xie, Xiangnong Huang","doi":"10.1109/SKG.2010.24","DOIUrl":"https://doi.org/10.1109/SKG.2010.24","url":null,"abstract":"Different from most existing studies on Web session identification for commerce purposes, a novel dynamic real time HTTP-session processes description method is presented in this paper for detecting the anomaly HTTP traffic for network boundary. The proposed scheme doesn't rely on presupposed threshold and client/server-side data which are widely used in traditional session detection approaches. A new parameter is defined based on inter-arrival time of HTTP requests. A nonlinear algorithm is introduced for quantization. Trained by the quantized sequences, nonparametric hidden Markov model with explicit state duration is applied to cluster and scout the HTTP-session processes. A probability function is derived for predicting HTTP-session processes. The deviation between the prediction result and the real observation is used for sham Web behavior detection. Experiments based on real HTTP traces of large-scale Web proxies are implemented to valid the proposal.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"35 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":"121557619","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}
Text corpora which are tagged with part-of-speech (pos) information are useful in many areas of linguistic research. This paper proposes a model of Genetic Expression Programming (GEP) for pos tagging. GEP is used to search for appropriate structures in function space. After the evolution of sequence of tags, GEP can find the best individual as solution. Before simulation, a set of appropriate parameters of algorithm is fitted. Experiments on Brown Corpus show that the proposed model can achieve higher accuracy rate than Genetic Algorithm model and HMM model.
{"title":"An Efficient Corpus Based Part-of-Speech Tagging with GEP","authors":"Chengyao Lv, Huihua Liu, Yuanxing Dong","doi":"10.1109/SKG.2010.42","DOIUrl":"https://doi.org/10.1109/SKG.2010.42","url":null,"abstract":"Text corpora which are tagged with part-of-speech (pos) information are useful in many areas of linguistic research. This paper proposes a model of Genetic Expression Programming (GEP) for pos tagging. GEP is used to search for appropriate structures in function space. After the evolution of sequence of tags, GEP can find the best individual as solution. Before simulation, a set of appropriate parameters of algorithm is fitted. Experiments on Brown Corpus show that the proposed model can achieve higher accuracy rate than Genetic Algorithm model and HMM model.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"45 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":"124405962","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}
Trustworthiness plays an important role in service activities. However, it is not easy to define and compute the service trustworthiness as the evidence involves several information from different service party and maybe conflict at the same time. We discuss the definition and computation method of trustworthiness in this paper. The trustworthiness is acquired from service provider, service user, and service agent and then it is fused based on D-S evident theory. Finally, we testify that the trustworthiness can improve the precision of service discovery via simulation experiments.
{"title":"Trustworthiness Fusion of Web Service Based on D-S Evidence Theory","authors":"Hu Rong, Liu Jian-xun","doi":"10.1109/SKG.2010.55","DOIUrl":"https://doi.org/10.1109/SKG.2010.55","url":null,"abstract":"Trustworthiness plays an important role in service activities. However, it is not easy to define and compute the service trustworthiness as the evidence involves several information from different service party and maybe conflict at the same time. We discuss the definition and computation method of trustworthiness in this paper. The trustworthiness is acquired from service provider, service user, and service agent and then it is fused based on D-S evident theory. Finally, we testify that the trustworthiness can improve the precision of service discovery via simulation experiments.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"39 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":"115637712","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
扫码关注我们
求助内容：
应助结果提醒方式：