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

Identifying Crashing Fault Residence Based on Cross Project Model

学校读者我要写书评

暂无评论

Identifying Crashing Fault Residence Based on Cross Project ...

International Symposium on Software Reliability Engineering (ISSRE)

作者： Zhou Xu Tao Zhang Yifeng Zhang Yutian Tang Jin Liu Xiapu Luo Jacky Keung Xiaohui Cui School of Computer Science Wuhan University China Department of Computing The Hong Kong Polytechnic University China College of Computer Science and Technology Harbin Engineering University China Key Laboratory of Network Assessment Technology Institute of Information Engineering Chinese Academy of Sciences China Department of Computer Science City University of Hong Kong China School of Cyber Science and Engineering Wuhan University China

ISBN: (纸本)9781728149837

Analyzing the crash reports recorded upon software crashes is a critical activity for software quality assurance. Predicting whether or not the fault causing the crash (crashing fault for short) resides in the stack traces of crash reports can speed-up the program debugging process and determine the priority of the debugging efforts. Previous work mostly collected label information from bug-fixing logs, and extracted crash features from stack traces and source code to train classification models for the Identification of Crashing Fault Residence (ICFR) of newly-submitted crashes. However, labeled data are not always fully available in real applications. Hence the classifier training is not always feasible. In this work, we make the first attempt to develop a cross project ICFR model to address the data scarcity problem. This is achieved by transferring the knowledge from external projects to the current project via utilizing a state-of-the-art Balanced Distribution Adaptation (BDA) based transfer learning method. BDA not only combines both marginal distribution and conditional distribution across projects but also assigns adaptive weights to the two distributions for better adjusting specific cross project pair. The experiments on 7 software projects show that BDA is superior to 9 baseline methods in terms of 6 indicators overall.

关键词： feature extraction learning (artificial intelligence) pattern classification program debugging project management software fault tolerance software quality source code (software) Debugging Crash software fault tolerance software quality Pattern recognition Project management Feature extraction SQA management of resources

Systematic Resource Allocation in Cloud RAN with Caching as a Service under Two Timescales

学校读者我要写书评

暂无评论

Systematic Resource Allocation in Cloud RAN with Caching as ...

作者： Tang, Jianhua Quek, Tony Q. S. Chang, Tsung-Hui Shim, Byonghyo Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha410081 China Institute of New Media and Communications Department of Electrical and Computer Engineering Seoul National University Seoul08826 Korea Republic of Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore Department of Electronic Engineering Kyung Hee University Yongin17104 Korea Republic of School of Science and Engineering Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen518172 China Department of Electrical and Computer Engineering Institute of New Media and Communications Seoul National University Seoul08826 Korea Republic of

Recently, cloud radio access network (C-RAN) with caching as a service (CaaS) was proposed to merge the functionalities of communication, computing, and caching (CCC) together. In this paper, we dissect the interactions of CCC in C-RAN with CaaS from two dimensions: physical resource dimension and time dimension. In the physical resource dimension, we identify how to segment the baseband unit (BBU) pool resources (i.e., computation and storage) into different types of virtual machines (VMs). In the time dimension, we address how the long-term resource segmentation in the BBU pool impacts on the short-term transmit beamforming at the remote radio heads. We formulate the problem as a stochastic mixed-integer nonlinear programming (SMINLP) to minimize the system cost, including the server cost, VM cost and wireless transmission cost. After a series of approximation, including sample average approximation, successive convex approximation, and semidefinite relaxation, the SMINLP is approximated as a global consensus problem. The alternating direction method of multipliers (ADMM) is utilized to obtain the solution in a parallel fashion. Simulation results verify the convergence of our proposed algorithm, and also confirm that the proposed scheme is more cost-saving than that without considering the integration of CCC. © 1972-2012 IEEE.

关键词： Integer programming

