Reviewerly/exHarmony huggingface dataset:
A smart tele-cytology point-of-care platform for oral cancer screening

Early detection of oral cancer necessitates a minimally invasive, tissue-specific diagnostic tool that facilitates screening/surveillance. Brush biopsy, though minimally invasive, demands skilled cyto-pathologist expertise. In this study, we explored the clinical utility/efficacy of a tele-cytology system in combination with Artificial Neural Network (ANN) based risk-stratification model for early detection of oral potentially malignant (OPML)/malignant lesion. A portable, automated tablet-based tele-cytology platform capable of digitization of cytology slides was evaluated for its efficacy in the detection of OPML/malignant lesions (n = 82) in comparison with conventional cytology and histology. Then, an image pre-processing algorithm was established to segregate cells, ANN was trained with images (n = 11,981) and a risk-stratification model developed. The specificity, sensitivity and accuracy of platform/ stratification model were computed, and agreement was examined using Kappa statistics. The tele-cytology platform, Cellscope, showed an overall accuracy of 84–86% with no difference between tele-cytology and conventional cytology in detection of oral lesions (kappa, 0.67–0.72). However, OPML could be detected with low sensitivity (18%) in accordance with the limitations of conventional cytology. The integration of image processing and development of an ANN-based risk stratification model improved the detection sensitivity of malignant lesions (93%) and high grade OPML (73%), thereby increasing the overall accuracy by 30%. Tele-cytology integrated with the risk stratification model, a novel strategy established in this study, can be an invaluable Point-of-Care (PoC) tool for early detection/screening in oral cancer. This study hence establishes the applicability of tele-cytology for accurate, remote diagnosis and use of automated ANN-based analysis in improving its efficacy.
Models of Quantum Complexity Growth

The concept of quantum complexity has far-reaching implications spanning theoretical computer science, quantum many-body physics, and high energy physics. The quantum complexity of a unitary transformation or quantum state is defined as the size of the shortest quantum computation that executes the unitary or prepares the state. It is reasonable to expect that the complexity of a quantum state governed by a chaotic many-body Hamiltonian grows linearly with time for a time that is exponential in the system size; however, because it is hard to rule out a short-cut that improves the efficiency of a computation, it is notoriously difficult to derive lower bounds on quantum complexity for particular unitaries or states without making additional assumptions. To go further, one may study more generic models of complexity growth. We provide a rigorous connection between complexity growth and unitary $k$-designs, ensembles which capture the randomness of the unitary group. This connection allows us to leverage existing results about design growth to draw conclusions about the growth of complexity. We prove that local random quantum circuits generate unitary transformations whose complexity grows linearly for a long time, mirroring the behavior one expects in chaotic quantum systems and verifying conjectures by Brown and Susskind. Moreover, our results apply under a strong definition of quantum complexity based on optimal distinguishing measurements.
Reversible Data Hiding in JPEG Images With Multi-Objective Optimization

Among various methods of reversible data hiding (RDH) in JPEG images, the consideration in designing is only the image quality, but the image quality and the file size expansion are equally important in JPEG images. Based on this situation, we propose a RDH scheme in JPEG images considering both the image quality and the file size expansion while designing the algorithm. The multi-objective optimization strategy is utilized to realize the balance of the two objectives. Specifically, the cover is divided into several non-overlapping signals firstly, and after that, the embedding costs of signals are calculated using the knowledge of the JPEG compression. Next, the optimized combination of signals for embedding data is gained by the multi-objective optimization. Experimental results show the better performance of our proposed RDH compared with state-of-the-art RDH in JPEG images.
Stacked Spatio-Temporal Graph Convolutional Networks for Action Segmentation

We propose novel Stacked Spatio-Temporal Graph Convolutional Networks (Stacked-STGCN) for action segmentation, i.e., predicting and localizing a sequence of actions over long videos. We extend the Spatio-Temporal Graph Convolutional Network (STGCN) originally proposed for skeleton-based action recognition to enable nodes with different characteristics (e.g., scene, actor, object, action), feature descriptors with varied lengths, and arbitrary temporal edge connections to account for large graph deformation commonly associated with complex activities. We further introduce the stacked hourglass architecture to STGCN to leverage the advantages of an encoder-decoder design for improved generalization performance and localization accuracy. We explore various descriptors such as frame- level VGG, segment-level I3D, RCNN-based object, etc. as node descriptors to enable action segmentation based on joint inference over comprehensive contextual information. We show results on CAD120 (which provides pre-computed node features and edge weights for fair performance comparison across algorithms) as well as a more complex real- world activity dataset, Charades. Our Stacked-STGCN in general achieves improved performance over the state-of- the-art for both CAD120 and Charades. Moreover, due to its generic design, Stacked-STGCN can be applied to a wider range of applications that require structured inference over long sequences with heterogeneous data types and varied temporal extent.
Decentralized Identity: Where Did It Come From and Where Is It Going?

