Reviewerly/exHarmony huggingface dataset:
AC-SUM-GAN: Connecting Actor-Critic and Generative Adversarial Networks for Unsupervised Video Summarization

This paper presents a new method for unsupervised video summarization. The proposed architecture embeds an Actor-Critic model into a Generative Adversarial Network and formulates the selection of important video fragments (that will be used to form the summary) as a sequence generation task. The Actor and the Critic take part in a game that incrementally leads to the selection of the video key-fragments, and their choices at each step of the game result in a set of rewards from the Discriminator. The designed training workflow allows the Actor and Critic to discover a space of actions and automatically learn a policy for key-fragment selection. Moreover, the introduced criterion for choosing the best model after the training ends, enables the automatic selection of proper values for parameters of the training process that are not learned from the data (such as the regularization factor σ). Experimental evaluation on two benchmark datasets (SumMe and TVSum) demonstrates that the proposed AC-SUM-GAN model performs consistently well and gives SoA results in comparison to unsupervised methods, that are also competitive with respect to supervised methods.
A multimodal approach using deep learning for fall detection

A computational system able to automatically and efficiently detect and classify falls would be beneficial for monitoring the elderly population and speed up the assistance proceedings, reducing the risk of prolonged injuries and death. One of the most common problems in such systems is the high number of false-positives in their recognition scheme, which may cause an overload on surveillance system calls. We address this problem by proposing different topologies of a multimodal convolution neural network, which is trained to detect falls based on RGB images and information from accelerometers. We train and evaluate our networks with the UR Fall Detection dataset and UP-Fall dataset, and provide an extensive comparison with state-of-the-art models. Our model reached good results on UR Fall Detection dataset and achieved the state-of-art on UP-Fall detection dataset, relying on easily available sensors to do so, demonstrating it can be a scalable solution for robust fall detection in the real world.
Does Comma Selection Help to Cope with Local Optima?

One hope when using non-elitism in evolutionary computation is that the ability to abandon the current-best solution aids leaving local optima. To improve our understanding of this mechanism, we perform a rigorous runtime analysis of a basic non-elitist evolutionary algorithm (EA), the $$(\mu ,\lambda )$$ EA, on the most basic benchmark function with a local optimum, the jump function. We prove that for all reasonable values of the parameters and the problem, the expected runtime of the $$(\mu ,\lambda )$$ EA is, apart from lower order terms, at least as large as the expected runtime of its elitist counterpart, the $$(\mu +\lambda )$$ EA (for which we conduct the first runtime analysis on jump functions to allow this comparison). Consequently, the ability of the $$(\mu ,\lambda )$$ EA to leave local optima to inferior solutions does not lead to a runtime advantage. We complement this lower bound with an upper bound that, for broad ranges of the parameters, is identical to our lower bound apart from lower order terms. This is the first runtime result for a non-elitist algorithm on a multi-modal problem that is tight apart from lower order terms.
Breast Cancer–Detection System Using PCA, Multilayer Perceptron, Transfer Learning, and Support Vector Machine

This study proposed a new processing method to predict breast cancer on the basis of nine individual attributes, including age, body mass index, glucose, insulin, and a homeostasis model assessment.First, principal component analysis (PCA) was used to identify valuable parts of the data and further reduce the dimensions of the data.The cumulative proportion of the top five major components was 99.89%.The multilayer perceptron network (MLP) method was then used to extract characteristics included in the data, and the structure of the network was designed for the exploration of how data developed as the dimensions increased or decreased.As such, the model was established to first explore (high dimensional) and then develop (low dimensional) data.After training and learning, the models could segregate the representative attributes and numbers, and the characteristic data were then used as classifiers through transfer learning techniques using support vector machines.To verify the proposed method, the experiment performed k-fold cross-validation 50 times on average.Experimental results verified the proposed method with 10-fold cross-validation using the dataset of Manuel Gomes from the University Hospital Centre of Coimbra, and an accuracy of 86.97% was achieved.The results indicate that the proposed series of processes and methods can effectively and powerfully examine the incidence of breast cancer.Furthermore, the data processed using only the PCA method as well as the characteristics extracted through the PCA method then combined with MLP after learning were analyzed.The differences displayed for the visual technique characteristics of the t-distributed stochastic neighbor embedding were compared.
GenASM: A High-Performance, Low-Power Approximate String Matching Acceleration Framework for Genome Sequence Analysis

