Reviewerly/exHarmony huggingface dataset:
Blockchain Technology and Artificial Intelligence Based Decentralized Access Control Model to Enable Secure Interoperability for Healthcare

Healthcare, one of the most important industries, is data-oriented, but most of the research in this industry focuses on incorporating the internet of things (IoT) or connecting medical equipment. Very few researchers are looking at the data generated in the healthcare industry. Data are very important tools in this competitive world, as they can be integrated with artificial intelligence (AI) to promote sustainability. Healthcare data include the health records of patients, drug-related data, clinical trials data, data from various medical equipment, etc. Most of the data management processes are manual, time-consuming, and error-prone. Even then, different healthcare industries do not trust each other to share and collaborate on data. Distributed ledger technology is being used for innovations in different sectors including healthcare. This technology can be incorporated to maintain and exchange data between different healthcare organizations, such as hospitals, insurance companies, laboratories, pharmacies, etc. Various attributes of this technology, such as its immutability, transparency, provenance etc., can bring trust and security to the domain of the healthcare sector. In this paper, a decentralized access control model is proposed to enable the secure interoperability of different healthcare organizations. This model uses the Ethereum blockchain for its implementation. This model interfaces patients, doctors, chemists, and insurance companies, empowering the consistent and secure exchange of data. The major concerns are maintaining a history of the transactions and avoiding unauthorized updates in health records. Any transaction that changes the state of the data is reflected in the distributed ledger and can be easily traced with this model. Only authorized entities can access their respective data. Even the administrator will not be able to modify any medical records.
Wireless Semantic Communications for Video Conferencing

Video conferencing has become a popular mode of meeting despite consuming considerable communication resources. Conventional video compression causes resolution reduction under a limited bandwidth. Semantic video conferencing (SVC) maintains a high resolution by transmitting some keypoints to represent the motions because the background is almost static, and the speakers do not change often. However, the study on the influence of transmission errors on keypoints is limited. In this paper, an SVC network based on keypoint transmission is established, which dramatically reduces transmission resources while only losing detailed expressions. Transmission errors in SVC only lead to a changed expression, whereas those in the conventional methods directly destroy pixels. However, the conventional error detector, such as cyclic redundancy check, cannot reflect the degree of expression changes. To overcome this issue, an incremental redundancy hybrid automatic repeat-request framework for varying channels (SVC-HARQ) incorporating a novel semantic error detector is developed. SVC-HARQ has flexibility in bit consumption and achieves a good performance. In addition, SVC-channel state information (CSI) is designed for CSI feedback to allocate the keypoint transmission and enhance the performance dramatically. Simulation shows that the proposed wireless semantic communication system can remarkably improve transmission efficiency.
Free-space continuous-variable quantum key distribution of unidimensional Gaussian modulation using polarized coherent states in an urban environment

An experiment evaluating continuous-variable quantum key distribution (CV-QKD) in an urban environment free-space channel has been accomplished using a single homodyne detector. This is based on Gaussian modulation with coherent states in the polarization degree of freedom. We achieved a QKD distance at 460 m at a repetition rate of 10 kHz. The secure key rate is 0.152 kbps at the typical reconciliation efficiency of 0.95. The experimental setup of this scheme is simplified, and the barrier for implementation has been remarkably reduced compared to that for traditional symmetric modulation protocols, for example, the GG02 protocol proposed in F. Grosshans and P. Grangier [Phys. Rev. Lett. 88, 057902 (2002)]. The influence of the security key rate by asymmetric modulation is small for a relatively low channel loss condition in a free-space environment. This scheme is expected to have significance for future practical applications.
On the Limitations of Representing Functions on Sets

Recent work on the representation of functions on sets has considered the use of summation in a latent space to enforce permutation invariance. In particular, it has been conjectured that the dimension of this latent space may remain fixed as the cardinality of the sets under consideration increases. However, we demonstrate that the analysis leading to this conjecture requires mappings which are highly discontinuous and argue that this is only of limited practical use. Motivated by this observation, we prove that an implementation of this model via continuous mappings (as provided by e.g. neural networks or Gaussian processes) actually imposes a constraint on the dimensionality of the latent space. Practical universal function representation for set inputs can only be achieved with a latent dimension at least the size of the maximum number of input elements.
CenterNet: Object Detection with Keypoint Triplets

