Reviewerly/exHarmony huggingface dataset:
Driver Identification Based on Vehicle Telematics Data using LSTM-Recurrent Neural Network

Despite advancements in vehicle security systems, over the last decade, auto-theft rates have increased, and cyber-security attacks on internet-connected and autonomous vehicles are becoming a new threat. In this paper, a deep learning model is proposed, which can identify drivers from their driving behaviors based on vehicle telematics data. The proposed Long-Short-Term-Memory (LSTM) model predicts the identity of the driver based on the individual's unique driving patterns learned from the vehicle telematics data. Given the telematics is time-series data, the problem is formulated as a time series prediction task to exploit the embedded sequential information. The performance of the proposed approach is evaluated on three naturalistic driving datasets, which gives high accuracy prediction results. The robustness of the model on noisy and anomalous data that is usually caused by sensor defects or environmental factors is also investigated. Results show that the proposed model prediction accuracy remains satisfactory and outperforms the other approaches despite the extent of anomalies and noise-induced in the data.
Adapting Pretrained Transformer to Lattices for Spoken Language Understanding

Lattices are compact representations that encode multiple hypotheses, such as speech recognition results or different word segmentations. It is shown that encoding lattices as opposed to 1-best results generated by automatic speech recognizer (ASR) boosts the performance of spoken language understanding (SLU). Recently, pre-trained language models with the transformer architecture have achieved the state-of-the-art results on natural language understanding, but their ability of encoding lattices has not been explored. Therefore, this paper aims at adapting pre-trained transformers to lattice inputs in order to perform understanding tasks specifically for spoken language. Our experiments on the benchmark ATIS dataset show that fine-tuning pre-trained transformers with lattice inputs yields clear improvement over fine-tuning with 1-best results. Further evaluation demonstrates the effectiveness of our methods under different acoustic conditions <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">11</sup> The code is available at https://github.com/MiuLab/Lattice-SLU.
Dynamic reputation–based consensus mechanism: Real-time transactions for energy blockchain

The energy blockchain is a distributed Internet protocol for energy transactions between nodes in power systems. The consensus algorithm is the core component of the energy blockchain and has an essential impact on its application. At present, in the implementation of the energy blockchain, there are problems such as low transaction throughput (transactions per second) and high latency, which cannot meet the application requirements of real-time processing transactions in the energy field. To this end, according to the analysis of conventional blockchain consensus algorithm and traditional practical Byzantine fault tolerance algorithm, a dynamic-reputation practical Byzantine fault tolerance algorithm for the energy blockchain is proposed. The dynamic-reputation practical Byzantine fault tolerance algorithm adopts a credit-based consortium node consensus election method. The monitoring node divides the remaining nodes into two types of nodes according to the reputation value: the consensus node and the secondary node, which, respectively, participate in different stages of the block generation process, and dynamically update the consensus nodes with low reputation ratings. By constructing the experimental platform simulation, the test results verify the effectiveness of the dynamic-reputation practical Byzantine fault tolerance algorithm. Compared with the algorithm of the fabric platform, the dynamic-reputation practical Byzantine fault tolerance algorithm improves the transaction processing speed and is suitable for the blockchain application in the energy field.
Ordered or Orderless: A Revisit for Video Based Person Re-Identification

Is recurrent network really necessary for learning a good visual representation for video based person re-identification (VPRe-id)? In this paper, we first show that the common practice of employing recurrent neural networks (RNNs) to aggregate temporal-spatial features may not be optimal. Specifically, with a diagnostic analysis, we show that the recurrent structure may not be effective learn temporal dependencies than what we expected and implicitly yields an orderless representation. Based on this observation, we then present a simple yet surprisingly powerful approach for VPRe-id, where we treat VPRe-id as an efficient orderless ensemble of image based person re-identification problem. More specifically, we divide videos into individual images and re-identify person with ensemble of image based rankers. Under the i.i.d. assumption, we provide an error bound that sheds light upon how could we improve VPRe-id. Our work also presents a promising way to bridge the gap between video and image based person re-identification. Comprehensive experimental evaluations demonstrate that the proposed solution achieves state-of-the-art performances on multiple widely used datasets (iLIDS-VID, PRID 2011, and MARS).
Multi-AUV Collaborative Target Recognition Based on Transfer-Reinforcement Learning

