Reviewerly/exHarmony huggingface dataset:
Take an Emotion Walk: Perceiving Emotions from Gaits Using Hierarchical Attention Pooling and Affective Mapping

We present an autoencoder-based semi-supervised approach to classify perceived human emotions from walking styles obtained from videos or motion-captured data and represented as sequences of 3D poses. Given the motion on each joint in the pose at each time step extracted from 3D pose sequences, we hierarchically pool these joint motions in a bottom-up manner in the encoder, following the kinematic chains in the human body. We also constrain the latent embeddings of the encoder to contain the space of psychologically-motivated affective features underlying the gaits. We train the decoder to reconstruct the motions per joint per time step in a top-down manner from the latent embeddings. For the annotated data, we also train a classifier to map the latent embeddings to emotion labels. Our semi-supervised approach achieves a mean average precision of 0.84 on the Emotion-Gait benchmark dataset, which contains both labeled and unlabeled gaits collected from multiple sources. We outperform current state-of-art algorithms for both emotion recognition and action recognition from 3D gaits by 7%--23% on the absolute. More importantly, we improve the average precision by 10%--50% on the absolute on classes that each makes up less than 25% of the labeled part of the Emotion-Gait benchmark dataset.
A t-SNE Based Classification Approach to Compositional Microbiome Data

As a data-driven dimensionality reduction and visualization tool, t-distributed stochastic neighborhood embedding (t-SNE) has been successfully applied to a variety of fields. In recent years, it has also received increasing attention for classification and regression analysis. This study presented a t-SNE based classification approach for compositional microbiome data, which enabled us to build classifiers and classify new samples in the reduced dimensional space produced by t-SNE. The Aitchison distance was employed to modify the conditional probabilities in t-SNE to account for the compositionality of microbiome data. To classify a new sample, its low-dimensional features were obtained as the weighted mean vector of its nearest neighbors in the training set. Using the low-dimensional features as input, three commonly used machine learning algorithms, logistic regression (LR), support vector machine (SVM), and decision tree (DT) were considered for classification tasks in this study. The proposed approach was applied to two disease-associated microbiome datasets, achieving better classification performance compared with the classifiers built in the original high-dimensional space. The analytic results also showed that t-SNE with Aitchison distance led to improvement of classification accuracy in both datasets. In conclusion, we have developed a t-SNE based classification approach that is suitable for compositional microbiome data and may also serve as a baseline for more complex classification models.
Ridge Estimation for Uncertain Autoregressive Model with Imprecise Observations

The objective of time series analysis is to study the relationship between the data over time and to predict future values. Traditionally, statisticians assume that the observation data are precise, and we can get some exact values. However, in many cases, the imprecise observation data are available. We assume that these data are uncertain variables in the sense of uncertainty theory. In this paper, the ridge method is used to compute the unknown parameters in the uncertain autoregressive model. First, the ridge estimation of the parameters is given. The shrinkage parameter in the ridge estimation is obtained by ridge trace analysis. Based on the fitted autoregressive model, the forecast value and confidence interval of the future data are derived. Then two numerical examples are presented to verify the feasibility of this approach. Finally, the effectiveness of our model in reducing the influence of the outliers is shown by the comparative analysis.
A deep learning based framework for the registration of three dimensional multi-modal medical images of the head

Abstract Image registration is a fundamental task in image analysis in which the transform that moves the coordinate system of one image to another is calculated. Registration of multi-modal medical images has important implications for clinical diagnosis, treatment planning, and image-guided surgery as it provides the means of bringing together complimentary information obtained from different image modalities. However, since different image modalities have different properties due to their different acquisition methods, it remains a challenging task to find a fast and accurate match between multi-modal images. Furthermore, due to reasons such as ethical issues and need for human expert intervention, it is difficult to collect a large database of labelled multi-modal medical images. In addition, manual input is required to determine the fixed and moving images as input to registration algorithms. In this paper, we address these issues and introduce a registration framework that (1) creates synthetic data to augment existing datasets, (2) generates ground truth data to be used in the training and testing of algorithms, (3) registers (using a combination of deep learning and conventional machine learning methods) multi-modal images in an accurate and fast manner, and (4) automatically classifies the image modality so that the process of registration can be fully automated. We validate the performance of the proposed framework on CT and MRI images of the head obtained from a publicly available registration database.
Going hard and early: Aotearoa New Zealand's response to Covid-19

