Reviewerly/exHarmony huggingface dataset:
Attribute Based Encryption with Privacy Protection and Accountability for CloudIoT

The pervasive, ubiquitous, and heterogeneous properties of IoT make securing IoT systems a very challenging task. More so when access and storage are performed through a cloud-based IoT system. IoT data stored on cloud should be encrypted to ensure data privacy. It is also crucial to allow only authorized entities to access and decrypt the encrypted data. In this article, we propose a ciphertext-policy attribute-based encryption (CP-ABE) scheme that enables fine-grained access control of encrypted IoT data on cloud. CP-ABE is regarded as a highly promising approach to provide flexible and fine-grained access control, which is quite suited to secure cloud based IoT systems. We first present an access control system model of CloudIoT platform based on ABE. Based on the presented system model, we construct a ciphertext-policy hiding CP-ABE scheme, which guarantees the privacy of the users. We further construct a white-box traceable CP-ABE scheme with accountability in order to address the user key abuse and authorization center key abuse. Experiment illustrates the proposed systems are efficient.
Doctor XAI

Several recent advancements in Machine Learning involve blackbox models: algorithms that do not provide human-understandable explanations in support of their decisions. This limitation hampers the fairness, accountability and transparency of these models; the field of eXplainable Artificial Intelligence (XAI) tries to solve this problem providing human-understandable explanations for black-box models. However, healthcare datasets (and the related learning tasks) often present peculiar features, such as sequential data, multi-label predictions, and links to structured background knowledge. In this paper, we introduce Doctor XAI, a model-agnostic explainability technique able to deal with multi-labeled, sequential, ontology-linked data. We focus on explaining Doctor AI, a multilabel classifier which takes as input the clinical history of a patient in order to predict the next visit. Furthermore, we show how exploiting the temporal dimension in the data and the domain knowledge encoded in the medical ontology improves the quality of the mined explanations.
F-BRS: Rethinking Backpropagating Refinement for Interactive Segmentation

Deep neural networks have become a mainstream approach to interactive segmentation. As we show in our experiments, while for some images a trained network provides accurate segmentation result with just a few clicks, for some unknown objects it cannot achieve satisfactory result even with a large amount of user input. Recently proposed backpropagating refinement scheme (BRS) introduces an optimization problem for interactive segmentation that results in significantly better performance for the hard cases. At the same time, BRS requires running forward and backward pass through a deep network several times that leads to significantly increased computational budget per click compared to other methods. We propose f-BRS (feature backpropagating refinement scheme) that solves an optimization problem with respect to auxiliary variables instead of the network inputs, and requires running forward and backward passes just for a small part of a network. Experiments on GrabCut, Berkeley, DAVIS and SBD datasets set new state-of-the-art at an order of magnitude lower time per click compared to original BRS. The code and trained models are available at https://github.com/saic-vul/fbrs_interactive_segmentation.
Predicting Semantic Map Representations From Images Using Pyramid Occupancy Networks

Autonomous vehicles commonly rely on highly detailed birds-eye-view maps of their environment, which capture both static elements of the scene such as road layout as well as dynamic elements such as other cars and pedestrians. Generating these map representations on the fly is a complex multi-stage process which incorporates many important vision-based elements, including ground plane estimation, road segmentation and 3D object detection. In this work we present a simple, unified approach for estimating these map representations directly from monocular images using a single end-to-end deep learning architecture. For the maps themselves we adopt a semantic Bayesian occupancy grid framework, allowing us to trivially accumulate information over multiple cameras and timesteps. We demonstrate the effectiveness of our approach by evaluating against several challenging baselines on the NuScenes and Argoverse datasets, and show that we are able to achieve a relative improvement of 9.1% and 22.3% respectively compared to the best-performing existing method.
MOD-RRT*: A Sampling-Based Algorithm for Robot Path Planning in Dynamic Environment

This article presents an algorithm termed as multiobjective dynamic rapidly exploring random (MOD-RRT*), which is suitable for robot navigation in unknown dynamic environment. The algorithm is composed of a path generation procedure and a path replanning one. First, a modified RRT* is utilized to obtain an initial path, as well as generate a state tree structure as prior knowledge. Then, a shortcuting method is given to optimize the initial path. On this basis, another method is designed to replan the path if the current path is infeasible. The suggested approach can choose the best node among several candidates within a short time, where both path length and path smoothness are considered. Comparing with other static planning algorithms, the MOD-RRT* can generate a higher quality initial path. Simulations on the dynamic environment are conducted to clarify the efficient performance of our algorithm in avoiding unknown obstacles. Furthermore, real applicative experiment further proves the effectiveness of our approach in practical applications.
Multi-Modal Domain Adaptation for Fine-Grained Action Recognition

