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

作者： Xie, Kun Wang, Lele Wang, Xin Xie, Gaogang Wen, Jigang Zhang, Guangxing Cao, Jiannong Zhang, Dafang College of Computer Science and Electronics Engineering Hunan University Changsha410006 China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing100864 China Department of Electrical and Computer Engineering State University of New York at Stony Brook Stony BrookNY11794 United States Network Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing100864 China Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong

The inference of traffic volume of the whole network from partial traffic measurements becomes increasingly critical for various network engineering tasks, such as capacity planning and anomaly detection. Previous studies indicate that the matrix completion is a possible solution for this problem. However, as a 2-D matrix cannot sufficiently capture the spatial-temporal features of traffic data, these approaches fail to work when the data missing ratio is high. To fully exploit hidden spatial-temporal structures of the traffic data, this paper models the traffic data as a 3-way traffic tensor and formulates the traffic data recovery problem as a low-rank tensor completion problem. However, the high computation complexity incurred by the conventional tensor completion algorithms prevents its practical application for the traffic data recovery. To reduce the computation cost, we propose a novel sequential tensor completion algorithm, which can efficiently exploit the tensor decomposition result based on the previous traffic data to derive the tensor decomposition upon arriving of new data. Furthermore, to better capture the changes of data correlation over time, we propose a dynamic sequential tensor completion algorithm. To the best of our knowledge, we are the first to propose sequential tensor completion algorithms to significantly speed up the traffic data recovery process. This facilitates the modeling of Internet traffic with the tensor to well exploit the hidden structures of traffic data for more accurate missing data inference. We have done extensive simulations with the real traffic trace as the input. The simulation results demonstrate that our algorithms can achieve significantly better performance compared with the literature tensor and matrix completion algorithms even when the data missing ratio is high. © 1993-2012 IEEE.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

Stacked Cross Refinement network for Edge-Aware Salient Object Detection

Stacked Cross Refinement Network for Edge-Aware Salient Obje...

引用

International Conference on Computer Vision (ICCV)

作者： Zhe Wu Li Su Qingming Huang School of Computer Science and Technology University of Chinese Academy of Sciences (UCAS) Beijing China Key Lab of Big Data Mining and Knowledge Management UCAS Beijing China Key Lab of Intell. Info. Process. Inst. of Comput. Tech. CAS Beijing China Peng Cheng Laboratory ShenZhen China

ISBN: (数字)9781728148038

ISBN: (纸本)9781728148045

Salient object detection is a fundamental computer vision task. The majority of existing algorithms focus on aggregating multi-level features of pre-trained convolutional neural networks. Moreover, some researchers attempt to utilize edge information for auxiliary training. However, existing edge-aware models design unidirectional frameworks which only use edge features to improve the segmentation features. Motivated by the logical interrelations between binary segmentation and edge maps, we propose a novel Stacked Cross Refinement network (SCRN) for salient object detection in this paper. Our framework aims to simultaneously refine multi-level features of salient object detection and edge detection by stacking Cross Refinement Unit (CRU). According to the logical interrelations, the CRU designs two direction-specific integration operations, and bidirectionally passes messages between the two tasks. Incorporating the refined edge-preserving features with the typical U-Net, our model detects salient objects accurately. Extensive experiments conducted on six benchmark datasets demonstrate that our method outperforms existing state-of-the-art algorithms in both accuracy and efficiency. Besides, the attribute-based performance on the SOC dataset show that the proposed model ranks first in the majority of challenging scenes. Code can be found at https://***/wuzhe71/SCAN.

关键词： Image edge detection Task analysis Feature extraction Object detection Image segmentation Silicon Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Improved Upper Bound on the network Function Computing Capacity

Improved Upper Bound on the Network Function Computing Capac...

引用

作者： Guang, Xuan Yeung, Raymond W. Yang, Shenghao Li, Congduan School of Mathematical Sciences and LPMC Nankai University Tianjin300071 China Institute of Network Coding Chinese University of Hong Kong Hong Kong Hong Kong Department of Information Engineering Chinese University of Hong Kong Hong Kong Hong Kong School of Science and Engineering Chinese University of Hong Kong Shenzhen518172 China Shenzhen Key Laboratory of IoT Intelligent Systems and Wireless Network Technology Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen518172 China School of Electronics and Communication Engineering Sun Yat-sen University Guangzhou510006 China

