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

22nd IEEE International Conference on network Protocols, ICNP 2014

作者： Wang, Wei Sun, Yi Zheng, Kai Kaafar, Mohamed Ali Li, Dan Li, Zhongcheng Institute of Computing Technology CAS China State Key Laboratory of Networking and Switching Technology China University of Chinese Academy of Science China IBM China Research Lab China NICTA China Tsinghua University China

ISBN: (纸本)9781479962044

The network resource competition of today' data enters is extremely intense between long-lived elephant flows and latency-sensitive mice flows. Achieving both goals of high throughput and low latency respectively for the two types of flows requires compromise, which recent research has not successfully solved mainly due to the transfer of elephant and mice flows on shared links without any differentiation. However, current data enters usually adopt clos-based topology, e.g. Fat-tree/VL2, so there exist multiple shortest paths between any pair of source and destination. In this paper, we leverage on this observation to propose a flow scheduling scheme, Freeway, to adaptively partition the transmission paths into low latency paths and high throughput paths respectively for the two types of flows. An algorithm is proposed to dynamically adjust the number of the two types of paths according to the real-time traffic. And based on these separated transmission paths, we propose different flow type-specific scheduling and forwarding methods to make full utilization of the bandwidth. Our simulation results show that Freeway significantly reduces the delay of mice flow by 85.8% and achieves 9.2% higher throughput compared with Hedera. © 2014 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Social evolutionary games

Social evolutionary games

引用

International Conference on Game Theory for networks, GameNets

作者： Jianye Yu Yuanzhuo Wang Xiao!ong Jin Xueqi Cheng CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China

In this paper, we introduce a framework of social evolutionary games (SEG) for investigating the evolution of social networks. In a SEG, a coevolutionary mechanism is adopted by agents who aim to improve his short-term utility and long-term reputation. Two examples are presented to demonstrate SEG, prisoner's dilemma game for pairwise interaction and public goods game for group interaction. Numerical simulations are performed on the two examples with different parameter settings, and the results indicates that SEG can be used as a metaphor for investigating the evolution of social networks in some scenarios.

关键词： Microscopy

来源：评论

学校读者我要写书评

暂无评论

Sequential and adaptive sampling for matrix completion in network monitoring systems

Sequential and adaptive sampling for matrix completion in ne...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Kun Xie Lele Wang Xin Wang Gaogang Xie Guangxing Zhang Dongliang Xie Jigang Wen College of Computer Science and Electronics Engineering Hunan University Changsha China State Key Lab of Networking & Switching Tech. Beijing Univ. of Posts and Telecomm. China Department of Electrical and Computer Engineering State University of New York at Stony Brook USA Institute of Computing Technology Chinese Academy of Sciences Beijing China DNSLAB China Internet Network Information Center Beijing China

End-to-end network monitoring is essential to ensure transmission quality for Internet applications. However, in large-scale networks, full-mesh measurement of network performance between all transmission pairs is infeasible. As a newly emerging sparsity representation technique, matrix completion allows the recovery of a low-rank matrix using only a small number of random samples. Existing schemes often fix the number of samples assuming the rank of the matrix is known, while the data features thus the matrix rank vary over time. In this paper, we propose to exploit the matrix completion techniques to derive the end-to-end network performance among all node pairs by only measuring a small subset of end-to-end paths. To address the challenge of rank change in the practical system, we propose a sequential and information-based adaptive sampling scheme, along with a novel sampling stopping condition. Our scheme is based only on the data observed without relying on the reconstruction method or the knowledge on the sparsity of unknown data. We have performed extensive simulations based on real-world trace data, and the results demonstrate that our scheme can significantly reduce the measurement cost while ensuring high accuracy in obtaining the whole network performance data.

关键词： Monitoring Sparse matrices Matrix decomposition Computers Accuracy Conferences Internet

来源：评论

学校读者我要写书评

暂无评论

Account matching across heterogeneous networks

Account matching across heterogeneous networks

引用

International Conference on Game Theory for networks, GameNets

作者： Qiang Liu Jingyuan Li Yuanzhuo Wang Guoliang Xing Yan Ren University of Chinese Academy of Sciences Beijing China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China National Computer Network Emergency Response Technical Team Coordination Center of China Beijing China

