Reviewerly/exHarmony huggingface dataset:
Development of the online course for training master students majoring in mathematics

Abstract This article considers the issue of implementing a model of blended learning to prepare master students majoring in Mathematics (speciality code in Ukrainian educational system “014 Secondary Education. Mathematics”). The research analyses the existing developments of the issue about the use of blended learning while training would-be mathematics teachers. The researchers determined and explained the stages of work on developing the online course “Methods for Teaching Mathematics to Students at Technical Universities”, that is used when students learn methodological subjects of the curriculum. The research describes the development of the theoretical online course model and methodological recommendations on the learning materials and preparing papers for the course. The article offers recommendations related to the course structure. The course developers defined the usability criteria of the educational platforms, determined the stages of course users’ activity, their content, and organization. The research describes the areas of online course activity management, the course tutors’ and moderators’ teamwork is defined as the main condition of its development and support. In order to prove the efficiency of implementing blended learning of the methodological subjects, an experiment was carried out during the assistant practice in technical universities that master students of the specialization “Mathematics” had. The results allowed confirming the efficiency of students’ practical training during blended learning of the methodological subjects that in its turn encouraged the improvement of the assistant practice results.
Knowledge-Aware Group Representation Learning for Group Recommendation

Nowadays, going out and participating in group activities is an indispensable part of human life, and group recommendation systems are needed to provide suggestions. In practice, group recommendation faces serious sparsity issues due to the lack of group-item interaction data, and the key challenge is to aggregate group member preference for group decision making. Conventional group recommendations applied a predefined strategy to aggregate the preferences of group members, which cannot model the group decision making process and do not address the data sparsity problem well. In this paper, we introduce knowledge graph into group recommendation as side information, and propose a novel end-to-end method named knowledge graph-based attentive group recommendation (KGAG) to solve the data sparsity and preference aggregation problems. Specifically, a graph convolution network (GCN) is employed to capture abundant structure information of items and users in knowledge graph to overcome the sparsity problem. Besides, to learn knowledge-aware group representation for inferring the group decision better, we capture the user-item connectivity and user-user connectivity in knowledge graph, and then adopt attention mechanism to learn the influence of each member according to user-user interaction in group and the candidate item, for member preference aggregation. Additionally, the attention mechanism can provide interpretability to group recommendation. Moreover, we extend the margin loss to our KGAG which forces the prediction score of positive item to be a distance larger than that of negative item. Experimental results show the superiority of the proposed KGAG and verify the efficacy of each component of KGAG.
Using Explainability to Help Children UnderstandGender Bias in AI

Machine learning systems have become ubiquitous into our society. This has raised concerns about the potential discrimination that these systems might exert due to unconscious bias present in the data, for example regarding gender and race. Whilst this issue has been proposed as an essential subject to be included in the new AI curricula for schools, research has shown that it is a difficult topic to grasp by students. We propose an educational platform tailored to raise the awareness of gender bias in supervised learning, with the novelty of using Grad-CAM as an explainability technique that enables the classifier to visually explain its own predictions. Our study demonstrates that preadolescents (N=78, age 10-14) significantly improve their understanding of the concept of bias in terms of gender discrimination, increasing their ability to recognize biased predictions when they interact with the interpretable model, highlighting its suitability for educational programs.
A Novel Method for Intrinsic and Extrinsic Parameters Estimation by Solving Perspective-Three-Point Problem with Known Camera Position

The aim of the perspective-three-point (P3P) problem is to estimate extrinsic parameters of a camera from three 2D–3D point correspondences, including the orientation and position information. All the P3P solvers have a multi-solution phenomenon that is up to four solutions and needs a fully calibrated camera. In contrast, in this paper we propose a novel method for intrinsic and extrinsic parameter estimation based on three 2D–3D point correspondences with known camera position. Our core contribution is to build a new, virtual camera system whose frame and image plane are defined by the original 3D points, to build a new, intermediate world frame by the original image plane and the original 2D image points, and convert our problem to a P3P problem. Then, the intrinsic and extrinsic parameter estimation is to solve frame transformation and the P3P problem. Lastly, we solve the multi-solution problem by image resolution. Experimental results show its accuracy, numerical stability and uniqueness of the solution for intrinsic and extrinsic parameter estimation in synthetic data and real images.
Improving Panoptic Segmentation at All Scales

