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

International Wireless Communications and Mobile computing Conference, IWCMC

作者： Kai Pan Hui Li Shuo-Yen Robert Li Qin Shi Weijuan Yin Shenzhen Key Laboratory of Cloud Computing Technology & Application Shenzhen Graduate School Peking University China Department of Information Engineering Chinese University of Hong Kong China Peking University Beijing Beijing CN

Emerging as an important potential approach to the operation of lossy communication networks, Network Coding (NC) has been proposed to combine with TCP called TCP-NC by MIT. However, the key parameter R that is brought in for sending redundant packets against random loss is preseted and stays constant, therefore, chances are that it may fail to work. In this paper, we proposed a dynamic redundancy algorithm to control the number of sending packets. The algorithm is executed at the time of every arrival of feedback and makes redundancy approximate the loss rate as much as possible. All of these is done by the sender who is completely unconscious of the network situation. Simulation results under hybrid networks show that our new protocol retains all the advantages of TCP-NC over TCP-Reno and TCP-Westwood in terms of channel utilization and overall throughput, and simultaneously outperforms TCP-NC in time-varying light-load hybrid networks.

关键词： Receivers Throughput Protocols Redundancy Heuristic algorithms Indexes Loss measurement

来源：评论

学校读者我要写书评

暂无评论

A novel framework of online network coding for multicast switches with constrained buffers

引用

Journal of Electronics 2011年第4期28卷 460-467页

作者： Wang, Wei Yu, Li Zhu, Guangxi Li, Hui Wuhan National Lab. for Optoelectronics Division of Communiction and Intelligent Networks Department of Electronics and Information Engineering Huazhong University of Science and Technology Wuhan 430074 China Shenzhen Key Lab of Cloud Computing Technology and Application Shenzhen Graduate School Peking University Shenzhen 518055 China Department of Electronics and Information Engineering Huazhong University of Science and Technology Wuhan 430074 China

Network coding is able to address output conflicts when fanout splitting is allowed for multicast switching. Hence, it successfully achieves a larger rate region than non-coding approaches in crossbar switches. However, network coding requires large coding buffers and a high computational cost on encoding and decoding. In this paper, we propose a novel Online Network Coding framework called Online NC for multicast switches, which is adaptive to constrained buffers. Moreover, it enjoys a much lower decoding complexity O(n ²) by a Vandermonde matrix based approach, as compared to conventional randomized network coding O(n ³). Our approach realizes online coding with one coding algorithm that synchronizes buffering and coding. Therefore, we significantly reduce requirements on buffer space, while also sustaining high throughputs. We confirm the superior advantages of our contributions using empirical studies. © 2011 Science Press, Institute of Electronics, CAS and Springer-Verlag Berlin Heidelberg.

关键词： Multicast Network coding Packet switching Vandermonde matrix

来源：评论

学校读者我要写书评

暂无评论

Constructing Multiple Scene Graphs in Distributed Environment

引用

Computer Aided Drafting,Design and Manufacturing 2015年第1期25卷 16-21页

作者： XIA Rui WANG Guo-ping LI Sheng WANG Heng Shenzhen Key Lab for Cloud Computing Technology and Applications Shenzhen Graduate School of Peking University Graphics & Interaction Lab. School of Electronics Engineering and Computer SciencesPeking University Beijing Engineering Technology Research Center of Virtual Simulation and Visualization Peking University

Scene graph is a infrastructure of the virtual reality system to organize the virtual scene with abstraction, it can provide facility for the rendering engine and should be integrated effectively on demand into a real-time system, where a large quantities of scene objects and resources can be manipulated and managed with high flexibility and reliability. We present a new scheme of multiple scene graphs to accommodate the features of rendering engine and distributed systems. Based upon that, some other functions, e.g. block query, interactive editing, permission management, instance response, ＂redo＂ and ＂undo＂, are implemented to satisfy various requirements. At the same time, our design has compatibility to popular C/S architecture with good concurrent performance. Above all, it is convenient to be used for further development. The results of experiments including responding time demonstrate its good performance.

关键词： multiple scene graphs authority scene editing distributed systems

来源：评论

学校读者我要写书评

暂无评论

An Entropy-based Probabilistic Forwarding Strategy in Named Data Networking

An Entropy-based Probabilistic Forwarding Strategy in Named ...

引用

IEEE International Conference on Communications

作者： Kai Lei Jiawei Wang Jie Yuan Institute of Big Data Technologies Shenzhen Key Lab for Cloud Computing Technology & Applications School of Electronics and Computer Engineering (SECE) Peking University

ISBN: (纸本)9781467364300

