Entropy

Visual sorting of express packages is faced with many problems such as the various types, complex status, and the changeable detection environment, resulting in low sorting efficiency. In order to improve the sorting efficiency of packages under complex logistics sorting, a multi-dimensional fusion method (MDFM) for visual sorting in actual complex scenes is proposed. In MDFM, the Mask R-CNN is designed and applied to detect and recognize different kinds of express packages in complex scenes. Combined with the boundary information of 2D instance segmentation from Mask R-CNN, the 3D point cloud data of grasping surface is accurately filtered and fitted to determining the optimal grasping position and sorting vector. The images of box, bag, and envelope, which are the most common types of express packages in logistics transportation, are collected and the dataset is made. The experiments with Mask R-CNN and robot sorting were carried out. The results show that Mask R-CNN achieves better results in object detection and instance segmentation on the express packages, and the robot sorting success rate by the MDFM reaches 97.2%, improving 2.9, 7.5, and 8.0 percentage points, respectively, compared to baseline methods. The MDFM is suitable for complex and diverse actual logistics sorting scenes, and improves the efficiency of logistics sorting, which has great application value. Full article

How to learn the embedding vectors of nodes in unsupervised large-scale heterogeneous networks is a key problem in heterogeneous network embedding research. This paper proposes an unsupervised embedding learning model, named LHGI (Large-scale Heterogeneous Graph Infomax). LHGI adopts the subgraph sampling technology under the guidance of metapaths, which can compress the network and retain the semantic information in the network as much as possible. At the same time, LHGI adopts the idea of contrastive learning, and takes the mutual information between normal/negative node vectors and the global graph vector as the objective function to guide the learning process. By maximizing the mutual information, LHGI solves the problem of how to train the network without supervised information. The experimental results show that, compared with the baseline models, the LHGI model shows a better feature extraction capability both in medium-scale unsupervised heterogeneous networks and in large-scale unsupervised heterogeneous networks. The node vectors generated by the LHGI model achieve better performance in the downstream mining tasks. Full article

Dual-phase high entropy alloys have recently attracted widespread attention as advanced structural materials due to their unique microstructure, excellent mechanical properties, and corrosion resistance. However, their molten salt corrosion behavior has not been reported, which is critical in evaluating their application merit in the areas of concentrating solar power and nuclear energy. Here, the molten salt corrosion behavior of AlCoCrFeNi_2.1 eutectic high-entropy alloy (EHEA) was evaluated in molten NaCl-KCl-MgCl₂ salt at 450 °C and 650 °C in comparison to conventional duplex stainless steel 2205 (DS2205). The EHEA showed a significantly lower corrosion rate of ~1 mm/year at 450 °C compared to ~8 mm/year for DS2205. Similarly, EHEA showed a lower corrosion rate of ~9 mm/year at 650 °C compared to ~20 mm/year for DS2205. There was selective dissolution of the body-centered cubic phase in both the alloys, B2 in AlCoCrFeNi_2.1 and α-Ferrite in DS2205. This was attributed to micro-galvanic coupling between the two phases in each alloy that was measured in terms of Volta potential difference using a scanning kelvin probe. Additionally, the work function increased with increasing temperature for AlCoCrFeNi_2.1, indicating that the FCC-L1₂ phase acted as a barrier against further oxidation and protected the underlying BCC-B2 phase with enrichment of noble elements in the protective surface layer. Full article

Models of dynamical wave function collapse consistently describe the breakdown of the quantum superposition with the growing mass of the system by introducing non-linear and stochastic modifications to the standard Schrödinger dynamics. Among them, Continuous Spontaneous Localization (CSL) was extensively investigated both theoretically and experimentally. Measurable consequences of the collapse phenomenon depend on different combinations of the phenomenological parameters of the model—the strength $\lambda$ and the correlation length $r_C$—and have led, so far, to the exclusion of regions of the admissible ($\lambda -r_C$) parameters space. We developed a novel approach to disentangle the $\lambda$ and $r_C$ probability density functions, which discloses a more profound statistical insight. Full article