The technology category now widely known as “decentralized identity” and more narrowly as “self-sovereign identity” didn’t even exist four years ago. At that time, the cutting edge of digital identity technology consisted of Internet- scale federated identity protocols such as OpenID Connect and user-centric data sharing protocols such as User-Managed Access (UMA). Then along came Bitcoin and a surge of interest in blockchain and distributed ledger technology (DLT). Although the initial uses of this technology focused primarily on cryptocurrency, it didn’t take long for the digital identity community to begin applying it to digital identity scenarios.
E-Learning and Smart Revision Portal for Zambian Primary and Secondary School Learners: A Digitalized Virtual Classroom in the COVID-19 Era and Beyond

The emergence of coronavirus (COVID-19) and its rapid spread across Asia, Europe, United States of America and parts of Africa led to many republics implementing partial and complete lockdowns of their countries as part of the many solutions to curbing the pandemic. Internal measures included closure of all learning institutions and restricted mobility of citizens. Zambia responded by closure of schools and institutions of higher learning, and a partial lockdown. As an alternative to on-campus learning, some higher learning institutions in Zambia introduced E-learning for their students. This was not the case for primary and secondary schools until mid- Aprils 2020 when educational responses started being implemented. This paper highlights the E-learning and smart revision facility, a virtual classroom for Zambian primary and secondary schools.
Train Sparsely, Generate Densely: Memory-Efficient Unsupervised Training of High-Resolution Temporal GAN

Training of Generative Adversarial Network (GAN) on a video dataset is a challenge because of the sheer size of the dataset and the complexity of each observation. In general, the computational cost of training GAN scales exponentially with the resolution. In this study, we present a novel memory efficient method of unsupervised learning of high-resolution video dataset whose computational cost scales only linearly with the resolution. We achieve this by designing the generator model as a stack of small sub-generators and training the model in a specific way. We train each sub-generator with its own specific discriminator. At the time of the training, we introduce between each pair of consecutive sub-generators an auxiliary subsampling layer that reduces the frame-rate by a certain ratio. This procedure can allow each sub-generator to learn the distribution of the video at different levels of resolution. We also need only a few GPUs to train a highly complex generator that far outperforms the predecessor in terms of inception scores.
Evaluation of Deep Neural Networks for Semantic Segmentation of Prostate in T2W MRI

In this paper, we present an evaluation of four encoder–decoder CNNs in the segmentation of the prostate gland in T2W magnetic resonance imaging (MRI) image. The four selected CNNs are FCN, SegNet, U-Net, and DeepLabV3+, which was originally proposed for the segmentation of road scene, biomedical, and natural images. Segmentation of prostate in T2W MRI images is an important step in the automatic diagnosis of prostate cancer to enable better lesion detection and staging of prostate cancer. Therefore, many research efforts have been conducted to improve the segmentation of the prostate gland in MRI images. The main challenges of prostate gland segmentation are blurry prostate boundary and variability in prostate anatomical structure. In this work, we investigated the performance of encoder–decoder CNNs for segmentation of prostate gland in T2W MRI. Image pre-processing techniques including image resizing, center-cropping and intensity normalization are applied to address the issues of inter-patient and inter-scanner variability as well as the issue of dominating background pixels over prostate pixels. In addition, to enrich the network with more data, to increase data variation, and to improve its accuracy, patch extraction and data augmentation are applied prior to training the networks. Furthermore, class weight balancing is used to avoid having biased networks since the number of background pixels is much higher than the prostate pixels. The class imbalance problem is solved by utilizing weighted cross-entropy loss function during the training of the CNN model. The performance of the CNNs is evaluated in terms of the Dice similarity coefficient (DSC) and our experimental results show that patch-wise DeepLabV3+ gives the best performance with DSC equal to 92.8 % . This value is the highest DSC score compared to the FCN, SegNet, and U-Net that also competed the recently published state-of-the-art method of prostate segmentation.
Peer Collaborative Learning for Online Knowledge Distillation

Traditional knowledge distillation uses a two-stage training strategy to transfer knowledge from a high-capacity teacher model to a compact student model, which relies heavily on the pre-trained teacher. Recent online knowledge distillation alleviates this limitation by collaborative learning, mutual learning and online ensembling, following a one-stage end-to-end training fashion. However, collaborative learning and mutual learning fail to construct an online high-capacity teacher, whilst online ensembling ignores the collaboration among branches and its logit summation impedes the further optimisation of the ensemble teacher. In this work, we propose a novel Peer Collaborative Learning method for online knowledge distillation, which integrates online ensembling and network collaboration into a unified framework. Specifically, given a target network, we construct a multi-branch network for training, in which each branch is called a peer. We perform random augmentation multiple times on the inputs to peers and assemble feature representations outputted from peers with an additional classifier as the peer ensemble teacher. This helps to transfer knowledge from a high-capacity teacher to peers, and in turn further optimises the ensemble teacher. Meanwhile, we employ the temporal mean model of each peer as the peer mean teacher to collaboratively transfer knowledge among peers, which helps each peer to learn richer knowledge and facilitates to optimise a more stable model with better generalisation. Extensive experiments on CIFAR-10, CIFAR-100 and ImageNet show that the proposed method significantly improves the generalisation of various backbone networks and outperforms the state-of-the-art methods.
Parallel Data Augmentation for Formality Style Transfer

