Benchmark Algorithms In Terms Research Articles

Genetic Algorithm-Based Adaptive Wiener Gain for Speech Enhancement Using an Iterative Posterior NMF

In this paper, we propose a genetic algorithm-based adaptive Wiener gain for speech enhancement using an iterative posterior non-negative matrix factorization (NMF). In the recent past, NMF-based Wiener filtering methods were used to improve the performance of speech enhancement, which has shown that they provide better performance when compared with conventional NMF methods. But performance degrades in non-stationary noise environments. Template-based approaches are more robust and perform better in non-stationary noise environments compared to statistical model-based approaches but are dependent on a priori information. Combining the approaches avoids the drawbacks of both. To improve the performance further, speech and noise bases are adapted simultaneously in the NMF approach. The usage of Super-Gaussian constraints in iterative NMF still improves the performance in non-stationary noise. The silence frame is a challenging task in the case of NMF; still there will be some amount of noise present in those frames. For further enhancement, we have combined with a genetic algorithm (GA)-based adaptive Wiener filter which performs well in denoising and also the GA search the adaptive [Formula: see text] allows us to control the trade-off between fitting the observed spectrogram of mixed speech and noise achieving high likelihood under our prior model. The proposed method outperforms other benchmark algorithms in terms of the source to distortion ratio (SDR), short-time objective intelligibility (STOI), and perceptual evaluation of speech quality (PESQ).

Multi-Graph Convolutional-Recurrent Neural Network (MGC-RNN) for Short-Term Forecasting of Transit Passenger Flow

Short-term forecasting of passenger flow is critical for transit management and crowd regulation. Spatial dependencies, temporal dependencies, inter-station correlations driven by other latent factors, and exogenous factors bring challenges to the short-term forecasts of passenger flow of urban rail transit networks. An innovative deep learning approach, Multi-Graph Convolutional-Recurrent Neural Network (MGC-RNN) is proposed to forecast passenger flow in urban rail transit systems to incorporate these complex factors. We propose to use multiple graphs to encode the spatial and other heterogenous inter-station correlations. The temporal dynamics of the inter-station correlations are also modeled via the proposed multi-graph convolutional-recurrent neural network structure. Inflow and outflow of all stations can be collectively predicted with multiple time steps ahead via a sequence to sequence(seq2seq) architecture. The proposed method is applied to the short-term forecasts of passenger flow in Shenzhen Metro, China. The experimental results show that MGC-RNN outperforms the benchmark algorithms in terms of forecasting accuracy. Besides, it is found that the inter-station driven by network distance, network structure, and recent flow patterns are significant factors for passenger flow forecasting. Moreover, the architecture of LSTM-encoder-decoder can capture the temporal dependencies well. In general, the proposed framework could provide multiple views of passenger flow dynamics for fine prediction and exhibit a possibility for multi-source heterogeneous data fusion in the spatiotemporal forecast tasks.

Ship Fire Detection Based on an Improved YOLO Algorithm with a Lightweight Convolutional Neural Network Model.

Ship fire is one of the greatest dangers to ship navigation safety. Nevertheless, typical detection methods have limited detection effectiveness and accuracy due to distance restrictions and ship motion. Although the issue can be addressed by image recognition algorithms based on deep learning, the computational complexity and efficiency for ship detection are tough. This paper proposes a lightweight target identification technique based on the modified YOLOv4-tiny algorithm for the precise and efficient detection of ship fires, taking into account the distinctive characteristics of ship fires and the marine environment. Initially, a multi-scale detection technique is applied to broaden the detection range and integrate deep semantic information, thereby enhancing the feature information of small targets and obscured objects and improving the detection precision. Then, the proposed algorithm employs the SE attention mechanism for inter-channel feature fusion to improve the capability of feature extraction and the precision of ship fire detection. Last but not least, picture transformation and migration learning are added to the small ship fire dataset to accelerate the convergence pace, improve the convergence effect, and reduce dataset dependence. The simulation experiments reveal that the proposed I-YOLOv4-tiny + SE model outperforms the benchmark algorithm in terms of ship fire detection accuracy and detection efficiency and that it satisfies the real-time ship fire warning criteria in demanding maritime environments.