Currently, the most widely used protocol for the transportation layer of computer networks for reliable transportation is the Transmission Control Protocol (TCP). However, TCP has some problems such as high handshake delay, head-of-line (HOL) blocking, and so on. To solve these problems, Google proposed the Quick User Datagram Protocol Internet Connection (QUIC) protocol, which supports 0-1 round-trip time (RTT) handshake, a congestion control algorithm configuration in user mode. So far, the QUIC protocol has been integrated with traditional congestion control algorithms, which are not efficient in numerous scenarios. To solve this problem, we propose an efficient congestion control mechanism on the basis of deep reinforcement learning (DRL), i.e., proximal bandwidth-delay quick optimization (PBQ) for QUIC, which combines traditional bottleneck bandwidth and round-trip propagation time (BBR) with proximal policy optimization (PPO). In PBQ, the PPO agent outputs the congestion window (CWnd) and improves itself according to network state, and the BBR specifies the pacing rate of the client. Then, we apply the presented PBQ to QUIC and form a new version of QUIC, i.e., PBQ-enhanced QUIC. The experimental results show that the proposed PBQ-enhanced QUIC achieves much better performance in both throughput and RTT than existing popular versions of QUIC, such as QUIC with Cubic and QUIC with BBR. Full article

We introduce a refined way to diffusely explore complex networks with stochastic resetting where the resetting site is derived from node centrality measures. This approach differs from previous ones, since it not only allows the random walker with a certain probability to jump from the current node to a deliberately chosen resetting node, rather it enables the walker to jump to the node that can reach all other nodes faster. Following this strategy, we consider the resetting site to be the geometric center, the node that minimizes the average travel time to all the other nodes. Using the established Markov chain theory, we calculate the Global Mean First Passage Time (GMFPT) to determine the search performance of the random walk with resetting for different resetting node candidates individually. Furthermore, we compare which nodes are better resetting node sites by comparing the GMFPT for each node. We study this approach for different topologies of generic and real-life networks. We show that, for directed networks extracted for real-life relationships, this centrality focused resetting can improve the search to a greater extent than for the generated undirected networks. This resetting to the center advocated here can minimize the average travel time to all other nodes in real networks as well. We also present a relationship between the longest shortest path (the diameter), the average node degree and the GMFPT when the starting node is the center. We show that, for undirected scale-free networks, stochastic resetting is effective only for networks that are extremely sparse with tree-like structures as they have larger diameters and smaller average node degrees. For directed networks, the resetting is beneficial even for networks that have loops. The numerical results are confirmed by analytic solutions. Our study demonstrates that the proposed random walk approach with resetting based on centrality measures reduces the memoryless search time for targets in the examined network topologies. Full article

Constitutive relations are fundamental and essential to characterize physical systems. By utilizing the $\kappa$-deformed functions, some constitutive relations are generalized. We here show some applications of the Kaniadakis distributions, based on the inverse hyperbolic sine function, to some topics belonging to the realm of statistical physics and natural science. Full article

In this study, learning pathways are modelled by networks constructed from the log data of student–LMS interactions. These networks capture the sequence of reviewing the learning materials by the students enrolled in a given course. In previous research, the networks of successful students showed a fractal property; meanwhile, the networks of students who failed showed an exponential pattern. This research aims to provide empirical evidence that students’ learning pathways have the properties of emergence and non-additivity from a macro level; meanwhile, equifinality (same end of learning process but different learning pathways) is presented at a micro level. Furthermore, the learning pathways of 422 students enrolled in a blended course are classified according to learning performance. These individual learning pathways are modelled by networks from which the relevant learning activities (nodes) are extracted in a sequence by a fractal-based method. The fractal method reduces the number of nodes to be considered relevant. A deep learning network classifies these sequences of each student into passed or failed. The results show that the accuracy of the prediction of the learning performance was 94%, the area under the receiver operating characteristic curve was 97%, and the Matthews correlation was 88%, showing that deep learning networks can model equifinality in complex systems. Full article

Based on the perspective of the innovation value chain, sci-tech innovation is divided into two stages: R&D and achievement transformation. This paper uses panel data from 25 provinces in China as the sample. We utilize a two-way fixed effect model, spatial Dubin model, and panel threshold model to discuss the impact of two-stage innovation efficiency on the value of the green brand, the spatial effect of this impact, and the threshold role of intellectual property protection in the process. The results indicate that: (1) the two stages of innovation efficiency have a positive impact on the value of green brands, and the effect of the eastern region is significantly better than that of the central and western regions. (2) The spatial spillover effect of the two stages of regional innovation efficiency on the value of green brands is evident, especially in the eastern region. (3) The innovation value chain has a pronounced spillover effect. (4) The single threshold effect of intellectual property protection is significant. When the threshold is crossed, the positive impact of the two stages of innovation efficiency on the value of green brands is significantly enhanced. (5) The influence of economic development level, openness, market size, and marketization degree on the value of green brands shows remarkable regional differences. In conclusion, this study contributes to understanding green brands’ growth and provides important implications for developing independent brands in various regions of China. Full article

