Reviewerly/exHarmony huggingface dataset:
Toward Cross-Domain Dynamic Accumulator Authentication Based on Blockchain in Internet of Things

The authentication problem is one of the most significant challenges in the applications of Internet of Things (IoT), and the relationship authentication among smart devices is an effective solution to tackle cross-domain issue. In this article, we first abstract a general undirected graph from the authentication relationship among the smart devices in IoT. Then, we formulate the authentication problem into a signature transitivity problem by incorporating accumulator knowledge and a standard digital signature scheme. As a consequence, the legality of authentication is well-verified by computing the signature and witness of the related edges without worrying about whether the devices belong to the same administrative domain or not. Finally, the efficiency and online time of authority are solved by exploring the blockchain technology, which also leads to the assurance of an online 24-hour third party. The results of analysis and comparison show that the proposed scheme CroDA can well address the practical authentication issue.
Theoretical study of early-time superradiance for atom clouds and arrays

We explore conditions for Dicke superradiance in a cloud of atoms by examining the Taylor series expansion of the photon emission rate at $t= 0$. By defining superradiance as an increasing photon emission rate for $t\sim 0$, we have calculated the conditions for superradiance for a variety of cases. We investigate superradiance as defined for photon emission into all angles as well as directional superradiance where the photon emission is only detected in a particular direction. Although all of the examples are for two level atoms that are fully inverted at $t=0$, we also give equations for partially inverted two level atoms and for fully inverted multilevel atoms. We give an algorithm for efficiently evaluating these equations for atom arrays and determine superradiance conditions for large atom number.
Screen-Shooting Resilient Watermarking Scheme via Learned Invariant Keypoints and QT

This paper proposes a screen-shooting resilient watermarking scheme via learned invariant keypoints and QT; that is, if the watermarked image is displayed on the screen and captured by a camera, the watermark can be still extracted from the photo. A screen-shooting resilient watermarking algorithm should meet the following two basic requirements: robust keypoints and a robust watermark algorithm. In our case, we embedded watermarks by combining the feature region filtering model to SuperPoint (FRFS) neural networks, quaternion discrete Fourier transform (QDFT), and tensor decomposition (TD). First we applied FRFS to locate the embedding feature regions which are decided by the keypoints that survive screen-shooting. Second, we structured watermark embedding regions centered at keypoints. Third, the watermarks were embedded by the QDFT and TD (QT) algorithm, which is robust for capturing process attacks. In a partial shooting scenario, the watermark is repeatedly embedded into different regions in an image to enhance robustness. Finally, we extracted the watermarks from at least one region at the extraction stage. The experimental results showed that the proposed scheme is very robust for camera shooting (including partial shooting) different shooting scenarios, and special attacks. Moreover, the efficient mechanism of screen-shooting resilient watermarking could have propietary protection and leak tracing applications.
Fast Light-field Disparity Estimation with Multi-disparity-scale Cost Aggregation

Light field images contain both angular and spatial information of captured light rays. The rich information of light fields enables straightforward disparity recovery capability but demands high computational cost as well. In this paper, we design a lightweight disparity estimation model with physical-based multi-disparity-scale cost volume aggregation for fast disparity estimation. By introducing a sub-network of edge guidance, we significantly improve the recovery of geometric details near edges and improve the overall performance. We test the proposed model extensively on both synthetic and real-captured datasets, which provide both densely and sparsely sampled light fields. Finally, we significantly reduce computation cost and GPU memory consumption, while achieving comparable performance with state-of-the-art disparity estimation methods for light fields. Our source code is available at https://github.com/zcong17huang/FastLFnet.
An E-Commerce Recommendation System Based on Dynamic Analysis of Customer Behavior

The technological development in the devices and services provided via the Internet and the availability of modern devices and their advanced applications, for most people, have led to an increase in the expansion and a trend towards electronic commerce. The large number and variety of goods offered on e-commerce websites sometimes make the customers feel overwhelmed and sometimes make it difficult to find the right product. These factors increase the amount of competition between global commercial sites, which increases the need to work efficiently to increase financial profits. The recommendation systems aim to improve the e-commerce systems performance by facilitating the customers to find the appropriate products according to their preferences. There are lots of recommendation system algorithms that are implemented for this purpose. However, most of these algorithms suffer from several problems, including: cold start, sparsity of user-item matrix, scalability, and changes in user interest. This paper aims to develop a recommendation system to solve the problems mentioned before and to achieve high realistic prediction results this is done by building the system based on the customers’ behavior and cooperating with the statistical analysis to support decision making, to be employed on an e-commerce site and increasing its performance. The project contribution can be shown by the experimental results using precision, recall, F-function, mean absolute error (MAE), and root mean square error (RMSE) metrics, which are used to evaluate system performance. The experimental results showed that using statistical methods improves the decision-making that is employed to increase the accuracy of recommendation lists suggested to the customers.
Semantic Segmentation With Light Field Imaging and Convolutional Neural Networks