Abstract Aotearoa New Zealand went ‘hard’ and ‘early’ in its response to COVID-19 and has been highly successful in limiting the spread and impact of the virus. The response has ramped up over time, and has included various levels of: border control; advice on hygiene, physical distancing and mask wearing; advice to remain at home if unwell; and testing and tracing. A four-level Alert Level framework has guided key actions at different levels of risk. Strong leadership from the Prime Minister, Minister of Finance, and Director-General of Health and high levels of community co-operation have supported the response. The country is most vulnerable at its borders, where arrangements have been of concern; advice on testing and the wearing of masks has changed over time; while the use and distribution of personal protective equipment has also been of concern. The country overall was not well prepared for a pandemic, but policy-making has been nimble. Key challenges for 2021 include swiftly rolling out a vaccine, catching up on delayed health care, and deciding how and when the border can reopen. The economic, and associated social, challenges will last many years.
UWB-gestures, a public dataset of dynamic hand gestures acquired using impulse radar sensors

Abstract In the past few decades, deep learning algorithms have become more prevalent for signal detection and classification. To design machine learning algorithms, however, an adequate dataset is required. Motivated by the existence of several open-source camera-based hand gesture datasets, this descriptor presents UWB-Gestures, the first public dataset of twelve dynamic hand gestures acquired with ultra-wideband (UWB) impulse radars. The dataset contains a total of 9,600 samples gathered from eight different human volunteers. UWB-Gestures eliminates the need to employ UWB radar hardware to train and test the algorithm. Additionally, the dataset can provide a competitive environment for the research community to compare the accuracy of different hand gesture recognition (HGR) algorithms, enabling the provision of reproducible research results in the field of HGR through UWB radars. Three radars were placed at three different locations to acquire the data, and the respective data were saved independently for flexibility.
A survey of image labelling for computer vision applications

Supervised machine learning methods for image analysis require large amounts of labelled training data to solve computer vision problems. The recent rise of deep learning algorithms for recognising image content has led to the emergence of many ad-hoc labelling tools. With this survey, we capture and systematise the commonalities as well as the distinctions between existing image labelling software. We perform a structured literature review to compile the underlying concepts and features of image labelling software such as annotation expressiveness and degree of automation. We structure the manual labelling task by its organisation of work, user interface design options, and user support techniques to derive a systematisation schema for this survey. Applying it to available software and the body of literature, enabled us to uncover several application archetypes and key domains such as image retrieval or instance identification in healthcare or television.
SIAAA‐C: A student interactive assistant android application with chatbot during COVID‐19 pandemic

Nowadays, smartphone applications (apps) are literally used in all life aspects, improving the quality of different services in addition to saving time and effort. However, the majority of currently used apps in different universities around the world are limited in their features and not very popular among students who may suffer to get useful information using traditional guiding methods. However, the importance of these apps is constantly increasing, especially in times of crises like the COVID-19 pandemic during which people were forced to work from home and the human interaction was reduced to its minimal degree. In this paper, we present a Student Interactive Assistant Android Application with Chatbot (SIAAA-C), which is basically a personal electronic guide that is used by students to get various and effective academic services. The app has a number of useful features including a campus map, multiple types of notifications, and most important, an efficient built in chatbot that responds to both Arabic and English written queries and covers a wide range of academic topics ranging from basic to complex. Even more, SIAAA-C was designed to have Arabic and English interfaces to be used in the University of Jordan (UoJ), which has one of the biggest campuses in the Arabic area with more than 40,000 local and foreign students. Moreover, SIAAA-C was practically tested in a real-life environment by a group of UoJ students who were selected from different faculties during the pandemic peak period and the feedbacks were very promising, based on the outcomes of an evaluation survey that was answered by 102 students after a 1-month test period.
Geospatial Analysis of Solar Energy in Riyadh Using a GIS-AHP-Based Technique

In recent years, spatial multi-criteria decision analysis (MCDA) has been applied to different types of spatial problems, such as solar power site suitability. MCDA can be used to support the process of identifying suitable regions for solar energy projects. To the best of our knowledge, no study has addressed the problem of site evaluation for solar photovoltaic PV systems in the Riyadh region. Therefore, a spatial MCDA framework is proposed to perform a geospatial analysis of solar energy in the Riyadh region, which includes data collection, spatial analysis, a spatial decision support system and visualization. The methodology that was used to solve the site suitability problem is described. It involved the combination of a Geographical Information System (GIS) and the Analytic Hierarchy Process (GIS-AHP). The results show that the most suitable sites are in the north and northwest of the Riyadh region, with an area that represents 16,748 Km2 with an 80% suitability degree. In addition, it was proven that Afif is the largest suitable city. It has high solar radiation, at an average of 2.631687 MWh/m2/year, and low temperatures, at an average of 26.3 °C, as well as having flat areas with a slope under 5°. The results were validated using a sensitivity analysis model and also compared with those for ground-based stations.
Exploring Deep Transfer Learning Techniques for Alzheimer's Dementia Detection