Over recent years, there are an increasing number of incidents in which archival images have been ripped. Leak tracking is one of the key problems for anti-screenshot digital watermarking of archival images. Most of the existing algorithms suffer from low detection rate of watermark, because the archival images have a single texture. In this paper, we propose an anti-screenshot watermarking algorithm for archival images based on Deep Learning Model (DLM). At present, screenshot image watermarking algorithms based on DLM can resist screenshot attacks. However, if these algorithms are applied on archival images, the bit error rate (BER) of the image watermark will increase dramatically. Archival images are ubiquitous, so in order to improve the robustness of archival image anti-screenshot, we propose a screenshot DLM “ScreenNet”. It aims to enhance the background and enrich the texture with style transfer. Firstly, a preprocessing process based on style transfer is added before the insertion of an archival image into the encoder to reduce the influence of the screenshot process of the cover image. Secondly, the ripped images are usually moiréd, so we generate a database of ripped archival images with moiréd by means of moiréd networks. Finally, the watermark information is encoded/decoded through the improved ScreenNet model using the ripped archive database as the noise layer. The experiments prove that the proposed algorithm is able to resist anti-screenshot attacks and achieves the ability to detect watermark information to leak the trace of ripped images. Full article

Despite its undeniable success, classical machine learning remains a resource-intensive process. Practical computational efforts for training state-of-the-art models can now only be handled by high speed computer hardware. As this trend is expected to continue, it should come as no surprise that an increasing number of machine learning researchers are investigating the possible advantages of quantum computing. The scientific literature on Quantum Machine Learning is now enormous, and a review of its current state that can be comprehended without a physics background is necessary. The objective of this study is to present a review of Quantum Machine Learning from the perspective of conventional techniques. Departing from giving a research path from fundamental quantum theory through Quantum Machine Learning algorithms from a computer scientist’s perspective, we discuss a set of basic algorithms for Quantum Machine Learning, which are the fundamental components for Quantum Machine Learning algorithms. We implement the Quanvolutional Neural Networks (QNNs) on a quantum computer to recognize handwritten digits, and compare its performance to that of its classical counterpart, the Convolutional Neural Networks (CNNs). Additionally, we implement the QSVM on the breast cancer dataset and compare it to the classical SVM. Finally, we implement the Variational Quantum Classifier (VQC) and many classical classifiers on the Iris dataset to compare their accuracies. Full article

With the increase in cloud users and internet of things (IoT) applications, advanced task scheduling (TS) methods are required to reasonably schedule tasks in cloud computing. This study proposes a diversity-aware marine predators algorithm (DAMPA) for solving TS in cloud computing. In DAMPA, to enhance the premature convergence avoidance ability, the predator crowding degree ranking and comprehensive learning strategies were adopted in the second stage to maintain the population diversity and thereby inhibit premature convergence. Additionally, a stage-independent control of the stepsize-scaling strategy that uses different control parameters in three stages was designed to balance the exploration and exploitation abilities. Two case experiments were conducted to evaluate the proposed algorithm. Compared with the latest algorithm, in the first case, DAMPA reduced the makespan and energy consumption by 21.06% and 23.47% at most, respectively. In the second case, the makespan and energy consumption are reduced by 34.35% and 38.60% on average, respectively. Meanwhile, the algorithm achieved greater throughput in both cases. Full article

This paper presents a method for the transparent, robust, and highly capacitive watermarking of video signals using an information mapper. The proposed architecture is based on the use of deep neural networks to embed the watermark in the luminance channel in the YUV color space. An information mapper was used to enable the transformation of a multi-bit binary signature of varying capacitance reflecting the entropy measure of the system into a watermark embedded in the signal frame. To confirm the effectiveness of the method, tests were carried out for video frames with a resolution of 256 × 256 pixels, with a watermark capacity of 4 to 16,384 bits. Transparency metrics (SSIM and PSNR) and a robustness metric—the bit error rate (BER)—were used to assess the performance of the algorithms. Full article

