Reviewerly/exHarmony huggingface dataset:
A Fair Performance Comparison between Complex-Valued and Real-Valued Neural Networks for Disease Detection

Our aim is to contribute to the classification of anomalous patterns in biosignals using this novel approach. We specifically focus on melanoma and heart murmurs. We use a comparative study of two convolution networks in the Complex and Real numerical domains. The idea is to obtain a powerful approach for building portable systems for early disease detection. Two similar algorithmic structures were chosen so that there is no bias determined by the number of parameters to train. Three clinical data sets, ISIC2017, PH2, and Pascal, were used to carry out the experiments. Mean comparison hypothesis tests were performed to ensure statistical objectivity in the conclusions. In all cases, complex-valued networks presented a superior performance for the Precision, Recall, F1 Score, Accuracy, and Specificity metrics in the detection of associated anomalies. The best complex number-based classifier obtained in the Receiving Operating Characteristic (ROC) space presents a Euclidean distance of 0.26127 with respect to the ideal classifier, as opposed to the best real number-based classifier, whose Euclidean distance to the ideal is 0.36022 for the same task of melanoma detection. The 27.46% superiority in this metric, as in the others reported in this work, suggests that complex-valued networks have a greater ability to extract features for more efficient discrimination in the dataset.
SRX–Secure Data Backup and Recovery for SGX Applications

Intel SGX improves the security of applications by shielding code and data from untrusted software in enclaves. Since enclaves lose their state when closed, that state has to be sealed, i.e., cryptographically protected with a secret key, and stored outside the enclave boundary. In SGX, the used key is bound to both the enclave and the processor that sealed the data, so it is unfeasible for any enclave in another computer to derive the same secret key to unseal such data. This offers security to the data, but also makes it impossible to recover that data if the original computer is damaged or stolen. In order to support backup and recovery of data sealed by enclaves, we propose SRX, a solution for sharing sealed data amongst a restricted set of SGX-enabled computers executing the same enclave code. Enclaves using SRX have access to common keys to seal and unseal enclave data, allowing the sharing of sealed data among the trusted domain. SRX guarantees that these secret keys are never exposed outside the trusted domain. SRX was implemented and evaluated with two applications: a bitcoin wallet and a password manager.
Improved Harris Combined With Clustering Algorithm for Data Traffic Classification

Aiming at the problem that the data traffic in the intelligent wireless communication system presents complex characteristics such as burstiness and self-similarity, which leads to the low classification accuracy of the existing classification model for traffic, a data traffic classification method based on improved Harris Eagle algorithm combined with fuzzy C-means clustering is proposed. The method maps traffic samples to Harris Eagle individuals, finds the optimal position through multiple iterations of the algorithm, and uses this as the initial center point of the clustering algorithm to guide data traffic classification. The simulation shows that, compared with the traditional fuzzy clustering method, the clustering method based on the particle swarm algorithm and the gray wolf algorithm, the improved Harris Eagle combined with fuzzy clustering has better intra-class compactness and inter-class separation on the data traffic sample set. Meanwhile, the clustering accuracy and recall rate are both improved to about 90 percent.
Intelligent Digital Human Agent Service With Deep Learning Based-Face Recognition

This study proposes a framework for an intelligent agent information service using digital human and deep learning technology. The framework can recognize the identity of individuals using facial features and provide personalized services through a digital human. The personalized service is defined by a relevance graph based on personal data collected in advance. The proposed system can continuously evolve to recommend customized services using relevance graphs and dynamic data processing, gradually become more intelligent using additionally collected data. Moreover, it uses animation keyframe interpolation for natural and seamless digital human interaction and provides visual effects that are synchronized based on specific information collected for the intuitive service. The proposed system was tested on a school domain for two months, and a statistical domain feedback system based on a mathematical model that predicts service usage per unit time was developed using the recorded information. Additionally, we evaluate our system through user experience surveys.
An efficient verifiable secret redistribution scheme

A verifiable secret redistribution (VSR) scheme is a verifiable secret sharing scheme in which the shareholders can redistribute the secret from an old ( t , n ) -threshold access structure to a new ( t ′ , n ′ ) -threshold access structure without reconstructing the secret and without interacting with the dealer. There exists an important flaw in the previous VSR schemes which has not been addressed by now: During redistributing the secret from an old ( t , n ) -threshold access structure to a new ( t ′ , n ′ ) -threshold access structure, n t − n − t + 1 t restarts of the secret redistribution phase, in the worst case, are required to eliminate faulty shareholders and complete the secret redistribution phase. In this paper, we propose a new VSR scheme using Homogeneous linear recursions (HLR) and prove its security. Our scheme has the following interesting properties: First, it addresses the mentioned flaw of the previous VSR schemes without relaxing the security. Second, it does not have any restart and is more efficient than the previous VSR schemes. Finally, without observing the produced shares and sub-shares, the honesty of the dealer and shareholders can be verified publicly.
AI Support for Accelerating Histopathological Slide Examinations of Prostate Cancer in Clinical Studies