Building Efficient CNN Architecture for Offline Handwritten Chinese Character Recognition

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Li, Zhiyuan Teng, Nanjun Jin, Min Lu, Huaxiang CAS Center for Excellence in Brain Science and Intelligence Technology Beijing Key Laboratory of Semiconductor Neural Network Intelligent Sensing and Computing Technology Lab of Artificial Networks Institute of Semiconductors CAS University of Chinese Academy of Sciences

Deep convolutional neural networks based methods have brought great breakthrough in images classification, which provides an end-to-end solution for handwritten Chinese character recognition(HCCR) problem through learning discriminative features automatically. Nevertheless, state-of-the-art CNNs appear to incur huge computation cost, and require the storage of a large number of parameters especially in fully connected layers, which is difficult to deploy such networks into alternative hardware devices with limited computation amount. To solve the storage problem, we propose a novel technique called Global Weighted Arverage Pooling for reducing the parameters in fully connected layer without loss in accuracy. Besides, we implement a cascaded model in single CNN by adding mid output layer to complete recognition as early as possible, which reduces average inference time significantly. Experiments were performed on the ICDAR-2013 offline HCCR dataset, and it is found that our proposed approach only needs 6.9ms for classfying a chracter image on average, and achieves the state-of-the-art accuracy of 97.1% while requires only 3.3MB for storage. Copyright © 2018, The Authors. All rights reserved.

关键词： Deep neural networks

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Liao, Hao Liu, Ming-Kai Mariani, Manuel Sebastian Zhou, Mingyang Wu, Xingtong National Engineering Laboratory for Big Data System Computing Technology Guangdong Province Key Laboratory of Popular High Performance Computers College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Institute of Fundamental and Frontier Sciences University of Electronic Science and Technology of China Chengdu610051 China URPP Social Networks Universität Zürich CH-8050 Switzerland

When investigating the spreading of a piece of information or the diffusion of an innovation, we often lack information on the underlying propagation network. Reconstructing the hidden propagation paths based on the observed diffusion process is a challenging problem which has recently attracted attention from diverse research fields. To address this reconstruction problem, based on static similarity metrics commonly used in the link prediction literature, we introduce new node-node temporal similarity metrics. The new metrics take as input the time-series of multiple independent spreading processes, based on the hypothesis that two nodes are more likely to be connected if they were often infected at similar points in time. This hypothesis is implemented by introducing a time-lag function which penalizes distant infection times. We find that the choice of this time-lag strongly affects the metrics' reconstruction accuracy, depending on the network's clustering coefficient and we provide an extensive comparative analysis of static and temporal similarity metrics for network reconstruction. Our findings shed new light on the notion of similarity between pairs of nodes in complex networks. Copyright © 2019, The Authors. All rights reserved.

关键词： Information services

Relative influence maximization in competitive social networks

学校读者我要写书评

暂无评论

science China(Information sciences) 2017年第10期60卷 252-254页

作者： Dingda YANG Xiangwen LIAO Huawei SHEN Xueqi CHENG Guolong CHEN College of Physics and Information Engineering Fuzhou University Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing College of Mathematics and Computer Science Fuzhou University Institute of Computing Technology Chinese Academy of Sciences

In many realistic scenarios,such as political election and viral marketing,two opposite opinions,i.e.,positive opinion and negative opinion,spread simultaneously in the same social networks[1,2].Consequently,to achiev... 详细信息

关键词： net RIM Relative influence maximization in competitive social networks Figure

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

Nonlinear Prediction with Deep Recurrent Neural networks for Non-Blind Audio Bandwidth Extension

学校读者我要写书评

暂无评论

China Communications 2018年第4期15卷 72-85页

作者： Lin Jiang Ruimin Hu Xiaochen Wang Weiping Tu Maosheng Zhang National Engineering Research Center for Multimedia Software School of Computer Science Wuhan University Wuhan 430072 China Institute of Big Data and internet Innovation Hunan University of Commerce Changsha 410205 China Software College East China University of Technology Nanchang 330013 China Collaborative Innovation Center for Economics crime investigation and prevention technology Jiangxi Province Nanchang 330103China Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University Wuhan 430072 China Collaborative Innovation Center of Geospatial Technology Wuhan 430079 China

