Fast Multi-Pattern Matching Algorithm on Compressed Network Traffic

Pattern matching is a fundamental approach to detect malicious behaviors and information over Internet, which has been gradually used in high-speed network traffic analysis. However, there is a performance bottleneck for multi-pattern matching on online compressed network traffic(CNT), this is because malicious and intrusion codes are often embedded into compressed network traffic. In this paper, we propose an online fast and multi-pattern matching algorithm on compressed network traffic(FMMCN). FMMCN employs two types of jumping, i.e. jumping during sliding window and a string jump scanning strategy to skip unnecessary compressed bytes. Moreover, FMMCN has the ability to efficiently process multiple large volume of networks such as HTTP traffic, vehicles traffic, and other Internet-based services. The experimental results show that FMMCN can ignore more than 89.5% of bytes, and its maximum speed reaches 176.470MB/s in a midrange switches device, which is faster than the current fastest algorithm ACCH by almost 73.15 MB/s.

High-Efficiency Rectifier for Wireless Energy Harvesting Based on Double Branch Structure

A rectifier circuit for wireless energy harvesting(WEH) with a wide input power range is proposed in this paper. We build up accurate models of the diodes to improve the accuracy of the design of the rectifier. Due to the nonlinear characteristics of the diodes, a new band-stop structure is introduced to reduce the imaginary part impedance and suppress harmonics. A novel structure with double branches and an optimized λ/4 microstrip line is proposed to realize the power division ratio adjustment by the input power automatically. The proposed two branches can satisfy the two cases with input power of-20 dBm to 0 dBm and 0 dBm to 15 dBm, respectively. Here, dBm = 10 log(P mW), and P represents power. An impedance compression network(ICN) is correspondingly designed to maintain the input impedance stability over the wide input power range. A rectifier that works at 2.45 GHz is implemented. The measured results show that the highest efficiency can reach 51.5% at the output power of 0 dBm and higher than 40% at the input power of-5 dBm to 12 dBm.

Short-time prediction for traffic flow based on wavelet de-noising and LSTM model

Aiming at the problem that some existing traffic flow prediction models are only for a single road segment and the model input data are not pre-processed,a heuristic threshold algorithm is used to de-noise the original traffic flow data after wavelet decomposition.The correlation coefficients of road traffic flow data are calculated and the data compression matrix of road traffic flow is constructed.Data de-noising minimizes the interference of data to the model,while the correlation analysis of road network data realizes the prediction at the road network level.Utilizing the advantages of long short term memory(LSTM)network in time series data processing,the compression matrix is input into the constructed LSTM model for short-term traffic flow prediction.The LSTM-1 and LSTM-2 models were respectively trained by de-noising processed data and original data.Through simulation experiments,different prediction times were set,and the prediction results of the prediction model proposed in this paper were compared with those of other methods.It is found that the accuracy of the LSTM-2 model proposed in this paper increases by 10.278%on average compared with other prediction methods,and the prediction accuracy reaches 95.58%,which proves that the short-term traffic flow prediction method proposed in this paper is efficient.

Optical SDMA for applying compressive sensing in WSN

In order to apply compressive sensing in wireless sensor network, inside the nodes cluster classified by the spatial correlation, we propose that a cluster head adopts free space optical communication with space division multiple access, and a sensor node uses a modulating retro-reflector for communication. Thus while a random sampling matrix is used to guide the establishment of links between head cluster and sensor nodes, the random linear projection is accomplished. To establish multiple links at the same time, an optical space division multiple access antenna is designed. It works in fixed beams switching mode and consists of optic lens with a large field of view（FOV）, fiber array on the focal plane which is used to realize virtual channels segmentation, direction of arrival sensor, optical matrix switch and controller. Based on the angles of nodes＇ laser beams, by dynamically changing the route, optical matrix switch actualizes the multi-beam full duplex tracking receiving and transmission. Due to the structure of fiber array, there will be several fade zones both in the focal plane and in lens＇ FOV. In order to lower the impact of fade zones and harmonize multibeam, a fiber array adjustment is designed. By theoretical, simulated and experimental study, the antenna＇s qualitative feasibility is validated.