ISBN: (纸本)9781479979035

Due to the development of web services, many social network sites, as well as online shopping sites have been booming in the past decade, where it is a common phenomenon that people are likely to use multiple services at the same time. Discovering the correspondence between accounts of a same individual is a crucial prerequisite for many interesting cross network applications, such as improving the recommendation performance of the online shopping sites by using extra information from social network services. In this paper, we propose a gametheoretic method to identify correlation accounts of individuals between social network sites and online shopping sites with stable matching model, incorporating accounts profiles as well as historical behaviors. The results show that our method identifies up to 70% of correlation accounts between Facebook and eBay, one of the most popular social network sites and online shopping sites in the world, respectively.

关键词： Games Lead

来源：评论

学校读者我要写书评

暂无评论

Freeway: Adaptively Isolating the Elephant and Mice Flows on Different Transmission Paths

Freeway: Adaptively Isolating the Elephant and Mice Flows on...

引用

International Conference on network Protocols

作者： Wei Wang Yi Sun Kai Zheng Mohamed Ali Kaafar Dan Li Zhongcheng Li University of Chinese Academy of Science CAS Institute of Computing Technology State Key Laboratory of Networking Switching Technology IBM China Research Lab NICTA Australia Tsinghua University

关键词： Mice Throughput Traffic control Heuristic algorithms Partitioning algorithms Topology network topology

来源：评论

学校读者我要写书评

暂无评论

Social sensing enhanced time estimation for bus service

引用

Concurrency and Computation: Practice and Experience 2015年第15期27卷

作者： Jin Liu Juan Li Xiaohui Cui Xiaoguang Niu Xiaoping Sun Jing Zhou State Key Lab. of Software Engineering Computer School Wuhan University Wuhan China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin China International School of Software Wuhan University Wuhan China Computer School Wuhan University Wuhan China Key Lab of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science Communication University of China China

The precise prediction of bus routes or the arrival time of buses for a traveler can enhance the quality of bus service. However, many social factors influence people's preferences for taking buses. These social factors may include heavy traffic cost, traffic congestion, poor air quality and so forth. Existing prediction techniques rarely consider social sensing when predicting the bus arrival time. Accordingly, this paper proposes a social sensing enhanced service for predicting bus routes, which integrates sensing ability and social networks to understand and measure the influence between social events and vehicle velocity. We focus on the analysis of two different attributions: PT service quality attributions PEA s and road condition attributions PRCA s. Both of them synthesize the social sensing in their evaluation of bus routes. PEA represents individual preferences and PRCA represents physical factors that significantly influence vehicle velocity. Bus relevant social events were further categorized into PEA events or PRCA events. PEA s of buses were scored according to the tendency of bus conditions reflected in social events. Furthermore, an artificial neural network prediction model is established to estimate the bus travel time. Copyright © 2015 John Wiley & Sons, Ltd.

关键词： social sensing in-time bus service bus route arrival time estimation

来源：评论

学校读者我要写书评

暂无评论

Addressing the energy hole problem based on heterogeneous clustering size for wireless sensor networks

引用

Journal of Computational Information Systems 2014年第9期10卷 3973-3980页

作者： Song, Xiaoying Wen, Tao Guo, Quan Ma, Fengming Zhang, Dongqing Software Center Northeastern University Shenyang 110819 China Liaoning Key Lab. of Network Security and Computing Technology Dalian Neusoft Information Institute Dalian 116023 China School of Management Science Qufu Normal University Rizhao Shandong 276800 China

Clustering is one of the effective ways to solve energy hole problem for Wireless Sensor network. So far, the approaches of heterogeneous cluster size mainly have concentrated on the design of unequal cluster protocol rather than the optimal cluster radius theoretically. Furthermore, the existing protocols of data gathering fall short in the extra energy dissipation of the rotating cluster head frequently. To overcome these limitations, in this paper, we first present the theoretical analysis to obtain the optimal number of cluster when the energy dissipation is balancing in the whole network. Then, the optimal cluster radius of different rings is obtained by theoretical analysis as well. In succession, a simple and effective strategy is proposed to further prolong the network lifetime on basis of the optimal cluster radius obtained theoretically. Finally, the simulation results demonstrate the performance advantages of our approach. © 2014 Binary Information Press.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Parametric local multimodal hashing for cross-view similarity search

