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

2008 10th International Conference on Advanced Communication technology

作者： Hai, Jin Ruhan, He Wenbing, Tao Aobing, Sun Services Computing Technology and System Lab. Cluster and Grid Computing Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9788955191356

A large-scale image retrieval system for the WWW, named VAST (VisuAl & SemanTic image search), is presented in this paper. Based on the existing inverted file and visual feature clusters, we form a semantic network on top of the keyword association on the visual feature clusters. The system is able to automatically combine keyword and visual features for retrieval by the semantic network The combination is automatic, simple, and very fast, which is suitable for large-scale web dataset Meanwhile, the retrieval takes advantage of the semantic contents of the images in addition to the low-level features, which remarkably improves the retrieval precision. The experimental results demonstrate the superiority of the system.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Ontology based grid information interoperation

Ontology based grid information interoperation

引用

21st International Conference on Advanced Information Networking and ApplicationsWorkshops/Symposia, AINAW'07

作者： Di, Sheng Jin, Hai Li, Shengli Chen, Ling Qi, Li Wang, Chengwei Services Computing Technology and System Lab. Cluster and Grid Computing Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)0769528473

A series of problems arises with the emergence and fast development of grid. Among all the problems, one of them is how to smoothly connect heterogeneous grid platforms. There are a number of ways to solve this problem and the relatively more efficient one is using ontology. Based on this method, we focus on alleviating semantic inconsistency of various platforms and designing a novel ontology. This ontology is depicted by Resource Description Framework (RDF) and transacted by adapters. Finally, we test our method and analyze its performance. © 2007 IEEE.

关键词： grid computing

来源：评论

学校读者我要写书评

暂无评论

Scalable DHT-based Information Service for large-scale grids 08

Scalable DHT-based Information Service for large-scale grids

引用

2008 Conference on computing Frontiers, CF'08

作者： Jin, Hai Tao, Yongcai Wu, Song Shi, Xuanhua Cluster and Grid Computing Lab. Services Computing Technology and System Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781605580777

Current grid information service is centralized or hierarchical and proves inefficient as grid scale rapidly increases. The introduction of P2P techniques into grids breaks an encouraging path. However, frequent join and departure of resource nodes require strong self-organization capacity of system to maintain their rigid structure. Moreover, arranging identifier space for P2P nodes is knotty and has great impact on system performance. If the identifier space is too large, some nodes will be overloaded. On the contraiy, small identifier space will bring the same problem as millennium bug. To address the issues, this paper proposes a scalable DHT-based (Distributed Hash Table) Information Service (DIS) for grid system, which organizes grid resources into a DHT ring based on VO (Virtual Organization). To save the identifier space while retaining the scalability and system performance, only stable VOs can join DIS via a new DHT node, whereas volatile VOs join DIS through being the sub-domain of other VO. Experimental results show that DIS provides rapid resource query, strong scalability and high throughput, meanwhile avoiding the key node failure as well as the bottleneck problem. Copyright 2008 ACM.

关键词： grid computing

来源：评论

学校读者我要写书评

暂无评论

Media Power Measuring via Emotional Contagion

引用

Journal of Social computing 2024年第1期5卷 15-35页

作者： Xue Lin Hong Huang Zongya Li Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China School of Journalism Huazhong University of Science and TechnologyWuhan 430074China

