Reviewerly/exHarmony huggingface dataset:
Meta Module Network for Compositional Visual Reasoning

Neural Module Network (NMN) exhibits strong interpretability and compositionality thanks to its handcrafted neural modules with explicit multi-hop reasoning capability. However, most NMNs suffer from two critical draw-backs: 1) scalability: customized module for specific function renders it impractical when scaling up to a larger set of functions in complex tasks; 2) generalizability: rigid pre-defined module inventory makes it difficult to generalize to unseen functions in new tasks/domains. To design a more powerful NMN architecture for practical use, we propose Meta Module Network (MMN) centered on a novel meta module, which can take in function recipes and morph into diverse instance modules dynamically. The instance modules are then woven into an execution graph for complex visual reasoning, inheriting the strong explainability and compositionality of NMN. With such a flexible instantiation mechanism, the parameters of instance modules are inherited from the central meta module, retaining the same model complexity as the function set grows, which promises better scalability. Meanwhile, as functions are encoded into the embedding space, unseen functions can be readily represented based on its structural similarity with previously observed ones, which ensures better generalizability. Experiments on GQA and CLEVR datasets validate the superiority of MMN over state-of-the-art NMN designs. Synthetic experiments on held-out unseen functions from GQA dataset also demonstrate the strong generalizability of MMN. Our code and model are released in Github <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup> .
InfoMax-GAN: Improved Adversarial Image Generation via Information Maximization and Contrastive Learning

While Geerative Adversarial Networks (GANs) are fundamental to many generative modelling applications, they suffer from numerous issues. In this work, we propose a principled framework to simultaneously mitigate two fundamental issues in GANs: catastrophic forgetting of the discriminator and mode collapse of the generator. We achieve this by employing for GANs a contrastive learning and mutual information maximization approach, and perform extensive analyses to understand sources of improvements. Our approach significantly stabilizes GAN training and improves GAN performance for image synthesis across five datasets under the same training and evaluation conditions against state-of-the-art works. In particular, compared to the state-of-the-art SSGAN, our approach does not suffer from poorer performance on image domains such as faces, and instead improves performance significantly. Our approach is simple to implement and practical: it involves only one auxiliary objective, has low computational cost, and performs robustly across a wide range of training settings and datasets without any hyperparameter tuning. For reproducibility, our code is available in the open-source GAN library, Mimicry [34].
Temporal Context Aggregation for Video Retrieval with Contrastive Learning

The current research focus on Content-Based Video Retrieval requires higher-level video representation describing the long-range semantic dependencies of relevant incidents, events, etc. However, existing methods commonly process the frames of a video as individual images or short clips, making the modeling of long-range semantic dependencies difficult. In this paper, we propose TCA (Temporal Context Aggregation for Video Retrieval), a video representation learning framework that incorporates longrange temporal information between frame-level features using the self-attention mechanism. To train it on video retrieval datasets, we propose a supervised contrastive learning method that performs automatic hard negative mining and utilizes the memory bank mechanism to increase the capacity of negative samples. Extensive experiments are conducted on multiple video retrieval tasks, such as CC WEB VIDEO, FIVR-200K, and EVVE. The proposed method shows a significant performance advantage (~ 17% mAP on FIVR-200K) over state-of-the-art methods with video-level features, and deliver competitive results with 22x faster inference time comparing with frame-level features.
Machine Learning Enabled Early Detection of Breast Cancer by Structural Analysis of Mammograms

Clinical image processing plays a significant role in healthcare systems and is currently a widely used methodology. In carcinogenic diseases, time is crucial; thus, an image’s accurate analysis can help treat disease at an early stage. Ductal carcinoma in situ (DCIS) and lobular carcinoma in situ (LCIS) are common types of malignancies that affect both women and men. The number of cases of DCIS and LCIS has increased every year since 2002, while it still takes a considerable amount of time to recommend a controlling technique. Image processing is a powerful technique to analyze preprocessed images to retrieve useful information by using some remarkable processing operations. In this paper, we used a dataset from the Mammographic Image Analysis Society and MATLAB 2019b software from MathWorks to simulate and extract our results. In this proposed study, mammograms are primarily used to diagnose, more precisely, the breast’s tumor component. The detection of DCIS and LCIS on breast mammograms is done by preprocessing the images using contrast-limited adaptive histogram equalization. The resulting images’ tumor portions are then isolated by a segmentation process, such as threshold detection. Furthermore, morphological operations, such as erosion and dilation, are applied to the images, then a gray-level co-occurrence matrix texture features, Harlick texture features, and shape features are extracted from the regions of interest. For classification purposes, a support vector machine (SVM) classifier is used to categorize normal and abnormal patterns. Finally, the adaptive neuro-fuzzy inference system is deployed for the amputation of fuzziness due to overlapping features of patterns within the images, and the exact categorization of prior patterns is gained through the SVM. Early detection of DCIS and LCIS can save lives and help physicians and surgeons todiagnose and treat these diseases. Substantial results are obtained through cubic support vector machine (CSVM), respectively, showing 98.95% and 98.01% accuracies for normal and abnormal mammograms. Through ANFIS, promising results of mean square error (MSE) 0.01866, 0.18397, and 0.19640 for DCIS and LCIS differentiation during the training, testing, and checking phases.
A method of two-stage clustering learning based on improved DBSCAN and density peak algorithm