Due to the existence of unfavorable factors such as turbid water quality and target occlusion, it is difficult to obtain valid data of target features. Due to the repeated calculation of similar data, the real-time performance of the algorithm is poor. In view of the above problems, this paper proposes a multi-AUV collaborative target recognition method based on transfer-reinforcement learning. The features of the target information which is collected by multi-AUV are fused based on wavelet transformation and affine invariance. The similarity of features is calculated by Mahalanobis distance and the learning model is selected autonomously based on the similarity threshold. Based on the Q-learning reinforcement learning model, the target information under the interference environment is trained intensively, and the effective features are extracted and stored in the source domain, which can reduce the impact of the environmental interference on the target recognition. The feature transfer learning model based on deep confidence network transfers the feature data of the source domain to the target domain, reducing the repeated calculation of similar data, and then ensuring the real-time performance of the algorithm. Simulation experiments are conducted in the SUN dataset under five underwater environments (turbid water, target occlusion, insufficient light, complex background, and overlapping targets), and the results demonstrate that the proposed model achieves better performance.
A Two-Stage Triplet Network Training Framework for Image Retrieval

In this paper, we propose a novel framework for instance-level image retrieval. Recent methods focus on fine-tuning the Convolutional Neural Network (CNN) via a Siamese architecture to improve off-the-shelf CNN features. They generally use the ranking loss to train such networks, and do not take full use of supervised information for better network training, especially with more complex neural architectures. To solve this, we propose a two-stage triplet network training framework, which mainly consists of two stages. First, we propose a Double-Loss Regularized Triplet Network (DLRTN), which extends basic triplet network by attaching the classification sub-network, and is trained via simultaneously optimizing two different types of loss functions. Double-loss functions of DLRTN aim at specific retrieval task and can jointly boost the discriminative capability of DLRTN from different aspects via supervised learning. Second, considering feature maps of the last convolution layer extracted from DLRTN and regions detected from the region proposal network as the input, we then introduce the Regional Generalized-Mean Pooling (RGMP) layer for the triplet network, and re-train this network to learn pooling parameters. Through RGMP, we pool feature maps for each region and aggregate features of different regions from each image to Regional Generalized Activations of Convolutions (R-GAC) as final image representation. R-GAC is capable of generalizing existing Regional Maximum Activations of Convolutions (R-MAC) and is thus more robust to scale and translation. We conduct the experiment on six image retrieval datasets including standard benchmarks and recently introduced INSTRE dataset. Extensive experimental results demonstrate the effectiveness of the proposed framework.
Privacy and Security of Big Data in AI Systems: A Research and Standards Perspective

The huge volume, variety, and velocity of big data have empowered Machine Learning (ML) techniques and Artificial Intelligence (AI) systems. However, the vast portion of data used to train AI systems is sensitive information. Hence, any vulnerability has a potentially disastrous impact on privacy aspects and security issues. Nevertheless, the increased demands for high-quality AI from governments and companies require the utilization of big data in the systems. Several studies have highlighted the threats of big data on different platforms and the countermeasures to reduce the risks caused by attacks. In this paper, we provide an overview of the existing threats which violate privacy aspects and security issues inflicted by big data as a primary driving force within the AI/ML workflow. We define an adversarial model to investigate the attacks. Additionally, we analyze and summarize the defense strategies and countermeasures of these attacks. Furthermore, due to the impact of AI systems in the market and the vast majority of business sectors, we also investigate Standards Developing Organizations (SDOs) that are actively involved in providing guidelines to protect the privacy and ensure the security of big data and AI systems. Our far-reaching goal is to bridge the research and standardization frame to increase the consistency and efficiency of AI systems developments guaranteeing customer satisfaction while transferring a high degree of trustworthiness.
Comparing selection mechanisms for gaze input techniques in head-mounted displays

Head movements are a common input modality on VR/AR headsets. However, although they enable users to control a cursor, they lack an integrated method to trigger actions. Many approaches exist to fill this gap: dedicated "clickers", on-device buttons, mid-air gestures, dwell, speech and new input techniques based on matching head motions to those of visually presented targets. These proposals are diverse and there is a current lack of empirical data on the performance of, experience of, and preference for these different techniques. This hampers the ability of designers to select appropriate input techniques to deploy. We conduct two studies that address this problem. A Fitts' Law study compares five traditional selection techniques and concludes that clicker (hands-on) and dwell (hands-free) provide optimal combinations of precision, speed and physical load. A follow-up study compares clicker and dwell to a motion matching implementation. While clicker remains fastest and dwell most accurate, motion matching may provide a valuable compromise between these two poles.
Interactive AR-assisted product disassembly sequence planning (ARDIS)

