检索结果-内蒙古大学图书馆

Facilitating Service Discovery with Semantic Overlay

Journal of Computer Science & Technology 2006年第4期21卷 582-591页

作者：金海武浩宁小敏 Cluster and Grid Computing Laboratory Huazhong University of Science and Technology Wuhan ~3007~ P.R. China

Service Oriented Architecture （SOA） and Peer-to-Peer （P2P） computing share many common characteristics. It is believed that the combination of the two emerging techniques is a very promising method in promoting the web services （WS）. Because the service discovery plays a key role in the integration, here a P2P-based framework to manage the knowledge of service and locating services is proposed. In this paper, the details of the principle, constructing and maintaining of service semantic overlay architecture have been described, and the way how the semantic overlay facilitates discovery of service resources is illustrated. To enable the semantic web service superiority, Service Ontology, which is considered as the service semantic model, is employed to depict service. The service discovery includes two phases： searching on the service semantic overlay; and local discovery in peer＇s service repository. Various solutions have been proposed to realize those two phases. Furthermore, tests are carried out to evaluate service discovery on the architecture.

关键词： information search and retrieval intelligent web services semantic web knowledge management

来源：评论

学校读者我要写书评

暂无评论

Hybrid followee recommendation in microblogging systems

引用

Science China(Information Sciences) 2017年第1期60卷 21-34页

作者： Hanhua CHEN Hai JIN Xiaolong CUI Services Computing Technology and System Laboratory Big Data Technology and System LaboratoryCluster and Grid Computing Laboratory School of Computer Science and TechnologyHuazhong University of Science and Technology

Followee recommendation plays an important role in information sharing over microblogging platforms. Existing followee recommendation schemes adopt either content relevance or social information for followee ranking, suffering poor performance. Based on the observation that microblogging systems have dual roles of social network and news media platform, we propose a novel followee recommendation scheme that takes into account the information sources of both tweet contents and the social structures. We set up a linear weighted model to combine the two factors and further design a simulated annealing algorithm to automatically assign the weights of both factors in order to achieve an optimized combination of them. We conduct comprehensive experiments on real-world datasets collected from Sina Weibo, the largest microblogging system in China. The results demonstrate that our scheme provides a much more accurate followee recommendation for a user compared to existing schemes.

关键词： online social networks microblogging followee recommendation simulated annealing ranking

来源：评论

学校读者我要写书评

暂无评论

Understanding and identifying latent data races cross-thread interleaving

引用

Frontiers of Computer Science 2015年第4期9卷 524-539页

作者： Long ZHEN~ Xiaofei LIAO Song WU Xuepeng FAN Hai JIN Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

Data races are ubiquitous in multi-threaded ap- plications, but they are by no means easy to detect. One of the most important reasons is the complexity of thread in- terleavings. A volume of research has been devoted to the interleaving-insensitive detection. However, all the previous work focuses on the uniform detection （unknown to the char- acteristics of thread interleavings）, thereby making the detec- tion defective in either reporting false positives or suffering from prohibitive overhead. To cope with the problem above, we propose an efficient, precise, and sound step-by-step res- olution based on the characteristics of thread interleavings. We first try to tease apart the categories of thread interleav- ings from the several typical sources arising from the lock synchronizations. We then conduct a brief study and find a new and complex pattern the previous work cannot detect. It is also revealed that the simple pattern with the majority of thread interleavings can be resolved by a simple processing to achieve a big profit for the previous reordering-based design. Our final experimental results demonstrate the effectiveness of our empiricism-based approach, and show that 51.0% of execution time and 52.3 % of trace size arising from the state- of-the-art reordering technique can be saved through a quick filtering of the simple pattern with a negligible （4.45%） per- formance overhead introduced on-the-fly.

关键词： data race happens-before thread interleaving

来源：评论

学校读者我要写书评

暂无评论

A Protective Mechanism for the Access Control System in the Virtual Domain

引用

China Communications 2016年第11期13卷 129-142页