Fine-grained action recognition datasets exhibit environmental bias, where multiple video sequences are captured from a limited number of environments. Training a model in one environment and deploying in another results in a drop in performance due to an unavoidable domain shift. Unsupervised Domain Adaptation (UDA) approaches have frequently utilised adversarial training between the source and target domains. However, these approaches have not explored the multi-modal nature of video within each domain. In this work we exploit the correspondence of modalities as a self-supervised alignment approach for UDA in addition to adversarial alignment (Fig. 1). We test our approach on three kitchens from the large-scale EPIC-Kitchens dataset, using two modalities commonly employed for action recognition: RGB and Optical Flow. We show that multi-modal self-supervision alone improves the performance over source-only training by 2.4% on average. We then combine adversarial training with multi-modal self-supervision, showing that our approach outperforms other UDA methods by 3%.
Fault-Tolerant Control for Stochastic Switched IT2 Fuzzy Uncertain Time-Delayed Nonlinear Systems

This article devotes to solve the fault-tolerant control problem based on interval type-2 (IT2) Takagi-Sugeno (T-S) fuzzy stochastic switched uncertain time-delayed systems with signal quantization. Stochastic switched systems can model a dynamic structure susceptible to abrupt faults, making it more practically significant in power systems or economic systems. The core design is an observer-based fault-tolerant control scheme that can estimate incomplete measurable variables and eliminate the influence of fault dynamically well and enhancing the robust stability of the systems subject to quantization effects. A novel method in seeking the upper bound solution of time-varying delay efficiently decreases conservativeness, especially for the proposed time-delayed system. The simulated analysis is specified to verify the availability and validity of the obtained design method.
Trainable Communication Systems: Concepts and Prototype

We consider a trainable point-to-point communication system, where both transmitter and receiver are implemented as neural networks (NNs), and demonstrate that training on the bit-wise mutual information (BMI) allows seamless integration with practical bit-metric decoding (BMD) receivers, as well as joint optimization of constellation shaping and labeling. Moreover, we present a fully differentiable neural iterative demapping and decoding (IDD) structure which achieves significant gains on additive white Gaussian noise (AWGN) channels using a standard 802.11n low-density parity-check (LDPC) code. The strength of this approach is that it can be applied to arbitrary channels without any modifications. Going one step further, we show that careful code design can lead to further performance improvements. Lastly, we show the viability of the proposed system through implementation on software-defined radios (SDRs) and training of the end-to-end system on the actual wireless channel. Experimental results reveal that the proposed method enables significant gains compared to conventional techniques.
Privacy preservation in permissionless blockchain: A survey

Permissionless blockchain, as a kind of distributed ledger, has gained considerable attention because of its openness, transparency, decentralization, and immutability. Currently, permissionless blockchain has shown a good application prospect in many fields, from the initial cryptocurrency to the Internet of Things (IoT) and Vehicular Ad-Hoc Networking (VANET), which is considered as the beginning of rewriting our digital infrastructure. However, blockchain confronts some privacy risks that hinder its practical applications. Though numerous surveys reviewed the privacy preservation in blockchain, they failed to reveal the latest advances, nor have they been able to conduct a unified standard comprehensive classification of the privacy protection of permissionless blockchain. Therefore, in this paper, we analyze the specific characteristics of permissionless blockchain, summarize the potential privacy threats, and investigate the unique privacy requirements of blockchain. Existing privacy preservation technologies are carefully surveyed and evaluated based on our proposed evaluation criteria. We finally figure out open research issues as well as future research directions from the perspective of privacy issues.
Realizing the Heterogeneity: A Self-Organized Federated Learning Framework for IoT

The ubiquity of devices in Internet of Things (IoT) has opened up a large source for IoT data. Machine learning (ML) models with big IoT data is beneficial to our daily life in monitoring air condition, pollution, climate change, etc. However, centralized conventional ML models rely on all clients' data at a central server, which seriously threatens user privacy. Federated learning (FL) emerges as a promising solution aiming to protect user privacy by enabling model training on a large corpus of decentralized data. The recent studies indicate FL suffers from the heterogeneity issue as it treats all clients' data equally, that is, FL might sacrifice the performance of the majority of clients to accommodate the performance of the minority of clients with low usability data. In order to overcome this issue, a reinforcement learning (RL)-based intelligent central server with the capability of recognizing heterogeneity is implemented, which can help lead the trend toward better performance for majority of clients. To be specific, an FL central server analyses the benefits of different collaboration by capturing the intricate patterns in heterogeneous clients based on rating feedback and then updates clients' weights iteratively, until it establishes a coalition of clients with quasioptimal performance. The experimental results on three real data sets under various heterogeneity levels demonstrate the superior performance of the proposed solution.
Quantum computing enhanced computational catalysis