Genome sequence analysis has enabled significant advancements in medical and scientific areas such as personalized medicine, outbreak tracing, and the understanding of evolution. To perform genome sequencing, devices extract small random fragments of an organism's DNA sequence (known as reads). The first step of genome sequence analysis is a computational process known as read mapping. In read mapping, each fragment is matched to its potential location in the reference genome with the goal of identifying the original location of each read in the genome. Unfortunately, rapid genome sequencing is currently bottlenecked by the computational power and memory bandwidth limitations of existing systems, as many of the steps in genome sequence analysis must process a large amount of data. A major contributor to this bottleneck is approximate string matching (ASM), which is used at multiple points during the mapping process. ASM enables read mapping to account for sequencing errors and genetic variations in the reads. We propose GenASM, the first ASM acceleration framework for genome sequence analysis. GenASM performs bitvectorbased ASM, which can efficiently accelerate multiple steps of genome sequence analysis. We modify the underlying ASM algorithm (Bitap) to significantly increase its parallelism and reduce its memory footprint. Using this modified algorithm, we design the first hardware accelerator for Bitap. Our hardware accelerator consists of specialized systolic-array-based compute units and on-chip SRAMs that are designed to match the rate of computation with memory capacity and bandwidth, resulting in an efficient design whose performance scales linearly as we increase the number of compute units working in parallel. We demonstrate that GenASM provides significant performance and power benefits for three different use cases in genome sequence analysis. First, GenASM accelerates read alignment for both long reads and short reads. For long reads, GenASM outperforms state-of-the-art software and hardware accelerators by 116× and 3.9×, respectively, while reducing power consumption by 37× and 2.7×. For short reads, GenASM outperforms state-of-the-art software and hardware accelerators by 111× and 1.9×. Second, GenASM accelerates pre-alignment filtering for short reads, with 3.7× the performance of a state-of-the-art pre-alignment filter, while reducing power consumption by 1.7× and significantly improving the filtering accuracy. Third, GenASM accelerates edit distance calculation, with 22-12501× and 9.3-400× speedups over the state-of-the-art software library and FPGA-based accelerator, respectively, while reducing power consumption by 548-582× and 67×. We conclude that GenASM is a flexible, high-performance, and low-power framework, and we briefly discuss four other use cases that can benefit from GenASM.
Human activity recognition based on smartphone and wearable sensors using multiscale DCNN ensemble

Sensor-based Human Activity Recognition (sensor-based HAR) has been used in many real-world applications providing valuable knowledge to many areas, such as human-object interaction, medical, military and security. Recently, wearable devices have progressively gained momentum due to their relevant data provided by their sensors, which could be employed in sensor-based HAR. In addition, the large number of sensors present in these devices provides complementary data since each sensor provides distinct information. However, there are two main issues: data heterogeneity between multiple sensors and the temporal nature of the sensor data. To cope with the former issue, we process each sensor separately, learning their features and performing the classification before fusing with the other sensors. To exploit the latter issue, we use an approach to extract patterns in multiple temporal scales of the data, using an ensemble of Deep Convolution Neural Networks (DCNN). This is convenient since the data are already a temporal sequence and the multiple scales extracted provide meaningful information regarding the activities performed by the users. Consequently, our approach is able to extract both simple movement patterns, such as a wrist twist when picking up a spoon and complex movements, such as the human gait. This multimodal and multi-temporal approach outperforms previous state-of-the-art works in seven important datasets using two different protocols. Finally, we demonstrate that our proposed set of kernels improves sensor-based HAR in another multi-kernel approach, the widely employed inception network.
Differentiable vector graphics rasterization for editing and learning

We introduce a differentiable rasterizer that bridges the vector graphics and raster image domains, enabling powerful raster-based loss functions, optimization procedures, and machine learning techniques to edit and generate vector content. We observe that vector graphics rasterization is differentiable after pixel prefiltering. Our differentiable rasterizer offers two prefiltering options: an analytical prefiltering technique and a multisampling anti-aliasing technique. The analytical variant is faster but can suffer from artifacts such as conflation. The multisampling variant is still efficient, and can render high-quality images while computing unbiased gradients for each pixel with respect to curve parameters. We demonstrate that our rasterizer enables new applications, including a vector graphics editor guided by image metrics, a painterly rendering algorithm that fits vector primitives to an image by minimizing a deep perceptual loss function, new vector graphics editing algorithms that exploit well-known image processing methods such as seam carving, and deep generative models that generate vector content from raster-only supervision under a VAE or GAN training objective.
Federated Recommendation Systems