Examination of speech datasets for detecting dementia, collected via various speech tasks, has revealed links between speech and cognitive abilities. However, the speech dataset available for this research is extremely limited because the collection process of speech and baseline data from patients with dementia in clinical settings is expensive. In this paper, we study the spontaneous speech dataset from a recent ADReSS challenge, a Cookie Theft Picture (CTP) dataset with balanced groups of participants in age, gender, and cognitive status. We explore state-of-the-art deep transfer learning techniques from image, audio, speech, and language domains. We envision that one advantage of transfer learning is to eliminate the design of handcrafted features based on the tasks and datasets. Transfer learning further mitigates the limited dementia-relevant speech data problem by inheriting knowledge from similar but much larger datasets. Specifically, we built a variety of transfer learning models using commonly employed MobileNet (image), YAMNet (audio), Mockingjay (speech), and BERT (text) models. Results indicated that the transfer learning models of text data showed significantly better performance than those of audio data. Performance gains of the text models may be due to the high similarity between the pre-training text dataset and the CTP text dataset. Our multi-modal transfer learning introduced a slight improvement in accuracy, demonstrating that audio and text data provide limited complementary information. Multi-task transfer learning resulted in limited improvements in classification and a negative impact in regression. By analyzing the meaning behind the AD/non-AD labels and Mini-Mental State Examination (MMSE) scores, we observed that the inconsistency between labels and scores could limit the performance of the multi-task learning, especially when the outputs of the single-task models are highly consistent with the corresponding labels/scores. In sum, we conducted a large comparative analysis of varying transfer learning models focusing less on model customization but more on pre-trained models and pre-training datasets. We revealed insightful relations among models, data types, and data labels in this research area.
Modeling and mitigation of cross-talk effects in readout noise with applications to the Quantum Approximate Optimization Algorithm

We introduce a correlated measurement noise model that can be efficiently described and characterized, and which admits effective noise-mitigation on the level of marginal probability distributions. Noise mitigation can be performed up to some error for which we derive upper bounds. Characterization of the model is done efficiently using Diagonal Detector Overlapping Tomography -- a generalization of the recently introduced Quantum Overlapping Tomography to the problem of reconstruction of readout noise with restricted locality. The procedure allows to characterize $k$-local measurement cross-talk on $N$-qubit device using $O(k2^klog(N))$ circuits containing random combinations of X and identity gates. We perform experiments on 15 (23) qubits using IBM's (Rigetti's) devices to test both the noise model and the error-mitigation scheme, and obtain an average reduction of errors by a factor $>22$ ($>5.5$) compared to no mitigation. Interestingly, we find that correlations in the measurement noise do not correspond to the physical layout of the device. Furthermore, we study numerically the effects of readout noise on the performance of the Quantum Approximate Optimization Algorithm (QAOA). We observe in simulations that for numerous objective Hamiltonians, including random MAX-2-SAT instances and the Sherrington-Kirkpatrick model, the noise-mitigation improves the quality of the optimization. Finally, we provide arguments why in the course of QAOA optimization the estimates of the local energy (or cost) terms often behave like uncorrelated variables, which greatly reduces sampling complexity of the energy estimation compared to the pessimistic error analysis. We also show that similar effects are expected for Haar-random quantum states and states generated by shallow-depth random circuits.
Segmentation of brain MRI using an altruistic Harris Hawks’ Optimization algorithm