Semantic segmentation is of great importance and a challenge in computer vision. One of its main problems is how to efficiently obtain rich information (geometric structure) and identify useful features from higher dimensions. A light field camera, due to its special microlens array structure, can completely record the angular-spatial information of scenes, which is attractive and has great potential to improve the performance of semantic segmentation task. Inspired by this, we propose an end-to-end semantic segmentation network that can process light field macro-pixel image robustly and extract its features. In addition, this network can flexibly and efficiently load the different popular deep learning backbones. Furthermore, we propose an efficient angular model, which to learn the angular features between the different viewpoints of the macro-pixel image, improve the nonlinearity of angular-spatial features and enhance multichannel semantic correlations. To evaluate the network, we construct a new real scene light field dataset comprising 800 high-quality samples. The quantitative and qualitative results show that the highest mean intersection over union (mIoU) based of our algorithm is greater than 57.00%. Our algorithm achieves a 10.30% increase compared with state-of-the-art semantic segmentation algorithms. In combination with different backbones or multi-scale light field macro-pixel images, the network can also achieve comparable results. This preliminary work demonstrates that the combination of light field imaging and deep learning technology has potential applications in the future study of semantic segmentation.
RSDet++: Point-Based Modulated Loss for More Accurate Rotated Object Detection

We classify the discontinuity of loss in both five-param and eight-param rotated object detection methods as rotation sensitivity error (RSE) which will result in performance degeneration. We introduce a novel modulated rotation loss to alleviate the problem and a rotation sensitivity detection network (RSDet) which consists of an eight-param single-stage rotated object detector and the modulated rotation loss. Our proposed RSDet has several advantages: 1) it reformulates the rotated object detection problem as predicting the corners of objects while most previous methods employ a five-param-based regression method with different measurement units. 2) modulated rotation loss achieves consistent improvement on both five-param and eight-param rotated object detection methods by solving the discontinuity of loss. To further improve the accuracy of our method on objects smaller than 10 pixels, we introduce a novel RSDet++ which consists of a point-based anchor-free rotated object detector and a modulated rotation loss. Extensive experiments demonstrate the effectiveness of both RSDet and RSDet++, which achieve competitive results on rotated object detection in the challenging benchmarks DOTA-v1.0, DOTA-v1.5, and DOTA-v2.0. We hope the proposed method can provide a new perspective for designing algorithms to solve rotated object detection and pay more attention to tiny objects. The codes and models are available at: <uri xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/yangxue0827/RotationDetection</uri> .
Are cluster validity measures (in) valid?

Internal cluster validity measures (such as the Calinski-Harabasz, Dunn, or Davies-Bouldin indices) are frequently used for selecting the appropriate number of partitions a dataset should be split into. In this paper we consider what happens if we treat such indices as objective functions in unsupervised learning activities. Is the optimal grouping with regards to, say, the Silhouette index really meaningful? It turns out that many cluster (in)validity indices promote clusterings that match expert knowledge quite poorly. We also introduce a new, well-performing variant of the Dunn index that is built upon OWA operators and the near-neighbour graph so that subspaces of higher density, regardless of their shapes, can be separated from each other better.
Inductive Learning on Commonsense Knowledge Graph Completion

Commonsense knowledge graph (CKG) is a special type of knowledge graph (KG), where entities are composed of free-form text. Existing CKG completion methods focus on transductive learning setting, where all the entities are present during training. Here, we propose the first inductive learning setting for CKG completion, where unseen entities may appear at test time. We emphasize that the inductive learning setting is crucial for CKGs, because unseen entities are frequently introduced due to the fact that CKGs are dynamic and highly sparse. We propose InductivE as the first framework targeted at the inductive CKG completion task. InductivE first ensures the inductive learning capability by directly computing entity embeddings from raw entity attributes. Second, a graph neural network with novel densification process is proposed to further enhance unseen entity representation with neighboring structural information. Experimental results show that InductivE performs especially well on inductive scenarios where it achieves above 48% improvement over previous methods while also outperforms state-of-the-art baselines in transductive settings.
Single and multiple drones detection and identification using RF based deep learning algorithm