A methodological study of triplet structures in quantum matter is presented. The focus is on helium-3 under supercritical conditions (4 < T/K < 9; 0.022 < _ρNÅ^-3 < 0.028), for which strong quantum diffraction effects dominate the behavior. Computational results for the triplet instantaneous structures are reported. Path integral Monte Carlo (PIMC) and several closures are utilized to obtain structure information in the real and the Fourier spaces. PIMC involves the fourth-order propagator and the SAPT2 pair interaction potential. The main triplet closures are: AV3, built as the average of the Kirkwood superposition and the Jackson–Feenberg convolution, and the Barrat–Hansen–Pastore variational approach. The results illustrate the main characteristics of the procedures employed by concentrating on the salient equilateral and isosceles features of the computed structures. Finally, the valuable interpretive role of closures in the triplet context is highlighted. Full article

Machine learning as a service (MLaaS) plays an essential role in the current ecosystem. Enterprises do not need to train models by themselves separately. Instead, they can use well-trained models provided by MLaaS to support business activities. However, such an ecosystem could be threatened by model extraction attacks—an attacker steals the functionality of a trained model provided by MLaaS and builds a substitute model locally. In this paper, we proposed a model extraction method with low query costs and high accuracy. In particular, we use pre-trained models and task-relevant data to decrease the size of query data. We use instance selection to reduce query samples. In addition, we divided query data into two categories, namely low-confidence data and high-confidence data, to reduce the budget and improve accuracy. We then conducted attacks on two models provided by Microsoft Azure as our experiments. The results show that our scheme achieves high accuracy at low cost, with the substitution models achieving 96.10% and 95.24% substitution while querying only 7.32% and 5.30% of their training data on the two models, respectively. This new attack approach creates additional security challenges for models deployed on cloud platforms. It raises the need for novel mitigation strategies to secure the models. In future work, generative adversarial networks and model inversion attacks can be used to generate more diverse data to be applied to the attacks. Full article

Distribution Entropy (DistEn) has been introduced as an alternative to Sample Entropy (SampEn) to assess the heart rate variability (HRV) on much shorter series without the arbitrary definition of distance thresholds. However, DistEn, considered a measure of cardiovascular complexity, differs substantially from SampEn or Fuzzy Entropy (FuzzyEn), both measures of HRV randomness. This work aims to compare DistEn, SampEn, and FuzzyEn analyzing postural changes (expected to modify the HRV randomness through a sympatho/vagal shift without affecting the cardiovascular complexity) and low-level spinal cord injuries (SCI, whose impaired integrative regulation may alter the system complexity without affecting the HRV spectrum). We recorded RR intervals in able-bodied (AB) and SCI participants in supine and sitting postures, evaluating DistEn, SampEn, and FuzzyEn over 512 beats. The significance of “case” (AB vs. SCI) and “posture” (supine vs. sitting) was assessed by longitudinal analysis. Multiscale DistEn (mDE), SampEn (mSE), and FuzzyEn (mFE) compared postures and cases at each scale between 2 and 20 beats. Unlike SampEn and FuzzyEn, DistEn is affected by the spinal lesion but not by the postural sympatho/vagal shift. The multiscale approach shows differences between AB and SCI sitting participants at the largest mFE scales and between postures in AB participants at the shortest mSE scales. Thus, our results support the hypothesis that DistEn measures cardiovascular complexity while SampEn/FuzzyEn measure HRV randomness, highlighting that together these methods integrate the information each of them provides. Full article

A violation of Bell-CHSH inequalities does not justify speculations about quantum non-locality, conspiracy and retro-causation. Such speculations are rooted in a belief that setting dependence of hidden variables in a probabilistic model (called a violation of measurement independence (MI)) would mean a violation of experimenters’ freedom of choice. This belief is unfounded because it is based on a questionable use of Bayes Theorem and on incorrect causal interpretation of conditional probabilities. In Bell-local realistic model, hidden variables describe only photonic beams created by a source, thus they cannot depend on randomly chosen experimental settings. However, if hidden variables describing measuring instruments are correctly incorporated into a contextual probabilistic model a violation of inequalities and an apparent violation of no-signaling reported in Bell tests can be explained without evoking quantum non-locality. Therefore, for us, a violation of Bell-CHSH inequalities proves only that hidden variables have to depend on settings confirming contextual character of quantum observables and an active role played by measuring instruments. Bell thought that he had to choose between non-locality and the violation of experimenters’ freedom of choice. From two bad choices he chose non-locality. Today he would probably choose the violation of MI understood as contextuality. Full article