The problem of network function computation over a directed acyclic network is investigated in this paper. In such a network, a sink node desires to compute with zero error a target function, of which the inputs are generated at multiple source nodes. The edges in the network are assumed to be error-free and have limited capacity. The nodes in the network are assumed to have unbounded computing capability and be able to perform network coding. The computing rate of a network code that can compute the target function over the network is the average number of times that the target function is computed with zero error for one use of the network. In this paper, we obtain an improved upper bound on the computing capacity, which is applicable to arbitrary target functions and arbitrary network topologies. This improved upper bound not only is an enhancement of the previous upper bounds but also is the first tight upper bound on the computing capacity for computing an arithmetic sum over a certain non-tree network, which has been widely studied in the literature. We also introduce a multi-dimensional array approach that facilitates evaluation of the improved upper bound. Furthermore, we apply this bound to the problem of computing a vector-linear function over a network. With this bound, we are not only able to enhance a previous result on computing a vector-linear function over a network but also simplify the proof significantly. Finally, we prove that for computing the binary maximum function over the reverse butterfly network, our improved upper bound is not achievable. This result establishes that in general our improved upper bound is non-achievable, but whether it is asymptotically achievable or not remains open. © 1963-2012 IEEE.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

A comprehensive analysis of video service quality on IQIYI from large-scale data sets 13th

A comprehensive analysis of video service quality on IQIYI f...

引用

13th International Conference on Heterogeneous networking for Quality, Reliability, Security and Robustness, QShine 2017

作者： Guo, Yao Lv, Qiujian Liu, Fang Yang, Jie Gao, Zhe Beijing Laboratory of Advanced Information Networks Beijing Key Laboratory of Network System Architecture and Convergence Center for Data Science BUPT Beijing100876 China Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China Technology Research Institute Aisino Corporation Beijing100086 China

ISBN: (纸本)9783319780771

With the proliferation of online video, measuring the quality of the video service has become a vital aspect for improving user’s experience. Recent work shows that measurable quality metrics such as buffering, bitrate, and video resolutions impact user’s experience, but none of them reveal the real relationships between these metrics and user’s actual experience. This paper attempts to solve the problem above. We use IQIYI as the sample, and our large-scale dataset consists of 7 days real Internet traffic in a northern city of China. We quantify user’s experience at per-video level (or view). Using Apache Spark, we extract some video events and calculate several quality metrics. In order to investigate the relationship between the metrics and user’s experience, we use the FP-Growth algorithm to mining the implicit association rules and get some interesting results. © ICST Institute for Computer sciences, Social Informatics and Telecommunications Engineering 2018.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

Dynamic-K recommendation with personalized decision boundary 23rd

Dynamic-K recommendation with personalized decision boundary

引用

23rd China conference on Information Retrieval, CCIR 2017

作者： Gao, Yan Guo, Jiafeng Lan, Yanyan Liao, Huaming CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783319686981

In this paper, we investigate the recommendation task in the most common scenario with implicit feedback (e.g., clicks, purchases). State-of-the-art methods in this direction usually cast the problem as to learn a personalized ranking on a set of items (e.g., webpages, products). The top-N results are then provided to users as recommendations, where the N is usually a fixed number pre-defined by the system according to some heuristic criteria (e.g., page size, screen size). There is one major assumption underlying this fixed-number recommendation scheme, i.e., there are always sufficient relevant items to users’ preferences. Unfortunately, this assumption may not always hold in real-world scenarios. In some applications, there might be very limited candidate items to recommend, and some users may have very high relevance requirement in recommendation. In this way, even the top-1 ranked item may not be relevant to a user’s preference. Therefore, we argue that it is critical to provide a dynamic-K recommendation, where the K should be different with respect to the candidate item set and the target user. We formulate this dynamic-K recommendation task as a joint learning problem with both ranking and classification objectives. The ranking objective is the same as existing methods, i.e., to create a ranking list of items according to users’ interests. The classification objective is unique in this work, which aims to learn a personalized decision boundary to differentiate the relevant items from irrelevant items. Based on these ideas, we extend two state-of-the-art ranking-based recommendation methods, i.e., BPRMF and HRM, to the corresponding dynamic-K versions, namely DK-BPRMF and DK-HRM. Our experimental results on two datasets show that the dynamic-K models are more effective than the original fixed-N recommendation methods. © Springer International Publishing AG 2017.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Beyond precision: A study on recall of initial retrieval with neural representations

arXiv

引用

arXiv 2018年

作者： Xiao, Yan Guo, Jiafeng Fan, Yixing Lan, Yanyan Xu, Jun Cheng, Xueqi University of Chinese Academy of Sciences Beijing China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

Vocabulary mismatch is a central problem in information retrieval (IR), i.e., the relevant documents may not contain the same (symbolic) terms of the query. Recently, neural representations have shown great success in capturing semantic relatedness, leading to new possibilities to alleviate the vocabulary mismatch problem in IR. However, most existing efforts in this direction have been devoted to the re-ranking stage. That is to leverage neural representations to help re-rank a set of candidate documents, which are typically obtained from an initial retrieval stage based on some symbolic index and search scheme (e.g., BM25 over the inverted index). This naturally raises a question: If the relevant documents have not been found in the initial retrieval stage due to vocabulary mismatch, there would be no chance to re-rank them to the top positions later. Therefore, in this paper, we study the problem how to employ neural representations to improve the recall of relevant documents in the initial retrieval stage. Specifically, to meet the efficiency requirement of the initial stage, we introduce a neural index for the neural representations of documents, and propose two hybrid search schemes based on both neural and symbolic indices, namely the parallel search scheme and the sequential search scheme. Our experiments show that both hybrid index and search schemes can improve the recall of the initial retrieval stage with small overhead. Copyright © 2018, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Coarse to fine: Diffusing categories in wikipedia 26