Crop-based training strategies decouple training resolution from GPU memory consumption, allowing the use of large-capacity panoptic segmentation networks on multi-megapixel images. Using crops, however, can introduce a bias towards truncating or missing large objects. To address this, we propose a novel crop-aware bounding box regression loss (CABB loss), which promotes predictions to be consistent with the visible parts of the cropped objects, while not over-penalizing them for extending outside of the crop. We further introduce a novel data sampling and augmentation strategy which improves generalization across scales by counteracting the imbalanced distribution of object sizes. Combining these two contributions with a carefully designed, top-down panoptic segmentation architecture, we obtain new state-of-the-art results on the challenging Mapillary Vistas (MVD), Indian Driving and Cityscapes datasets, surpassing the previously best approach on MVD by +4.5% PQ and +5.2% mAP.
A Deep Learning Approach for Face Detection using Max Pooling

Deep learning is a trendy term these days, and it refers to a modern age in machine learning in which algorithms are taught to identify patterns in vast amounts of data. It mostly refers to studying various layers of representation, which assists in the understanding of data that includes text, sound, and pictures. To interact with the objects in a video series, many researchers use a form of deep learning called a CNN. Face detection involves several face-related technologies, such as face authentication, facial recognition, and face clustering. For identification and understanding, effective preparation must be carried out. The standard technique did not produce a positive outcome in terms of face recognition precision. The objectives of this research are by using a deep learning model to enhance the accuracy of face detection. For recognizing faces from datasets, the proposed model utilizes a deep learning technique named convolutional neural networks. The proposed work is applied using Max Pooling, a well-known deep learning process. Our model is trained and validated using the LFW dataset, which includes 13000 photos collected from Kaggle. The training accuracy of the model was 95.72% percent, and the validation accuracy was 96.27%.
Zero-Shot Text Classification via Knowledge Graph Embedding for Social Media Data

The idea of “citizen sensing” and “human as sensors” is crucial for social Internet of Things, an integral part of cyber–physical–social systems (CPSSs). Social media data, which can be easily collected from the social world, has become a valuable resource for research in many different disciplines, e.g., crisis/disaster assessment, social event detection, or the recent COVID-19 analysis. Useful information, or knowledge derived from social data, could better serve the public if it could be processed and analyzed in more efficient and reliable ways. Advances in deep neural networks have significantly improved the performance of many social media analysis tasks. However, deep learning models typically require a large amount of labeled data for model training, while most CPSS data is not labeled, making it impractical to build effective learning models using traditional approaches. In addition, the current state-of-the-art, pretrained natural language processing (NLP) models do not make use of existing knowledge graphs, thus often leading to unsatisfactory performance in real-world applications. To address the issues, we propose a new zero-shot learning method which makes effective use of existing knowledge graphs for the classification of very large amounts of social text data. Experiments were performed on a large, real-world tweet data set related to COVID-19, the evaluation results show that the proposed method significantly outperforms six baseline models implemented with state-of-the-art deep learning models for NLP.
Causal Hidden Markov Model for Time Series Disease Forecasting

We propose a causal hidden Markov model to achieve robust prediction of irreversible disease at an early stage, which is safety-critical and vital for medical treatment in early stages. Specifically, we introduce the hidden variables which propagate to generate medical data at each time step. To avoid learning spurious correlation (e.g., confounding bias), we explicitly separate these hidden variables into three parts: a) the disease (clinical)-related part; b) the disease (non-clinical)-related part; c) others, with only a),b) causally related to the disease however c) may contain spurious correlations (with the disease) inherited from the data provided. With personal attributes and disease label respectively provided as side information and supervision, we prove that these disease-related hidden variables can be disentangled from others, implying the avoidance of spurious correlation for generalization to medical data from other (out-of-) distributions. Guaranteed by this result, we propose a sequential variational auto-encoder with a reformulated objective function. We apply our model to the early prediction of peripapillary atrophy and achieve promising results on out-of-distribution test data. Further, the ablation study empirically shows the effectiveness of each component in our method. And the visualization shows the accurate identification of lesion regions from others. <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup>
Worst-Case Optimal Graph Joins in Almost No Space

We present an indexing scheme that supports worst-case optimal (wco) joins over graphs within compact space. Supporting all possible wco joins using conventional data structures - based on B(+)-Trees, tries, etc. - requires 6 index orders in the case of graphs represented as triples. We rather propose a form of index, which we call a ring, that indexes each triple as a set of cyclic bidirectional strings of length 3. Rather than maintaining 6 orderings, we can use one ring to index them all. This ring replaces the graph and uses only sublinear extra space on top of the graph; in order words, the ring supports worst-case optimal graph joins in almost no space beyond storing the graph itself. We perform experiments using our representation to index a large graph (Wikidata) in memory, over which wco join algorithms are implemented. Our experiments show that the ring offers the best overall performance for query times while using only a small fraction of the space when compared with several state-of-the-art approaches.
A Lightweight Keypoint-Based Oriented Object Detection of Remote Sensing Images