The quantum computation of electronic energies can break the curse of dimensionality that plagues many-particle quantum mechanics. It is for this reason that a universal quantum computer has the potential to fundamentally change computational chemistry and materials science, areas in which strong electron correlations present severe hurdles for traditional electronic structure methods. Here, we present a state-of-the-art analysis of accurate energy measurements on a quantum computer for computational catalysis, using improved quantum algorithms with more than an order of magnitude improvement over the best previous algorithms. As a prototypical example of local catalytic chemical reactivity we consider the case of a ruthenium catalyst that can bind, activate, and transform carbon dioxide to the high-value chemical methanol. We aim at accurate resource estimates for the quantum computing steps required for assessing the electronic energy of key intermediates and transition states of its catalytic cycle. In particular, we present new quantum algorithms for double-factorized representations of the four-index integrals that can significantly reduce the computational cost over previous algorithms, and we discuss the challenges of increasing active space sizes to accurately deal with dynamical correlations. We address the requirements for future quantum hardware in order to make a universal quantum computer a successful and reliable tool for quantum computing enhanced computational materials science and chemistry, and identify open questions for further research.
MEgATrack

We present a system for real-time hand-tracking to drive virtual and augmented reality (VR/AR) experiences. Using four fisheye monochrome cameras, our system generates accurate and low-jitter 3D hand motion across a large working volume for a diverse set of users. We achieve this by proposing neural network architectures for detecting hands and estimating hand keypoint locations. Our hand detection network robustly handles a variety of real world environments. The keypoint estimation network leverages tracking history to produce spatially and temporally consistent poses. We design scalable, semi-automated mechanisms to collect a large and diverse set of ground truth data using a combination of manual annotation and automated tracking. Additionally, we introduce a detection-by-tracking method that increases smoothness while reducing the computational cost; the optimized system runs at 60Hz on PC and 30Hz on a mobile processor. Together, these contributions yield a practical system for capturing a user's hands and is the default feature on the Oculus Quest VR headset powering input and social presence.
Blockchain Based Smart Contracts for Internet of Medical Things in e-Healthcare

The concept of Blockchain has penetrated a wide range of scientific areas, and its use is considered to rise exponentially in the near future. Executing short scripts of predefined code called smart contracts on Blockchain can eliminate the need of intermediaries and can also raise the multitude of execution of contracts. In this paper, we discuss the concept of Blockchain along with smart contracts and discuss their applicability in the Internet of Medical Things (IoMT) in the e-healthcare domain. The paper analyses the dimensions that decentralization and the use of smart contracts will take the IoMT in e-healthcare, proposes a novel architecture, and also outlines the advantages, challenges, and future trends related to the integration of all three. The proposed architecture shows its effectiveness with average packet delivery ratio, average latency, and average energy efficiency performance parameters when compared with traditional approaches.
KiU-Net: Overcomplete Convolutional Architectures for Biomedical Image and Volumetric Segmentation

Most methods for medical image segmentation use U-Net or its variants as they have been successful in most of the applications. After a detailed analysis of these "traditional" encoder-decoder based approaches, we observed that they perform poorly in detecting smaller structures and are unable to segment boundary regions precisely. This issue can be attributed to the increase in receptive field size as we go deeper into the encoder. The extra focus on learning high level features causes U-Net based approaches to learn less information about low-level features which are crucial for detecting small structures. To overcome this issue, we propose using an overcomplete convolutional architecture where we project the input image into a higher dimension such that we constrain the receptive field from increasing in the deep layers of the network. We design a new architecture for im- age segmentation- KiU-Net which has two branches: (1) an overcomplete convolutional network Kite-Net which learns to capture fine details and accurate edges of the input, and (2) U-Net which learns high level features. Furthermore, we also propose KiU-Net 3D which is a 3D convolutional architecture for volumetric segmentation. We perform a detailed study of KiU-Net by performing experiments on five different datasets covering various image modalities. We achieve a good performance with an additional benefit of fewer parameters and faster convergence. We also demonstrate that the extensions of KiU-Net based on residual blocks and dense blocks result in further performance improvements. Code: https://github.com/jeya-maria-jose/KiU-Net-pytorch.
Dimension decided Harris hawks optimization with Gaussian mutation: Balance analysis and diversity patterns