Unmanned aerial systems, especially drones have gone through remarkable improvement and expansion in recent years. Drones have been widely utilized in many applications and scenarios, due to their low price and ease of use. However, in some applications drones can pose a malicious threat. To diminish risks to public security and personal privacy, it is necessary to deploy an effective and affordable anti-drone system in sensitive areas to detect, localize, identify, and defend against intruding malicious drones. This research article presents a new publicly available radio frequency drone dataset and investigates detection and identification methodologies to detect single or multiple drones and identify a single detected drone's type. Moreover, special attention in this paper has been underlined to examine the possibility of using deep learning algorithms, particularly fully connected deep neural networks as an anti-drone solution within two different radio frequency bands. We proposed a supervised deep learning algorithm with fully-connected deep neural network models that use raw drone signals rather than features. Regarding the research results, the proposed algorithm shows a lot of potentials. The probability of detecting a single drone is 99.8%, and the probability of type identification is 96.1%. Moreover, the results of multiple drones detection demonstrate an average accuracy of 97.3%. There have not been such comprehensive publications, to this time, in the open literature that have presented and enlightened the problem of multiple drones detection in the radio frequency domain.
Mining High Utility Itemsets with Hill Climbing and Simulated Annealing

High utility itemset mining (HUIM) is the task of finding all items set, purchased together, that generate a high profit in a transaction database. In the past, several algorithms have been developed to mine high utility itemsets (HUIs). However, most of them cannot properly handle the exponential search space while finding HUIs when the size of the database and total number of items increases. Recently, evolutionary and heuristic algorithms were designed to mine HUIs, which provided considerable performance improvement. However, they can still have a long runtime and some may miss many HUIs. To address this problem, this article proposes two algorithms for HUIM based on Hill Climbing (HUIM-HC) and Simulated Annealing (HUIM-SA). Both algorithms transform the input database into a bitmap for efficient utility computation and for search space pruning. To improve population diversity, HUIs discovered by evolution are used as target values for the next population instead of keeping the current optimal values in the next population. Through experiments on real-life datasets, it was found that the proposed algorithms are faster than state-of-the-art heuristic and evolutionary HUIM algorithms, that HUIM-SA discovers similar HUIs, and that HUIM-SA evolves linearly with the number of iterations.
Automated detection and staging of malaria parasites from cytological smears using convolutional neural networks

Microscopic examination of blood smears remains the gold standard for laboratory inspection and diagnosis of malaria. Smear inspection is, however, time-consuming and dependent on trained microscopists with results varying in accuracy. We sought to develop an automated image analysis method to improve accuracy and standardization of smear inspection that retains capacity for expert confirmation and image archiving. Here, we present a machine learning method that achieves red blood cell (RBC) detection, differentiation between infected/uninfected cells, and parasite life stage categorization from unprocessed, heterogeneous smear images. Based on a pretrained Faster Region-Based Convolutional Neural Networks (R-CNN) model for RBC detection, our model performs accurately, with an average precision of 0.99 at an intersection-over-union threshold of 0.5. Application of a residual neural network-50 model to infected cells also performs accurately, with an area under the receiver operating characteristic curve of 0.98. Finally, combining our method with a regression model successfully recapitulates intraerythrocytic developmental cycle with accurate lifecycle stage categorization. Combined with a mobile-friendly web-based interface, called PlasmoCount, our method permits rapid navigation through and review of results for quality assurance. By standardizing assessment of Giemsa smears, our method markedly improves inspection reproducibility and presents a realistic route to both routine lab and future field-based automated malaria diagnosis.
Dual-decoder graph autoencoder for unsupervised graph representation learning

Unsupervised graph representation learning is a challenging task that embeds graph data into a low-dimensional space without label guidance. Recently, graph autoencoders have been proven to be an effective way to solve this problem in some attributed networks. However, most existing graph autoencoder-based embedding algorithms only reconstruct the feature maps of nodes or the affinity matrix but do not fully leverage the latent information encoded in the low-dimensional representation. In this study, we propose a dual-decoder graph autoencoder model for attributed graph embedding. The proposed framework embeds the graph topological structure and node attributes into a compact representation, and then the two decoders are trained to reconstruct the node attributes and graph structures simultaneously. The experimental results on clustering and link prediction tasks strongly support the conclusion that the proposed model outperforms the state-of-the-art approaches.
Blockchain-Based Decentralized Digital Manufacturing and Supply for COVID-19 Medical Devices and Supplies