Efficient reliability analysis using prediction-oriented active sparse polynomial chaos expansion

In this paper, a prediction-oriented active sparse polynomial chaos expansion (PAS-PCE) is proposed for reliability analysis. Instead of leveraging on additional techniques to reduce the problem dimensionality and/or to obtain the local error estimates, which has been done in the majority of existing PCE-based methods, this study first makes use of the Bregman-iterative greedy coordinate descent in effectively solving the least absolute shrinkage and selection operator based regression for sparse PCE approximation with a small set of initial samples. Then, the local variance distribution of the performance function is predicted using the approximated PCE. By maximizing an optimality measure that balances the exploration of design space and exploitation of the PCE characteristics, a recently proposed learning function is subsequently adopted for selecting the optimal samples one by one from a candidate pool to cover the limit state surface regions proportionally to the predicted local variance. The performance of the proposed PAS-PCE is assessed on four numerical examples of varying complexity and input dimensionality through comparison with several state-of-the-art active learning methods based on a variety of surrogate models. Results show that the proposed method is superior to the benchmark algorithms in terms of both accuracy and efficiency for reliability analysis.

Grouping-based Oversampling in Kernel Space for Imbalanced Data Classification

The class-imbalanced classification is a difficult problem because not only traditional classifiers are more biased towards the majority classes and inclined to generate incorrect predictions, but also the existing algorithms often have difficulty tackling this kind of problem with the class overlapping. Oversampling is a widely used and effective method to obtain balanced samples for imbalanced data, but the existing oversampling methods usually result in more serious class overlapping due to improper choice of the reference samples. To circumvent this shortcoming, according to the different possibilities of minority class samples appearing in the overlapping regions in the feature space, a grouping scheme for the minority class samples is first designed to identify the overlapping region samples. Then, a new oversampling method based on this grouping scheme is proposed to make the new samples far away from the overlapping region and rectify the decision boundary properly. Subsequently, a new effective classification algorithm is developed for imbalanced data. Extensive experiments show that the proposed algorithm is superior to the seventeen benchmark algorithms in terms of three performance metrics, especially on high imbalance ratio data sets.

A deep learning approach to predict the number of [formula omitted]-barriers for intrusion detection over a circular region using wireless sensor networks

Wireless Sensor Networks (WSNs) is a promising technology with enormous applications in almost every walk of life. One of the crucial applications of WSNs is intrusion detection and surveillance at border areas and in the defence establishments. The border areas are stretched over hundreds to thousands of miles, hence, it is not possible to patrol the entire border region. As a result, an enemy may enter from any point absence of surveillance and cause the loss of lives or destroy the military establishments. WSNs can be a feasible solution for the problem of intrusion detection and surveillance at the border areas. Detection of an enemy at the border areas and nearby critical areas such as military cantonments is a time-sensitive task as a delay of a few seconds may have disastrous consequences. Therefore, it becomes imperative to design systems that can identify and detect the enemy as soon as it comes within the range of the deployed system. In this paper, we have proposed a deep learning architecture based on a fully connected feed-forward Artificial Neural Network (ANN) for the accurate prediction of the number of k-barriers for fast intrusion detection and prevention. We have trained and evaluated the feed-forward ANN model using four potential features, namely area of the circular region, sensing range of sensors, transmission range of sensors, and number of sensor for Gaussian and uniform sensor distribution. These features are extracted through Monte Carlo simulation. In doing so, we found that the model accurately predicts the number of k-barriers for both Gaussian and uniform sensor distribution with correlation coefficient (R = 0.78) and Root Mean Square Error (RMSE = 41.15) for the former and R = 0.79 and RMSE = 48.36 for the latter. Further, the proposed approach outperforms the other benchmark algorithms in terms of accuracy and computational time complexity.

Constrained Soft Actor-Critic for Energy-Aware Trajectory Design in UAV-Aided IoT Networks