作者： Jinan Shen Deqing Zou Hai Jin Kai Yang Bin Yuan Weiming Li Services Computing Technology and System Laboratory Cluster and Grid Computing LaboratorySchool of Computing Science and TechnologyHuazhong University of Science and Technology School of Information Engineering Hubei University for Nationalities

In traditional framework,mandatory access control(MAC) system and malicious software are run in kernel mode. Malicious software can stop MAC systems to be started and make it do invalid. This problem cannot be solved under the traditional framework if the operating system(OS) is comprised since malwares are running in ring 0 level. In this paper,we propose a novel way to use hypervisors to protect kernel integrity and the access control system in commodity operating systems. We separate the access control system into three parts: policy management(PM),security server(SS) and policy enforcement(PE). Policy management and the security server reside in the security domain to protect them against malware and the isolation feather of the hypervisor can protect them from attacks. We add an access vector cache(AVC) between SS and PE in the guest OS,in order to speed up communication between the guest OS and the security domain. The policy enforcement module is retained in the guest OS for performance. The security of AVC and PE can be ensured by using a memory protection mechanism. The goal of protecting the OS kernel is to ensure the security of the execution path. We implementthe system by a modified Xen hypervisor. The result shows that we can secure the security of the access control system in the guest OS with no overhead compared with modules in the latter. Our system offers a centralized security policy for virtual domains in virtual machine ***: hypervisor; virtualization; memo-

关键词： hypervisor virtualization memory protection guest OS access control system

来源：评论

学校读者我要写书评

暂无评论

Fine-grained and heterogeneous proxy re-encryption for secure cloud storage

引用

Chinese Science Bulletin 2014年第32期59卷 4201-4209页

作者： Peng Xu Hongwu Chen Deqing Zou Hai Jin Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology

Cloud is an emerging computing *** has drawn extensive attention from both academia and *** its security issues have been considered as a critical obstacle in its rapid *** data owners store their data as plaintext in cloud,they lose the security of their cloud data due to the arbitrary accessibility,specially accessed by the un-trusted *** order to protect the confidentiality of data owners’cloud data,a promising idea is to encrypt data by data owners before storing them in ***,the straightforward employment of the traditional encryption algorithms can not solve the problem well,since it is hard for data owners to manage their private keys,if they want to securely share their cloud data with others in a fine-grained *** this paper,we propose a fine-grained and heterogeneous proxy re-encryption(FHPRE)system to protect the confidentiality of data owners’cloud *** applying the FH-PRE system in cloud,data owners’cloud data can be securely stored in cloud and shared in a fine-grained ***,the heterogeneity support makes our FH-PRE system more efficient than the previous ***,it provides the secure data sharing between two heterogeneous cloud systems,which are equipped with different cryptographic primitives.

关键词：安全问题数据存储加密算法细粒度异构代理计算模式数据共享

来源：评论

学校读者我要写书评

暂无评论

An approach for indexing, storing and retrieving domain knowledge

Proceedings of the ACM Symposium on Applied Computing

引用

Proceedings of the ACM Symposium on Applied computing 2007年 1381-1382页

作者： Wu, Hao Jin, Hai Ning, Xiaomin Cluster and Grid Computing Laboratory Services Computing Technology and System Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)1595934804;9781595934802

In this short paper, we present our solution to index, store and retrieve the domain knowledge. The main principle exploits Lucene to index the domain knowledge under guide of the domain schema. The method to map domain knowledge structure into Lucene index structure, store and update the indices, and to transfer RDF-based query into Lucene's query are presented. Copyright 2007 ACM.

关键词： Knowledge acquisition

来源：评论

学校读者我要写书评

暂无评论

Finding and evaluating the community structure in semantic peer-to-peer overlay networks

引用

Science China(Information Sciences) 2011年第7期54卷 1340-1351页

作者： CHEN HanHua & JIN Hai Services computing Technology and System laboratory,cluster and grid computing laboratory,School of Computer Science and Technology,Huazhong University of Science and Technology,Wuhan 430074,China 1. Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