In object detection, keypoint-based approaches often suffer a large number ofincorrect object bounding boxes, arguably due to the lack of an additional lookinto the cropped regions. This paper presents an efficient solution whichexplores the visual patterns within each cropped region with minimal costs. Webuild our framework upon a representative one-stage keypoint-based detectornamed CornerNet. Our approach, named CenterNet, detects each object as atriplet, rather than a pair, of keypoints, which improves both precision andrecall. Accordingly, we design two customized modules named cascade cornerpooling and center pooling, which play the roles of enriching informationcollected by both top-left and bottom-right corners and providing morerecognizable information at the central regions, respectively. On the MS-COCOdataset, CenterNet achieves an AP of \textbf{47.0\%}, which outperforms allexisting one-stage detectors by a large margin. Meanwhile, with a fasterinference speed, CenterNet demonstrates quite comparable performance to thetop-ranked two-stage detectors. Code is available athttps://github.com/Duankaiwen/CenterNet.
In Other News: a Bi-style Text-to-speech Model for Synthesizing Newscaster Voice with Limited Data

Nishant Prateek, Mateusz Łajszczak, Roberto Barra-Chicote, Thomas Drugman, Jaime Lorenzo-Trueba, Thomas Merritt, Srikanth Ronanki, Trevor Wood. Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 2 (Industry Papers). 2019.
From Smart Homes to Smart-Ready Homes and Communities

People have various and changing needs as they age, and the number of people living with some form of dementia is steadily increasing. Smart homes have a unique potential to provide assisted living but are often designed rigidly with a specific and fixed problem in mind.To make smart-ready homes and communities that can be adaptively and easily updated over time to support varying user needs and to deliver the needed assistance, empowerment, and living independence.The design and deployment of programmable assistive environment for older adults.The use of platform technology (a special form of what is known today as the Internet of Things or IoT) has enabled the decoupling of goal setting and application development from sensing and assistive technology deployment and insertion in the assistive environment. Personalising a smart home or changing its applications and its interfaces dynamically as the user needs change was possible and has been demonstrated successfully in one house - the Gator Tech Smart House. Scaling up the platform technology approach to a planned living community is underway at one of UK's National Health Services (NHS) Healthy New Town projects.There is a great need to integrate technology with living spaces to provide assistance and independent living, but to smarten these spaces for lifelong living, the technology and the smart home applications must be flexible, adaptive, and changeable over time. However, people do not just live at home, they live in communities. Looking at the big picture (communities), as well as the small (homes), we consider how to progress beyond smart-ready homes towards smart-ready communities.
Convolutional Networks with Adaptive Inference Graphs

Do convolutional networks really need a fixed feed-forward structure? What if, after identifying the high-level concept of an image, a network could move directly to a layer that can distinguish fine-grained differences? Currently, a network would first need to execute sometimes hundreds of intermediate layers that specialize in unrelated aspects. Ideally, the more a network already knows about an image, the better it should be at deciding which layer to compute next. In this work, we propose convolutional networks with adaptive inference graphs (ConvNet-AIG) that adaptively define their network topology conditioned on the input image. Following a high-level structure similar to residual networks (ResNets), ConvNet-AIG decides for each input image on the fly which layers are needed. In experiments on ImageNet we show that ConvNet-AIG learns distinct inference graphs for different categories. Both ConvNet-AIG with 50 and 101 layers outperform their ResNet counterpart, while using $$20\%$$ and $$38\%$$ less computations respectively. By grouping parameters into layers for related classes and only executing relevant layers, ConvNet-AIG improves both efficiency and overall classification quality. Lastly, we also study the effect of adaptive inference graphs on the susceptibility towards adversarial examples. We observe that ConvNet-AIG shows a higher robustness than ResNets, complementing other known defense mechanisms.
Adding New Tasks to a Single Network with Weight Transformations Using Binary Masks

Visual recognition algorithms are required today to exhibit adaptive abilities. Given a deep model trained on a specific, given task, it would be highly desirable to be able to adapt incrementally to new tasks, preserving scalability as the number of new tasks increases, while at the same time avoiding catastrophic forgetting issues. Recent work has shown that masking the internal weights of a given original conv-net through learned binary variables is a promising strategy. We build upon this intuition and take into account more elaborated affine transformations of the convolutional weights that include learned binary masks. We show that with our generalization it is possible to achieve significantly higher levels of adaptation to new tasks, enabling the approach to compete with fine tuning strategies by requiring slightly more than 1 bit per network parameter per additional task. Experiments on two popular benchmarks showcase the power of our approach, that achieves the new state of the art on the Visual Decathlon Challenge.
Open science: The open clinical trials data journey