This letter investigates an unmanned aerial vehicle (UAV)-aided data collection system, where a UAV is deployed to gather information from terrestrial Internet of Things (IoT) devices. We aim to minimize the mission completion time by optimizing the UAV trajectory, while ensuring all the target data can be successfully collected with a given energy budget. Firstly, the problem is formulated as a constrained Markov Decision Process (CMDP). Then, a constrained soft actor-critic (CSAC) algorithm is proposed by incorporating Lagrangian primal-dual optimization (PDO) into the soft actor-critic (SAC) framework. Simulation results demonstrate that the proposed algorithm outperforms state-of-the-art benchmark algorithms in terms of the mission completion time. Particularly, it is able to learn an adaptive policy that outputs optimal trajectories for different device locations.

Multiagent Q-Learning-Based Multi-UAV Wireless Networks for Maximizing Energy Efficiency: Deployment and Power Control Strategy Design

In air-to-ground communications, the network lifetime depends on the operation time of unmanned aerial vehicle-base stations (UAV-BSs) owing to the restricted battery capacity. Therefore, the maximization of energy efficiency and the minimization of outage ground users are important metrics of network performance. To achieve these two objectives, the location and transmit power of the UAV-BSs in the network must be optimized. This optimization problem may not be tractable in the conventional optimization framework because multiple UAV-BSs interact in a complicated manner. Hence, we formulate the problem as a Markov decision process and develop an algorithm to obtain a solution in a reinforcement learning framework. To avoid a central controller and high computational complexity, we employ a multiagent distributed <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${Q}$ </tex-math></inline-formula> -learning algorithm to obtain a solution. Specifically, we propose a multiagent <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${Q}$ </tex-math></inline-formula> -learning-based UAV-BS deployment and power control strategy to maximize energy efficiency and minimize the number of outage users in multi-UAV wireless networks. Through intensive simulations, it is demonstrated that the proposed algorithm can outperform benchmark algorithms in terms of average energy efficiency and number of average outage users in multi-UAV wireless networks.

Synergetic energy-conscious scheduling optimization of part feeding systems via a novel chaotic reference-guided policy

PurposeThis paper aims to investigate a multi-objective electric vehicle’s (EV’s) synergetic scheduling problem in the automotive industry, where a synergetic delivery mechanism to coordinate multiple EVs is proposed to fulfill part feeding tasks.Design/methodology/approachA chaotic reference-guided multi-objective evolutionary algorithm based on self-adaptive local search (CRMSL) is constructed to deal with the problem. The proposed CRMSL benefits from the combination of reference vectors guided evolutionary algorithm (RVEA) and chaotic search. A novel directional rank sorting procedure and a self-adaptive energy-efficient local search strategy are then incorporated into the framework of the CRMSL to obtain satisfactory computational performance.FindingsThe involvement of the chaotic search and self-adaptive energy-efficient local search strategy contributes to obtaining a stronger global and local search capability. The computational results demonstrate that the CRMSL achieves better performance than the other two well-known benchmark algorithms in terms of four performance metrics, which is inspiring for future researches on energy-efficient co-scheduling topics in manufacturing industries.Originality/valueThis research fully considers the cooperation and coordination of handling devices to reduce energy consumption, and an improved multi-objective evolutionary algorithm is creatively applied to solve the proposed engineering problem.

Joint flight scheduling and task allocation for secure data collection in UAV-aided IoTs

With the flexible mobility and deployment, Unmanned Aerial Vehicles (UAVs) have created a new dimension to provide data collection services for a large number of distributed wireless sensory devices. Unfortunately, the broadcast nature of wireless channels make it hard to guarantee the security of data transmission in Internet of Things (IoTs). In this paper, focusing on the scenario where potential eavesdroppers intend to intercept the data uploading of legitimate nodes, we take the advantages of the UAV technology and the physical-layer security approach to study the Secure Data Collection Problem (SDCP). We first explore the flight scheduling and task allocation, that is, determining which areas to be visited and who to be served by UAVs, to establish favorable communication channels. Then we set up the utility function with secrecy rates and non-negative budget constraints. Due to the coupling between the UAV scheduling and task allocation optimization variables in the SDCP, we construct a surrogate function to achieve decoupling and reformulate SDCP into the SDCP-m problem, which is analyzed and proved to be a nonnegative monotone submodular function subject to a general constraint. Finally, an efficient Cost–Benefit Greedy (CBG) algorithm, which is theoretically analyzed to seek the quantitative value of approximation ratio, is proposed. The simulation results show that the CBG algorithm not only outperforms benchmark algorithms in terms of the average secrecy rate and the iteration number, but also generates a nearly optimal trajectory.

