Reviewerly/exHarmony huggingface dataset:
Everything is There in Latent Space: Attribute Editing and Attribute Style Manipulation by StyleGAN Latent Space Exploration

Unconstrained Image generation with high realism is now possible using recent Generative Adversarial Networks (GANs). However, it is quite challenging to generate images with a given set of attributes. Recent methods use style-based GAN models to perform image editing by leveraging the semantic hierarchy present in the layers of the generator. We present Few-shot Latent-based Attribute Manipulation and Editing (FLAME), a simple yet effective framework to perform highly controlled image editing by latent space manipulation. Specifically, we estimate linear directions in the latent space (of a pre-trained StyleGAN) that controls semantic attributes in the generated image. In contrast to previous methods that either rely on large-scale attribute labeled datasets or attribute classifiers, FLAME uses minimal supervision of a few curated image pairs to estimate disentangled edit directions. FLAME can perform both individual and sequential edits with high precision on a diverse set of images while preserving identity. Further, we propose a novel task of Attribute Style Manipulation to generate diverse styles for attributes such as eyeglass and hair. We first encode a set of synthetic images of the same identity but having different attribute styles in the latent space to estimate an attribute style manifold. Sampling a new latent from this manifold will result in a new attribute style in the generated image. We propose a novel sampling method to sample latent from the manifold, enabling us to generate a diverse set of attribute styles beyond the styles present in the training set. FLAME can generate diverse attribute styles in a disentangled manner. We illustrate the superior performance of FLAME against previous image editing methods by extensive qualitative and quantitative comparisons. FLAME generalizes well on out-of-distribution images from art domain as well as on other datasets such as cars and churches.
A machine learning-based approach for sentiment analysis on distance learning from Arabic Tweets

Social media platforms such as Twitter, YouTube, Instagram and Facebook are leading sources of large datasets nowadays. Twitter's data is one of the most reliable due to its privacy policy. Tweets have been used for sentiment analysis and to identify meaningful information within the dataset. Our study focused on the distance learning domain in Saudi Arabia by analyzing Arabic tweets about distance learning. This work proposes a model for analyzing people's feedback using a Twitter dataset in the distance learning domain. The proposed model is based on the Apache Spark product to manage the large dataset. The proposed model uses the Twitter API to get the tweets as raw data. These tweets were stored in the Apache Spark server. A regex-based technique for preprocessing removed retweets, links, hashtags, English words and numbers, usernames, and emojis from the dataset. After that, a Logistic-based Regression model was trained on the pre-processed data. This Logistic Regression model, from the field of machine learning, was used to predict the sentiment inside the tweets. Finally, a Flask application was built for sentiment analysis of the Arabic tweets. The proposed model gives better results when compared to various applied techniques. The proposed model is evaluated on test data to calculate Accuracy, F1 Score, Precision, and Recall, obtaining scores of 91%, 90%, 90%, and 89%, respectively.
Customer Loan Eligibility Prediction using Machine Learning Algorithms in Banking Sector

As there is rapid growth in the banking and financial sector every individual is relying on the banks and the loans provided by global and national banking sectors. In general, bank will be providing loans based on the net property value and asserts of the bank to the limited people who are eligible, and approvals of the loans will be based on the income resources of the customers. In this project various machine learning techniques are implemented to predict the eligibility of the customer for a loan. Customer data is collected based on various banks and accessing the customer profiles to analyze the data based on the parameters which are essential to integrate with the machine learning techniques. Analyze the data and provide the results based on the customer profile to grant the loans using machine learning approach is most advanced than traditional loan approval-based systems. The key objectives of the project are data cleansing, key attributes selection and performance comparison of decision tree, random forest, support vector machine, K-nearest neighbor, and decision tree with AdaBoost machine learning methods on predicting the customer loan eligibility. Data is divided into training and testing parts and model is trained using train dataset and the model performance is evaluated on test dataset. Results evidence that ensemble model decision tree with adaboost technique given more accuracy compared to other implemented models.
Text Classification with Few Examples using Controlled Generalization

Abhijit Mahabal, Jason Baldridge, Burcu Karagol Ayan, Vincent Perot, Dan Roth. Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers). 2019.
High-Dimensional Bell Test without Detection Loophole

