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

Admission control with Elastic QoS for Video on Demand {1.s

International Journal of Automation and computing 2012年第5期9卷 467-473页

作者： Fu-Shou Lin 1.Bao-Qun Yin 1.2 Jing Huang 1.Xu-Min Wu 1.1.key {1. of anhui network communication system and control, University of Science and Technology of China, Hefei 230027, China 2 National network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Science, Beijing 1.01.0, China 1. Key Lab of Anhui Network Communication System and Control University of Science and Technology of China Hefei 230027 China 2. National Network New Media Engineering Research Center Institute of Acoustics Chinese Academy of Science Beijing 100190 China

In network service {1.s, satisfying quality of service (QoS) is one of the main objectives. Admission control and resource allocation strategy can be used to guarantee the QoS requirement. Based on partially observable Markov decision processes (POMDPs), this paper proposes a novel admission control model for video on demand (VOD) service {1.s with elastic QoS. Elastic QoS is also considered in resource allocation strategy. Policy gradient algorithm is often available to find the solution of POMDP problems, with a satisfactory convergence rate. Through numerical examples, it can be shown that the proposed admission control strategy has better performance than complete admission control strategy.

关键词： Partially observable Markov decision processes (POMDPs) admission control resource allocation elastic quality of service (QoS) policy gradient

来源：评论

学校读者我要写书评

暂无评论

Towards Load Balance and Maintenance in Structured P2P network for Locality Sensitive Hashing

Towards Load Balance and Maintenance in Structured P2P Netwo...

引用

201. 4th IEEE International Conference on Computer Science and Information Technology(ICCSIT 201.)

作者： Dawei Liu Ming Zhu The Key Lab of Network Communication System ＆ Control The Chinese Academay of Sciences The Key Lab of Network Communication System ＆ ControlAnhui Department of AutomationUniversity of Science and Technology of China

ISBN: (纸本)9781612848334

In this paper,we consider load balancing and maintenance of distributed similarity search system using locality sensitive hashing（LSH） in DHT-based structured P2P *** has been proven efficient in K-Nearest Neighbor（KNN） search in high ***,a number of schemes have been proposed to implement LSH over DHTbased peer-to-peer system to process distributed similarity *** provide an efficient structure using virtual nodes to manage the multi-dimensional LSH bucket space in DHT peers and maintenance algorithm,which improves load balancing in comparison with the state-of-the-art *** effectiveness of the proposed method is proved by experiments.

关键词： load balance DHT LSH virtual node distributed similarity search

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT VIDEO SIMILARITY SEARCH STRATEGY FOR VIDEO-ON-DEMAND systemS

AN EFFICIENT VIDEO SIMILARITY SEARCH STRATEGY FOR VIDEO-ON-D...

引用

2009 2nd IEEE International Conference on Broadband network & Multimedia Technology(2009年宽带网络与多媒体国际会议 IEEE IC-BNMT2009)

作者： Cao Zheng Zhu Ming The Key Lab of Network Communication System & Control The Chinese Academy of Sciences The Key Lab of Network Communication System & Control Anhui Department of Automation University of Science and Technology of China

The video-on-demand systems and video share web are more and more popular in recent years. Video similarity search for content-based video retrieval is important in web service and research field. There is still no satisfying search method for sca{1.le fast similarity search in large video database. In order to solve two challenging problems: video similarity measure and fast search method in large database, a novel efficient video similarity search strategy for video-on-demand systems is proposed in this paper. A compact video signature was computed according to image histogram and spatial-temporal features of video. The video similarity is measured by the computation of the distance of video signature. For the sca{1.le computing requirement, a new search method based on Clustering Index Table was presented by index clustering. The experimental results from the query tests in large database show this method is highly efficient and effective for similar video search.

关键词： Video similarity search Video signature Spatial-temporal distribution Clustering indez table

来源：评论

学校读者我要写书评

暂无评论

A scalable peer-to-peer indexing scheme for high dimensional nearest- neighbor search in massive datasets

引用

Journal of Convergence Information Technology 2011年第9期6卷 131-139页

作者： Liu, Dawei Zhu, Ming The Key Lab of Network Communication System and Control The Chinese Academy of Sciences University of Science and Technology of China China The Key Lab of Network Communication System and Control Anhui Department of Automation University of Science and Technology of China China

Nearest-Neighbor (NN) search is an increasingly important problem in many computer applications, in which high dimensional massive datasets are involved. In this paper, we propose a P2P distributed indexing scheme to perform NN search in massive datasets. We consider the locality sensitive hashing (LSH) scheme under lp-metric to support similarity search in high dimensional space and we put forward a novel mapping from the multi-dimensional LSH bucket space to the one dimension DHT key space using nun-uniform Hilbert Curve. We consider the requirements of both similarity search and the maintenance of P2P {1.. Our indexing scheme preserves the locality sensitive property of LSH indexes and guarantees load balance in DHT {1.s. We also show how to leverage the LSH indexing scheme to efficiently process NN search in P2P {1.. Experiments on real world data confirm the effectiveness and efficiency of our approach and show the scalability gains compared to state-of-the-art schemes.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

A dynamic programming algorithm for QoS-aware replica placement in distributed caching systems

引用

Journal of Convergence Information Technology 2012年第12期7卷 226-234页

作者： Wang, Biyao Wang, Jinlin Liu, Xue The Key Lab of Network Communication System and Control The Chinese Academy of Sciences The Key Lab of Network Communication System and Control Anhui Department of Automation University of Science and Technology China National Network New Media Engineering Research Center Institute of Acoustics Chinese Academy of Sciences China

The rapid growth of new information services, especially like new media services, providing content distribution to clients with good quality of service(QoS) while retaining efficient is a great challenge. This paper investigates the QoS-aware replica placement problem (QRPP) for distributed caching system. We propose a dynamic programming algorithm for the problem in general graph, it first ensures the QoS requirement is satisfied of each request, then places the replica along the request forward path to minimize the total cost. The simulation results show the dynamic programming algorithm can achive a good balance between the access latency and the requested avai{1.ility. When the request is more concentrated, the dynamic programming algorithm can have better performance than the MODULO and LRU both in access latency and requested avai{1.ility.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Collaboration filtering recommendation optimization with user implicit feedback

引用

Journal of Computational Information systems 2014年第14期10卷 5855-5862页

作者： Cui, Haomin Zhu, Ming Joint Laboratory of Network Communication System & Control Key Lab of Anhui Department of Automation University of Science and Technology of China Hefei China

Collaboration Filter is one of well-known effective methods for recommendation. The suggestions are based on the mass of user ratings for various items, which are used as explicit feedback. However, implicit feedback such as the time spent on website, how soon the user skipped the song, and the sequence of selected items have also proved to be useful in recommender {1.s. In this paper, we proposed a hybrid recommendation algorithm considering both explicit and implicit feedback to produce better recommended list. An iteration process is proposed for using implicit feedback in order to find effective feedback for recommendation. Time window is also used to limit the impact range of implicit feedback. Experimental results on MovieLens datasets show that the implicit feedback can effectively compensate for the shortcomings of explicit feedback and the proposed algorithm is more accurate than the traditional one. © 201. by Binary Information Press

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

A Bandwidth Smoothing Algorithm Applied in Streaming Media system upon Home {1.

A Bandwidth Smoothing Algorithm Applied in Streaming Media S...

引用

201. 2nd International Conference on Education Technology and Computer(第二届IEEE教育技术与计算机国际会议 ICETC 201.)

作者： Haiwei Wang Peng Sun Xiaoyong Zhu Hong Ni Key Lab of Network Communication System and Control Chinese Academy of Sciences Key Lab of Anhui N National Network New Media Engineering Research Center Institute of AcousticsChinese Academy of Sci

ISBN: (纸本)9781424463671;9781424463688;9781424463701

Bandwidth smoothing can increase the utility of network bandwidth by reducing the burstiness of a VBR (variable bit rate) video stream. To guarantee the quality of service of video-on-command service in home network, data transmission rate should not exceed the maximum data handling capacity of embedded terminals. This paper designs a streaming media system in home network, and puts forward a smoothing algorithm based on greedy algorithm for transmitting VBR video streams subjected to maximum data transmitting rate. The presented algorithm can decrease startup delay of streaming and meet the demand of client buffering requirement under the constraint of maximum transmission rate. Experiment results demonstrate the effectiveness of the presented algorithm.

关键词： home network streaming media system variable bit rate bandwidth smoothing

来源：评论

学校读者我要写书评

暂无评论

R-CHORD: A DISTRIBUTED SIMILARITY RETRIEVAL system WITH RPCID

R-CHORD: A DISTRIBUTED SIMILARITY RETRIEVAL SYSTEM WITH RPCI...

引用

2009 IEEE International Conference on network Infrastructure and Digital Content(2009年IEEE网络基础设施与数字内容国际会议 IEEE IC-NIDC2009)

作者： Wenke Yin Ming Zhu Lan Jiang Joint Laboratory of Network Communication System & Control Key Lab of Anhui Hefei 230027 China Department of Automation University of Science and Technology of China Hefei 230027 China

In order to achieve the access of massive highdimensional data on P2P network efficiently, we present a distributed similarity retrieval {1. named R-Chord using modified iDistance based on Relative Position Code (RPCID). RPCID calculates the lower bound distance between the query point and the data point using Relative Position Code (RPC). RPC is a data object encoding method based on spatial location information. A RPC area can be discarded when the lower bound distance is greater than the pruning distance. Experimental results show that RPCID can achieve better time performance and resource consumption than iDistance.

关键词： Range search K-Nearest-Neighbor search Relative Position Code

来源：评论

学校读者我要写书评

暂无评论

26th Annual Computational Neuroscience Meeting (CNS*201.): Part 3 Antwerp, Belgium. 1.-20 July 201. Abstracts

引用

BMC NEUROSCIENCE 2017年第SUPPL 1期18卷 95-176页

作者： [Anonymous] Department of Neuroscience Yale University New Haven CT 06520 USA Department Physiology & Pharmacology SUNY Downstate Brooklyn NY 11203 USA NYU School of Engineering 6 MetroTech Center Brooklyn NY 11201 USA Departament de Matemàtica Aplicada Universitat Politècnica de Catalunya Barcelona 08028 Spain Institut de Neurobiologie de la Méditerrannée (INMED) INSERM UMR901 Aix-Marseille Univ Marseille France Center of Neural Science New York University New York NY USA Aix-Marseille Univ INSERM INS Inst Neurosci Syst Marseille France Laboratoire de Physique Théorique et Modélisation CNRS UMR 8089 Université de Cergy-Pontoise 95300 Cergy-Pontoise Cedex France Department of Mathematics and Computer Science ENSAT Abdelmalek Essaadi’s University Tangier Morocco Laboratory of Natural Computation Department of Information and Electrical Engineering and Applied Mathematics University of Salerno 84084 Fisciano SA Italy Department of Medicine University of Salerno 84083 Lancusi SA Italy Dipartimento di Fisica Università degli Studi Aldo Moro Bari and INFN Sezione Di Bari Italy Data Analysis Department Ghent University Ghent Belgium Coma Science Group University of Liège Liège Belgium Cruces Hospital and Ikerbasque Research Center Bilbao Spain BIOtech Department of Industrial Engineering University of Trento and IRCS-PAT FBK 38010 Trento Italy Department of Data Analysis Ghent University Ghent 9000 Belgium The Wellcome Trust Centre for Neuroimaging University College London London WC1N 3BG UK Department of Electronic Engineering NED University of Engineering and Technology Karachi Pakistan Blue Brain Project École Polytechnique Fédérale de Lausanne Lausanne Switzerland Departement of Mathematics Swansea University Swansea Wales UK Laboratory for Topology and Neuroscience at the Brain Mind Institute École polytechnique fédérale de Lausanne Lausanne Switzerland Institute of Mathematics University of Aberdeen Aberdeen Scotland UK Department of Integrativ

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：