Optimized task scheduling for cost-latency trade-off in mobile fog computing using fuzzy analytical hierarchy process

Mobile Fog Computing (MFC) paradigm can be integrated as a unit called as Multi-Access Edge Computing (MFC) in a fifth-generation (5G) network. There are extensive researches coercing to the MFC. Task scheduling is an important issue in the area of MFC to solve computing capacities such as limited CPU power, storage capacity, memory constraints, and limited battery life in Mobile Devices (MDs). The multi-criteria decision-making problem in fog nodes has not been widely studied. According to the variety and difficulty of criteria, the scheduling in the fog node has become a challenge. The previous works in the tasks scheduling context considered a few criteria of dynamic scheduling without covering other enough criteria. Besides, in MFC, the tasks come with different priorities. We present a scheduling algorithm based on the Priority Queue, Fuzzy and Analytical Hierarchy Process namely PQFAHP in our paper. We use PQFAHP to combine several priorities and prioritize multi-criteria. In our paper, dynamic scheduling includes the completion time, energy consumption, RAM, and deadline criteria. Our experimental results show that the proposed algorithm can consider multi-criteria for scheduling Our proposed work is one of the multi-criteria algorithms that performs optimal results than several benchmark algorithms in terms of waiting time, delay, service level, mean response time, and the number of scheduled tasks on the MFC side. This paper has considerable contributions related to the scheduling of fog computing. For instance, it could decrease 14.2%, 49%, and 26% in average waiting time, delay, and energy consumption respectively, and increase 10.8% in service level.

Resource Allocation for Secure SWIPT-Enabled D2D Communications With $\alpha$ Fairness

Device-to-device (D2D) communication is an emerging paradigm that can improve system capacity and spectral efficiency by using cooperative communication coexisting with cellular networks. In spite of these advantages, D2D communication suffers from unfair resource usage, security risks posed by eavesdroppers, and limited energy storage. To deal with these issues, in this paper, we propose a resource allocation algorithm to maximize the security-aware energy efficiency (EE) for D2D users (DUs) in a simultaneous wireless information and power transfer (SWIPT)-enabled D2D communication system with <inline-formula><tex-math notation="LaTeX">$\alpha$</tex-math></inline-formula> fairness, where multiple random eavesdroppers are present. In particular, we formulate a multi-objective resource allocation problem by jointly optimizing the transmit power, power-splitting (PS) factors of DUs, and the sub-channel allocation factor under multiple constraints, including the maximum interference power for each cellular user, the maximum transmit power of each DU, the PS factor, and the integer sub-channel assignment. To solve the non-convex problem, an iterative algorithm is developed to obtain the sub-optimal solution. Simulation results verify that the proposed algorithm outperforms benchmark algorithms in terms of balancing secrecy EE and fairness.

Investor Sentiment Combined with Multisource Information to Predict Stock Prices: An Analysis of China’s A-Share Market

Investor sentiment has been widely used in the research of the stock market, and how to accurately measure investor sentiment is still being explored. With the rise of social media, investor sentiment is no longer only influenced by macroeconomic data and news media, but also guided by We-Media and fragmented information. We take the data of China A-shares from January 2020 to December 2020 as the research object and propose a stock price prediction method that combines investor sentiment with multisource information. Firstly, the sentiment of macroeconomic data, brokerage research reports, news, and We-Media is calculated, respectively, and then the investor sentiment vector combining multisource information is obtained by the multilayer perceptron. Finally, the LSTM model is used to represent the stock time series characteristics. The results show that (1) the proposed algorithm is superior to the benchmark algorithm in terms of accuracy and F1-score, (2) investor sentiment vector can effectively measure the investment sentiment of stocks, and (3) compared with vector concatenation, multilayer perceptron can better represent investor sentiment.

Robust Resource Allocation Algorithm for Energy-Harvesting-Based D2D Communication Underlaying UAV-Assisted Networks