Violation of Bell's inequalities shows strong conflict between quantum mechanics and local realism. Loophole-free Bell tests not only deepen understanding of quantum mechanics, but are also important foundations for device-independent (DI) tasks in quantum information. High-dimensional quantum systems offer a significant advantage over qubits for closing the detection loophole. In the symmetric scenario, a detection efficiency as low as 61.8% can be tolerated using four-dimensional states and a four-setting Bell inequality [Phys. Rev. Lett. 104, 060401 (2010)PRLTAO0031-900710.1103/PhysRevLett.104.060401]. For the first time, we show that four-dimensional entangled photons violate a Bell inequality while closing the detection loophole in experiment. The detection efficiency of the four-dimensional entangled source is about 71.7%, and the fidelity of the state is 0.995±0.001. Combining the technique of multicore fibers, the realization of loophole-free high-dimensional Bell tests and high-dimensional quantum DI technologies are promising.
Impact of the Pandemic on STEAM Disciplines in the Sixth Grade of Primary Education

The demand for professionals entering the labor market requires knowledge and disciplines in the areas of Science, Technology, Engineering, Art and Mathematics (STEAM). Schools are the first link to train competent students for today’s society. However, the pandemic has conditioned the teaching–learning methodologies based on promoting STEAM in educational centers, which is the reason that leads us to carry out this study. The main objective of the research is to evaluate the STEAM dimensions in the sixth grade of primary education in times of pandemic. The study method is based on a quasi-experimental, descriptive and correlational design with an experimental group and a control group. The data are collected through a validated questionnaire, pre-test and post-test, which develops an assessment of student collaboration in STEAM activities. The sample is made up of 142 Spanish students, of which 68 belong to the control group and 74 to the experimental group. The conclusions of the study highlight that the active methodologies, based on computational thinking and on makerspaces of the future classroom, influenced the STEAM dimensions of the experimental group before the pandemic. However, the pandemic and the health restrictions in face-to-face classes led to a negative assessment of the experimental group in the STEAM dimensions.
Blind-Spot Collision Detection System for Commercial Vehicles Using Multi Deep CNN Architecture

Buses and heavy vehicles have more blind spots compared to cars and other road vehicles due to their large sizes. Therefore, accidents caused by these heavy vehicles are more fatal and result in severe injuries to other road users. These possible blind-spot collisions can be identified early using vision-based object detection approaches. Yet, the existing state-of-the-art vision-based object detection models rely heavily on a single feature descriptor for making decisions. In this research, the design of two convolutional neural networks (CNNs) based on high-level feature descriptors and their integration with faster R-CNN is proposed to detect blind-spot collisions for heavy vehicles. Moreover, a fusion approach is proposed to integrate two pre-trained networks (i.e., Resnet 50 and Resnet 101) for extracting high level features for blind-spot vehicle detection. The fusion of features significantly improves the performance of faster R-CNN and outperformed the existing state-of-the-art methods. Both approaches are validated on a self-recorded blind-spot vehicle detection dataset for buses and an online LISA dataset for vehicle detection. For both proposed approaches, a false detection rate (FDR) of 3.05% and 3.49% are obtained for the self recorded dataset, making these approaches suitable for real time applications.
Digital transformation of vocational schools: problem analysis

Modern society is characterized by a significant impact of information technologies on all spheres of human life. In a special way, the processes of digital transformation affect educational institutions, including vocational (vocational and technical) ones. Now vocational (vocational and technical) education occupies an important place in the sector of the country's economy, prioritizing effective training of highly qualified labourers in the state policy of Ukraine. Nowadays, the professional activity of labourers incorporates an intellectual component related to working with electronic devices, artificial intelligence systems, etc. Monitoring of the labor market shows that a skilled worker of the XXI century should be able to think critically, process information analytically, and work with mechatronics systems. The analysis of the European experience in training qualified workers reflects a certain lag of domestic institutions in terms of digital supply. At the same time, the level of teachers' digital competence at vocational (vocational and technical) education institutions needs improving. As a result, the issues of digital transformation for educational institutions are urgent and topical. Provision of modern digital equipment, formation and development of digital competence of all participants in the educational space are becoming the main tasks of teaching stuff in the current conditions. In a special way, the tasks set become relevant during the period of quarantine restrictions, when educational institutions mainly work on distance and mixed forms of teaching.
A Lossless Compression and Encryption Method for Remote Sensing Image Using LWT, Rubik’s Cube and 2D-CCM