Abstract While studies in pathology are essential for the progress in the diagnostic and prognostic techniques in the field, pathologist time is becoming an increasingly scarce resource, and can indeed become the limiting factor in the feasibility of studies to be performed. In this work, we demonstrate how the Digital Pathology platform by CRS4, for supporting research studies in digital pathology, has been augmented by the addition of AI-based features to accelerate image examination to reduce the pathologist time required for clinical studies. The platform has been extended to provide computationally generated annotations and visual cues to help the pathologist prioritize high-interest image areas. The system includes an image annotation pipeline with DeepHealth-based deep learning models for tissue identification and prostate cancer identification. Annotations are viewed through the platform’s virtual microscope and can be controlled interactively (e.g., thresholding, coloring). Moreover, the platform captures inference provenance information and archives it as RO-Crate artifacts containing data and metadata required for reproducibility. We evaluate the models and the inference pipeline, achieving AUC of 0.986 and 0.969 for tissue and cancer identification, respectively, and verifying linear dependence of execution speed on image tissue content. Finally, we describe the ongoing clinical validation of the contribution, including preliminary results, and discuss feedback from clinical professionals regarding the overall approach.
Cervical cytopathology image refocusing via multi-scale attention features and domain normalization

Cervical cytopathology image refocusing is important for addressing the problem of defocus blur in whole slide images. However, most of current deblurring methods are developed for global motion blur instead of local defocus blur and need a lot of supervised re-training for unseen domains. In this paper, we propose a refocusing method for cervical cytopathology images via multi-scale attention features and domain normalization. Our method consists of a domain normalization net (DNN) and a refocusing net (RFN). In DNN, we adopt registration-free cycle scheme for normalizing the unseen unsupervised domains into the seen supervised domain and introduce gray mask loss and hue-encoding mask loss to ensure the consistency of cell structure and basic hue. In RFN, combining the locality and sparseness characteristics of defocus blur, we design a multi-scale refocusing network to enhance the reconstruction of cell nucleus and cytoplasm, and introduce defocus intensity estimation mask to strengthen the reconstruction of local blur. We integrate hybrid learning strategy on the supervised and unsupervised domains to make RFN achieving well refocusing on the unsupervised domain. We build a cervical cytopathology image refocusing dataset and conduct extensive experiments to demonstrate the superiority of our method compared with current deblurring state-of-the-art models. Furthermore, we prove that the refocused images help improve the performance of subsequent high-level analysis tasks. We release the refocusing dataset and source codes to promote the development of this field.
Information flow in Deep Restricted Boltzmann Machines: An analysis of mutual information between inputs and outputs

Empirical evidence suggests the existence of an entangled relationship between the information flow from inputs features to hidden representations of a deep neural network and its ability to generalize from training samples to unobserved data. For instance, regularization techniques often used to control statistical generalization, are expected to impact this information flow. In this work, we study MI (mutual information) between inputs and representation outputs, and its relationship with various regularization methods commonly used in Restricted Boltzmann Machines (RBM) and their generalizations: Deep Belief Networks and Deep Boltzmann Machines. Our theoretical findings show the existence of fundamental connections between the hyperparameters associated with the regularization and the MI, including relevant practical ingredients such as: network dimension, matrix norms and dropout probability, which are well-known to influence the generalization ability of the network. These results are experimentally corroborated on various visual datasets. Code is avaliable at https://codeocean.com/capsule/3175474/tree .
Application of Digital Information Technology in Book Classification and Quick Search in University Libraries

A digital library is a digital information resource system supported by modern high technology, a next-generation information resource management model on the Internet, and the result of the digitization of library collections, and with the development of society and the accelerated pace of people's lives, people cannot spend too much time classifying and finding books, so the study of book classification and quick finding in university libraries is very important. This paper mainly researches and analyzes the classification and quick search of books in the university library through the algorithms and methods of digital information technology and finds a better algorithm. This paper mainly conducts experiments on automatic text and support vector machine (one-to-many and global optimization) methods and compares the obtained experimental data, such as classification accuracy, classification time, search time, and other data. The experimental results show that the classification accuracy of these three classification methods is in the range of 86%-94%. However, compared with the two methods of automatic text classification and one-to-many classification, the global optimization classification has the highest accuracy in the sample size of each interval. Among them, the classification time is the lowest for automatic text classification, which is less than 30s, and the one-to-many classification sample takes the most time, and their average fitness is in the range of 24%-27%.
Does a Program Yield the Right Distribution?