Recent advances in efficient computation of deep convolutional neural networks

Deep neural networks have evolved remarkably over the past few years and they are currently the fundamental tools of many intelligent systems.At the same time,the computational complexity and resource consumption of these networks continue to increase.This poses a significant challenge to the deployment of such networks,especially in real-time applications or on resource-limited devices.Thus,network acceleration has become a hot topic within the deep learning community.As for hardware implementation of deep neural networks,a batch of accelerators based on a field-programmable gate array(FPGA) or an application-specific integrated circuit(ASIC)have been proposed in recent years.In this paper,we provide a comprehensive survey of recent advances in network acceleration,compression,and accelerator design from both algorithm and hardware points of view.Specifically,we provide a thorough analysis of each of the following topics:network pruning,low-rank approximation,network quantization,teacher–student networks,compact network design,and hardware accelerators.Finally,we introduce and discuss a few possible future directions.

Probability-Based Channel Pruning for Depthwise Separable Convolutional Networks

Channel pruning can reduce memory consumption and running time with least performance damage,and is one of the most important techniques in network compression.However,existing channel pruning methods mainly focus on the pruning of standard convolutional networks,and they rely intensively on time-consuming fine-tuning to achieve the performance improvement.To this end,we present a novel efficient probability-based channel pruning method for depthwise separable convolutional networks.Our method leverages a new simple yet effective probability-based channel pruning criterion by taking the scaling and shifting factors of batch normalization layers into consideration.A novel shifting factor fusion technique is further developed to improve the performance of the pruned networks without requiring extra time-consuming fine-tuning.We apply the proposed method to five representative deep learning networks,namely MobileNetV1,MobileNetV2,ShuffleNetV1,ShuffleNetV2,and GhostNet,to demonstrate the efficiency of our pruning method.Extensive experimental results and comparisons on publicly available CIFAR10,CIFAR100,and ImageNet datasets validate the feasibility of the proposed method.

Constitutive modeling of compression behavior of TC4 tube based on modified Arrhenius and artificial neural network models

Warm rotary draw bending provides a feasible method to form the large-diameter thin-walled（LDTW）TC4 bent tubes, which are widely used in the pneumatic system of aircrafts. An accurate prediction of flow behavior of TC4 tubes considering the couple effects of temperature,strain rate and strain is critical for understanding the deformation behavior of metals and optimizing the processing parameters in warm rotary draw bending of TC4 tubes. In this study, isothermal compression tests of TC4 tube alloy were performed from 573 to 873 K with an interval of 100 K and strain rates of 0.001, 0.010 and0.100 s^（-1）. The prediction of flow behavior was done using two constitutive models, namely modified Arrhenius model and artificial neural network（ANN） model. The predictions of these constitutive models were compared using statistical measures like correlation coefficient（R）, average absolute relative error（AARE） and its variation with the deformation parameters（temperature, strain rate and strain）. Analysis of statistical measures reveals that the two models show high predicted accuracy in terms of R and AARE. Comparatively speaking, the ANN model presents higher predicted accuracy than the modified Arrhenius model. In addition, the predicted accuracy of ANN model presents high stability at the whole deformation parameter ranges, whereas the predictability of the modified Arrhenius model has some fluctuation at different deformation conditions. It presents higher predicted accuracy at temperatures of 573-773 K, strain rates of 0.010-0.100 s^（-1）and strain of 0.04-0.32, while low accuracy at temperature of 873 K, strain rates of 0.001 s^（-1）and strain of 0.36-0.48.Thus, the application of modified Arrhenius model is limited by its relatively low predicted accuracy at some deformation conditions, while the ANN model presents very high predicted accuracy at all deformation conditions,which can be used to study the compression behavior of TC4 tube at the temperature range of 573-873 K and the strain rate of 0.001-0.100 s^（-1）. It can provide guideline for the design of processing parameters in warm rotary draw bending of LDTW TC4 tubes.

