Reviewerly/exHarmony huggingface dataset:
Jumputan Batik for The Family of PKK RW 02 Kelurahan Baktijaya, Kecamatan Sukmajaya, Depok

Batik is a craft that has high artistic value and has become part of Indonesian culture which is a legacy of the ancestors of the Indonesian nation which has been widely known in the world. The potential of batik can be used to foster interest in the archipelago's literature, as a historical heritage that is still admired by all levels of society. One of the relics that is also strategic to be developed is wastra jumputan. One of the easier and faster batik fabrics to make and will be easily learned by the public. This jumputan batik training was applied to the families of RW 02 PKK women, Baktijaya Village, Sukmajaya District, Depok. This jumputan batik training was a follow-up to the previous training which was only held at the RT level. Through training with video recording tutorials and online methods, it will be one method of growing public interest in recognizing and developing the potential of Indonesian literature without having to meet in person. The results of the training show that the most prominent interest in jumputan batik is the motifs it produces. Various motifs can be produced with several manufacturing techniques that are relatively easy to master by the trainees. With the Covid-19 pandemic, this batik training is not like before, which is in one place but at home each and also followed by the families of PKK mothers by following the instructions we have given. As the end result of this effort, people who initially did not know or had followed this method of making jumputan wastra, in just two hours the community could master it well in producing various jumputan cloth motifs.
MODERN HIGHER MUSICOLOGICAL EDUCATION (PHD) IN UKRAINE: TRADITIONS AND INNOVATIONS

Modern higher musicological education (PhD) in Ukraine: traditions and innovationsMusic education and music pedagogy are integral components of music art as a complex system.It is at the level of these important areas is the process of comprehensive professional training of future musicians, associated with the translation and acquisition of professional knowledge, skills and abilities in all areas of music performance practice and music science.The modern methodology of teaching a set of music-historical, music-theoretical and music-performing disciplines, which are basic for the formation of professional competencies at the third (educational-scientific) level of higher music education (PhD), is based on close interaction of modern music-pedagogical science with the latest achievements in art history and humanities.Today in this area there is a significant semantic renewal, generated by the requirements of modern art life and the huge expansion of the problem field of modern musicology and the growth of its scientific areas and new branches.Music-pedagogical science as one of the fundamental branches of musicology and as a research area functions and develops in a wide cultural space of general humanities in constant integrative relations with socio-culturological (culturology, philosophy, aesthetics, history of culture, general history, pedagogy, psychology, etc.
SEQUENTIAL PATTERN MINING ALGORITHMS – RECENT TRENDS

Sequential pattern mining is a technique of data mining whose objective is to identify statistically relevant patterns within a database with time-related data. It has a wide range of applications in variety of domains like education, healthcare, bioinformatics, web usage mining, telecommunications, intrusion detection etc. At present, most of the real sequence databases are incremental in nature. So there is a need to explore incremental and distributed pattern mining algorithms. Periodic pattern mining is a technique to discover periodic pattern which may be a pattern that repeats itself after a specific time interval. It has a wide range of applications in weather prediction, stock market analysis, web usage recommendation etc. Moreover, uncertain frequent pattern mining has become a popular research domain among researchers, as many real-life databases at present consist of uncertain and incomplete data. In this paper, a novel attempt is made to incorporate a systematic literature review of state-of-the-art techniques of sequential pattern mining which ranges from incremental pattern mining, periodic pattern mining and uncertain frequent pattern mining. Researchers in the field of pattern mining will find it very useful to get the information about various algorithms of different types of pattern mining.
Anomaly Detection

Often, we tend to have an intrinsic notion of whether an observation is unexpected or abnormal. Sensors that seem to behave erratically or give readings that are rarely seen; an unheard-of combination of symptoms/test readings, or a rare pattern in a medical image such as a CT scan; and network traffic in an IT system that is unusual, these are a few cases that tend to raise attention. Detecting any abnormal occurrences in the data is referred to as anomaly detection.
STL Decomposition and SARIMA Model: The Case for Estimating Value-at-Risk of Covid-19 Increment Rate in DKI Jakarta

In this research, we propose an extreme values measure, the Value-at-Risk (VaR) based Seasonal Trend Loess (STL) Decomposition and Seasonal Autoregressive Integrated Moving Average (SARIMA) models, which is more sensitive to the seasonality of extreme value than the conventional VaR. We consider the problem of the seasonality and extreme value for increment rate of Covid-19 forecasting. For stakeholder, government and regulator, VaR estimation can be implemented to face the extreme wave of new positive Covid-19 in the future and minimize the losses that possibly affected in term of financial and human resources. Specifically, the estimation of VaR is developed with the difference lies on parameter estimators of STL and SARIMA model. The VaR has coverage probability as well as close 1-α. Thus, we propose to set α as parameter to estimate VaR. Consequently, the performance of VaR will depend not only on parameter model but also α. Our aim estimates VaR with minimum α based on correct VaR value. Numerical analysis is carried out to illustrate the estimative VaR.
Detection Method of Computer Room Personnel Based on Improved DERT

Recently developed methods such as DETR [1] apply Transformer [2] structure to target detection. The performance of using Transformers for target detection (DETR) is similar to that of two-stage target detector. First of all, this paper attempts to apply Transformer to computer room personnel detection. The contributions of the improved DETR include: 1) in order to improve the poor performance of small target detection. Embed Depthwise Convolution in the encoder. When the coding feature is reconstructed, the channel information is retained. 2) in order to solve the problem of slow convergence in DETR training. This paper improves the cross-attention in DECODE and adds the spatial query module. It can accelerate the convergence of DETR. The convergence speed of the improved method is six times faster than that of the original DETR, and the mAP0.5 is improved by 3.1%.
A Comprehensive Survey on Aspect Based Word Embedding Models and Sentiment Analysis Classification Approaches