Coarse to fine: Diffusing categories in wikipedia

引用

26th International World Wide Web Conference, WWW 2017 Companion

作者： Cai, Pengshan Feng, Yansong Jia, Yantao Wang, Yuanzhuo Jin, Xiaolong Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China Institute of Computer Science and Technology Peking University Beijing China

ISBN: (纸本)9781450349147

Automatic taxonomy construction aims to build a categorization system without human efforts. Traditional textual pattern based methods extract hyponymy relation in raw texts. However, these methods usually yield low precision and recall. In this paper, we propose a method to automatically find diffusing attributes to a category from Wikipedia infoboxes. We use the diffusing attribute to diffuse a coarse-grained category into several fine-grained subcategories and generate a finer-grained taxonomy. Experiments show our method can find proper diffusing attributes to categories across various domains. © 2017 International World Wide Web Conference Committee (IW3C2), published under Creative Commons CC BY 4.0 License.

关键词： Taxonomies

来源：评论

学校读者我要写书评

暂无评论

Revisiting Cloud Migration: Strategies and Methods

引用

Journal of Physics: Conference Series 2020年第1期1575卷

作者： Zhixiao Wang Wenyao Yan Wendong Wang School of Computer Science and Engineering Xi'an University of Technology Xi'an 710048 China Shaanxi Key Laboratory Xi'an of Network Computing and Security Technology China School of Data Science and Computer Xi'an innovation college of Yan'an University Xi'an 710100 China Yan'an University Xi'an 716000 China

Cloud computing attracts users with its advantage of unlimited resource supply where resources can be elastically expanded on demand and balanced-load at the same time. This means that the application in the cloud environment should run in the way of elastic expansion cluster. At present, most of the elastic expansion and load balancing technologies provided by IaaS level are oriented to virtual machines (VM), with little consideration of application level, which does not fundamentally meet the needs of users. Based on this, starting from the motivation of cloud migration, we first analyse the cloud migration technology from three aspects: migration object, migration means and migration objectives, then explore the cloud migration criteria and four cloud migration strategies at the application level in the cloud environment, and point out that cloud migration should be optimized and maintained in terms of elastic expansion, load balancing, security, etc.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A hybrid algorithm based on ILP and genetic algorithm for time-aware test case prioritization

引用

Journal of Southeast University(English Edition) 2018年第1期34卷 28-35页

作者： Sun Jiaze Wang Gang School of Computer Science and Technology Xi’anUniversity of Posts and TelecommunicatioosXi’an 710121China Shaanxi Key Laboratory of Network Data Intelligent Processing X’an University of Posts and TelecommunicationsX’an 710121China

To solve the problem of time-awarc test case prioritization,a hybrid algorithm composed of integer linear programming and the genetic algorithm(ILP-GA)is ***,the test case suite which cm maximize the number of covered program entities a d satisfy time constraints is selected by integer linea ***,the individual is encoded according to the cover matrices of entities,and the coverage rate of program entities is used as the fitness function and the genetic algorithm is used to prioritize the selected test *** typical open source projects are selected as benchmark *** and method are selected as program entities,and time constraint percentages a e 25%and 75%.The experimental results show that the ILP-GA convergence has faster speed and better stability than ILP-additional and IP-total in most cases,which contributes to the detection of software defects as early as possible and reduces the software testing costs.

关键词： test case prioritization integer linear programming(I LP) genetic algorithm time constraint

来源：评论

学校读者我要写书评

暂无评论

Neural or statistical: An empirical study on language models for Chinese input recommendation on mobile 23rd

Neural or statistical: An empirical study on language models...

引用

23rd China conference on Information Retrieval, CCIR 2017

作者： Zhang, Hainan Lan, Yanyan Guo, Jiafeng Xu, Jun Cheng, Xueqi CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China

ISBN: (纸本)9783319686981

Chinese input recommendation plays an important role in alleviating human cost in typing Chinese words, especially in the scenario of mobile applications. The fundamental problem is to predict the conditional probability of the next word given the sequence of previous words. Therefore, statistical language models, i.e.n-grams based models, have been extensively used on this task in real application. However, the characteristics of extremely different typing behaviors usually lead to serious sparsity problem, even n-gram with smoothing will fail. A reasonable approach to tackle this problem is to use the recently proposed neural models, such as probabilistic neural language model, recurrent neural network and word2vec. They can leverage more semantically similar words for estimating the probability. However, there is no conclusion on which approach of the two will work better in real application. In this paper, we conduct an extensive empirical study to show the differences between statistical and neural language models. The experimental results show that the two different approach have individual advantages, and a hybrid approach will bring a significant improvement. © Springer International Publishing AG 2017.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：