Energy efficiency (EE) is a significant performance indicator in unmanned aerial vehicle (UAV)-assisted communication networks for providing a balance between power consumption minimization and transmission rate maximization. However, most of the current works focus on the transmission rate maximization under perfect channel state information (CSI) and exact coordinate information, which is too ideal in practical systems due to channel estimation errors and coordinate estimation errors. Thus, robust resource allocation algorithms with imperfect CSI and coordinate information are critically important to reduce users’ outages and improve system robustness. In this article, a robust EE maximization problem with channel uncertainties and coordinate uncertainties is formulated for an energy harvesting-based device-to-device (D2D) communication underlaying UAV-assisted network under some necessary constraints, which involve the outage probability constraints of ground terminals, the flight altitude constraint of the UAV, the minimum harvested energy constraints of D2D users, and the transmission time constraint. Both radio resource allocation and the flight altitude are jointly optimized based on the worst case approach. The considered nonconvex problem is transformed into a convex one by exploiting variable relaxation and variable substitution approaches. The Lagrange dual theory is used to derive the closed-form expressions of robust resource allocation. Simulation results demonstrate the effectiveness of the proposed algorithm by comparing it with the benchmark algorithms in terms of EE and robustness.

IADE: An Improved Differential Evolution Algorithm to Preserve Sustainability in a 6G Network

Differential evolution (DE) algorithm is utilized to find an optimized solution in multidimensional real applications like 5G/6G networked devices and support unlimited connectivity for terrestrial networks due to high efficiency, robustness, and easy achievements. With the development of new emerging networks and the rise of big data, the DE algorithm encounters a series of challenges, such as the slow convergence rate in late iteration, strong parameter dependence, and easiness to fall into local optimum. These issues exponentially increase the energy and power consumption of communications and computing technologies in 5G/6G network like a networked data center. To address this and leverage a practical solution, this paper introduces <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">IADE</i> , an improved adaptive DE algorithm, to solve the problems mentioned earlier. IADE improves the scaling factor, crossover probability, variation, and selection strategy of the DE algorithm. In IADE, the parameters adaptively adjusted with the population’s iterative evolution to meet the parameter’s different requirements values of network steering traffic in each period. Numerous experiments are carried out through the benchmark function to evaluate the performance of IADE, and the results obtained from the experiment illustrate that IADE surpasses the benchmark algorithms in terms of solution accuracy and convergence speed for large tasks around 10%, respectively.

UAV-LEO Integrated Backbone: A Ubiquitous Data Collection Approach for B5G Internet of Remote Things Networks

With the advance of unmanned aerial vehicles (UAVs) and low earth orbit (LEO) satellites, the integration of space, air and ground networks has become a potential solution to the beyond fifth generation (B5G) Internet of remote things (IoRT) networks. However, due to the network heterogeneity and the high mobility of UAVs and LEOs, how to design an efficient UAV-LEO integrated data collection scheme without infrastructure support is very challenging. In this paper, we investigate the resource allocation problem for a two-hop uplink UAV-LEO integrated data collection for the B5G IoRT networks, where numerous UAVs gather data from IoT devices and transmit the IoT data to LEO satellites. In order to maximize the data gathering efficiency in the IoT-UAV data gathering process, we study the bandwidth allocation of IoT devices and the 3-dimensional (3D) trajectory design of UAVs. In the UAV-LEO data transmission process, we jointly optimize the transmit powers of UAVs and the selections of LEO satellites for the total uploaded data amount and the energy consumption of UAVs. Considering the relay role and the cache capacity limitations of UAVs, we merge the optimizations of IoT-UAV data gathering and UAV-LEO data transmission into an integrated optimization problem, which is solved with the aid of the successive convex approximation (SCA) and the block coordinate descent (BCD) techniques. Simulation results demonstrate that the proposed scheme achieves better performance than the benchmark algorithms in terms of both energy consumption and total upload data amount.

UAV-Relaying-Assisted Multi-Access Edge Computing With Multi-Antenna Base Station: Offloading and Scheduling Optimization

