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

第七届网格与协同计算国际会议(Seventh International Conference on grid and Cooperative computing GCC 2008)

作者： Song Wu Kai Wang Hai Jin Deqing Zou Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781424432806;9780769534497

Heterogeneous grid workflow management plays an important role in the grid interoperation. It integrates service resources from different grid systems and packs them as atomic services into a composite service. The focuses of the research are how to shield the difference among the heterogeneous grid services and how to provide a flexible way to compose services. Heterogeneous grid workflow management mechanism, based on virtual service, compiles with BPEL4WS standards and shields the differences in the aspects of both organization of service information and the types of service among heterogeneous grids. The mechanism compensates for the weakness that traditional mechanism requires prior static binding in the service selection and scheduling. The proposed mechanism can provide some new functions like service backup and dynamic service selection based on QoS to improve the flexibility and stability of workflow management. In addition, in order to address the issues of tight coupling between data and service, the proposed mechanism employs virtual data space and corresponding data transferring solution.

关键词： workflow management grid service virtual service dynamic binding

来源：评论

学校读者我要写书评

暂无评论

Secure and Efficient Data Integrity Based on Iris Features in Cloud computing

Secure and Efficient Data Integrity Based on Iris Features i...

引用

International Conference on Security technology, SECTECH

作者： Salah H. Abbdal Hai Jin Deqing Zou Ali A. Yassin Services Computing Technologyt and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China

Cloud computing aids users to outsource their data in the cloud remotely to prevent them from burdens of local storage and maintenance. Users no longer have possession and control of these data. This property brings many new security challenges like unauthorised entities and correctness of stored data. In this paper, we focus on the problem of ensuring the integrity of data stored in the cloud. We propose a method which combines biometric and cryptography techniques in a cost-effective manner for data owners to gain trust in the cloud. We present efficient and secure integrity based on the XOR operation and iris feature extraction as the strong factors. This work gives the cloud user more confidence in detecting any block that has been changed. Additionally, our proposed scheme employs user's iris features to secure and integrate data in a manner difficult for any internal or external entity to take or compromise it. Extensive security and performance analysis show that our scheme is highly efficient and provably secure.

关键词： Cloud computing Servers Security Iris Iris recognition Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Dispatcher: Resource-aware Nakamoto Blockchain via Hierarchical Topology and Adaptive Incentives

引用

Distributed Ledger Technologies: Research and Practice 2024年第2期3卷 1-20页

作者： Hai Jin Shuohua Dong Xiaohai Dai Yuandi Cai Jiang Xiao National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Mainstream blockchain systems such as Bitcoin and Ethereum are revolutionizing the financial industry by adopting the Nakamoto consensus protocol, i.e., Proof-of-Work (PoW). Only nodes with sufficient computing resources can work out the PoW difficulties, thereby increasing the mining cost of malicious attackers and ensuring the security of blockchain systems. Such an assumption of having abundant resources leads to drawbacks of low throughput and risk of centralization. In this article, we present Dispatcher, a novel distributed consensus protocol that takes resource heterogeneity into account to ensure resource-aware PoW with high efficiency. Dispatcher introduces a hierarchical topology to offer flexible PoW difficulties tailored for different nodes’ resources. In particular, it utilizes the limited resource of each node to jointly maximize the performance by concurrent mining. Moreover, we design an adaptive incentive mechanism to fit the available resource of blockchain nodes to rewards. Our experiments show that Dispatcher enjoys a substantial performance margin over the state-of-the-art. We can achieve a 50% throughput improvement compared with OHIE.

关键词： Blockchain resource heterogeneity incentive hierarchical architecture

来源：评论

学校读者我要写书评

暂无评论

Network and Parallel computing 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Hai Jin Guang R. Gao Zhiwei Xu Hao Chen

ISBN: (数字)9783540301417

ISBN: (纸本)9783540233886

This proceedings contains the papers presented at the 2004 IFIP International Conference on Network and Parallel computing (NPC 2004), held at Wuhan, China, from October 18 to 20, 2004. The goal of the conference was to establish an international forum for engineers and scientists to present their ideas and experiences in network and parallel computing. A total of 338 submissions were received in response to the call for papers. These papers werefrom Australia, Brazil,Canada,China, Finland, France, G- many, Hong Kong, India, Iran, Italy, Japan, Korea, Luxemburg, Malaysia, N- way, Spain, Sweden, Taiwan, UK, and USA. Each submission was sent to at least three *** paper was judged according to its originality,inno- tion, readability, and relevance to the expected audience. Based on the reviews received, a total of 69 papers were accepted to be included in the proceedings. Among the 69 papers, 46 were accepted as full papers and were presented at the *** accepted23papersasshortpapers;eachofthesepaperswas given an opportunity to have a brief presentation at the conference, followed by discussions in a poster session. Thus, due to the limited scope and time of the conference and the high number of submissions received, only 20% of the total submissions were included in the ?nal program.