Media power,the impact that media have on public opinion and perspectives,plays a significant role in maintaining internal stability,exerting external influence,and shaping international dynamics for nations/***,prior research has primarily concentrated on news content and reporting time,resulting in limitations in evaluating media *** more accurately assess media power,we use news content,news reporting time,and news emotion simultaneously to explore the emotional contagion between *** use emotional contagion to measure the mutual influence between media and regard the media with greater impact as having stronger media *** propose a framework called Measuring Media Power via Emotional Contagion(MMPEC)to capture emotional contagion among media,enabling a more accurate assessment of media power at the media and national/regional *** also interprets experimental results through correlation and causality analyses,ensuring *** analyses confirm the higher accuracy of MMPEC compared to other baseline models,as demonstrated in the context of COVID-19-related news,yielding compelling and interesting insights.

关键词： explainability media power emotional contagion

来源：评论

学校读者我要写书评

暂无评论

Secure cryptographic functions via virtualization-based outsourced computing

Secure cryptographic functions via virtualization-based outs...

引用

作者： Qiang, Weizhong Zhang, Kang Dai, Weiqi Jin, Hai Services Computing Technology and System Lab and Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Cryptographic functions, such as encryption/decryption libraries, are common and important tools for applications to enhance confidentiality of the data. However, these functions could be compromised by subtle attacks launched by untrusted operating system or other applications, and sensitive keys or cryptographic procedures could then be compromised. In this paper, based on virtualization technology, we propose a novel approach that outsources the cryptographic functions in one virtual machine (VM) into another dedicated VM, so that sensitive keys and the cryptographic procedures are only contained by this VM with specific purpose. We also propose a prototype, called cryptographic function assurance (CFA), to enhance the security of cryptographic functions. Taking OpenSSL as an example, CFA allows those applications that use OpenSSL library to transparently utilize CFA to protect the cryptographic functions. We present the detailed implementation, as well as the security analysis of CFA. We also give the performance evaluation for OpenSSL's interfaces and Apache httpd, to show the overhead caused by the integration of CFA. Copyright © 2015 John Wiley & Sons, Ltd. Copyright © 2015 John Wiley & Sons, Ltd.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

Efficient multiple-reference temporal error concealment algorithm based on H.264/AVC 2nd

Efficient multiple-reference temporal error concealment algo...

引用

2nd International Conference on Human Centered computing, HCC 2016

作者： Yu, Chen Cheng, Chao Jin, Hai Zhou, Jingli Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9783319318530

Temporal error concealment at the video communication receiver recovers damaged blocks using temporal information redundancy. To enhance the quality of reconstructed image, a multiple-reference temporal error concealment algorithm based on H.264/AVC was proposed. Firstly, a pre-concealment is implemented to improve video frame;then the fractional pixel boundary matching algorithm and search algorithm are used to evaluate the candidate motion vectors from a number of reference frames, and the motion vector (MV) giving the minimum boundary matching distortion (MBMD) is selected as optimal motion vector;finally it is used to recover the damaged block and the video frame quality can be improved further. For various video sequences and different macro-block loss ratio, experimental results show that the proposed algorithm is significantly better than traditional temporal error concealment algorithms such as BMA and BM from both objectively and subjectively. At the loss ratio of 10 %, improvements of the proposed algorithm are more than 0.8~3.7 dB compared to that of other algorithms. © Springer International Publishing Switzerland 2016.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Anysee2: An auto load balance P2P live streaming system with hybrid architecture (work-in-progress) 2

Anysee2: An auto load balance P2P live streaming system with...

引用

2nd International Conference on Scalable Information systems, InfoScale 2007

作者： Huang, Qi Jin, Hai Liu, Ke Liao, Xiaofei Tu, Xuping Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9781595937575

Nowadays, Peer-to-Peer technology has been widely used in live streaming applications and many related systems are proposed. However, their single overlay design and unbalanced scheduling methods lead to some inefficiency including high control overhead and bad playback experience. This paper mainly discusses how to address these certain problems. We introduce a hybrid architecture to solve the locality problem and reduce the control overhead. We also propose a scheduling method to achieve load balance. All solutions are implemented in Anysee2.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Runtime-aware adaptive scheduling in stream processing

Runtime-aware adaptive scheduling in stream processing

引用

作者： Liu, Yuan Shi, Xuanhua Jin, Hai Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Long-running stream applications usually share the same fundamental computational infrastructure. To improve the efficiency of data processing in stream processing systems, a data analysis operator could be partitioned into n parallel tasks. The partitioned tasks are usually deployed on m nodes coexisting with other application operators. Because the node performance can vary in unpredictable ways (i.e., (1) stream input rates may fluctuate and (2) computational resource availability varies as other applications are affected), the nodes have different processing steps, and the slow node determines the operator performance. Hence, the tasks should be redistributed at runtime for stream applications to meet their strict latency requirements. Our key idea is to redistribute the tasks to the best node dynamically adaptive to resource or load fluctuations. In this paper, we present a runtime-aware adaptive schedule mechanism that aims at minimizing the operator processing latency and minimizing the latency difference between different nodes' tasks. We propose a new abstraction called performance cost ratio (PCR) that evaluates the node performance. The higher the node's PCR is, the less cost the node will pay for processing one tuple, and the more tasks should be deployed on it. In a scheduling, we first sort tasks descendingly by their loads and sort nodes by their PCR. Then we reassign the amount of computation according to the node's PCR to keep the node's PCR and its input rate the same or in similar proportion in all PCRs. The PCR-based quantitative algorithm applies itself to make tasks loads quantized to the processing capacity of nodes, move the minimum amount of operator's tasks, and keep the tasks local at the same time. We have implemented a runtime-aware adaptive scheduler as an extension to Storm and evaluated this strategy. We achieve the optimization goal using less computational resources. Copyright © 2015 John Wiley & Sons, Ltd. Copyright © 2015 John Wil

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

A multicast based bandwidth saving approach for wireless live streaming system

引用

International Journal of Smart Home 2008年第1期2卷 65-80页

作者： Jiang, Wenbin Jin, Hai Liao, Xiaofei Yuan, Zhi Services Computing Technology and System Lab Huazhong University of Science and Technology Wuhan 430074 China Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan 430074 China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

P2P based live streaming applications are growing up rapidly. However, when extending them to WLANs, the bandwidth bottleneck and the high rate of packet loss are usually the major stumbling blocks. To overcome this issue, a new wireless multicast agent mechanism (WiMA) based on the IP multicast scheme for buffer management and scheduling is proposed. First of all, a wireless agent selection method is presented to choose an appropriate agent for WiMA. Then this agent gains media data by interacting with wired neighbor peers as a common P2P node, and transmits these data to other wireless peers in the WLAN by means of multicast pushing and multicast patching. A normal wireless peer requests data according to the strategy of "emergent ones first". Experimental results show that the approach proposed can significantly save bandwidth in WLANs with acceptable start delay and satisfied playing continuity.

关键词： Wireless local area networks (WLAN)

来源：评论

学校读者我要写书评

暂无评论

Parallel bloom filter on xeon phi many-core processors 15th

Parallel bloom filter on xeon phi many-core processors

引用

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

作者： Ni, Sheng Guo, Rentong Liao, Xiaofei Jin, Hai Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9783319271217

Bloom filters are widely used in databases and network areas. These filters facilitate efficient membership checking with a low false positive ratio. It is a way to improve the throughput of bloom filter by parallel processing. Common many-core processors such as Xeon Phi can provide high parallelism. Thus, we build an iterative model to analyze memory access performance. This performance suggests that the bottleneck in the traditional design is mainly caused by synchronization cost and memory latency on many-core platforms. Therefore, we propose a parallel bloom filter (PBF), which is a lockless method involving input data preprocessing. This method reduces synchronization overhead and improves cache locality. We also implement and evaluate PBF on a Xeon Phi processor. Results show that the memory access performance is three times better than that of the counting bloom filter. PBF provides improved scalability, and the speedup ratio can reach a maximum of 80.7x. © Springer International Publishing Switzerland 2015.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：