Recently much attention has been paid to semantic overlay networks for information retrieval in large scale peer-to-peer networks,and much research work on semantic overlay protocols and searching algorithms has been done and the results indicate that semantic overlay is efficient for content searching in peer-to-peer ***,very limited work has been done to analyze and evaluate the characteristics of semantic overlay *** this paper we identify a natural property of semantic overlay networks,the community *** propose a mathematical model to evaluate the property of community structure of semantic P2P overlay networks.A heuristic algorithm is designed to optimize the community *** the evaluation model we compare the SemreX semantic overlay with the Gnutella *** demonstrate that a SemreX overlay network has the distinctive community structure feature,while a Gnutella-like network does *** also simulate a simple flooding protocol in both overlays to show that the overlay with community structure is more efficient for content searching.

关键词： peer-to-peer community structure semantic overlay

来源：评论

学校读者我要写书评

暂无评论

Semantic-overlay-driven web services discovery

Semantic-overlay-driven web services discovery

引用

1st International Conference on Semantics, Knowledge and grid, SKG 2005

作者： Wu, Hao Jin, Hai Chen, Hanhua Cluster and Grid Computing Laboratory Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)0769525342

There are many common characteristics between Web Service (WS) and Peer-to-Peer (P2P) computing environment. Therefore, carrying out web service over P2P network can utilize the advantages of P2P to achieve the services integration and resource self-government. The service discovery is a key step during this convergence. In this paper, a semantic-overlay based approach is presented for web service discovery. To enable the semantic web service superiority, service profile is used to describe web service and as the service data source. The service-expertise based model is proposed for service node selection. Meanwhile, similarity functions are discussed for measuring the semantic similarity of different elements inside a service profile. © 2006 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

An efficient metadata management method in large distributed storage systems 1

引用

4th International Conference on Human-Centric computing, HumanCom'11 and the 6th International Conference on Embedded and Multimedia computing, EMC'11

作者： Ran, Longbo Jin, Hai Cluster and Grid Computing Lab. Services Computing Technology and System Laboratory Huazhong University of Science and Technology 430074 Wuhan China

ISBN: (数字)9789400721050

ISBN: (纸本)9789400721043

Efficient metadata management is a critical aspect of overall system performance in large distributed storage systems. Directory subtree partitioning and traditional hashing are two common techniques used for managing metadata in such systems, but both have some shortcomings, for example, in directory subtree partitioning method, the root node easily becomes a bottleneck, and for traditional hashing, a large directory hierarchy must be maintained and traversed. In this paper, we present a new method called directory-level-based metadata management that has high efficiency while avoiding the shortcomings of traditional methods. © 2011 Springer Science+Business Media B.V.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Improving the memory efficiency of in-memory mapreduce based HPC systems 15th

Improving the memory efficiency of in-memory mapreduce based...

引用

15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015

作者： Pei, Cheng Shi, Xuanhua Jin, Hai Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9783319271187

In-memory cluster computing systems based MapReduce, such as Spark, have made a great impact in addressing all kinds of big data problems. Given the overuse of memory speed, which stems from avoiding the latency caused by disk I/O operations, some process designs may cause resource inefficiency in traditional high performance computing (HPC) systems. Hash-based shuffle, particularly large-scale shuffle, can significantly affect job performance through excessive file operations and unreasonable use of memory. Some intermediate data unnecessarily overflow to the disk when memory usage is unevenly distributed or when memory runs out. Thus, in this study, Write Handle Reusing is proposed to fully utilize memory in shuffle file writing and reading. Load Balancing Optimizer is introduced to ensure the even distribution of data processing across all worker nodes, and Memory-Aware Task Scheduler that coordinates concurrency level and memory usage is also developed to prevent memory spilling. Experimental results on representative workloads demonstrate that the proposed approaches can decrease the overall job execution time and improve memory efficiency. © Springer International Publishing Switzerland 2015.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：