Density peak (DP) and density-based spatial clustering of applications with noise (DBSCAN) are the representative clustering algorithms on the basis of density in unsupervised learning. They are capable of clustering data of arbitrary shape as well as identifying noise samples in a potential data set. Notwithstanding, DP algorithm depends on the decision graph when selecting the centers, it is difficult for users without priori knowledge to automatically as well as accurately identify cluster centers. The clustering performance exhibited by DBSCAN algorithm presents a strong sensitivity to parameter setting regarding Eps and MinPts. For dealing with afore-mentioned issues, we propose a new two-stage clustering method based on improved DBSCAN and DP algorithm (TSCM), which first use an improved DBSCAN algorithm based on bat optimization to generate initial clusters. Specifically, the improved DBSCAN takes a well-known internal clustering validation index without labels called Silhouette as fitness function to control the process of parameters determination by bat optimization. The cluster centers in decision graph are automatically selected according to the initial clusters. The final clusters are obtained by DP with the determined cluster centers. As found in the experiments, relative to DP and DBSCAN, TSCM can effectively overcome the manual intervention of cluster center selection in DP and parameters setting in DBSCAN. The clustering performance is significantly improved.
Cloud-Based Federated Learning Implementation Across Medical Centers

Building well-performing machine learning (ML) models in health care has always been exigent because of the data-sharing concerns, yet ML approaches often require larger training samples than is afforded by one institution. This paper explores several federated learning implementations by applying them in both a simulated environment and an actual implementation using electronic health record data from two academic medical centers on a Microsoft Azure Cloud Databricks platform.Using two separate cloud tenants, ML models were created, trained, and exchanged from one institution to another via a GitHub repository. Federated learning processes were applied to both artificial neural networks (ANNs) and logistic regression (LR) models on the horizontal data sets that are varying in count and availability. Incremental and cyclic federated learning models have been tested in simulation and real environments.The cyclically trained ANN showed a 3% increase in performance, a significant improvement across most attempts (P < .05). Single weight neural network models showed improvement in some cases. However, LR models did not show much improvement after federated learning processes. The specific process that improved the performance differed based on the ML model and how federated learning was implemented. Moreover, we have confirmed that the order of the institutions during the training did influence the overall performance increase.Unlike previous studies, our work has shown the implementation and effectiveness of federated learning processes beyond simulation. Additionally, we have identified different federated learning models that have achieved statistically significant performances. More work is needed to achieve effective federated learning processes in biomedicine, while preserving the security and privacy of the data.
Early detection of cyberbullying on social media networks

Cyberbullying is an important issue for our society and has a major negative effect on the victims, that can be highly damaging due to the frequency and high propagation provided by Information Technologies. Therefore, the early detection of cyberbullying in social networks becomes crucial to mitigate the impact on the victims. In this article, we aim to explore different approaches that take into account the time in the detection of cyberbullying in social networks. We follow a supervised learning method with two different specific early detection models, named threshold and dual. The former follows a more simple approach, while the latter requires two machine learning models. To the best of our knowledge, this is the first attempt to investigate the early detection of cyberbullying. We propose two groups of features and two early detection methods, specifically designed for this problem. We conduct an extensive evaluation using a real world dataset, following a time-aware evaluation that penalizes late detections. Our results show how we can improve baseline detection models up to 42%.
DL2: A Deep Learning-Driven Scheduler for Deep Learning Clusters