关键词： Theory of Computation Computer Communication Networks Software Engineering Operating systems Algorithm Analysis and Problem Complexity Information systems Applications (incl. Internet)

来源：评论

学校读者我要写书评

暂无评论

Efficient and Progressive Algorithms for Distributed Skyline Queries over Uncertain Data

Efficient and Progressive Algorithms for Distributed Skyline...

引用

IEEE International Conference on Distributed computing systems

作者： Xiaofeng Ding Hai Jin Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology

ISBN: (纸本)9781424472611;9780769540597

The skyline operator has received considerable attention from the database community, due to its importance in many applications including multi-criteria decision making, preference answering, and so forth. In many applications where uncertain data a re inherently exist, i.e., data collected from different sources in distributed locations are usually with imprecise measurements, and thus exhibit kind of uncertainty. Taking into account the network delay and economic cost associated with sharing and communicating large amounts of distributed data over an internet, an important problem in this scenario is to retrieve the global skyline tuples from all the distributed local sites with minimum communication cost. Based on the well known notation of the probabilistic skyline query over centralized uncertain data, in this paper, for the first time, we propose the notation of distributed skyline queries over uncertain data. Furthermore, two communication- and computation-efficient algorithms are proposed to retrieve the qualified skylines from distributed local sites. Extensive experiments have been conducted to verify the efficiency and the effectiveness of our algorithms with both the synthetic and real data sets.

关键词： Plant uncertain Distribute network delay Uncertainty algorithms

来源：评论

学校读者我要写书评

暂无评论

SKVM: Scaling In-Memory Key-Value Store on Multicore

SKVM: Scaling In-Memory Key-Value Store on Multicore

引用

IEEE Symposium on Computers and Communication

作者： Ran Zheng Wenjin Wang Hai Jin Qin Zhang Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology

ISBN: (纸本)9781467371957

SKVM is a high performance in-memory Key-Value (KV) store for multicore, which is designed for high concurrent data access. There are some problems of existing systems dealing with high concurrent data processing on multicore: lock competition, cache coherency overhead, and large numbers of concurrent network connections. To solve the problems and make the in-memory KV store scale well on multicore, high concurrent data access is divided into two steps: high concurrent connection processing and high concurrent data processing. Half sync/half async model (HSHA) is adopted to eliminate network bottle-neck, which can support high concurrent network connection. Through data partition, lock competition is eliminated and cache movement is reduced. Furthermore, consistent hash is adopted as data distribution strategy which can improve the scalability of system on multicore. Though some of these ideas appear elsewhere, SKVM is the first to combine them together. The experimental results show that SKVM can reach at most 2.4× higher throughput than Memcached, and scales near linearly with the number of cores under any workload.

关键词： In-Memory KV store Multicore Scalability Concurrent data access

来源：评论

学校读者我要写书评

暂无评论

One-Sided Message Passing Programming Model for Unstructured Peer-to-Peer computing system

One-Sided Message Passing Programming Model for Unstructured...

引用

IEEE International Conference on Computer and Information technology Workshops, CIT

作者： Hai Jin Fei Luo Qin Zhang Xiaofei Liao Hao Zhang Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory Huazhong University of Science and Technology Wuhan China Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory Huazhong University of Science and Technology Wuhan China

The programming is still a challenging issue for the high performance distributed computing (HPDC) platform, and it is critical to the popularity of peer-to-peer (P2P) based HPDC systems. Therefore, this paper focuses on the design and implementation of OMP, a one-sided message passing programming model for unstructured P2P computing system, P2HP. Based on taskspsila execution flow, P2HP provides a one-sided point-to-point message-passing communication library, and a software development kit with rich APIs for applicationspsila parallelization. Furthermore, a serial sequence alignment algorithm is parallelized with OMP in P2HP. The evaluation shows that OMP makes P2HP practical and efficient.

关键词： Message passing Peer to peer computing Application software Parallel programming Distributed computing Software libraries grid computing Computer architecture Concurrent computing High performance computing

来源：评论

学校读者我要写书评