Coronavirus 2019 (COVID-19) has disclosed the deficiencies and limitations of the existing manufacturing and supply chain systems used for medical devices and supplies.It enforces the necessity to accelerate the shift towards decentralized digital manufacturing and supply chain networks.This paper proposes a blockchain-based solution for decentralized digital manufacturing of medical devices and their supply.We develop Ethereum smart contracts to govern and track transactions in a decentralized, transparent, traceable, auditable, trustworthy, and secure manner.This allows overcoming certain issues hindering the transition towards decentralized digital manufacturing and supply, including trusted traceability, attestations, certifications, and secured intellectual property (IP) rights.We incorporate the decentralized storage of the InterPlanetary file system (IPFS) into the Ethereum blockchain to store and fetch Internet of things (IoT)-based devices records and additional manufacturing and supply details.We present the system architecture and algorithms along with their full implementation and testing details.Furthermore, we present cost and security analyses to show that the proposed solution is cost-efficient and resilient against well-known vulnerabilities and security attacks.We make our smart contracts code publicly available on GitHub.
Lessons Learned from a Human-Centered Design of an Immersive Exergame for People with Dementia

Cognitive-physical exercises can reduce the progression of dementia. However, traditional methods often induce problems (e.g., lack of motivation), whereas the success of recent virtual reality (VR) exergames such as Beat Saber may provide a playful, motivational, and immersive alternative. Yet, until now, it remains unclear which game mechanics, concepts, and designs work best for people with dementia, and how to implement exergames for and with this user group. In this paper, we adapted a human-centered design approach to address the specifics of developing VR exergames for people with dementia. This includes semi-structured interviews with stakeholders and contextual inquiries to better analyze the user requirements. Based on our analysis, we present Memory Journalist VR - a novel VR exergame specifically designed for people with dementia in a participatory design process. We report the qualitative evaluation based on the feedback gathered in five focus group sessions. Finally, we discuss the lessons learned, which provide important insights for the design of future VR exergames for people with dementia: (i) creating social gaming activities with a focus on shared aspects, (ii) support of an inverse game flow channel addressing decline and variance in cognitive-physical abilities, and (iii) ensuring a safe VR exergame experience.
GeoConv: Geodesic guided convolution for facial action unit recognition

Automatic facial action unit (AU) recognition has attracted great attention but still remains a challenging task, as subtle changes of local facial muscles are difficult to thoroughly capture. Most existing AU recognition approaches leverage geometry information in a straightforward 2D or 3D manner, which either ignore 3D manifold information or suffer from high computational costs. In this paper, we propose a novel geodesic guided convolution (GeoConv) for AU recognition by embedding 3D manifold information into 2D convolutions. Specifically, the kernel of GeoConv is weighted by our introduced geodesic weights, which are negatively correlated to geodesic distances on a coarsely reconstructed 3D morphable face model. Moreover, based on GeoConv, we further develop an end-to-end trainable framework named GeoCNN for AU recognition. Extensive experiments on BP4D and DISFA benchmarks show that our approach significantly outperforms the state-of-the-art AU recognition methods.
Learning Hierarchical Graph Neural Networks for Image Clustering

We propose a hierarchical graph neural network (GNN) model that learns how to cluster a set of images into an unknown number of identities using a training set of images annotated with labels belonging to a disjoint set of identities. Our hierarchical GNN uses a novel approach to merge connected components predicted at each level of the hierarchy to form a new graph at the next level. Unlike fully unsupervised hierarchical clustering, the choice of grouping and complexity criteria stems naturally from supervision in the training set. The resulting method, Hi-LANDER, achieves an average of 49% improvement in F-score and 7% increase in Normalized Mutual Information (NMI) relative to current GNN-based clustering algorithms. Additionally, state-of-the-art GNN-based methods rely on separate models to predict linkage probabilities and node densities as intermediate steps of the clustering process. In contrast, our unified framework achieves a three-fold decrease in computational cost. Our training and inference code are released <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup> .