This paper proposes a lossless encryption–compression algorithm for large-scale remote sensing images. Firstly, the red, green and blue components of color image are compressed by a lossless predictive encoding. Then, the lifting wavelet transform (LWT) is used to decompose the encoding results. And a new Rubik’s cube transformation is introduced to scramble the decomposed coefficients, which uses the chaotic sequence generated by 2D Cubic–Chebyshev map (2D-CCM). The initial values of 2D-CCM are obtained from the chi-square test values of the three components, which leads to the algorithm related to the plaintext image. After that, the scrambling coefficients are thresholding, and the position sequences generated in the process are encrypted and compressed by the proposed encrypted run-length encoding (E-RLE). The processed coefficients are further compressed by Huffman encoding. At the end, the final results are obtained by a novel helix diffusion which is related to the chaotic sequence. Experimental results show that, this algorithm achieves higher lossless compression ratio with lower time complexity, and the encryption scheme has higher security.
A Dynamic Bayesian Model for Breast Cancer Survival Prediction

<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Objective:</i> Predicting breast cancer survival and targeting patients at high-risk of mortality is of crucial importance. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Methods:</i> We built a Bayesian Dynamic Cox (BDCox) model for predicting 5-year overall survival in breast cancer patients using data of the SEER Cancer Registry with 12,840 women. Four feature selection methods were used to identify predictors and enhance parsimony: fast backward variable selection, elastic net, Bayesian Model Average (BMA), and clinical expertise. All resulting models and a baseline full model containing all features were internally validated via bootstrapping and externally validated in the Shanghai Breast Cancer Survival Study. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Results:</i> BMA outperformed other feature selection methods in both internal and external validations. The BDCox model with 12 predictors had the best performance. Several predictors showed time-varying associations with survival that are in agreement with previous studies. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Conclusion:</i> The model developed using BDCox outperformed other prognostic models considered in our study. The internal validation results indicate that the BDCox model is capable of achieving high prediction accuracy (C-statistic: 0.802), and the external validation results showed excellent generalizability of the BDCox model (C-statistic: 0.739). <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Significance:</i> We built a dynamic Bayesian model from the large population-based registry SEER for predicting 5-year breast cancer overall survival. The prediction performance of the BDCox model is significantly better than other survival models.
Deep Unrolled Low-Rank Tensor Completion for High Dynamic Range Imaging

The major challenge in high dynamic range (HDR) imaging for dynamic scenes is suppressing ghosting artifacts caused by large object motions or poor exposures. Whereas recent deep learning-based approaches have shown significant synthesis performance, interpretation and analysis of their behaviors are difficult and their performance is affected by the diversity of training data. In contrast, traditional model-based approaches yield inferior synthesis performance to learning-based algorithms despite their theoretical thoroughness. In this paper, we propose an algorithm unrolling approach to ghost-free HDR image synthesis algorithm that unrolls an iterative low-rank tensor completion algorithm into deep neural networks to take advantage of the merits of both learning- and model-based approaches while overcoming their weaknesses. First, we formulate ghost-free HDR image synthesis as a low-rank tensor completion problem by assuming the low-rank structure of the tensor constructed from low dynamic range (LDR) images and linear dependency among LDR images. We also define two regularization functions to compensate for modeling inaccuracy by extracting hidden model information. Then, we solve the problem efficiently using an iterative optimization algorithm by reformulating it into a series of subproblems. Finally, we unroll the iterative algorithm into a series of blocks corresponding to each iteration, in which the optimization variables are updated by rigorous closed-form solutions and the regularizers are updated by learned deep neural networks. Experimental results on different datasets show that the proposed algorithm provides better HDR image synthesis performance with superior robustness compared with state-of-the-art algorithms, while using significantly fewer training samples.
AutoPruner: transformer-based call graph pruning

Constructing a static call graph requires trade-offs between soundness and precision. Program analysis techniques for constructing call graphs are unfortunately usually imprecise. To address this problem, researchers have recently proposed call graph pruning empowered by machine learning to post-process call graphs constructed by static analysis. A machine learning model is built to capture information from the call graph by extracting structural features for use in a random forest classifier. It then removes edges that are predicted to be false positives. Despite the improvements shown by machine learning models, they are still limited as they do not consider the source code semantics and thus often are not able to effectively distinguish true and false positives. In this paper, we present a novel call graph pruning technique, AutoPruner, for eliminating false positives in call graphs via both statistical semantic and structural analysis. Given a call graph constructed by traditional static analysis tools, AutoPruner takes a Transformer-based approach to capture the semantic relationships between the caller and callee functions associated with each edge in the call graph. To do so, AutoPruner fine-tunes a model of code that was pre-trained on a large corpus to represent source code based on descriptions of its semantics. Next, the model is used to extract semantic features from the functions related to each edge in the call graph. AutoPruner uses these semantic features together with the structural features extracted from the call graph to classify each edge via a feed-forward neural network. Our empirical evaluation on a benchmark dataset of real-world programs shows that AutoPruner outperforms the state-of-the-art baselines, improving on F-measure by up to 13% in identifying false-positive edges in a static call graph.
Two-Stage Sparse Representation Clustering for Dynamic Data Streams