暂无评论

A Novel Metadata Extraction Method for Surveillance Video

A Novel Metadata Extraction Method for Surveillance Video

引用

International Conference on computing, Networking and Communications

作者： Ran Zheng Long Chen Hai Jin Lei Zhu Qin Zhang Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology

ISBN: (纸本)9781467385800

Surveillance videos are increasing massively with monitoring cameras widely deployed in cities. Metadata of moving objects in videos can reduce video storage and be utilized in many video analysis applications. The whole metadata extraction is too time-consuming to be fulfilled quickly. Therefore, it is urgent to parallelize and accelerate the extraction process. However, iterative execution of traditional metadata extraction methods makes the parallelization quite challenging. In this paper, we propose a novel Parallel Metadata Extraction (PME) method for surveillance video. A novel video segmentation algorithm is designed to segment whole video into independent video segments. The metadata of each video segment is extracted independently and simultaneously on computer nodes, which will be integrated later to guarantee the completeness of the metadata. Performance evaluations demonstrate that PME can accelerate extraction process greatly almost without metadata loss.

关键词： Surveillance Videos Video Segmentation Metadata Extraction Iterative Execution MapReduce

来源：评论

学校读者我要写书评

暂无评论

Piggyback game: Efficient event stream dissemination in Online Social Network systems

Piggyback game: Efficient event stream dissemination in Onli...

引用

International Conference on Network Protocols

作者： Fan Zhang Hanhua Chen Hai Jin Services Computing Technology and System Lab Big Data Technology and System Lab and Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781509032822

Event stream dissemination dominates the workloads in large-scale Online Social Network (OSN) systems. Based on the de facto per-user view data storage, event stream dissemination raises a large amount of inter-server traffics due to the complex interconnection among OSN users. The state-of-the-art schemes mainly explore the structure features of social graphs to reduce the inter-server messages for event stream dissemination. Different sub-graph structures are exploited for achieving the approximated optimal assignment. However, such schemes incur high costs of computation or communication. In this work, we follow a different design philosophy by using a game theoretic approach, which decomposes the high complex graph computation problem into individuals' rational strategy selection of each node. Specifically, we propose a novel social piggyback game to achieve a more efficient solution. We mathematically prove the existing of the Nash Equilibrium of the social piggyback game. Moreover, we propose an efficient best response dynamic algorithm to achieve the Nash Equilibrium, which quickly converges in a small number of iterations for large-scale OSNs. We further show that the communication cost of this design achieves a 1.5-approximation of the theoretical social optimal. We conduct comprehensive experiments to evaluate the performance of this design using large-scale real-world traces from popular OSN systems. Results show that the social piggyback game achieves a significant 302× improvement in system efficiency compared to existing schemes.

关键词： Games Schedules Heuristic algorithms Algorithm design and analysis Nash equilibrium Social network services Servers

来源：评论

学校读者我要写书评

暂无评论

On the Security of Smart Home systems:A Survey

引用

Journal of Computer Science & technology 2023年第2期38卷 228-247页

作者：袁斌万俊吴宇晗邹德清金海 School of Cyber Science and Engineering Huazhong University of Science and TechnologyWuhan 430074China Hubei Key Laboratory of Distributed System Security Huazhong University of Science and Technology Wuhan 430074China Hubei Engineering Research Center on Big Data Security Huazhong University of Science and Technology Wuhan 430074China National Engineering Research Center for Big Data Technology and System Huazhong University of Science and TechnologyWuhan 430074China Services Computing Technology and System Lab Huazhong University of Science and TechnologyWuhan 430074China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen 518057China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Lab Huazhong University of Science and TechnologyWuhan 430074China

Among the plethora of IoT(Internet of Things)applications,the smart home is one of the ***,the rapid development of the smart home has also made smart home systems a target for ***,researchers have made many efforts to investigate and enhance the security of smart home *** a more secure smart home ecosystem,we present a detailed literature review on the security of smart home ***,we categorize smart home systems’security issues into the platform,device,and communication *** exploring the research and specific issues in each of these security areas,we summarize the root causes of the security flaws in today's smart home systems,which include the heterogeneity of internal components of the systems,vendors'customization,the lack of clear responsibility boundaries and the absence of standard security ***,to better understand the security of smart home systems and potentially provide better protection for smart home systems,we propose research directions,including automated vulnerability mining,vigorous security checking,and data-driven security analysis.

关键词： IoT(Internet of Things) smart home IoT security smart home security

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：