Harris hawks optimization (HHO) is a newly developed swarm-based algorithm and the most popular optimizer in the recent year, which mimics the cooperation behavior of Harris hawks. Although the original HHO has a specific weight compared to other state-of-the-art methods when working on the local exploitation of feasible solutions, it still may fail to achieve an excellent set of scales between locally accurate exploitation and globally exploratory search. This imbalanced behavior forms an overall perspective, which can be experienced by slow convergence, inaccuracy or inadequate search coverage, and quickly dropping into local solutions. In order to strengthen the performance of the HHO, two strategies of Gaussian mutation and a dimension decision strategy observed in the cuckoo search method are introduced into this optimizer. The mechanism of cuckoo search is very useful in improving the convergence speed of the search agents as well as sufficient excavation of the solutions in the search area, while the Gaussian mutation strategy performs well in increasing the accuracy and jumping out of the local optimum. In order to verify the remarkable performance of the proposed method, the enhanced paradigm is compared with other mate-heuristic algorithms on 30 IEEE CEC2017 benchmark functions and three typical engineering problems. The experimental results illustrate that the novel developed GCHHO has an excellent ability to achieve superior performance in competition with the original HHO as well as other well-established optimizers. Open source codes and information on original HHO algorithm is available at: https://aliasgharheidari.com/HHO.html. Supportive data and info for this research will be publicly provided in http://aliasgharheidari.com.
Complex networks from classical to quantum

Recent progress in applying complex network theory to problems in quantum information has resulted in a beneficial crossover. Complex network methods have successfully been applied to transport and entanglement models while information physics is setting the stage for a theory of complex systems with quantum information-inspired methods. Novel quantum induced effects have been predicted in random graphs---where edges represent entangled links---and quantum computer algorithms have been proposed to offer enhancement for several network problems. Here we review the results at the cutting edge, pinpointing the similarities and the differences found at the intersection of these two fields.
Keeping the Smart Home Private with Smart(er) IoT Traffic Shaping

The proliferation of smart home Internet of Things (IoT) devices presents unprecedented challenges for preserving privacy within the home. In this paper, we demonstrate that a passive network observer (e.g., an Internet service provider) can infer private in-home activities by analyzing Internet traffic from commercially available smart home devices even when the devices use end-to-end transport-layer encryption. We evaluate common approaches for defending against these types of traffic analysis attacks, including firewalls, virtual private networks, and independent link padding, and find that none sufficiently conceal user activities with reasonable data overhead. We develop a new defense, "stochastic traffic padding" (STP), that makes it difficult for a passive network adversary to reliably distinguish genuine user activities from generated traffic patterns designed to look like user interactions. Our analysis provides a theoretical bound on an adversary's ability to accurately detect genuine user activities as a function of the amount of additional cover traffic generated by the defense technique.
Hilbert space methods for reduced-rank Gaussian process regression

This paper proposes a novel scheme for reduced-rank Gaussian process regression. The method is based on an approximate series expansion of the covariance function in terms of an eigenfunction expansion of the Laplace operator in a compact subset of $\mathbb{R}^d$. On this approximate eigenbasis the eigenvalues of the covariance function can be expressed as simple functions of the spectral density of the Gaussian process, which allows the GP inference to be solved under a computational cost scaling as $\mathcal{O}(nm^2)$ (initial) and $\mathcal{O}(m^3)$ (hyperparameter learning) with $m$ basis functions and $n$ data points. Furthermore, the basis functions are independent of the parameters of the covariance function, which allows for very fast hyperparameter learning. The approach also allows for rigorous error analysis with Hilbert space theory, and we show that the approximation becomes exact when the size of the compact subset and the number of eigenfunctions go to infinity. We also show that the convergence rate of the truncation error is independent of the input dimensionality provided that the differentiability order of the covariance function is increases appropriately, and for the squared exponential covariance function it is always bounded by ${\sim}1/m$ regardless of the input dimensionality. The expansion generalizes to Hilbert spaces with an inner product which is defined as an integral over a specified input density. The method is compared to previously proposed methods theoretically and through empirical tests with simulated and real data.
Diagnosis of breast cancer based on modern mammography using hybrid transfer learning

Breast cancer is a common cancer in women. Early detection of breast cancer in particular and cancer, in general, can considerably increase the survival rate of women, and it can be much more effective. This paper mainly focuses on the transfer learning process to detect breast cancer. Modified VGG (MVGG) is proposed and implemented on datasets of 2D and 3D images of mammograms. Experimental results showed that the proposed hybrid transfer learning model (a fusion of MVGG and ImageNet) provides an accuracy of 94.3%. On the other hand, only the proposed MVGG architecture provides an accuracy of 89.8%. So, it is precisely stated that the proposed hybrid pre-trained network outperforms other compared Convolutional Neural Networks. The proposed architecture can be considered as an effective tool for radiologists to decrease the false negative and false positive rates. Therefore, the efficiency of mammography analysis will be improved.