Reviewerly/exHarmony huggingface dataset:
Secure Keyword Search and Data Sharing Mechanism for Cloud Computing

The emergence of cloud infrastructure has significantly reduced the costs of hardware and software resources in computing infrastructure. To ensure security, the data is usually encrypted before it's outsourced to the cloud. Unlike searching and sharing the plain data, it is challenging to search and share the data after encryption. Nevertheless, it is a critical task for the cloud service provider as the users expect the cloud to conduct a quick search and return the result without losing data confidentiality. To overcome these problems, we propose a ciphertext-policy attribute-based mechanism with keyword search and data sharing (CPAB-KSDS) for encrypted cloud data. The proposed solution not only supports attribute-based keyword search but also enables attribute-based data sharing at the same time, which is in contrast to the existing solutions that only support either one of two features. Additionally, the keyword in our scheme can be updated during the sharing phase without interacting with the PKG. In this article, we describe the notion of CPAB-KSDS as well as its security model. Besides, we propose a concrete scheme and prove that it is against chosen ciphertext attack and chosen keyword attack secure in the random oracle model. Finally, the proposed construction is demonstrated practical and efficient in the performance and property comparison.
Spectral rotation for deep one-step clustering

Previous spectral clustering methods sequentially conduct three steps, i.e., similarity matrix learning from original data, spectral representation learning, and K-means clustering on spectral representation, respectively, to difficultly output robust clustering result even though each of three steps achieves individual optimization. The reason is that each goal of former two steps is not focused on achieving optimal clustering result. Moreover, original data usually contains noise to affect the clustering result, as well as has high-dimensional representation to easily result in the curse of dimensionality. In this paper, we propose a deep spectral clustering method which embeds four parts (i.e., similarity matrix learning, spectral representation learning, optimized K-means clustering, and transformation matrix learning) in a unified framework with the following advantages: 1) similarity matrix is obtained from the low-dimensional feature space of original data where the influence of both noise and high-dimensional data are considered; 2) optimized K-means clustering rotates original result of K-means clustering to search optimized clustering hyperplane which partitions data points into clusters; and 3) each of four parts is iteratively updated so that the clustering result is obtained based on the feedback of other three parts. As a result, our proposed framework develops a two-task deep clustering model with linear activation functions to output effective clustering result. Experimental results on real data sets show the effectiveness of our method in terms of four clustering evaluation metrics, compared to state-of-the-art clustering methods.
Multi-modal latent space inducing ensemble SVM classifier for early dementia diagnosis with neuroimaging data

Fusing multi-modality data is crucial for accurate identification of brain disorder as different modalities can provide complementary perspectives of complex neurodegenerative disease. However, there are at least four common issues associated with the existing fusion methods. First, many existing fusion methods simply concatenate features from each modality without considering the correlations among different modalities. Second, most existing methods often make prediction based on a single classifier, which might not be able to address the heterogeneity of the Alzheimer's disease (AD) progression. Third, many existing methods often employ feature selection (or reduction) and classifier training in two independent steps, without considering the fact that the two pipelined steps are highly related to each other. Forth, there are missing neuroimaging data for some of the participants (e.g., missing PET data), due to the participants' "no-show" or dropout. In this paper, to address the above issues, we propose an early AD diagnosis framework via novel multi-modality latent space inducing ensemble SVM classifier. Specifically, we first project the neuroimaging data from different modalities into a latent space, and then map the learned latent representations into the label space to learn multiple diversified classifiers. Finally, we obtain the more reliable classification results by using an ensemble strategy. More importantly, we present a Complete Multi-modality Latent Space (CMLS) learning model for complete multi-modality data and also an Incomplete Multi-modality Latent Space (IMLS) learning model for incomplete multi-modality data. Extensive experiments using the Alzheimer's Disease Neuroimaging Initiative (ADNI) dataset have demonstrated that our proposed models outperform other state-of-the-art methods.
Enhanced Binary Moth Flame Optimization as a Feature Selection Algorithm to Predict Software Fault Prediction

Software fault prediction (SFP) is a complex problem that meets developers in the software development life cycle. Collecting data from real software projects, either while the development life cycle or after lunch the product, is not a simple task, and the collected data may suffer from imbalance data distribution problem. In this research, we proposed an Enhanced Binary Moth Flame Optimization (EBMFO) with Adaptive synthetic sampling (ADASYN) to predict software faults. BMFO is employed as a wrapper feature selection, while ADASYN enhances the input dataset and address the imbalanced dataset. Converting MFO algorithm from a continues version to the binary version using transfer functions (TFs) from two different groups (S-shape and V-shape) is investigated in this work and proposed an EBFMFO version. Fifteen real projects data obtained from PROMISE repository are employed in this work. Three different classifiers are used: the k-nearest neighbors (k-NN), Decision Trees (DT), and Linear discriminant analysis (LDA). The reported results demonstrate that the proposed EBMFO enhances the overall performance of classifiers and outperforms the results in the literature and show the importance of TF for feature selection algorithms.
Fingerprint Enhancement Based on Tensor of Wavelet Subbands for Classification