Sentiment Analysis includes methods and techniques for businesses to understand and analyze customer reviews, feedback and opinion on a particular product or service. Sentiment Analysis uses Natural Language Processing (NLP) tools to analyze feelings or emotions, attitudes, opinions, thoughts, etc. behind the words. Sentiments such as positive, negative and neutral are associated with a particular product. Sentiment analysis is applicable in multi-domains such as customer feedback for a particular product, movie reviews, social and political comments. This survey basically focuses on different aspect-based word embedding models and aspect-based sentiment classification techniques, where the goal is to extract key features from the sentences and classify sentiment on entities at document level. Aspect Based Sentiment Analysis (ABSA) is a technique that concentrates not only the entire sentence but analyses key terms explicitly to predict the polarity as a whole. ABSA model accepts aspect categories and its corresponding aspect terms to generate sentiment corresponding to each aspect from the text corpus. This article provides a comprehensive survey on different word embedding models under CNN framework for aspect extraction and different machine learning techniques applicable for sentiment classification purpose.
Techniques and Technologies: An Overview

In this chapter, we provide a very high-level overview of the various techniques and technologies used for data science. This brief overview is intended to establish the framework for specifics covered in Chapters 13–19.
Theoretical evaluation of partial credit scoring of the multiple-response test item

We compute and compare statistics of five different scoring rules for the selected-response type of test items where the number of keys is an arbitrary integer and the test-takers are perfectly rational agents. We consider a hypothetical test of factual recognition, in which the underlying ability that we seek to measure is the fraction of the item options that the test-taker truly recognizes (and not only guesses correctly), assumed directly proportional the test-taker’s domain knowledge.
Learning Nigerian accent embeddings from speech: preliminary results based on SautiDB-Naija corpus

This paper describes foundational efforts with SautiDB-Naija, a novel corpus of non-native (L2) Nigerian English speech. We describe how the corpus was created and curated as well as preliminary experiments with accent classification and learning Nigerian accent embeddings. The initial version of the corpus includes over 900 recordings from L2 English speakers of Nigerian languages, such as Yoruba, Igbo, Edo, Efik-Ibibio, and Igala. We further demonstrate how fine-tuning on a pre-trained model like wav2vec can yield representations suitable for related speech tasks such as accent classification. SautiDB-Naija has been published to Zenodo for general use under a flexible Creative Commons License.
A Simple and Efficient Sampling-based Algorithm for General Reachability Analysis

In this work, we analyze an efficient sampling-based algorithm for general-purpose reachability analysis, which remains a notoriously challenging problem with applications ranging from neural network verification to safety analysis of dynamical systems. By sampling inputs, evaluating their images in the true reachable set, and taking their $\epsilon$-padded convex hull as a set estimator, this algorithm applies to general problem settings and is simple to implement. Our main contribution is the derivation of asymptotic and finite-sample accuracy guarantees using random set theory. This analysis informs algorithmic design to obtain an $\epsilon$-close reachable set approximation with high probability, provides insights into which reachability problems are most challenging, and motivates safety-critical applications of the technique. On a neural network verification task, we show that this approach is more accurate and significantly faster than prior work. Informed by our analysis, we also design a robust model predictive controller that we demonstrate in hardware experiments.
HumanNeRF: Generalizable Neural Human Radiance Field from Sparse Inputs