Segmentation is an essential requirement in medicine when digital images are used in illness diagnosis, especially, in posterior tasks as analysis and disease identification. An efficient segmentation of brain Magnetic Resonance Images (MRIs) is of prime concern to radiologists due to their poor illumination and other conditions related to de acquisition of the images. Thresholding is a popular method for segmentation that uses the histogram of an image to label different homogeneous groups of pixels into different classes. However, the computational cost increases exponentially according to the number of thresholds. In this paper, we perform the multi-level thresholding using an evolutionary metaheuristic. It is an improved version of the Harris Hawks Optimization (HHO) algorithm that combines the chaotic initialization and the concept of altruism. Further, for fitness assignment, we use a hybrid objective function where along with the cross-entropy minimization, we apply a new entropy function, and leverage weights to the two objective functions to form a new hybrid approach. The HHO was originally designed to solve numerical optimization problems. Earlier, the statistical results and comparisons have demonstrated that the HHO provides very promising results compared with well-established metaheuristic techniques. In this article, the altruism has been incorporated into the HHO algorithm to enhance its exploitation capabilities. We evaluate the proposed method over 10 benchmark images from the WBA database of the Harvard Medical School and 8 benchmark images from the Brainweb dataset using some standard evaluation metrics.
A user-oriented model for Oracles’ Gas price prediction

The Ethereum blockchain is a distributed database of transactions, where the Gas Oracles suggest the users the Gas price’s categories to get a transaction recorded. The paper explores the idea that the Gas Oracles are based on a data-centered model which does not provide users with a reliable prediction. We present an empirical study to test the reliability of the existing Gas Oracles from both the points of view of the Gas price predictions and the existing categories. The study reveals that the Gas Oracles’ predictions fail more often than advertised and shows that the Gas price categories do not correspond to the categories set by the users. Therefore we propose a user-oriented model for the Oracles’ Gas price prediction, based on two Gas price categories actually corresponding to the users’ interests and a new method to estimate the Gas price. The new method, performing the Poisson regression at smaller intervals of time, predicts the Gas price to pay with a lower margin of error when compared to the actual one. The predictions based on the user-oriented model thus provide the users with a more effective Gas price to set.
KNN Classification with One-step Computation

KNN classification is an improvisational learning mode, in which they are carried out only when a test data is predicted that set a suitable K value and search the K nearest neighbors from the whole training sample space, referred them to the lazy part of KNN classification.This lazy part has been the bottleneck problem of applying KNN classification due to the complete search of K nearest neighbors.In this paper, a one-step computation is proposed to replace the lazy part of KNN classification.The one-step computation actually transforms the lazy part to a matrix computation as follows.Given a test data, training samples are first applied to fit the test data with the least squares loss function.And then, a relationship matrix is generated by weighting all training samples according to their influence on the test data.Finally, a group lasso is employed to perform sparse learning of the relationship matrix.In this way, setting K value and searching K nearest neighbors are both integrated to a unified computation.In addition, a new classification rule is proposed for improving the performance of one-step KNN classification.The proposed approach is experimentally evaluated, and demonstrated that the one-step KNN classification is efficient and promising.
Computing secure key rates for quantum cryptography with untrusted devices

Abstract Device-independent quantum key distribution (DIQKD) provides the strongest form of secure key exchange, using only the input–output statistics of the devices to achieve information-theoretic security. Although the basic security principles of DIQKD are now well understood, it remains a technical challenge to derive reliable and robust security bounds for advanced DIQKD protocols that go beyond the previous results based on violations of the CHSH inequality. In this work, we present a framework based on semidefinite programming that gives reliable lower bounds on the asymptotic secret key rate of any QKD protocol using untrusted devices. In particular, our method can in principle be utilized to find achievable secret key rates for any DIQKD protocol, based on the full input–output probability distribution or any choice of Bell inequality. Our method also extends to other DI cryptographic tasks.
Problems with SZZ and features: An empirical study of the state of practice of defect prediction data collection

Abstract Context The SZZ algorithm is the de facto standard for labeling bug fixing commits and finding inducing changes for defect prediction data. Recent research uncovered potential problems in different parts of the SZZ algorithm. Most defect prediction data sets provide only static code metrics as features, while research indicates that other features are also important. Objective We provide an empirical analysis of the defect labels created with the SZZ algorithm and the impact of commonly used features on results. Method We used a combination of manual validation and adopted or improved heuristics for the collection of defect data. We conducted an empirical study on 398 releases of 38 Apache projects. Results We found that only half of the bug fixing commits determined by SZZ are actually bug fixing. If a six-month time frame is used in combination with SZZ to determine which bugs affect a release, one file is incorrectly labeled as defective for every file that is correctly labeled as defective. In addition, two defective files are missed. We also explored the impact of the relatively small set of features that are available in most defect prediction data sets, as there are multiple publications that indicate that, e.g., churn related features are important for defect prediction. We found that the difference of using more features is not significant. Conclusion Problems with inaccurate defect labels are a severe threat to the validity of the state of the art of defect prediction. Small feature sets seem to be a less severe threat.