Fingerprint image enhancement is a key aspect of an automated fingerprint identification system.This paper describes an effective algorithm based on a novel lighting compensation scheme.The scheme involves the use of adaptive higher-order singular value decomposition on a tensor of wavelet subbands of a fingerprint (AHTWF) image to enhance the quality of the image.The algorithm consists of three stages.The first stage is the decomposition of an input fingerprint image of size 2M × 2N into four subbands at the first level by applying a two-dimensional discrete wavelet transform.In the second stage, we construct a tensor in R M ×N ×4 space.The tensor contains four wavelet subbands that serve as four frontal planes.Furthermore, the tensor is decomposed through higher-order singular value decomposition to separate the fingerprint's wavelet subbands into detailed individual components.In the third stage, a compensated image is produced by adaptively obtaining the compensation coefficient for each frontal plane of the tensor-based on the reference Gaussian template.The experimental results indicated that the quality of the AHTWF image was higher than that of the original image.The proposed algorithm not only improves the clarity and continuity of ridge structures but also removes the background and blurred regions of a fingerprint image.Therefore, this algorithm can achieve higher fingerprint classification accuracy than related methods can.
Comparison of particle swarm optimization variants with fuzzy dynamic parameter adaptation for modular granular neural networks for human recognition

In this paper dynamic parameter adjustment in particle swarm optimization (PSO) for modular neural network (MNN) design using granular computing and fuzzy logic (FL) is proposed. Nowadays, there are a plethora of optimization techniques, but their implementations require having knowledge about thes e techniques in order to establish their parameters, because the performance and final results of a particular technique depend on the optimal parameter values. For this reason, in this paper the fuzzy adjustment of parameters during the execution is proposed, and this proposal allows to adjust the parameters depending on current PSO behavior in each iteration. The proposed method performs modular neural network optimization applied to human recognition using benchmark ear, iris and face databases. Two fuzzy inference systems are proposed to perform this dynamic adjustment, comparisons against a PSO without this dynamic adjustment (simple PSO) are performed to verify if the proposed adjustment using a fuzzy system is better improving recognition rate and execution time. The PSO variants presented in this paper are aimed at performing MNNs optimization. This optimization consists on finding optimal parameters, such as: the number of modules (or sub granules), percentage of data for the training phase, learning algorithm, goal error, number of hidden layers and their number of neurons.
Multi-Level Correlation Adversarial Hashing for Cross-Modal Retrieval

Cross-modal hashing (CMH) has been widely used for similarity search in multimedia retrieval applications, thanks to low storage cost and fast query speed. However, preserving the content similarities in finite-length hash codes between different data modalities is still challenging due to the existing heterogeneity gap. To further address the crucial bottleneck, we propose a Multi-Level Correlation Adversarial Hashing (MLCAH) algorithm to integrate the multi-level correlation information into hash codes. The proposed MLCAH model enjoys several merits. First, to the best of our knowledge, it is the early attempt of leveraging the multi-level correlation information for cross-modal hashing retrieval. Second, we propose global and local semantic alignment mechanisms, which can effectively encode multi-level correlation information, including global information, local information, and label information into hash codes. Third, a label-consistency attention mechanism with adversarial training is designed for exploiting the local cross-modality similarity from multi-modality data. Extensive evaluations on four benchmarks demonstrate that the proposed model brings significant improvements over several state-of-the-art cross-modal hashing methods.
Vocell: A 65-nm Speech-Triggered Wake-Up SoC for 10-$\mu$ W Keyword Spotting and Speaker Verification

The use of speech-triggered wake-up interfaces has grown significantly in the last few years for use in ubiquitous and mobile devices. Since these interfaces must always be active, power consumption is one of their primary design metrics. This article presents a complete mixed-signal system-on-chip, capable of directly interfacing to an analog microphone and performing keyword spotting (KWS) and speaker verification (SV), without any need for further external accesses. Through the use of: 1) an integrated single-chip digital-friendly design; b) hardware-aware algorithmic optimization; and c) memoryand power-optimized accelerators, ultra-low power is achieved while maintaining high accuracy for speech recognition tasks. The 65-nm implementation achieves 18.3-μW worst case power consumption or 10.6-μW power for typical real-time scenarios, 10× below state of the art (SoA).
Machine learning in infection management using routine electronic health records: tools, techniques, and reporting of future technologies