Non-blind audio bandwidth extension is a standard technique within contemporary audio codecs to efficiently code audio signals at low bitrates. In existing methods, in most cases high frequencies signal is usually generated by a duplication of the corresponding low frequencies and some parameters of high frequencies. However, the perception quality of coding will significantly degrade if the correlation between high frequencies and low frequencies becomes weak. In this paper, we quantitatively analyse the correlation via computing mutual information value. The analysis results show the correlation also exists in low frequency signal of the context dependent frames besides the current frame. In order to improve the perception quality of coding, we propose a novel method of high frequency coarse spectrum generation to improve the conventional replication method. In the proposed method, the coarse high frequency spectrums are generated by a nonlinear mapping model using deep recurrent neural network. The experiments confirm that the proposed method shows better performance than the reference methods.

关键词： audio coding non-blind audiobandwidth extension context correlation deeprecurrent neural network

Learning a deep listwise context model for ranking refinement

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Ai, Qingyao Bi, Keping Guo, Jiafeng Croft, W. Bruce College of Information and Computer Sciences University of Massachusetts Amherst AmherstMA United States CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

Learning to rank has been intensively studied and widely applied in information retrieval. Typically, a global ranking function is learned from a set of labeled data, which can achieve good performance on average but may be suboptimal for individual queries by ignoring the fact that relevant documents for different queries may have different distributions in the feature space. Inspired by the idea of pseudo relevance feedback where top ranked documents, which we refer as the local ranking context, can provide important information about the query's characteristics, we propose to use the inherent feature distributions of the top results to learn a Deep Listwise Context Model that helps us fine tune the initial ranked list. Specifically, we employ a recurrent neural network to sequentially encode the top results using their feature vectors, learn a local context model and use it to re-rank the top results. There are three merits with our model: (1) Our model can capture the local ranking context based on the complex interactions between top results using a deep neural network;(2) Our model can be built upon existing learning-to-rank methods by directly using their extracted feature vectors;(3) Our model is trained with an attention-based loss function, which is more effective and efficient than many existing listwise methods. Experimental results show that the proposed model can significantly improve the state-of-the-art learning to rank methods on benchmark retrieval corpora. Copyright © 2018, The Authors. All rights reserved.

关键词： Deep neural networks

On the relationship between energy complexity and other boolean function measures

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Sun, Xiaoming Sun, Yuan Wu, Kewen Xia, Zhiyu CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China School of Electronics Engineering and Computer Science Peking University China

In this work we investigate energy complexity, a Boolean function measure related to circuit complexity. Given a circuit C over the standard basis {∨2, ∧2, ¬}, the energy complexity of C, denoted by EC(C), is the maximum number of its activated inner gates over all inputs. The energy complexity of a Boolean function f, denoted by EC(f), is the minimum of EC(C) over all circuits C computing f. Recently, K. Dinesh et al. [3] gave EC(f) an upper bound in terms of the decision tree complexity, EC(f) = O(D(f)3). They also showed that EC(f) ≤ 3n−1, where n is the input size. For the lower bound, they show that EC(f) ≥ 13 psens(f), where psens(f) is the positive sensitivity. They asked whether EC(f) can be lower bounded by a polynomial of D(f). We improve both the upper and lower bounds in this paper. For upper bounds, We show that EC(f) ≤ min{ 12 D(f)2 + O(D(f)), n + 2 D(f) − 2}. For the lower bound, we answer Dinesh et al.'s question by proving that EC(f) = Ω(pD(f)). For non-degenerated functions, we also give another lower bound EC(f) = Ω(log n) where n is the input size. These two lower bounds are incomparable to each other. Besides, we examine the energy complexity of OR functions and ADDRESS functions, which implies the tightness of our two lower bounds respectively. In addition, the former one answers another open question in [3] asking for non-trivial lower bound for energy complexity of OR functions. Copyright © 2018, The Authors. All rights reserved.

关键词： Decision trees