This paper presents a proof-of-concept novel near real-time interactive AR-assisted product disassembly sequence planning system (ARDIS) based on product information, such as interference matrix and 3D models. The system is developed using Unity and consists of three modules, including an intelligent disassembly sequence planning module, an automatic content authoring module and an intuitive augmented reality (AR) user interface (UI) with various features, such as a virtual panel for customisation and an option panel for sequence regeneration. Given the retrieval targets specified by a user, optimised disassembly sequences are computed using an evolutionary computing algorithm. For the sequences computed, the respective AR disassembly instruction sequences, such as 2D text instructions and animated 3D models, are generated dynamically based on a taxonomy that links each disassembly step in a sequence with the corresponding Unity templates that have been created beforehand. Hence, the need for manual authoring to provide AR disassembly guidance is reduced. If necessary, the user can request for alternative disassembly sequences which can be re-computed in near real-time. Several case studies have been carried out to demonstrate and evaluate the performance of the system within the laboratory environment.
Emotion Recognition Using Feature-level Fusion of Facial Expressions and Body Gestures

Automatic emotion recognition using computer vision is significant for many real-world applications like photojournalism, virtual reality, sign language recognition, and Human Robot Interaction (HRI) etc., Psychological research findings advocate that humans depend on the collective visual conduits of face and body to comprehend human emotional behaviour. Plethora of studies have been done to analyse human emotions using facial expressions, EEG signals and speech etc., Most of the work done was based on single modality. Our objective is to efficiently integrate emotions recognized from facial expressions and upper body pose of humans using images. Our work on bimodal emotion recognition provides the benefits of the accuracy of both the modalities.
An efficient algorithm for fuzzy frequent itemset mining

Association-rule mining (ARM) has concerned as an important and critical research issue in the field of data analytics and mining that aims at finding the correlations among the items in binary databases. However, the conventional algorithms considered the frequency of the item(set) in binary data bases for ARM, which is not sufficient in real-life situations. Mining of useful information is not an easy task especially if the item(set) consists of the added values. Moreover, the discovered knowledge is not easy to understand if you are not the domain experts. For the past decades, several intelligent systems involved the fuzzy-set theory for many domains and applications due to it is interpretable for human reasoning. Before, the Apriori-based method for discovering fuzzy frequent itemsets (FFIs) based on the type-2 fuzzy-set theory was proposed, which requires the amount of computations with enormous candidates. In this study, we then first present a fast list-based multiple fuzzy frequent itemset mining (named as LFFT2)algorithm under type-2 fuzzy-set theory. It is developed by the type-2 membership functions to retrieve the multiple fuzzy frequent itemsets for presenting more useful and meaningful knowledge for making the efficient strategies or decisions. From the results shown in the experiments, it is clear to see that the developed LFFT2 outperforms the conventional Apriori-based approach regarding the execution time and the number of examined nodes in the search space.
Learning shape and motion representations for view invariant skeleton-based action recognition

Skeleton-based action recognition is an increasing attentioned task that analyses spatial configuration and temporal dynamics of a human action from skeleton data, which has been widely applied in intelligent video surveillance and human-computer interaction. How to design an effective framework to learn discriminative spatial and temporal characteristics for skeleton-based action recognition is still a challenging problem. The shape and motion representations of skeleton sequences are the direct embodiment of spatial and temporal characteristics respectively, which can well address for human action description. In this work, we propose an original unified framework to learn comprehensive shape and motion representations from skeleton sequences by using Geometric Algebra. We firstly construct skeleton sequence space as a subset of Geometric Algebra to represent each skeleton sequence along both the spatial and temporal dimensions. Then rotor-based view transformation method is proposed to eliminate the effect of viewpoint variation, which remains the relative spatio-temporal relations among skeleton frames in a sequence. We also construct spatio-temporal view invariant model (STVIM) to collectively integrate spatial configuration and temporal dynamics of skeleton joints and bones. In STVIM, skeleton sequence shape and motion representations which mutually compensate are jointly learned to describe skeleton-based actions comprehensively. Furthermore, a selected multi-stream Convolutional Neural Network is employed to extract and fuse deep features from mapping images of the learned representations for skeleton-based action recognition. Experimental results on NTU RGB+D, Northwestern-UCLA and UTD-MHAD datasets consistently verify the effectiveness of our proposed method and the superior performance over state-of-the-art competitors.
End-to-End Training of a Large Vocabulary End-to-End Speech Recognition System

In this paper, we present an end-to-end training framework for building state-of-the-art end-to-end speech recognition systems. Our training system utilizes a cluster of Central Processing Units (CPUs) and Graphics Processing Units (GPUs). The entire data reading, large scale data augmentation, neural network parameter updates are all performed “on-the-fly”. We use vocal tract length perturbation [1] and an acoustic simulator [2] for data augmentation. The processed features and labels are sent to the GPU cluster. The Horovod allreduce approach is employed to train neural network parameters. We evaluated the effectiveness of our system on the standard Librispeech corpus [3] and the 10,000-hr anonymized Bixby English dataset. Our end-to-end speech recognition system built using this training infrastructure showed a 2.44 % WER on test-clean of the LibriSpeech test set after applying shallow fusion with a Transformer language model (LM). For the proprietary English Bixby open domain test set, we obtained a WER of 7.92 % using a Bidirectional Full Attention (BFA) end-to-end model after applying shallow fusion with an RNN-LM. When the monotonic chunckwise attention (MoCha) based approach is employed for streaming speech recognition, we obtained a WER of 9.95 % on the same Bixby open domain test set.
Island-based Crow Search Algorithm for solving optimal control problems