Open data sharing and access has the potential to promote transparency and reproducibility in research, contribute to education and training, and prompt innovative secondary research. Yet, there are many reasons why researchers don't share their data. These include, among others, time and resource constraints, patient data privacy issues, lack of access to appropriate funding, insufficient recognition of the data originators' contribution, and the concern that commercial or academic competitors may benefit from analyses based on shared data. Nevertheless, there is a positive interest within and across the research and patient communities to create shared data resources. In this perspective, we will try to highlight the spectrum of "openness" and "data access" that exists at present and highlight the strengths and weakness of current data access platforms, present current examples of data sharing platforms, and propose guidelines to revise current data sharing practices going forward.
Meta Reinforcement Learning with Task Embedding and Shared Policy

Despite significant progress, deep reinforcement learning (RL) suffers from data-inefficiency and limited generalization. Recent efforts apply meta-learning to learn a meta-learner from a set of RL tasks such that a novel but related task could be solved quickly. Though specific in some ways, different tasks in meta-RL are generally similar at a high level. However, most meta-RL methods do not explicitly and adequately model the specific and shared information among different tasks, which limits their ability to learn training tasks and to generalize to novel tasks. In this paper, we propose to capture the shared information on the one hand and meta-learn how to quickly abstract the specific information about a task on the other hand. Methodologically, we train an SGD meta-learner to quickly optimize a task encoder for each task, which generates a task embedding based on past experience. Meanwhile, we learn a policy which is shared across all tasks and conditioned on task embeddings. Empirical results on four simulated tasks demonstrate that our method has better learning capacity on both training and novel tasks and attains up to 3 to 4 times higher returns compared to baselines.
Openness in Big Data and Data Repositories

Abstract There is a growing expectation, or even requirement, for researchers to deposit a variety of research data in data repositories as a condition of funding or publication. This expectation recognizes the enormous benefits of data collected and created for research purposes being made available for secondary uses, as open science gains increasing support. This is particularly so in the context of big data, especially where health data is involved. There are, however, also challenges relating to the collection, storage, and re-use of research data. This paper gives a brief overview of the landscape of data sharing via data repositories and discusses some of the key ethical issues raised by the sharing of health-related research data, including expectations of privacy and confidentiality, the transparency of repository governance structures, access restrictions, as well as data ownership and the fair attribution of credit. To consider these issues and the values that are pertinent, the paper applies the deliberative balancing approach articulated in the Ethics Framework for Big Data in Health and Research (Xafis et al. 2019) to the domain of Openness in Big Data and Data Repositories. Please refer to that article for more information on how this framework is to be used, including a full explanation of the key values involved and the balancing approach used in the case study at the end.
Quantum Two-Mode Squeezing Radar and Noise Radar: Correlation Coefficients for Target Detection

Quantum two-mode squeezing (QTMS) radars and noise radars detect targets by correlating the received signal with an internally stored recording. A covariance matrix can be calculated between the two which, in theory, is a function of a single correlation coefficient. This coefficient can be used to decide whether a target is present or absent. We can estimate the correlation coefficient by minimizing the Frobenius norm between the sample covariance matrix and the theoretically expected form of the matrix. Using simulated data, we show that the estimates follow a Rice distribution whose parameters are simple functions of the underlying, "true" correlation coefficient as well as the number of integrated samples. We obtain an explicit expression for the receiver operating characteristic curve that results when the correlation coefficient is used for target detection. This is an important first step toward performance prediction for QTMS radars.
Back in the Game

This research intends to contribute to extent the understanding of the renewed interest in analog games phenomenon. We expose the origin and characteristics of modern board games, taxonomy and timeline and demonstrate the growing interest in the subject by presenting current trends, main contributions, themes and some potential research gaps for future researchers, all via a bibliometric survey in the Scopus and Web of Science Databases.
Learning a Single Tucker Decomposition Network for Lossy Image Compression With Multiple Bits-per-Pixel Rates

Lossy image compression (LIC), which aims to utilize inexact approximations to represent an image more compactly, is a classical problem in image processing. Recently, deep convolutional neural networks (CNNs) have achieved interesting results in LIC by learning an encoder-quantizer-decoder network from a large amount of data. However, existing CNN-based LIC methods generally train a network for a specific bits-per-pixel (bpp). Such a “one-network-per-bpp” problem limits the generality and flexibility of CNNs to practical LIC applications. In this paper, we propose to learn a single CNN which can perform LIC at multiple bpp rates. A simple yet effective Tucker Decomposition Network (TDNet) is developed, where there is a novel tucker decomposition layer (TDL) to decompose a latent image representation into a set of projection matrices and a core tensor. By changing the rank of core tensor and its quantization, we can easily adjust the bpp rate of latent image representation within a single CNN. Furthermore, an iterative non-uniform quantization scheme is presented to optimize the quantizer, and a coarse-to-fine training strategy is introduced to reconstruct the decompressed images. Extensive experiments demonstrate the state-of-the-art compression performance of TDNet in terms of both PSNR and MS-SSIM indices.
Training Gaussian boson sampling distributions