BackgroundMachine learning (ML) is increasingly being used in many areas of health care. Its use in infection management is catching up as identified in a recent review in this journal. We present here a complementary review to this work.ObjectivesTo support clinicians and researchers in navigating through the methodological aspects of ML approaches in the field of infection management.SourcesA Medline search was performed with the keywords artificial intelligence, machine learning, infection∗, and infectious disease∗ for the years 2014–2019. Studies using routinely available electronic hospital record data from an inpatient setting with a focus on bacterial and fungal infections were included.ContentFifty-two studies were included and divided into six groups based on their focus. These studies covered detection/prediction of sepsis (n = 19), hospital-acquired infections (n = 11), surgical site infections and other postoperative infections (n = 11), microbiological test results (n = 4), infections in general (n = 2), musculoskeletal infections (n = 2), and other topics (urinary tract infections, deep fungal infections, antimicrobial prescriptions; n = 1 each). In total, 35 different ML techniques were used. Logistic regression was applied in 18 studies followed by random forest, support vector machines, and artificial neural networks in 18, 12, and seven studies, respectively. Overall, the studies were very heterogeneous in their approach and their reporting. Detailed information on data handling and software code was often missing. Validation on new datasets and/or in other institutions was rarely done. Clinical studies on the impact of ML in infection management were lacking.ImplicationsPromising approaches for ML use in infectious diseases were identified. But building trust in these new technologies will require improved reporting. Explainability and interpretability of the models used were rarely addressed and should be further explored. Independent model validation and clinical studies evaluating the added value of ML approaches are needed.
Particle Swarm Optimization for Cooperative Multi-Robot Task Allocation: A Multi-Objective Approach

This letter presents a new Multi-Objective Particle Swarm Optimization (MOPSO) approach to a Cooperative MultiRobot Task Allocation (CMRTA) problem, where the robots have to minimize the total team cost and, additionally, balance their workloads. We formulate the CMRTA problem as a more complex variant of multiple Travelling Salesman Problems (mTSP) and, in particular, address how to minimize the total travel distance of the entire robot team, as well as how to minimize the highest travel distance of an individual robot. The proposed approach extends the standard single-objective Particle Swarm Optimization (PSO) to cope with the multiple objectives, and its novel feature lies in a Pareto front refinement strategy and a probability-based leader selection strategy. To validate the proposed approach, we first use three benchmark functions to evaluate the performance of finding the true Pareto fronts in comparison with four existing well-known algorithms in continuous spaces. Afterwards, we use six datasets to investigate the task allocation mechanisms in dealing with the CMRTA problem in discrete spaces.
Gaze-in-wild: A dataset for studying eye and head coordination in everyday activities

The study of gaze behavior has primarily been constrained to controlled environments in which the head is fixed. Consequently, little effort has been invested in the development of algorithms for the categorization of gaze events (e.g. fixations, pursuits, saccade, gaze shifts) while the head is free, and thus contributes to the velocity signals upon which classification algorithms typically operate. Our approach was to collect a novel, naturalistic, and multimodal dataset of eye + head movements when subjects performed everyday tasks while wearing a mobile eye tracker equipped with an inertial measurement unit and a 3D stereo camera. This Gaze-in-the-Wild dataset (GW) includes eye + head rotational velocities (deg/s), infrared eye images and scene imagery (RGB + D). A portion was labelled by coders into gaze motion events with a mutual agreement of 0.74 sample based Cohen's κ. This labelled data was used to train and evaluate two machine learning algorithms, Random Forest and a Recurrent Neural Network model, for gaze event classification. Assessment involved the application of established and novel event based performance metrics. Classifiers achieve ~87% human performance in detecting fixations and saccades but fall short (50%) on detecting pursuit movements. Moreover, pursuit classification is far worse in the absence of head movement information. A subsequent analysis of feature significance in our best performing model revealed that classification can be done using only the magnitudes of eye and head movements, potentially removing the need for calibration between the head and eye tracking systems. The GW dataset, trained classifiers and evaluation metrics will be made publicly available with the intention of facilitating growth in the emerging area of head-free gaze event classification.
Lightweight and Privacy-Aware Fine-Grained Access Control for IoT-Oriented Smart Health