The forwarding strategy is the key to the resiliency and efficiency of Named Data Networking (NDN), which is a new and fundamental research area. For forwarding strategy, dynamically selecting an optimal interface from multiple alternative interfaces to forward an Interest packet is indeed a multiple attribute decision making (MADM) problem. In this paper, an entropy-based probabilistic forwarding (EPF) strategy is proposed to make a stochastic interface selection based on the combination of interfaces' dynamic availabilities and static routing information, which achieves better load balance in comparison with deterministic interface selection. By objectively assigning weights to attributes and considering multiple real-time network condition metrics, EPF can obtain the availabilities of interfaces more accurately and comprehensively. Since additional network metrics can be easily added and integrated into interfaces' assessment model, EPF provides good extensibility. In addition, we innovatively define two parameters (γ, δ) which can be used to trade off the effect factors between static routing information and dynamic running status of interfaces to customize EPF strategy for different network and application scenarios. Experiments show that EPF can realize preferable load balance and achieve higher throughput compared to the representative BestRoute forwarding strategy.

关键词： Entropy Throughput Routing Probabilistic logic Load modeling Packet loss

来源：评论

学校读者我要写书评

暂无评论

Understanding Sina Weibo online social network: A community approach

Understanding Sina Weibo online social network: A community ...

引用

2013 IEEE Global Communications Conference (GLOBECOM)

作者： Kai Lei Kai Zhang Kuai Xu Shenzhen Key Lab for Cloud Computing Technology & Applications (SPCCTA) Peking University Shenzhen P.R. China School of Mathematical and Natural Sciences Arizona State University

ISBN: (纸本)9781479913510

Sina Weibo, one of the most popular online social networks in China, has recently become a critical medium for Internet users to disseminate and discuss breaking news, social events and other information. Although online social networks and social media have received significant attention from the research community, few studies have focused on Sina Weibo due to the lack of data collection. Given the sheer size of Sina Weibo online social network and vast amount of tweets, retweets and comments, this paper introduces a novel community approach for understanding Sina Weibo online social network. Specifically, we collect all Weibo users registered with shenzhen as primary geographic location, and build a shenzhen Weibo community graph based on their following or follower relationships. Our experimental results describe interesting graphical characteristics such as clustering coefficients of this community graph, and reveal the impact of user popularity on tweet influence. Through modeling interactions of shenzhen Weibo users and their tweeted messages with bipartite graphs and one-mode projections, we analyze the similarity of retweeting and commenting activities among these users, and discuss the implications of the findings on understanding different types of user accounts and the motivations of their following and retweeting behaviors. To the best of our knowledge, this study is the first effort to introduce a community approach for understanding the community characteristics of Sina Weibo and characterizing the similarity of retweeting behaviors and following relationships.

关键词： Communities Educational institutions Correlation Data collection Bipartite graph Twitter

来源：评论

学校读者我要写书评

暂无评论

Hot topic analysis and content mining in social media

Hot topic analysis and content mining in social media

引用

IEEE International Conference on Performance, computing and Communications (IPCCC)

作者： Qian Yu WeiTao Weng Kai Zhang Kai Lei Kuai Xu Shenzhen Key Lab for Cloud Computing Technology & Applications (SPCCTA) Peking University Shenzhen P.R. China School of Mathematical and Natural Sciences Arizona State University

ISBN: (纸本)9781479975761

Sina Weibo has become an increasingly critical social media in China for sharing latest news, marketing new products, and discussing controversial issues. The rising importance of Sina Weibo on the society makes it very important to understand “what”, “when”, “who” on hot topics that are being continuously tweeted and searched by millions of active users. In this paper, we develop a systematic approach to characterize temporal distribution of hot topics searched by Sina Weibo users over a four-month time-span and to uncover correlated hot topics that are not only tweeted by the same users, but also appear in the similar set of tweet messages. We analyze real-time Sina Weibo tweet data streams and study volume correlations and temporal gaps between user searches and tweeting activities on hot topics. In addition, we examine the correlations between hot topic searches on social media and on search engines to understand hot topics and user behaviors across different platforms. Given the challenges of analyzing massive amount of tweet data, we explore Hadoop MapReduce framework to effectively process millions of tweets from the collected data-sets, and quantify the performance benefits of MapReduce on analyzing tweet streams. To the best of our knowledge, this paper is the first effort to characterize temporal search patterns of hot topics on Sina Weibo and to study their correlations with tweeting data streams as well as search engine statistics.

关键词： Media Search engines Correlation Web search Engines TV Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Synchronous network coding algorithm based on Galois field

引用

Nanjing Li Gong Daxue Xuebao/Journal of Nanjing University of Science and technology 2012年第SUPPL.1期36卷 44-51页

作者： Li, Jiang Chen, Jia Li, Yi-Ning Li, Hui Shenzhen Key Lab of Cloud Computing Technology and Application Shenzhen Graduate School Peking University Shenzhen 518055 China Shenzhen Media Group Shenzhen 518055 China