Abstract We study discrete probabilistic programs with potentially unbounded looping behaviors over an infinite state space. We present, to the best of our knowledge, the first decidability result for the problem of determining whether such a program generates exactly a specified distribution over its outputs (provided the program terminates almost-surely). The class of distributions that can be specified in our formalism consists of standard distributions (geometric, uniform, etc.) and finite convolutions thereof. Our method relies on representing these (possibly infinite-support) distributions as probability generating functions which admit effective arithmetic operations. We have automated our techniques in a tool called $$\textsc {Prodigy}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>P</mml:mi> <mml:mstyle> <mml:mi>R</mml:mi> <mml:mi>O</mml:mi> <mml:mi>D</mml:mi> <mml:mi>I</mml:mi> <mml:mi>G</mml:mi> <mml:mi>Y</mml:mi> </mml:mstyle> </mml:mrow> </mml:math> , which supports automatic invariance checking, compositional reasoning of nested loops, and efficient queries to the output distribution, as demonstrated by experiments.
The Lattice-Theoretic Essence of Property Directed Reachability Analysis

Abstract We present LT-PDR , a lattice-theoretic generalization of Bradley’s property directed reachability analysis (PDR) algorithm. LT-PDR identifies the essence of PDR to be an ingenious combination of verification and refutation attempts based on the Knaster–Tarski and Kleene theorems. We introduce four concrete instances of LT-PDR, derive their implementation from a generic Haskell implementation of LT-PDR, and experimentally evaluate them. We also present a categorical structural theory that derives these instances.
Swipe along

Short videos have recently emerged as a popular form of short-duration User Generated Content (UGC) within modern social media. Short video content is generally less than a minute long and predominantly produced in vertical orientation on smartphones. While still fundamentally being streaming, short video delivery is distinctly characterized by the deployment of a mechanism that pre-loads ahead of user request. Background pre-loading aims to eliminate start-up time, which is now prioritized higher in Quality of Experience (QoE) objectives, given that the application design facilitates instant 'swiping' to the next video in a recommended sequence. In this work, we provide a comprehensive comparison of four popular short video services. In particular, we explore content characteristics and evaluate the video quality across resolutions for each service. We next characterize the pre-loading policy adopted by each service. Last, we conduct an experimental study to investigate data consumption and evaluate achieved QoE under different network scenarios and application configurations.
Virtual visits

Elderly people in care homes face a great lack of contact with their families and loved ones. Social isolation and loneliness are detrimental factors for older people in their health condition, cognitive impairment and quality of life. We previously presented a communication system that facilitated high-quality mediated social contact through an Augmented Reality tool with 3D user capture and rendering on an iPad. We have further enhanced this system and propose a new demonstrator that provides a working communication system between the elderly and family members on a life-size display. A complete end-to-end chain architecture is presented, where capture, transmission, and rendering are enhanced to provide a tool for natural interaction and high social presence. Our system is technically ready and well-adapted to meet the needs of elderly users.
Attention-based advantage actor-critic algorithm with prioritized experience replay for complex 2-D robotic motion planning