With the booming of Internet of Things (IoT), smart health (s-health) is becoming an emerging and attractive paradigm. It can provide an accurate prediction of various diseases and improve the quality of healthcare. Nevertheless, data security and user privacy concerns still remain issues to be addressed. As a high potential and prospective solution to secure IoT-oriented s-health applications, ciphertext policy attribute-based encryption (CP-ABE) schemes raise challenges, such as heavy overhead and attribute privacy of the end users. To resolve these drawbacks, an optimized vector transformation approach is first proposed to efficiently transform the access policy and user attribute set into respective vectors of shorter length while other approaches result in redundant and longer vectors. Our transformation approach can greatly relieve the costly overheard of key generation, encryption, and decryption phases. Then, based on the transformation approach and the offline/online computation technology, we propose a lightweight policy-hiding CP-ABE scheme for the IoT-oriented s-health application. With our proposed scheme, data users in the s-health system can perform lightweight encryption and decryption without leaking any sensitive privacy about the attributes of the user. Finally, the formal security analysis, the theoretic performance evaluation and experiment results indicate that the solution is secure and efficient.
Global drivers of cryptocurrency infrastructure adoption

Abstract A vast digital ecosystem of entrepreneurship and exchange has sprung up with Bitcoin’s digital infrastructure at its core. We explore the worldwide spread of infrastructure necessary to maintain and grow Bitcoin as a system (Bitcoin nodes) and infrastructure enabling the use of bitcoins for everyday economic transactions (Bitcoin merchants). Specifically, we investigate the role of legal, criminal, financial, and social determinants of the adoption of Bitcoin infrastructure. We offer some support for the view that the adoption of cryptocurrency infrastructure is driven by perceived failings of traditional financial systems, in that the spread of Bitcoin infrastructure is associated with low trust in banks and the financial system among inhabitants of a region, and with the occurrence of country-level inflation crises. On the other hand, our findings also suggest that active support for Bitcoin is higher in locations with well-developed banking services. Finally, we find support for the view that bitcoin adoption is also partly driven by cryptocurrencies’ usefulness in engaging in illicit trade.
Augmented Ship Tracking Under Occlusion Conditions From Maritime Surveillance Videos

Ship tracking provides crucial on-site microscopic kinematic traffic information which benefits maritime traffic flow analysis, ship safety enhancement, traffic control, etc., and thus has attracted considerable research attentions in the maritime surveillance community.Conventional ship tracking methods yield satisfied results by exploring distinct visual ship features in maritime images, which may fail when the target ship is partially or fully sheltered by obstacles (e.g., ships, waves, etc.) in maritime videos.To overcome the difficulty, we propose an augmented ship tracking framework via the kernelized correlation filter (KCF) and curve fitting algorithm.First, the KCF model is introduced to track ships in the consecutive maritime images and obtain raw ship trajectory dataset.Second, the data anomaly detection and rectification procedure are implemented to rectify the contaminated ship positions.For the purpose of performance evaluation, we implement the proposed framework and another three popular ship tracking models on the four typical ship occlusion videos.The experimental results show that our proposed framework successfully tracks ships in maritime video clips with high accuracy (i.e., the average root mean square error (RMSE), root mean square percentage error (RMSPE), mean absolute deviation (MAD) and mean absolute percentage error (MAPE) are less than 10), which significantly outperforms the other popular ship trackers.
FAIR Digital Objects for Science: From Data Pieces to Actionable Knowledge Units

Data science is facing the following major challenges: (1) developing scalable cross-disciplinary capabilities, (2) dealing with the increasing data volumes and their inherent complexity, (3) building tools that help to build trust, (4) creating mechanisms to efficiently operate in the domain of scientific assertions, (5) turning data into actionable knowledge units and (6) promoting data interoperability. As a way to overcome these challenges, we further develop the proposals by early Internet pioneers for Digital Objects as encapsulations of data and metadata made accessible by persistent identifiers. In the past decade, this concept was revisited by various groups within the Research Data Alliance and put in the context of the FAIR Guiding Principles for findable, accessible, interoperable and reusable data. The basic components of a FAIR Digital Object (FDO) as a self-contained, typed, machine-actionable data package are explained. A survey of use cases has indicated the growing interest of research communities in FDO solutions. We conclude that the FDO concept has the potential to act as the interoperable federative core of a hyperinfrastructure initiative such as the European Open Science Cloud (EOSC).
Bias in word embeddings

Word embeddings are a widely used set of natural language processing techniques that map words to vectors of real numbers. These vectors are used to improve the quality of generative and predictive models. Recent studies demonstrate that word embeddings contain and amplify biases present in data, such as stereotypes and prejudice. In this study, we provide a complete overview of bias in word embeddings. We develop a new technique for bias detection for gendered languages and use it to compare bias in embeddings trained on Wikipedia and on political social media data. We investigate bias diffusion and prove that existing biases are transferred to further machine learning models. We test two techniques for bias mitigation and show that the generally proposed methodology for debiasing models at the embeddings level is insufficient. Finally, we employ biased word embeddings and illustrate that they can be used for the detection of similar biases in new data. Given that word embeddings are widely used by commercial companies, we discuss the challenges and required actions towards fair algorithmic implementations and applications.