Fixed broadband internet service can provide a stable broadband network of up to 100 megabits or even gigabits and users at home can use fixed broadband service for all kinds of internet surfing, including website and application access, watching videos, playing games, etc. Traditional maintenance for fixed broadband networks primarily uses human manual meth-ods, supplemented by some low-level semi-automation operations. Since the long processes with numerous network elements in the fixed broadband network, it is difficult for traditional operation and maintenance to support effectively with high quality. When abnormalities occur, it is quite manpower cost and time cost to monitor and locate faults. Therefore, to improve the autonomous capability of the fixed broadband network, intelligent operation and maintenance methods are necessary. First of all, a brand-new data pre-process method is proposed to detect anomalies and problems of slow access by selecting web services access commonly visited by users. Secondly, as the fixed broadband network is a multi-level and complex structure with only a small amount of anomaly sample data, we propose a multi-source joint anomaly detection model called MSJAD model on multi-dimensional features data. The model validation results on real datasets from the real fixed broadband network are state-of-the-art. The accuracy rate reaches 98 % and the recall is over 99 %. We have already begun to deploy the model on the real fixed broadband network and have achieved good feedback.

Intensive computation is entering data centers with multiple workloads of deep learning. To balance the compute efficiency, performance, and total cost of ownership (TCO), the use of a field-programmable gate array (FPGA) with reconfigurable logic provides an acceptable acceleration capacity and is compatible with diverse computation-sensitive tasks in the cloud. In this paper, we develop an FPGA acceleration platform that leverages a unified framework architecture for general-purpose convolutional neural network (CNN) inference acceleration at a data center. To overcome the computation bound, 4,096 DSPs are assembled and shaped as supertile units (SUs) for different types of convolution, which provide up to 4.2 TOP/s 16-bit fixed-point performance at 500 MHz. The interleaved-task-dispatching method is proposed to map the computation across the SUs, and the memory bound is solved by a dispatching-assembling buffering model and broadcast caches. For various non-convolution operators, a filter processing unit is designed for general-purpose filter-like/pointwise operators. In the experiment, the performances of CNN models running on server-class CPUs, a GPU, and an FPGA are compared. The results show that our design achieves the best FPGA peak performance and a throughput at the same level as that of the state-of-the-art GPU in data centers, with more than 50 times lower latency.

Query-oriented summarization aims at extracting an informative summary from a document collection for a given query. It is very useful to help users grasp the main information related to a query. Existing work can be mainly classified into two categories: supervised method and unsupervised method. The former requires training examples, which makes the method limited to predefined domains. While the latter usually utilizes clustering algorithms to find ‘centered’ sentences as the summary. However, the method does not consider the query information, thus the summarization is general about the document collection itself. Moreover, most of existing work assumes that documents related to the query only talks about one topic. Unfortunately, statistics show that a large portion of summarization tasks talk about multiple topics. In this paper, we try to break limitations of the existing methods and study a new setup of the problem of multi-topic based query-oriented summarization. We propose using a probabilistic approach to solve this problem. More specifically, we propose two strategies to incorporate the query information into a probabilistic model. Experimental results on two different genres of data show that our proposed approach can effectively extract a multi-topic summary from a document collection and the summarization performance is better than baseline methods. The approach is quite general and can be applied to many other mining tasks, for example product opinion analysis and question answering.

In this paper, we study a novel problem of staring people discovery from social networks, which is concerned with finding people who are not only authoritative but also sociable in the social network. We formalize this problem as an optimization programming problem. Taking the co-author network as a case study, we define three objective functions and propose two methods to combine these objective functions. A genetic algorithm based method is further presented to solve this problem. Experimental results show that the proposed solution can effectively find the staring people from social networks.