Abstract Robotic motion planning in dense and dynamic indoor scenarios constantly challenges the researchers because of the motion unpredictability of obstacles. Recent progress in reinforcement learning enables robots to better cope with the dense and unpredictable obstacles by encoding complex features of the robot and obstacles into the encoders like the long-short term memory (LSTM). Then these features are learned by the robot using reinforcement learning algorithms, such as the deep Q network and asynchronous advantage actor critic algorithm. However, existing methods depend heavily on expert experiences to enhance the convergence speed of the networks by initializing them via imitation learning. Moreover, those approaches based on LSTM to encode the obstacle features are not always efficient and robust enough, therefore sometimes causing the network overfitting in training. This paper focuses on the advantage actor critic algorithm and introduces an attention-based actor critic algorithm with experience replay algorithm to improve the performance of existing algorithm from two perspectives. First, LSTM encoder is replaced by a robust encoder attention weight to better interpret the complex features of the robot and obstacles. Second, the robot learns from its past prioritized experiences to initialize the networks of the advantage actor-critic algorithm. This is achieved by applying the prioritized experience replay method, which makes the best of past useful experiences to improve the convergence speed. As results, the network based on our algorithm takes only around 15% and 30% experiences to get rid of the early-stage training without the expert experiences in cases with five and ten obstacles, respectively. Then it converges faster to a better reward with less experiences (near 45% and 65% of experiences in cases with ten and five obstacles respectively) when comparing with the baseline LSTM-based advantage actor critic algorithm. Our source code is freely available at the GitHub ( https://github.com/CHUENGMINCHOU/AW-PER-A2C ).
Construction Tasks Electronic Process Monitoring: Laboratory Circuit-Based Simulation Deployment

The domain of data processing is essential to accelerate the delivery of information based on electronic performance monitoring (EPM). The classification of the activities conducted by craft workers can enhance the mechanisation and productivity of activities. However, research in this field is mainly based on simulations of binary activities (i.e., performing or not performing an action). To enhance EPM research in this field, a dynamic laboratory circuit-based simulation of ten common constructions activities was performed. A circuit feasibility case study of EPM using wearable devices was conducted, where two different data processing approaches were tested: machine learning and multivariate statistical analysis (MSA). Using the acceleration data of both wrists and the dominant leg, the machine-learning approach achieved an accuracy between 92 and 96%, while MSA achieved 47–76%. Additionally, the MSA approach achieved 32–76% accuracy by monitoring only the dominant wrist. Results highlighted that the processes conducted with manual tools (e.g., hammering and sawing) have prominent dominant-hand motion characteristics that are accurately detected with one wearable. However, free-hand performing (masonry), walking and not operating value (e.g., sitting) require more motion analysis data points, such as wrists and legs.
Dim and Small Target Tracking Using an Improved Particle Filter Based on Adaptive Feature Fusion

Particle filters have been widely used in dim and small target tracking, which plays a significant role in navigation applications. However, their characteristics, such as difficulty of expressing features for dim and small targets and lack of particle diversity caused by resampling, lead to a considerable negative impact on tracking performance. In the present paper, we propose an improved resampling particle filter algorithm based on adaptive multi-feature fusion to address the drawbacks of particle filters for dim and small target tracking and improve the tracking performance. We first establish an observation model based on the adaptive fusion of the features of the weighted grayscale intensity, edge information, and wavelet transform. We then generate new particles based on residual resampling by combining the target position in the previous frame and the particles in the current frame with higher weights, with the tracking accuracy and particle diversity improving simultaneously. The experimental results demonstrate that our proposed method achieves a high tracking performance with a distance accuracy of 77.2% and a running speed of 106 fps, respectively, meaning that it will have a promising prospect in dim and small target tracking applications.
Image Denoising Based on GAN with Optimization Algorithm

Image denoising has been a knotty issue in the computer vision field, although the developing deep learning technology has brought remarkable improvements in image denoising. Denoising networks based on deep learning technology still face some problems, such as in their accuracy and robustness. This paper constructs a robust denoising network based on a generative adversarial network (GAN). Since the neural network has the phenomena of gradient dispersion and feature disappearance, the global residual is added to the autoencoder in the generator network, to extract and learn the features of the input image, so as to ensure the stability of the network. On this basis, we proposed an optimization algorithm (OA), to train and optimize the mean and variance of noise on each node of the generator. Then the robustness of the denoising network was improved through back propagation. Experimental results showed that the model’s denoising effect is remarkable. The accuracy of the proposed model was over 99% in the MNIST data set and over 90% in the CIFAR10 data set. The peak signal to noise ratio (PSNR) and structural similarity (SSIM) values of the proposed model were better than the state-of-the-art models in the BDS500 data set. Moreover, an anti-interference test of the model showed that the defense capacities of both the fast gradient sign method (FGSM) and project gradient descent (PGD) attacks were significantly improved, with PSNR and SSIM values decreased by less than 2%.
A Reinforcement Learning-Based Routing for Real-Time Multimedia Traffic Transmission over Software-Defined Networking

Recently, video streaming services consumption has grown massively and is foreseen to increase even more in the future. The tremendous traffic usage has negatively impacted the network’s quality of service due to network congestion and end-to-end customers’ satisfaction represented by the quality of experience, especially during evening peak hours. This paper introduces an intelligent multimedia framework that aims to optimise the network’s quality of service and users’ quality of experience by taking into account the integration of Software-Defined Networking and Reinforcement Learning, which enables exploring, learning, and exploiting potential paths for video streaming flows. Moreover, an objective study was conducted to assess video streaming for various realistic network environments and under low and high traffic loads to obtain two quality of experience metrics; video multimethod assessment fusion and structural similarity index measure. The experimental results validate the effectiveness of the proposed solution strategy, which demonstrated better viewing quality by achieving better customers’ quality of experience, higher throughput and lower data loss compared with the currently existing solutions.