A network coding(NC) algorithm based on hardware logic is presented. At first, a synchronous mechanism to solve the challenge of transmission-rate mismatch in the real network is proposed. Then a novel method to accelerate the dot product process over Galois field(GF) is designed. The whole work aims at achieving the wire speed of the hardware logic. Both encoding and decoding operations can be completed in several hundred nanoseconds. The test results show that the NC multicast communication using this algorithm can achieve the limit flow of the max-flow min-cut theorem, and the throughput is improved by using NC.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Internet Traffic Analysis Using Community Detection and Apache Spark

Internet Traffic Analysis Using Community Detection and Apac...

引用

第九届网络分布式计算与知识发现国际会议( 2017 International Conference on Cyber-enabled distributed computing and knowledge discovery)

作者： Jiake Ni Weitao Weng Jiayu Chen Kai Lei Institute of Big Data Technologies Shenzhen Key Lab for Cloud Computing Technology & Applications School of Electronic and Computer Engineering(SECE)Peking University SHENZHEN 518055P.R.CHINA

With the rapid development of Internet,Internet traffic and end hosts continue to grow in *** behavior analysis for a large-scale network is becoming more and more *** address these challenges,this paper proposes an Internet traffic analysis approach based on community detection to discover community consisted of end hosts with similar traffic behavior in a large campus ***,we use only the IP-to-IP information without packet payloads to model the similarity of end hosts in campus *** the similarity graph which represent the social behavior similarity of all end hosts is ***,we leverage label Propagation algorithm to discover end hosts community on the similarity *** satisfy demands for the scalable analysis of evergrowing Internet traffic data,a Spark-based Internet traffic analysis system is developed,including implementing the above *** experimental results based on real campus network traffic show the benefits of the proposed approach in analyzing traffic behavior of a large-scale network on host community level and detecting potential anomalous traffic *** proposed approach reduces the complexity of analyzing the traffic behavior of a large network compare with analyzing individual *** addition,the experimental results also demonstrate the Spark-based Internet traffic analysis system can analyze Internet traffic efficiently.

关键词： Internet traffic analysis community detection Apache Spark data mining

来源：评论

学校读者我要写书评

暂无评论

The real implementation of NDN forwarding strategy on Android smartphone

The real implementation of NDN forwarding strategy on Androi...

引用

IEEE Annual Ubiquitous computing, Electronics & Mobile Communication Conference (UEMCON)

作者： Xuewei Piao Lei Huang Kaiqi Yuan Jie Yuan Kai Lei School of Electronic and Computer Engineering (SECE) Peking University Shenzhen P.R. China Shenzhen Key Lab for Cloud Computing Technology & Applications (SPCCTA) Peking University Shenzhen P.R. China

ISBN: (纸本)9781509014972

A prototype system of Named Data Networking (NDN) wireless communication for Android is established based on NDN Forwarding Daemon (NFD). By porting NDN to Raspberry Pi and Android smartphone, the NDN-based Android application can connect to an NDN-supported access point built on Raspberry Pi, and communicate with remote NDN Testbed. As a contribution, this paper make a preliminary exploration on deploying NDN on Android terminals and interfacing Android smartphones with multiple NDN networks, on which various NDN forwarding strategies can be tested.

关键词： Androids Humanoid robots Wireless communication Java Libraries Routing Protocols

来源：评论

学校读者我要写书评

暂无评论

A Knowledge Graph based Solution for Entity Discovery and Linking in Open-domain Questions

arXiv

引用

arXiv 2018年

作者： Lei, Kai Zhang, Bing Deng, Yang Zhang, Dongyu Shen, Ying Institute of Big Data Technologies Shenzhen Key Lab for Cloud Computing Technology & Applications Peking University SHENZHENP.R518055 China C.S. Depart. Harbin Institute of Technology

Named entity discovery and linking is the fundamental and core component of question answering. In Question Entity Discovery and Linking (QEDL) problem, traditional methods are challenged because multiple entities in one short question are difficult to be discovered entirely and the incomplete information in short text makes entity linking hard to implement. To overcome these difficulties, we proposed a knowledge graph based solution for QEDL and developed a system consists of Question Entity Discovery (QED) module and Entity Linking (EL) module. The method of QED module is a tradeoff and ensemble of two methods. One is the method based on knowledge graph retrieval, which could extract more entities in questions and guarantee the recall rate, the other is the method based on Conditional Random Field (CRF), which improves the precision rate. The EL module is treated as a ranking problem and Learning to Rank (LTR) method with features such as semantic similarity, text similarity and entity popularity is utilized to extract and make full use of the information in short texts. On the official dataset of a shared QEDL evaluation task, our approach could obtain 64.44% F1 score of QED and 64.86% accuracy of EL, which ranks the 2nd place and indicates its practical use for QEDL problem. Copyright © 2018, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：