A Reducing Iteration Orthogonal Matching Pursuit Algorithm for Compressive Sensing

In recent years, Compressed Sensing（CS） has been a hot research topic. It has a wide range of applications, such as image processing and speech signal processing owing to its characteristic of removing redundant information by reducing the sampling rate. The disadvantage of CS is that the number of iterations in a greedy algorithm such as Orthogonal Matching Pursuit（OMP） is fixed, thus limiting reconstruction precision.Therefore, in this study, we present a novel Reducing Iteration Orthogonal Matching Pursuit（RIOMP） algorithm that calculates the correlation of the residual value and measurement matrix to reduce the number of iterations.The conditions for successful signal reconstruction are derived on the basis of detailed mathematical analyses.When compared with the OMP algorithm, the RIOMP algorithm has a smaller reconstruction error. Moreover, the proposed algorithm can accurately reconstruct signals in a shorter running time.

Efficient Visual Recognition:A Survey on Recent Advances and Brain-inspired Methodologies

Visual recognition is currently one of the most important and active research areas in computer vision,pattern recognition,and even the general field of artificial intelligence.It has great fundamental importance and strong industrial needs,particularly the modern deep neural networks(DNNs)and some brain-inspired methodologies,have largely boosted the recognition performance on many concrete tasks,with the help of large amounts of training data and new powerful computation resources.Although recognition accuracy is usually the first concern for new progresses,efficiency is actually rather important and sometimes critical for both academic research and industrial applications.Moreover,insightful views on the opportunities and challenges of efficiency are also highly required for the entire community.While general surveys on the efficiency issue have been done from various perspectives,as far as we are aware,scarcely any of them focused on visual recognition systematically,and thus it is unclear which progresses are applicable to it and what else should be concerned.In this survey,we present the review of recent advances with our suggestions on the new possible directions towards improving the efficiency of DNN-related and brain-inspired visual recognition approaches,including efficient network compression and dynamic brain-inspired networks.We investigate not only from the model but also from the data point of view(which is not the case in existing surveys)and focus on four typical data types(images,video,points,and events).This survey attempts to provide a systematic summary via a comprehensive survey that can serve as a valuable reference and inspire both researchers and practitioners working on visual recognition problems.

A Survey of Bitmap Index Compression Algorithms for Big Data

With the growing popularity of Internet applications and the widespread use of mobile Internet, Internet traffic has maintained rapid growth over the past two decades. Internet Traffic Archival Systems（ITAS） for packets or flow records have become more and more widely used in network monitoring, network troubleshooting, and user behavior and experience analysis. Among the three key technologies in ITAS, we focus on bitmap index compression algorithm and give a detailed survey in this paper. The current state-of-the-art bitmap index encoding schemes include： BBC, WAH, PLWAH, EWAH, PWAH, CONCISE, COMPAX, VLC, DF-WAH, and VAL-WAH. Based on differences in segmentation, chunking, merge compress, and Near Identical（NI） features, we provide a thorough categorization of the state-of-the-art bitmap index compression algorithms. We also propose some new bitmap index encoding algorithms, such as SECOMPAX, ICX, MASC, and PLWAH＋, and present the state diagrams for their encoding algorithms. We then evaluate their CPU and GPU implementations with a real Internet trace from CAIDA. Finally, we summarize and discuss the future direction of bitmap index compression algorithms. Beyond the application in network security and network forensic, bitmap index compression with faster bitwise-logical operations and reduced search space is widely used in analysis in genome data, geographical information system, graph databases, image retrieval, Internet of things, etc. It is expected that bitmap index compression will thrive and be prosperous again in Big Data era since 1980s.