Data streams are a potentially unbounded sequence of data objects, and the clustering of such data is an effective way of identifying their underlying patterns. Existing data stream clustering algorithms face two critical issues: 1) evaluating the relationship among data objects with individual landmark windows of fixed size and 2) passing useful knowledge from previous landmark windows to the current landmark window. Based on sparse representation techniques, this article proposes a two-stage sparse representation clustering (TSSRC) method. The novelty of the proposed TSSRC algorithm comes from evaluating the effective relationship among data objects in the landmark windows with an accurate number of clusters. First, the proposed algorithm evaluates the relationship among data objects using sparse representation techniques. The dictionary and sparse representations are iteratively updated by solving a convex optimization problem. Second, the proposed TSSRC algorithm presents a dictionary initialization strategy that seeks representative data objects by making full use of the sparse representation results. This efficiently passes previously learned knowledge to the current landmark window over time. Moreover, the convergence and sparse stability of TSSRC can be theoretically guaranteed in continuous landmark windows under certain conditions. Experimental results on benchmark datasets demonstrate the effectiveness and robustness of TSSRC.
An Efficient Algorithm for Mining Stable Periodic High-Utility Sequential Patterns

Periodic high-utility sequential pattern mining (PHUSPM) is used to extract periodically occurring high-utility sequential patterns (HUSPs) from a quantitative sequence database according to a user-specified minimum utility threshold (minutil). A sequential pattern’s periodicity is determined by measuring when the frequency of its periods (the time between two consecutive happenings of the sequential pattern) exceed a user-specified maximum periodicity threshold (maxPer). However, due to the strict judgment threshold, the traditional PHUSPM method has the problem that some useful sequential patterns are discarded and the periodic values of some sequential patterns fluctuate greatly (i.e., are unstable). In frequent itemset mining (FIM), some researchers put forward some strategies to solve these problems. Because of the symmetry of frequent itemset pattern (FIPs), these strategies cannot be directly applied to PHUSPM. In order to address these issues, this work proposes the stable periodic high-utility sequential pattern mining (SPHUSPM) algorithm. The contributions made by this paper are as follows. First, we introduce the concept of stability to overcome the abovementioned problems, mine sequential patterns with stable periodic behavior, and propose the concept of stable periodic high-utility sequential patterns (SPHUSPs) for the first time. Secondly, we design a new data structure named the PUL-list to record the periodic information of sequential patterns, thereby improving the mining efficiency. Thirdly, we propose the maximum lability pruning strategy in sequential pattern (MLPS), which can prune a large number of unstable sequential patterns in advance. To assess the algorithm’s effectiveness, we perform many experiments. It turns out that the algorithm can not only mine patterns that are ignored by traditional algorithms, but also ensure that the discovered patterns have stable periodic behavior. In addition, after using the MLPS pruning strategy, the algorithm can prune 46.5% of candidates in advance on average in six datasets. Pruning a large number of candidates in advance not only speeds up the mining process, but also greatly reduces memory usage.
Intelligent MIMO Detection Using Meta Learning

In a <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${K}$ </tex-math></inline-formula> -best detector for multiple-input-multiple-output (MIMO) systems, the value of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${K}$ </tex-math></inline-formula> needs to be sufficiently large to achieve near-maximum-likelihood (ML) performance. By treating <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${K}$ </tex-math></inline-formula> as a variable that can be adjusted according to a fitting function of some learnable coefficients, an intelligent MIMO detection network based on deep neural networks (DNN) is proposed to reduce complexity of the detection algorithm with little performance degradation. In particular, the proposed intelligent detection algorithm uses meta learning to learn the coefficients of the fitting function for <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${K}$ </tex-math></inline-formula> to circumvent the problem of learning <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${K}$ </tex-math></inline-formula> directly. The idea of network fusion is used to combine the learning results of the meta learning component networks. Simulation results show that the proposed scheme achieves near-ML detection performance while its complexity is close to that of linear detectors. Besides, it also exhibits strong ability of fast training.