Efficient resource scheduling is essential for maximal utilization of expensive deep learning (DL) clusters. Existing cluster schedulers either are agnostic to machine learning (ML) workload characteristics, or use scheduling heuristics based on operators' understanding of particular ML framework and workload, which are less efficient or not general enough. In this article, we show that DL techniques can be adopted to design a generic and efficient scheduler. Specifically, we propose DL2, a DL-driven scheduler for DL clusters, targeting global training job expedition by dynamically resizing resources allocated to jobs. DL2 advocates a joint supervised learning and reinforcement learning approach: a neural network is warmed up via offline supervised learning based on job traces produced by the existing cluster scheduler; then the neural network is plugged into the live DL cluster, fine-tuned by reinforcement learning carried out throughout the training progress of the DL jobs, and used for deciding job resource allocation in an online fashion. We implement DL2 on Kubernetes and enable dynamic resource scaling in DL jobs on MXNet. Extensive evaluation shows that DL2 outperforms fairness scheduler (i.e., DRF) by 44.1 percent and expert heuristic scheduler (i.e., Optimus) by 17.5 percent in terms of average job completion time.
JITBot

Just-In-Time (JIT) defect prediction is a classification model that is trained using historical data to predict bug-introducing changes. However, recent studies raised concerns related to the explainability of the predictions of many software analytics applications (i.e., practitioners do not understand why commits are risky and how to improve them). In addition, the adoption of Just-In-Time defect prediction is still limited due to a lack of integration into CI/CD pipelines and modern software development platforms (e.g., GitHub). In this paper, we present an explainable Just-In-Time defect prediction framework to automatically generate feedback to developers by providing the riskiness of each commit, explaining why such commit is risky, and suggesting risk mitigation plans. The proposed framework is integrated into the GitHub CI/CD pipeline as a GitHub application to continuously monitor and analyse a stream of commits in many GitHub repositories. Finally, we discuss the usage scenarios and their implications to practitioners. The VDO demonstration is available at https://jitbot-tool.github.io/
New DNA Coded Fuzzy Based (DNAFZ) S-Boxes: Application to Robust Image Encryption Using Hyper Chaotic Maps

This article proposes a novel approach of improvising the cryptographic features of substitution-boxes (S-Box) based on the Choquet Fuzzy Integral (CFI) and DNA techniques. First, we propose a strong structure for the construction of four S-Boxes using CFI. The key for generating the CFI based (FZ) S-Boxes consists of two parts, namely, an external secret key and a secret image. Each of these FZ S-boxes is then encoded using DNA techniques, with dynamic rules selection which is dictated by a secret control code. The resultant four S-boxes are designated as DNAFZ S-Boxes. To apply for image encryption, the plain image is, at first 8-bit binary-coded, shuffled by an M-sequence, and down-sampled into four sub-images. Subsequently, the pixel values of each sub-image are replaced with the corresponding values of one of the four DNAFZ S-Boxes. Next, each DNAFZ encoded sub-image is diffused with a different DNA encoded chaotic sequence from Chen's hyper-chaotic map. Finally, the four DNAFZ/Chaotic encoded sub-images are combined to build the final encrypted image. The proposed DNAFZ S-boxes shows excellent statistical properties under majority logic criterions such as correlation, homogeneity, energy, entropy, and contrast. Moreover, numerical simulation is used to examine the efficacy of encrypted images against different attacks. In particular, the values of the pixel correlation coefficient are found to be quite small either horizontally, vertically, or diagonally (between 7.8597e-04 and 0.00527, between 8.7856e-04 and 0.00452, and between 0.00241 and 0.00021, respectively). In addition, the information entropy of the encrypted image is found to be within the range of (7.9965:7.9989) which is very near to the ideal value of 8. As for the UACI and the NPCR, they are in the ranges between 33.46 and 33.32 and between 99.58 and 99.62, respectively. These values are also very close to the optimum ones. The results are compared to those of other encryption algorithms and proved that the proposed encryption method delivers better results than other conventional ones including LSS chaotic map, Arnold transforms, Dynamic Henon map, Hybrid chaotic map optimized substitution, and cubic S-Box.
Analysis of challenges for blockchain adoption within the Indian public sector: an interpretive structural modelling approach