Gaussian boson sampling (GBS) is a near-term platform for photonic quantum computing. Applications have been developed that rely on directly programming GBS devices, but the ability to train and optimize circuits has been a key missing ingredient for developing new algorithms. In this work, we derive analytical gradient formulas for the GBS distribution, which can be used for training devices using standard methods based on gradient descent. We introduce a parametrization of the distribution that allows the gradient to be estimated by sampling from the same device that is being optimized. In the case of training using a Kullback-Leibler divergence or log-likelihood cost function, we show that gradients can be computed classically, leading to fast training. We illustrate these results with numerical experiments in stochastic optimization and unsupervised learning. As a particular example, we introduce the variational Ising solver, a hybrid algorithm for training GBS devices to sample ground states of a classical Ising model with high probability.
Measuring Bot and Human Behavioral Dynamics

Bots, social media accounts controlled by software rather than by humans, have recently been under the spotlight for their association with various forms of online manipulation. To date, much work has focused on social bot detection, but little attention has been devoted to the characterization and measurement of the behavior and activity of bots, as opposed to humans'. Over the course of the years, bots have become more sophisticated, and to some extent capable of emulating the short-term behavior of human users. The goal of this paper is to study the behavioral dynamics that bots exhibit over the course of an activity session, and highlight if and how these differ from human activity signatures. By using a large Twitter dataset associated with recent political events, we first separate bots and humans, then isolate their activity sessions. We compile a list of quantities to be measured, like the propensity of users to engage in social interactions or to produce content. Our analysis highlights the presence of short-term behavioral trends in humans, which can be associated with a cognitive origin, that are absent in bots, intuitively due to the automated nature of their activity. These findings are finally codified to create and evaluate a machine learning algorithm to detect activity sessions produced by bots and humans, to allow for more nuanced bot detection strategies.
CacheQuery: learning replacement policies from hardware caches

We show how to infer deterministic cache replacement policies using off-the-shelf automata learning and program synthesis techniques. For this, we construct and chain two abstractions that expose the cache replacement policy of any set in the cache hierarchy as a membership oracle to the learning algorithm, based on timing measurements on a silicon CPU. Our experiments demonstrate an advantage in scope and scalability over prior art and uncover two previously undocumented cache replacement policies.
Phone Features Improve Speech Translation

End-to-end models for speech translation (ST) more tightly couple speech recognition (ASR) and machine translation (MT) than a traditional cascade of separate ASR and MT models, with simpler model architectures and the potential for reduced error propagation. Their performance is often assumed to be superior, though in many conditions this is not yet the case. We compare cascaded and end-to-end models across high, medium, and low-resource conditions, and show that cascades remain stronger baselines. Further, we introduce two methods to incorporate phone features into ST models. We show that these features improve both architectures, closing the gap between end-to-end models and cascades, and outperforming previous academic work – by up to 9 BLEU on our low-resource setting.
Sparse-RS: A Versatile Framework for Query-Efficient Sparse Black-Box Adversarial Attacks

We propose a versatile framework based on random search, Sparse-RS, for score-based sparse targeted and untargeted attacks in the black-box setting. Sparse-RS does not rely on substitute models and achieves state-of-the-art success rate and query efficiency for multiple sparse attack models: L0-bounded perturbations, adversarial patches, and adversarial frames. The L0-version of untargeted Sparse-RS outperforms all black-box and even all white-box attacks for different models on MNIST, CIFAR-10, and ImageNet. Moreover, our untargeted Sparse-RS achieves very high success rates even for the challenging settings of 20x20 adversarial patches and 2-pixel wide adversarial frames for 224x224 images. Finally, we show that Sparse-RS can be applied to generate targeted universal adversarial patches where it significantly outperforms the existing approaches. Our code is available at https://github.com/fra31/sparse-rs.
Comparative Analysis of Text Classification Approaches in Electronic Health Records

Text classification tasks which aim at harvesting and/or organizing information from electronic health records are pivotal to support clinical and translational research. However these present specific challenges compared to other classification tasks, notably due to the particular nature of the medical lexicon and language used in clinical records. Recent advances in embedding methods have shown promising results for several clinical tasks, yet there is no exhaustive comparison of such approaches with other commonly used word representations and classification models. In this work, we analyse the impact of various word representations, text pre-processing and classification algorithms on the performance of four different text classification tasks. The results show that traditional approaches, when tailored to the specific language and structure of the text inherent to the classification task, can achieve or exceed the performance of more recent ones based on contextual embeddings such as BERT.