Multi-access edge computing (MEC) systems where the base station (BS) is equipped with multiple antennas are basic application systems in the future. Moreover, unmanned aerial vehicles (UAVs) can be used as relays for responding to emergency service situations in the systems above. Thus, in this work, we investigate a UAV-relaying-assisted MEC system with multi-antenna BS. The optimization for offloading and scheduling strategies should be considered for the energy consumption minimization. First, a circular deployment scheme is adopted to overcome the difficulty of UAVs’ location optimizations. Then, the original problem is established, which aims to minimize the weighted sum of transmission and hovering energy consumptions by jointly optimizing offloading and scheduling strategies. Moreover, the non-convex original problem is transformed into four sub-problems and their optimal solutions are obtained by proposed algorithms. Finally, an iterative algorithm is proposed to obtain a sub-optimal solution of the original problem. Simulation results show that the proposed algorithm outperforms the three benchmark algorithms in terms of the weighted sum and approaches the performance of the relaxed lower bound algorithm. Furthermore, simulation results demonstrate that appropriate number of UAVs and BS's antennas can achieve better energy-saving performance.

Joint Computation Partitioning and Resource Allocation for Latency Sensitive Applications in Mobile Edge Clouds

The proliferation of mobile devices and ubiquitous access of the wireless network enable many new mobile applications such as augmented reality, mobile gaming and so on. As the applications are latency sensitive, researchers propose to offload the complex computations of these applications to the nearby edge cloud, in order to reduce the latency. Existing works mostly consider the problem of partitioning the computations between the mobile device and the traditional cloud that has abundant resources. The proposed approaches can not be applied in the context of mobile edge cloud, because both the resources in the mobile edge cloud and the wireless access bandwidth to the edge cloud are constrained. In this paper, we study <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">joint computation partitioning and resource allocation problem</i> for latency sensitive applications in mobile edge clouds. The problem is novel in that we combine the computation partitioning and the two-dimensional resource allocations in both the computation resources and the network bandwidth. We develop a new and efficient method, namely Multi-Dimensional Search and Adjust (MDSA), which is an offline algorithm, to solve the problem. We compare MDSA with the classic list scheduling method and the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">SearchAdjust</i> algorithm via comprehensive simulations. The results show that MDSA outperforms the benchmark algorithms in terms of the overall application latency. Moreover, we also design an online method, named by Cooperative Online Scheduling (COS), which can be easily deployed in practical systems. By extensive evaluations, we show that COS outperforms the benchmark methods by 25 percent on average.

An improved multi-objective genetic algorithm with heuristic initialization for service placement and load distribution in edge computing

Edge Computing (EC) is a promising concept to overcome some obstacles of traditional cloud data centers to support Internet of Things (IoT) applications, especially time-sensitive applications. However, EC faces some challenges, including the resource allocation for heterogeneous applications at a network edge composed of distributed and resource-restricted nodes. A relevant issue that needs to be addressed by a resource manager is the service placement problem, which is the decision-making process of determining where to place different services (or applications). A related issue of service placement is how to distribute workloads of an application placed on multiple locations. Hence, we jointly investigate the load distribution and placement of IoT applications to minimize Service Level Agreement (SLA) violations due to the limitations of EC resources and other conflicting objectives. In order to handle the computational complexity of the formulated problem, we propose a multi-objective genetic algorithm with the initial population based on random and heuristic solutions to obtain near-optimal solutions. Evaluation results show that our proposal outperforms other benchmark algorithms in terms of response deadline violation, as well as terms of other conflicting objectives, such as operational cost and service availability.

An offline map matching algorithm based on shortest paths

ABSTRACT Offline map matching identifies corresponding roads to a GPS trajectory represented by a series of recorded geographic coordinates (GPS points) to the road network. This paper defines matching error as cost on the corresponding road-link to matched GPS points and formulates the offline map matching problem as a shortest path problem with resource constraints. By regarding matched points on one link as a type of resource consumed, the resource constraint indicates that the number of matched GPS points equals the total number of points in the given trajectory. We propose an offline map matching algorithm based on shortest paths by calculating the matching error on each link and extending the classic label-setting shortest path algorithm to find the path with the minimum total matching error for all GPS points. We use real-world taxi trajectories to compare our algorithm with three state-of-the-art map matching algorithms. Our algorithm outperforms all benchmark algorithms in terms of both matching accuracy and computational efficiency. Our algorithm achieves greater matched length (5.36 to 12.27% larger) and lower mis-matched length (3.72 to 75.30% smaller) at a very high matching speed (60.59 points per second on average over thirteen sampling intervals).