Recommender systems are heavily data-driven. In general, the more data the recommender systems use, the better the recommendation results are. However, due to privacy and security constraints, directly sharing user data is undesired. Such decentralized silo issues commonly exist in recommender systems. There have been many pilot studies on protecting data privacy and security when utilizing data silos. But, most works still need the users’ private data to leave the local data repository. Federated learning is an emerging technology, which tries to bridge the data silos and build machine learning models without compromising user privacy and data security. In this chapter, we introduce a new notion of federated recommender systems, which is an instantiation of federated learning on decentralized recommendation. We formally define the problem of the federated recommender systems. Then, we focus on categorizing and reviewing the current approaches from the perspective of the federated learning. Finally, we put forward several promising future research challenges and directions.
Export sales forecasting using artificial intelligence

Sales forecasting is important in production and supply chain management. It affects firms’ planning, strategy, marketing, logistics, warehousing and resource management. While traditional time series forecasting methods prevail in research and practice, they have several limitations. Causal forecasting methods are capable of predicting future sales behavior based on relationships between variables and not just past behavior and trends. This research proposes a framework for modeling and forecasting export sales using Genetic Programming, which is an artificial intelligence technique derived from the model of biological evolution. Analyzing an empirical case of an export company, an export sales forecasting model is suggested. Moreover, a sales forecast for a period of six weeks is conducted, the output of which is compared with the real sales data. Finally, a variable sensitivity analysis is presented for the causal forecasting model.
Deep Retinex Network for Single Image Dehazing

In this paper, we propose a retinex-based decomposition model for a hazy image and a novel end-to-end image dehazing network. In the model, the illumination of the hazy image is decomposed into natural illumination for the haze-free image and residual illumination caused by haze. Based on this model, we design a deep retinex dehazing network (RDN) to jointly estimate the residual illumination map and the haze-free image. Our RDN consists of a multiscale residual dense network for estimating the residual illumination map and a U-Net with channel and spatial attention mechanisms for image dehazing. The multiscale residual dense network can simultaneously capture global contextual information from small-scale receptive fields and local detailed information from large-scale receptive fields to precisely estimate the residual illumination map caused by haze. In the dehazing U-Net, we apply the channel and spatial attention mechanisms in the skip connection of the U-Net to achieve a trade-off between overdehazing and underdehazing by automatically adjusting the channel-wise and pixel-wise attention weights. Compared with scattering model-based networks, fully data-driven networks, and prior-based dehazing methods, our RDN can avoid the errors associated with the simplified scattering model and provide better generalization ability with no dependence on prior information. Extensive experiments show the superiority of the RDN to various state-of-the-art methods.
Evaluating Mixed and Augmented Reality: A Systematic Literature Review (2009-2019)

We present a systematic review of 45S papers that report on evaluations in mixed and augmented reality (MR/AR) published in ISMAR, CHI, IEEE VR, and UIST over a span of 11 years (2009-2019). Our goal is to provide guidance for future evaluations of MR/AR approaches. To this end, we characterize publications by paper type (e.g., technique, design study), research topic (e.g., tracking, rendering), evaluation scenario (e.g., algorithm performance, user performance), cognitive aspects (e.g., perception, emotion), and the context in which evaluations were conducted (e.g., lab vs. in-thewild). We found a strong coupling of types, topics, and scenarios. We observe two groups: (a) technology-centric performance evaluations of algorithms that focus on improving tracking, displays, reconstruction, rendering, and calibration, and (b) human-centric studies that analyze implications of applications and design, human factors on perception, usability, decision making, emotion, and attention. Amongst the 458 papers, we identified 248 user studies that involved 5,761 participants in total, of whom only 1,619 were identified as female. We identified 43 data collection methods used to analyze 10 cognitive aspects. We found nine objective methods, and eight methods that support qualitative analysis. A majority (216/248) of user studies are conducted in a laboratory setting. Often (138/248), such studies involve participants in a static way. However, we also found a fair number (30/248) of in-the-wild studies that involve participants in a mobile fashion. We consider this paper to be relevant to academia and industry alike in presenting the state-of-the-art and guiding the steps to designing, conducting, and analyzing results of evaluations in MR/AR.
A Comprehensive Survey on Local Differential Privacy toward Data Statistics and Analysis