Purpose Blockchain is one of the most significant emerging technologies that is set to transform many aspects of industry and society. However, it has several major technical, social, legal, environmental and ethical complexities that offer significant challenges for mainstream use within the public sector. The coronavirus disease 2019 (COVID-19) pandemic has compelled many public sector employees to work remotely, highlighting a number of challenges to blockchain adoption within the Indian context signifying the pertinence of this research topic in the post-pandemic era. This study offers insight to researchers and policymakers alike on how such challenges are interdependent within this important subject. Design/methodology/approach We explored 16 unique sets of challenges selected from the literature and gathered data from nine experts from government settings, healthcare and education sectors and academia who have significant knowledge and experience of blockchain implementation and use in their respective organisations. The implementation of Interpretive Structural Modelling (ISM) and Matriced' Impacts Croise's Multiplication Appliquée a UN Classement (MICMAC) provided a precise set of driving, linkage and dependent challenges that were used to formulate the framework. Findings The developed ISM framework is split into six different levels. The results suggest that the bottom level consists of challenges such as “Lack of standards (C9)” and “Lack of validation (C10)” form the foundation of the hierarchical structure of blockchain adoption. However, the topmost level consists of a highly dependent challenge termed “adoption of blockchain in the public sector (C16)”. The research filters the selected set of five challenges to develop a parsimonious model and formulated six propositions to examine the impact of “lack of standard (C9)”, “lack of validation (C10)” on “security issues (C3)” and “privacy concerns (C2)”, which eventually determine individuals' “reluctance to use blockchain technology (C12)”. Originality/value This research fills a key gap in exiting research by exploring the key challenges in blockchain adoption within the public sector by developing a valuable framework to model this important topic. To the best of our knowledge, this is the first paper to address these challenges and develop a parsimonious model for challenges of blockchain adoption in the public sector settings.
In-IDE Code Generation from Natural Language: Promise and Challenges

A great part of software development involves conceptualizing or communicating the underlying procedures and logic that needs to be expressed in programs. One major difficulty of programming is turning concept into code , especially when dealing with the APIs of unfamiliar libraries. Recently, there has been a proliferation of machine learning methods for code generation and retrieval from natural language queries , but these have primarily been evaluated purely based on retrieval accuracy or overlap of generated code with developer-written code, and the actual effect of these methods on the developer workflow is surprisingly unattested. In this article, we perform the first comprehensive investigation of the promise and challenges of using such technology inside the PyCharm IDE, asking, “At the current state of technology does it improve developer productivity or accuracy, how does it affect the developer experience, and what are the remaining gaps and challenges?” To facilitate the study, we first develop a plugin for the PyCharm IDE that implements a hybrid of code generation and code retrieval functionality, and we orchestrate virtual environments to enable collection of many user events (e.g., web browsing, keystrokes, fine-grained code edits). We ask developers with various backgrounds to complete 7 varieties of 14 Python programming tasks ranging from basic file manipulation to machine learning or data visualization, with or without the help of the plugin. While qualitative surveys of developer experience are largely positive, quantitative results with regards to increased productivity, code quality, or program correctness are inconclusive. Further analysis identifies several pain points that could improve the effectiveness of future machine learning-based code generation/retrieval developer assistants and demonstrates when developers prefer code generation over code retrieval and vice versa. We release all data and software to pave the road for future empirical studies on this topic, as well as development of better code generation models.
Distributed Ledger Technologies in Supply Chain Security Management: A Comprehensive Survey

Supply chains (SC) present performance bottlenecks that contribute to a high level of costs, infiltration of product quality, and impact productivity. Examples of such inhibitors include the bullwhip effect, new product lines, high inventory, and restrictive data flows. These bottlenecks can force manufacturers to source more raw materials and increase production significantly. Also, restrictive data flow in a complex global SC network generally slows down the movement of goods and services. The use of distributed ledger technologies (DLT) in SC management (SCM) demonstrates the potentials to reduce these bottlenecks through transparency, decentralization, and optimizations in data management. These technologies promise to enhance the trustworthiness of entities within the SC, ensure the accuracy of data-driven operations, and enable existing SCM processes to migrate from a linear to a fully circular economy. This article presents a comprehensive review of 111 articles published in the public domain in the use and efficacy of DLT in SC. It acts as a roadmap for current and future researchers who focus on SC security management to better understand the integration of digital technologies such as DLT. We clustered these articles using standard descriptors linked to trustworthiness, namely, immutability, transparency, traceability, and integrity.
Understanding and benchmarking the impact of GDPR on database systems

The General Data Protection Regulation (GDPR) provides new rights and protections to European people concerning their personal data. We analyze GDPR from a systems perspective, translating its legal articles into a set of capabilities and characteristics that compliant systems must support. Our analysis reveals the phenomenon of metadata explosion, wherein large quantities of metadata needs to be stored along with the personal data to satisfy the GDPR requirements. Our analysis also helps us identify new workloads that must be supported under GDPR. We design and implement an open-source benchmark called GDPRbench that consists of workloads and metrics needed to understand and assess personal-data processing database systems. To gauge the readiness of modern database systems for GDPR, we follow best practices and developer recommendations to modify Redis, PostgreSQL, and a commercial database system to be GDPR compliant. Our experiments demonstrate that the resulting GDPR compliant systems achieve poor performance on GPDR workloads, and that performance scales poorly as the volume of personal data increases. We discuss the real-world implications of these findings, and identify research challenges towards making GDPR compliance efficient in production environments. We release all of our software artifacts and datasets at http://www.gdprbench.org