Crow Search Algorithm (CROW) is one of the members of recently developed swarm-based metaheuristic algorithms. Literature includes different applications of this algorithm on engineering design problems. However, this optimization method suffers from some drawbacks such as premature convergence and trapping into local optima at the early phase of iterations. In order to conquer this algorithm specific inabilities, many research studies have been conducted in the literature dealing with the improvements and enhancements on the search mechanism of CROW. Structured population mechanism plays a vital role in preserving and controlling diversity, and thus increases the solution efficiency in evolutionary algorithms. Among the different types of methods used in structured algorithms, the island model is one of the widely applied solution strategies, in which the population individuals are subdivided into a predefined number of subpopulations. Migration mechanism is the key factor increasing population diversity, which takes place between independently running subpopulations during iterations to exchange valuable and useful solution information. This study embeds the fundamentals of the island model concepts into the Crow Search Algorithm to improve its probing capabilities of the search domain, by means of the periodically interacting subpopulations on the course of iterations. In addition, four different hierarchical migration topologies have been proposed, and their search effectiveness have been evaluated and compared over 45 optimization test functions. The optimization function test set includes classic benchmark optimization problems and CEC 2015 benchmark functions. Furthermore, each hierarchical island model is applied for solving six different optimal control problems in order to investigate their efficiencies on multi-dimensional real world optimization problems. The investigated optimal control problems are parallel reaction, continuous stirred tank reactor, batch reactor consecutive reaction, nonlinear constrained mathematical system, nonlinear continuous stirred tank reactor and nonlinear crane container problems. It is found out that the island model concepts improved the optimization performance of CROW. The proposed island models outperformed or showed similar performance compared to the six selected literature optimizers for 27–29 classic benchmark optimization problems. Moreover, incorporating the master sub-population to the island model improved the optimization capability of the algorithm further in most cases. The island models that employ the master sub-population came up with more favorable results compared to their non-master sub-population peers in all optimal control problems. The island model that includes the master sub-population and has the migration topology entitled "82" found the most desirable solutions for 4–6 optimal control problems.
A non-linear auto-regressive exogenous method to forecast the photovoltaic power output

This paper deal about the prediction of SunModule SW 175 monocrystalline photovoltaic (PV) module power output installed in Belbis, Egypt. The proposes prediction model forecast one month using a non-linear auto-regressive exogenous method, based in neural network times series and Levenberg-Marquardt training algorithm. NARX neural network are powerful to solve several problems and popular in nonlinear control applications. The NARX model is choosing for rapid training and convergence speed and strong representativeness and is characterized by favourable dynamics and resistance to interference. Besides, the exactitude of NARX method has examined as a function of training data sets, error definitions relying on experimental data of a PV framework. The predicted power acquired by the NARX method gives a high correlativity with the experimental data and comparatively low errors. The forecast of output power obtained with the NARX method are compared with neural network and experimentally measured data. The obtained result is very accurate in R2 coefficient 99.47% and MSE = 20.5753% compared to NARX-Bayesian R2 = 99.47 and RMSE = 21.71%. Generally, the execution and exactness of the results are exceedingly relying upon the climate condition, and the R2 took a low value if the user data in series analysis are not very accurate.
DeepPTZ: Deep Self-Calibration for PTZ Cameras

Rotating and zooming cameras, also called PTZ (Pan-Tilt-Zoom) cameras, are widely used in modern surveillance systems. While their zooming ability allows acquiring detailed images of the scene, it also makes their calibration more challenging since any zooming action results in a modification of their intrinsic parameters. Therefore, such camera calibration has to be computed online; this process is called self-calibration. In this paper, given an image pair captured by a PTZ camera, we propose a deep learning based approach to automatically estimate the focal length and distortion parameters of both images as well as the rotation angles between them. The proposed approach relies on a dual-Siamese structure, imposing bidirectional constraints. The proposed network is trained on a large-scale dataset automatically generated from a set of panoramas. Empirically, we demonstrate that our proposed approach achieves competitive performance with respect to both deep learning based and traditional state-of-the art methods. Our code and model will be publicly available at https://github.com/ChaoningZhang/DeepPTZ.