Collecting and analyzing massive data generated from smart devices have become increasingly pervasive in crowdsensing, which are the building blocks for data-driven decision-making. However, extensive statistics and analysis of such data will seriously threaten the privacy of participating users. Local differential privacy (LDP) has been proposed as an excellent and prevalent privacy model with distributed architecture, which can provide strong privacy guarantees for each user while collecting and analyzing data. LDP ensures that each user's data is locally perturbed first in the client-side and then sent to the server-side, thereby protecting data from privacy leaks on both the client-side and server-side. This survey presents a comprehensive and systematic overview of LDP with respect to privacy models, research tasks, enabling mechanisms, and various applications. Specifically, we first provide a theoretical summarization of LDP, including the LDP model, the variants of LDP, and the basic framework of LDP algorithms. Then, we investigate and compare the diverse LDP mechanisms for various data statistics and analysis tasks from the perspectives of frequency estimation, mean estimation, and machine learning. What's more, we also summarize practical LDP-based application scenarios. Finally, we outline several future research directions under LDP.
Fuzzy high-utility pattern mining in parallel and distributed Hadoop framework

Over the past decade, high-utility itemset mining (HUIM) has received widespread attention that can emphasize more critical information than was previously possible using frequent itemset mining (FIM). Unfortunately, HUIM is very similar to FIM since the methodology determines itemsets using a binary model based on a pre-defined minimum utility threshold. Additionally, most previous works only focused on single, small datasets in HUIM, which is not realistic to any real-world scenarios today containing big data environments. In this work, the fuzzy-set theory and a MapReduce framework are both utilized to design a novel high fuzzy utility pattern mining algorithm to resolve the above issues. Fuzzy-set theory is first involved and a new algorithm called efficient high fuzzy utility itemset mining (EFUPM) is designed to discover high fuzzy utility patterns from a single machine. Two upper-bounds are then estimated to allow early pruning of unpromising candidates in the search space. To handle the large-scale of big datasets, a Hadoop-based high fuzzy utility pattern mining (HFUPM) algorithm is then developed to discover high fuzzy utility patterns based on the Hadoop framework. Experimental results clearly show that the proposed algorithms perform strongly to mine the required high fuzzy utility patterns whether in a single machine or a large-scale environment compared to the current state-of-the-art approaches.
Non-Autoregressive Transformer for Speech Recognition

Recently very deep transformers have outperformed conventional bi-directional long short-term memory networks by a large margin in speech recognition. However, to put it into production usage, inference computation cost is still a serious concern in real scenarios. In this paper, we study two different non-autoregressive transformer structure for automatic speech recognition (ASR): A-CMLM and A-FMLM. During training, for both frameworks, input tokens fed to the decoder are randomly replaced by special mask tokens. The network is required to predict the tokens corresponding to those mask tokens by taking both unmasked context and input speech into consideration. During inference, we start from all mask tokens and the network iteratively predicts missing tokens based on partial results. We show that this framework can support different decoding strategies, including traditional left-to-right. A new decoding strategy is proposed as an example, which starts from the easiest predictions to the most difficult ones. Results on Mandarin (Aishell) and Japanese (CSJ) ASR benchmarks show the possibility to train such a non-autoregressive network for ASR. Especially in Aishell, the proposed method outperformed the Kaldi ASR system and it matches the performance of the state-of-the-art autoregressive transformer with 7x speedup. Pretrained models and code will be made available after publication.
Feature Selection with Binary Symbiotic Organisms Search Algorithm for Email Spam Detection

One method to increase classifier accuracy is using Feature Selection (FS). The main idea in the FS is reducing complexity, eliminating irrelevant information, and deleting a subset of input features that either have little information or have no information for prediction. In this paper, three efficient binary methods based on the Symbiotic Organisms Search (SOS) algorithm were presented for solving the FS problem. In the first and second methods, several S_shaped and V_shaped transfer functions were used for the binarization of the SOS, respectively. These methods were called BSOSS and BSOSV. In the third method, two new operators called Binary Mutualism Phase (BMP) and Binary Commensalism Phase (BCP) were presented for binarization of the SOS, named Efficient Binary SOS (EBSOS). The proposed methods were run on 18 standard UCI datasets and compared to the base and important meta-heuristic algorithms. The test results showed that the EBSOS method has the best performance among the three proposed methods for the binarization of the SOS. Finally, the EBSOS method was compared to the Genetic Algorithm (GA), Binary Bat Algorithm (BBA), Binary Particle Swarm Optimization (BPSO) Algorithm, Binary Flower Pollination Algorithm (BFPA), Binary Grey Wolf Optimizer (BGWO) Algorithm, Binary Dragonfly Algorithm (BDA), and Binary Chaotic Crow Search Algorithm (BCCSA). In addition, the EBSOS method was executed on the spam email dataset with the KNN, NB, SVM, and MLP classifiers. The results showed that the EBSOS method has better performance compared to other methods in terms of feature count and accuracy criteria. Furthermore, it was practically evaluated on spam email detection in particular.