Recent neural human representations can produce high-quality multi-view rendering but require using dense multi-view inputs and costly training. They are hence largely limited to static models as training each frame is infeasible. We present HumanNeRF - a generalizable neural representation - for high-fidelity free-view synthesis of dynamic humans. Analogous to how IBRNet assists NeRF by avoiding per-scene training, HumanNeRF employs an aggregated pixel-alignment feature across multi-view inputs along with a pose embedded non-rigid deformation field for tackling dynamic motions. The raw HumanNeRF can already produce reasonable rendering on sparse video inputs of unseen subjects and camera settings. To further improve the rendering quality, we augment our solution with an appearance blending module for combining the benefits of both neural volumetric rendering and neural texture blending. Extensive experiments on various multi-view dynamic human datasets demonstrate the generalizability and effectiveness of our approach in synthesizing photo-realistic free-view humans under challenging motions and with very sparse camera view inputs.
VAE based Text Style Transfer with Pivot Words Enhancement Learning

Text Style Transfer (TST) aims to alter the underlying style of the source text to another specific style while keeping the same content. Due to the scarcity of high-quality parallel training data, unsupervised learning has become a trending direction for TST tasks. In this paper, we propose a novel VAE based Text Style Transfer with pivOt Words Enhancement leaRning (VT-STOWER) method which utilizes Variational AutoEncoder (VAE) and external style embeddings to learn semantics and style distribution jointly. Additionally, we introduce pivot words learning, which is applied to learn decisive words for a specific style and thereby further improve the overall performance of the style transfer. The proposed VT-STOWER can be scaled to different TST scenarios given very limited and non-parallel training data with a novel and flexible style strength control mechanism. Experiments demonstrate that the VT-STOWER outperforms the state-of-the-art on sentiment, formality, and code-switching TST tasks.
Fair Community Detection and Structure Learning in Heterogeneous Graphical Models

Inference of community structure in probabilistic graphical models may not be consistent with fairness constraints when nodes have demographic attributes. Certain demographics may be over-represented in some detected communities and under-represented in others. This paper defines a novel $\ell_1$-regularized pseudo-likelihood approach for fair graphical model selection. In particular, we assume there is some community or clustering structure in the true underlying graph, and we seek to learn a sparse undirected graph and its communities from the data such that demographic groups are fairly represented within the communities. In the case when the graph is known a priori, we provide a convex semidefinite programming approach for fair community detection. We establish the statistical consistency of the proposed method for both a Gaussian graphical model and an Ising model for, respectively, continuous and binary data, proving that our method can recover the graphs and their fair communities with high probability.
A Generic Graph Sparsification Framework using Deep Reinforcement Learning

The interconnectedness and interdependence of modern graphs are growing ever more complex, causing enormous resources for processing, storage, communication, and decision-making of these graphs. In this work, we focus on the task graph sparsification: an edge-reduced graph of a similar structure to the original graph is produced while various user-defined graph metrics are largely preserved. Existing graph sparsification methods are mostly sampling-based, which introduce high computation complexity in general and lack of flexibility for a different reduction objective. We present SparRL, the first generic and effective graph sparsification framework enabled by deep reinforcement learning. SparRL can easily adapt to different reduction goals and promise graph-size-independent complexity. Extensive experiments show that SparRL outperforms all prevailing sparsification methods in producing high-quality sparsified graphs concerning a variety of objectives.
Gated2Gated: Self-Supervised Depth Estimation from Gated Images

Gated cameras hold promise as an alternative to scanning LiDAR sensors with high-resolution 3D depth that is robust to back-scatter in fog, snow, and rain. Instead of sequentially scanning a scene and directly recording depth via the photon time-of-flight, as in pulsed LiDAR sensors, gated imagers encode depth in the relative intensity of a handful of gated slices, captured at megapixel resolution. Although existing methods have shown that it is possible to decode high-resolution depth from such measurements, these methods require synchronized and calibrated LiDAR to supervise the gated depth decoder -- prohibiting fast adoption across geographies, training on large unpaired datasets, and exploring alternative applications outside of automotive use cases. In this work, we fill this gap and propose an entirely self-supervised depth estimation method that uses gated intensity profiles and temporal consistency as a training signal. The proposed model is trained end-to-end from gated video sequences, does not require LiDAR or RGB data, and learns to estimate absolute depth values. We take gated slices as input and disentangle the estimation of the scene albedo, depth, and ambient light, which are then used to learn to reconstruct the input slices through a cyclic loss. We rely on temporal consistency between a given frame and neighboring gated slices to estimate depth in regions with shadows and reflections. We experimentally validate that the proposed approach outperforms existing supervised and self-supervised depth estimation methods based on monocular RGB and stereo images, as well as supervised methods based on gated images.
Handwritten text generation and strikethrough characters augmentation