The main barrier to progress in the task of Formality Style Transfer is the inadequacy of training data.In this paper, we study how to augment parallel data and propose novel and simple data augmentation methods for this task to obtain useful sentence pairs with easily accessible models and systems.Experiments demonstrate that our augmented parallel data largely helps improve formality style transfer when it is used to pre-train the model, leading to the state-of-the-art results in the GYAFC benchmark dataset 1 .
Non-interactive Proofs of Proof-of-Work

Decentralized consensus protocols based on proof-of-work (PoW) mining require nodes to download data linear in the size of the blockchain even if they make use of Simplified Payment Verification (SPV). In this work, we put forth a new formalization of proof-of-work verification by introducing a primitive called Non-Interactive Proofs of Proof-of-Work (NIPoPoWs). We improve upon the previously known SPV NIPoPoW by proposing a novel NIPoPoW construction using superblocks, blocks that are much heavier than usual blocks, which capture the fact that proof-of-work took place without sending all of it. Unlike a traditional blockchain client which must verify the entire linearly-growing chain of PoWs, clients based on superblock NIPoPoWs require resources only logarithmic in the length of the chain, instead downloading a compressed form of the chain. Superblock NIPoPoWs are thus succinct proofs and, due to their non-interactivity, require only a single message between the prover and the verifier of the transaction. Our construction allows the creation of superlight clients which can synchronize with the network quickly even if they remain offline for large periods of time. Our scheme is provably secure in the Bitcoin Backbone model. From a theoretical point of view, we are the first to propose a cryptographic prover–verifier definition for decentralized consensus protocols and the first to give a construction which can synchronize non-interactively using only a logarithmically-sized message.
Democratizing EHR analyses with FIDDLE: a flexible data-driven preprocessing pipeline for structured clinical data

Abstract Objective In applying machine learning (ML) to electronic health record (EHR) data, many decisions must be made before any ML is applied; such preprocessing requires substantial effort and can be labor-intensive. As the role of ML in health care grows, there is an increasing need for systematic and reproducible preprocessing techniques for EHR data. Thus, we developed FIDDLE (Flexible Data-Driven Pipeline), an open-source framework that streamlines the preprocessing of data extracted from the EHR. Materials and Methods Largely data-driven, FIDDLE systematically transforms structured EHR data into feature vectors, limiting the number of decisions a user must make while incorporating good practices from the literature. To demonstrate its utility and flexibility, we conducted a proof-of-concept experiment in which we applied FIDDLE to 2 publicly available EHR data sets collected from intensive care units: MIMIC-III and the eICU Collaborative Research Database. We trained different ML models to predict 3 clinically important outcomes: in-hospital mortality, acute respiratory failure, and shock. We evaluated models using the area under the receiver operating characteristics curve (AUROC), and compared it to several baselines. Results Across tasks, FIDDLE extracted 2,528 to 7,403 features from MIMIC-III and eICU, respectively. On all tasks, FIDDLE-based models achieved good discriminative performance, with AUROCs of 0.757–0.886, comparable to the performance of MIMIC-Extract, a preprocessing pipeline designed specifically for MIMIC-III. Furthermore, our results showed that FIDDLE is generalizable across different prediction times, ML algorithms, and data sets, while being relatively robust to different settings of user-defined arguments. Conclusions FIDDLE, an open-source preprocessing pipeline, facilitates applying ML to structured EHR data. By accelerating and standardizing labor-intensive preprocessing, FIDDLE can help stimulate progress in building clinically useful ML tools for EHR data.
The emerging commercial landscape of quantum computing

Quantum computing technologies are advancing, and the class of addressable problems is expanding. Together with the emergence of new ventures and government-sponsored partnerships, these trends will help to lower the barrier for adoption of new technology and provide stability in an uncertain market. Until then, quantum computing presents an exciting testbed for different strategies in an emerging market. Quantum computing technologies are advancing, and the class of addressable problems is expanding. What market strategies are quantum computing companies and start-ups adopting?
A survey on the development status and application prospects of knowledge graph in smart grids