Object detection in remote sensing images has been widely used in military and civilian fields and is a challenging task due to the complex background, large-scale variation, and dense arrangement in arbitrary orientations of objects. In addition, existing object detection methods rely on the increasingly deeper network, which increases a lot of computational overhead and parameters, and is unfavorable to deployment on the edge devices. In this paper, we proposed a lightweight keypoint-based oriented object detector for remote sensing images. First, we propose a semantic transfer block (STB) when merging shallow and deep features, which reduces noise and restores the semantic information. Then, the proposed adaptive Gaussian kernel (AGK) is adapted to objects of different scales, and further improves detection performance. Finally, we propose the distillation loss associated with object detection to obtain a lightweight student network. Experiments on the HRSC2016 and UCAS-AOD datasets show that the proposed method adapts to different scale objects, obtains accurate bounding boxes, and reduces the influence of complex backgrounds. The comparison with mainstream methods proves that our method has comparable performance under lightweight.
On the effective initialisation for restricted Boltzmann machines via duality with Hopfield model

Restricted Boltzmann machines (RBMs) with a binary visible layer of size N and a Gaussian hidden layer of size P have been proved to be equivalent to a Hopfield neural network (HNN) made of N binary neurons and storing P patterns ξ, as long as the weights w in the former are identified with the patterns. Here we aim to leverage this equivalence to find effective initialisations for weights in the RBM when what is available is a set of noisy examples of each pattern, aiming to translate statistical mechanics background available for HNN to the study of RBM's learning and retrieval abilities. In particular, given a set of definite, structureless patterns we build a sample of blurred examples and prove that the initialisation where w corresponds to the empirical average ξ¯ over the sample is a fixed point under stochastic gradient descent. Further, as a toy application of the duality between HNN and RBM, we consider the simplest random auto-encoder (a three layer network made of two RBMs coupled by their hidden layer) and evidence that, as long as the parameter setting corresponds to the retrieval region of the dual HNN, reconstruction and denoising can be accomplished trivially, while when the system is in the spin-glass phase inference algorithms are necessary. This questions the need for larger retrieval regions which we obtain by applying a Gram–Schmidt orthogonalisation to the patterns: in fact, this procedure yields to a set of patterns devoid of correlations and for which the largest retrieval region can be accomplished. Finally we consider an application of duality also in a structured case: we test this approach on the MNIST dataset, and obtain that the network performs already ∼67% of successful classifications, suggesting it can be exploited as a computationally-cheap pre-training.
Decision boundary clustering for efficient local SVM

Scaling up support vector machine (SVM) for large data sets remains one of its main challenges. One way to achieve this is to break down the problem into smaller ones using clustering techniques where local SVM models are constructed. Although this approach is considerably fast compared to the standard SVM, its performance is sometimes inferior even when a local kernel SVM is used as in k-local SVM (KSVM). This often occurs due to the overfitting of some local models when the corresponding clusters are unbalanced, i.e., most of their patterns belong to one class. To alleviate this problem for KSVM, a new supervised clustering technique is proposed to partition the data around the decision boundary into nearly balanced clusters. For a binary classification problem, this is accomplished as follows. First, one of the class regions (e.g. the more dense) is clustered into k clusters. Then, the clusters that are closest to the decision boundary are determined. Finally, these clusters are expanded to include the closest patterns from all classes. In this way, each cluster includes a reasonable number of patterns of each class that helps to mitigate the overfitting problem. A comparison of the proposed approach with KSVM, clustered SVM (CSVM), the standard SVM and two of the top ensemble classification trees, namely Random Forest and AdaBoost, for several benchmark large data sets was accomplished. The experimental results showed that the proposed approach outperforms KSVM and CSVM and competes the best model, especially when the radial basis kernel is used, for most data sets.
Discovering Low-Precision Networks Close to Full-Precision Networks for Efficient Inference

To realize the promise of ubiquitous embedded deep network inference, it is essential to seek limits of energy and area efficiency. Low-precision networks offer promise as energy and area scale down quadratically with precision. We demonstrate 8- and 4-bit networks that meet or exceed the accuracy of their full-precision versions on the ImageNet classification benchmark. We hypothesize that gradient noise due to quantization during training increases with reduced precision, and seek ways to overcome this. The number of iterations required by SGD to achieve a given training error is related to the square of (a) the distance of the initial solution from the final and (b) the maximum variance of the gradient estimates. Accordingly, we reduce solution distance by starting with pretrained fp32 baseline networks, and combat noise introduced by quantizing weights and activations during training by training longer and reducing learning rates. Sensitivity analysis indicates that these techniques, coupled with activation function range calibration, are sufficient to discover low-precision networks close to fp32 precision baseline networks. Our results provide evidence that 4-bits suffice for classification.
Real-Time OFDM Signal Modulation Classification Based on Deep Learning and Software-Defined Radio