Parametric local multimodal hashing for cross-view similarit...

引用

23rd International Joint Conference on Artificial Intelligence, IJCAI 2013

作者： Zhai, Deming Chang, Hong Zhen, Yi Liu, Xianming Chen, Xilin Gao, Wen School of Computer Science and Technology Harbin Institute of Technology Harbin China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China Hong Kong University of Science and Technology Hong Kong Hong Kong

ISBN: (纸本)9781577356332

Recent years have witnessed the growing popularity of hashing for efficient large-scale similarity search. It has been shown that the hashing quality could be boosted by hash function learning (HFL). In this paper, we study HFL in the context of multimodal data for cross-view similarity search. We present a novel multimodal HFL method, called Parametric Local Multimodal Hashing (PLMH), which learns a set of hash functions to locally adapt to the data structure of each modality. To balance locality and computational efficiency, the hashing projection matrix of each instance is parameterized, with guaranteed approximation error bound, as a linear combination of basis hashing projections of a small set of anchor points. A local optimal conjugate gradient algorithm is designed to learn the hash functions for each bit, and the overall hash codes are learned in a sequential manner to progressively minimize the bias. Experimental evaluations on cross-media retrieval tasks demonstrate that PLMH performs competitively against the state-of-the-art methods.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Mining dynamical frequent itemsets based on ant colony algorithm

Mining dynamical frequent itemsets based on ant colony algor...

引用

IEEE International Conference on Computer science and Automation Engineering (CSAE)

作者： Chen, Shengbing Wang, Xiaofeng Wang, Xiaofang Key Lab of Network and Intelligent Information Processing Hefei University Hefei 230601 China Department of Computer Science and Technology Hefei University Hefei 230601 China Intelligent Computing Lab Institute of Intelligent Machines Chinese Academy of Sciences Hefei 230031 China Department of Computer Artillery Academy Hefei 230031 China

ISBN: (纸本)9781424487257

Mining frequent itemsets is a core problem in many data mining tasks, most existing works on mining frequent itemsets can only capture the long-term and static frequency itemsets, they do not suit the task whose frequent itemsets often change. Using the theory of ant colony algorithm, we proposed a new method for mining dynamical frequent itemset(called AC-MFI). The method considers the item of transaction as a node in the path, takes the itemset as a path, and takes each transaction as a foraging behavior. According to the pheromone updating policy of ant colony algorithm, AC-MFI mines dynamical frequent itemsets from transaction data stream. Experiment results show that the method is valid and practicable. © 2011 IEEE.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

Context-specific miRNA regulation network predicts cancer prognosis

Context-specific miRNA regulation network predicts cancer pr...

引用

IEEE International Conference on Systems Biology

作者： Xionghui Zhou Juan Liu Changning Liu Simon Rayner Fengji Liang Jingfang Ju Yinghui Li Shanguang Chen Jianghui Xiong School of Computer Science Wuhan University Wuhan China Bioinformatics Research Group Key Laboratory of Intelligent Information Processing Advanced Computing Research Laboratory Institute of Computing Technology Chinese Academy of Sciences (CAS) Beijing China Bioinformatics Group State Key Laboratory of Virology Wuhan Institute of Virology Chinese Academy of Sciences (CAS) Wuhan China Bioinformatics Group and Data Coordination Center State Key Laboratory of Space Medicine Fundamentals and Application China Astronaut Research and Training Center Beijing China Department of Pathology Stony Brook University Medical Center New York USA

MicroRNAs can regulate hundreds of target genes and play a pivotal role in a broad range of biological process. However, relatively little is known about how these highly connected miRNAs-target networks are remodelled in the context of various diseases. Here we examine the dynamic alteration of context-specific miRNA regulation to determine whether modified microRNAs regulation on specific biological processes is a useful information source for predicting cancer prognosis. A new concept, Context-specific miRNA activity (CoMi activity) is introduced to describe the statistical difference between the expression level of a miRNA's target genes and non-targets genes within a given gene set (context).

关键词： Breast cancer Context Correlation Biological processes Metastasis Tumors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：