With the advent of the electric power big data era, semantic interoperability and interconnection of power data have received extensive attention. Knowledge graph technology is a new method describing the complex relationships between concepts and entities in the objective world, which is widely concerned because of its robust knowledge inference ability. Especially with the proliferation of measurement devices and exponential growth of electric power data empowers, electric power knowledge graph provides new opportunities to solve the contradictions between the massive power resources and the continuously increasing demands for intelligent applications. In an attempt to fulfil the potential of knowledge graph and deal with the various challenges faced, as well as to obtain insights to achieve business applications of smart grids, this work first presents a holistic study of knowledge-driven intelligent application integration. Specifically, a detailed overview of electric power knowledge mining is provided. Then, the overview of the knowledge graph in smart grids is introduced. Moreover, the architecture of the big knowledge graph platform for smart grids and critical technologies are described. Furthermore, this paper comprehensively elaborates on the application prospects leveraged by knowledge graph oriented to smart grids, power consumer service, decision-making in dispatching, and operation and maintenance of power equipment. Finally, issues and challenges are summarised.
CLEAR: Contrastive Learning for Sentence Representation

Pre-trained language models have proven their unique powers in capturing implicit language features. However, most pre-training approaches focus on the word-level training objective, while sentence-level objectives are rarely studied. In this paper, we propose Contrastive LEArning for sentence Representation (CLEAR), which employs multiple sentence-level augmentation strategies in order to learn a noise-invariant sentence representation. These augmentations include word and span deletion, reordering, and substitution. Furthermore, we investigate the key reasons that make contrastive learning effective through numerous experiments. We observe that different sentence augmentations during pre-training lead to different performance improvements on various downstream tasks. Our approach is shown to outperform multiple existing methods on both SentEval and GLUE benchmarks.
Globalisation and Female Economic Participation in Sub-Saharan Africa

This study assesses the relationship between globalisation and the economic participation of women (EPW) in 47 Sub-Saharan African countries for the period 1990–2013. EPW is measured with the female labour force participation and employment rates. The empirical evidence is based on panel-corrected standard errors and fixed effects regressions. The findings show that the positive effect of the overall globalisation index on EPW is dampened by its political component and driven by its economic and social components, with a higher positive magnitude from the former or economic globalisation. For the most part, the findings are robust to the control for several structural and institutional characteristics. An extended analysis by unbundling globalisation shows that the positive incidence of social globalisation is driven by information flow (compared to personal contact and cultural proximity) while the positive effect of economic globalisation is driven by actual flows (relative to restrictions). Policy implications are discussed with some emphasis on how to elevate women’s social status and potentially reduce their victimisation to male dominance.
Exploring the intellectual cores of the blockchain–Internet of Things (BIoT)

Purpose Due to the rapid growth of blockchain technology in recent years, the fusion of blockchain and the Internet of Things (BIoT) has drawn considerable attention from researchers and industrial practitioners and is regarded as a future trend in technological development. Although several authors have conducted literature reviews on the topic, none have examined the development of the knowledge structure of BIoT, resulting in scattered research and development (R&amp;D) efforts. Design/methodology/approach This study investigates the intellectual core of BIoT through a co-citation proximity analysis–based systematic review (CPASR) of the correlations between 44 highly influential articles out of 473 relevant research studies. Subsequently, we apply a series of statistical analyses, including exploratory factor analysis (EFA), hierarchical cluster analysis (HCA), k-means clustering (KMC) and multidimensional scaling (MDS) to establish the intellectual core. Findings Our findings indicate that there are nine categories in the intellectual core of BIoT: (1) data privacy and security for BIoT systems, (2) models and applications of BIoT, (3) system security theories for BIoT, (4) frameworks for BIoT deployment, (5) the fusion of BIoT with emerging methods and technologies, (6) applied security strategies for using blockchain with the IoT, (7) the design and development of industrial BIoT, (8) establishing trust through BIoT and (9) the BIoT ecosystem. Originality/value We use the CPASR method to examine the intellectual core of BIoT, which is an under-researched and topical area. The paper also provides a structural framework for investigating BIoT research that may be applicable to other knowledge domains.
TABBIE: Pretrained Representations of Tabular Data

Existing work on tabular representationlearning jointly models tables and associated text using self-supervised objective functions derived from pretrained language models such as BERT.While this joint pretraining improves tasks involving paired tables and text (e.g., answering questions about tables), we show that it underperforms on tasks that operate over tables without any associated text (e.g., populating missing cells).We devise a simple pretraining objective (corrupt cell detection) that learns exclusively from tabular data and reaches the state-of-the-art on a suite of tablebased prediction tasks.Unlike competing approaches, our model (TABBIE) provides embeddings of all table substructures (cells, rows, and columns), and it also requires far less compute to train.A qualitative analysis of our model's learned cell, column, and row representations shows that it understands complex table semantics and numerical trends.