This letter presents our initial results for real-time orthogonal frequency division multiplexing (OFDM) signal modulation classification based on deep learning and software-defined radio. We generate a modulation classification dataset under a dynamic fading channel, including 6 different OFDM modulation signals, and propose a novel neural network with triple-skip residual stack (TRS) as the basic unit. Each TRS has multiple residual units with gradually increasing convolutional layers. Finally, a near real-time classification system is designed based on the proposed network and GNU Radio. The processing delay incurred by the detection and modulation classification is about 4 ms. It is worth mentioning that the classification accuracy can reach 64% at -10 dB, which is about 7% higher than ResNet and VGG.
Privacy preserving rule-based classifier using modified artificial bee colony algorithm

Privacy preserving data mining is a hot research field of data mining. The aim of privacy preserving data mining is to prevent the leakage of the sensitive information of individuals while performing data mining techniques. Classification task is one of the most studied fields in data mining hence in privacy preserving data mining as well. On the other hand, differential privacy is a powerful privacy guarantee that determines privacy leakage ratio by using ∊ parameter and enables researchers to mine data which includes sensitive information. Implementations of some well-known classification algorithms such as k-NN, Naïve Bayes, ID3, etc. with differential privacy have been developed. Although the success of the rule-based classifiers using meta-heuristics such as Ant-Miner, BeeMiner etc. in data mining has been demonstrated, any implementation of these classification algorithms with differential privacy has not been proposed in the literature until now to our best knowledge. Artificial bee colony (ABC) is a nature inspired algorithm which imitates foraging behavior of bees, and some approaches using ABC to discover classification rules have been proposed recently and the success of ABC algorithm for the discovery of classification rules has been demonstrated. Motivated by this shortcoming in the literature, we propose to develop a rule-based classifier using ABC algorithm with input perturbation technique of differential privacy to perform privacy preserving classification. According to our experimental results, the proposed ABC-based classifier performs better than the well-known algorithms that are SVM, C4.5, Holte’s One Rule, PART, and RIPPER over non-private and differentially private versions of the datasets in terms of classification performance.
Understanding quality of experience of heuristic-based HTTP adaptive bitrate algorithms

Adaptive bitrate (ABR) algorithms play a crucial role in delivering the highest possible viewer's Quality of Experience (QoE) in HTTP Adaptive Streaming (HAS). Online video streaming service providers use HAS - the dominant video streaming technique on the Internet - to deliver the best QoE for their users. A viewer's delight relies heavily on how the ABR of a media player can adapt the stream's quality to the current network conditions. QoE for video streaming sessions has been assessed in many research projects to give better insight into the significant quality metrics such as startup delay and stall events. The ITU Telecommunication Standardization Sector (ITU-T) P.1203 quality evaluation model allows to algorithmically predict a subjective Mean Opinion Score (MOS) by considering various quality metrics. Subjective evaluation is the best assessment method for examining the end-user opinion over a video streaming session's experienced quality. We have conducted subjective evaluations with crowdsourced participants and evaluated the MOS of the sessions using the ITU-T P.1203 quality model. This paper's main contribution is to investigate the correspondence of subjective and objective evaluations for well-known heuristic-based ABRs.
Learning the Superpixel in a Non-iterative and Lifelong Manner

Superpixel is generated by automatically clustering pixels in an image into hundreds of compact partitions, which is widely used to perceive the object contours for its excel-lent contour adherence. Although some works use the Convolution Neural Network (CNN) to generate high-quality superpixel, we challenge the design principles of these net-works, specifically for their dependence on manual labels and excess computation resources, which limits their flexibility compared with the traditional unsupervised segmentation methods. We target at redefining the CNN-based superpixel segmentation as a lifelong clustering task and pro-pose an unsupervised CNN-based method called LNS-Net. The LNS-Net can learn superpixel in a non-iterative and lifelong manner without any manual labels. Specifically, a lightweight feature embedder is proposed for LNS-Net to efficiently generate the cluster-friendly features. With those features, seed nodes can be automatically assigned to cluster pixels in a non-iterative way. Additionally, our LNS-Net can adapt the sequentially lifelong learning by rescaling the gradient of weight based on both channel and spatial context to avoid overfitting. Experiments show that the proposed LNS-Net achieves significantly better performance on three benchmarks with nearly ten times lower complexity compared with other state-of-the-art methods.