We introduce two data augmentation techniques, which, used with a Resnet-BiLSTM-CTC network, significantly reduce Word Error Rate (WER) and Character Error Rate (CER) beyond best-reported results on handwriting text recognition (HTR) tasks. We apply a novel augmentation that simulates strikethrough text (HandWritten Blots) and a handwritten text generation method based on printed text (StackMix), which proved to be very effective in HTR tasks. StackMix uses weakly-supervised framework to get character boundaries. Because these data augmentation techniques are independent of the network used, they could also be applied to enhance the performance of other networks and approaches to HTR. Extensive experiments on ten handwritten text datasets show that HandWritten Blots augmentation and StackMix significantly improve the quality of HTR models
Full Model Estimation for Non-Parametric Multivariate Finite Mixture Models

This paper addresses the problem of full model estimation for non-parametric finite mixture models. It presents an approach for selecting the number of components and the subset of discriminative variables (i.e., the subset of variables having different distributions among the mixture components). The proposed approach considers a discretization of each variable into B bins and a penalization of the resulting log-likelihood. Considering that the number of bins tends to infinity as the sample size tends to infinity, we prove that our estimator of the model (number of components and subset of relevant variables for clustering) is consistent under a suitable choice of the penalty term. Interest of our proposal is illustrated on simulated and benchmark data.
ELF: Exact-Lipschitz Based Universal Density Approximator Flow

Normalizing flows have grown more popular over the last few years; however, they continue to be computationally expensive, making them difficult to be accepted into the broader machine learning community. In this paper, we introduce a simple one-dimensional one-layer network that has closed form Lipschitz constants; using this, we introduce a new Exact-Lipschitz Flow (ELF) that combines the ease of sampling from residual flows with the strong performance of autoregressive flows. Further, we show that ELF is provably a universal density approximator, more computationally and parameter efficient compared to a multitude of other flows, and achieves state-of-the-art performance on multiple large-scale datasets.
Synthetic Acute Hypotension and Sepsis Datasets Based on MIMIC-III and Published as Part of the Health Gym Project

These two synthetic datasets comprise vital signs, laboratory test results, administered fluid boluses and vasopressors for 3,910 patients with acute hypotension and for 2,164 patients with sepsis in the Intensive Care Unit (ICU). The patient cohorts were built using previously published inclusion and exclusion criteria and the data were created using Generative Adversarial Networks (GANs) and the MIMIC-III Clinical Database. The risk of identity disclosure associated with the release of these data was estimated to be very low (0.045%). The datasets were generated and published as part of the Health Gym, a project aiming to publicly distribute synthetic longitudinal health data for developing machine learning algorithms (with a particular focus on offline reinforcement learning) and for educational purposes.
Finding Deviated Behaviors of the Compressed DNN Models for Image Classifications

Model compression can significantly reduce the sizes of deep neural network (DNN) models, and thus facilitates the dissemination of sophisticated, sizable DNN models, especially for their deployment on mobile or embedded devices. However, the prediction results of compressed models may deviate from those of their original models. To help developers thoroughly understand the impact of model compression, it is essential to test these models to find those deviated behaviors before dissemination. However, this is a non-trivial task because the architectures and gradients of compressed models are usually not available. To this end, we propose DFLARE, a novel, search-based, black-box testing technique to automatically find triggering inputs that result in deviated behaviors in image classification tasks. DFLARE iteratively applies a series of mutation operations to a given seed image, until a triggering input is found. For better efficacy and efficiency, DFLARE models the search problem as Markov Chains and leverages the Metropolis-Hasting algorithm to guide the selection of mutation operators in each iteration. Further, DFLARE utilizes a novel fitness function to prioritize the mutated inputs that either cause large differences between two models' outputs, or trigger previously unobserved models' probability vectors. We evaluated DFLARE on 21 compressed models for image classification tasks with three datasets. The results show that DFLARE outperforms the baseline in terms of efficacy and efficiency. We also demonstrated that the triggering inputs found by DFLARE can be used to repair up to 48.48% deviated behaviors in image classification tasks and further decrease the effectiveness of DFLARE on the repaired models.