Entropy (Basel, Switzerland)最新文献

{"title":"Spatiotemporal Transformer Neural Network for Time-Series Forecasting.","authors":"Yujie You,&nbsp;Le Zhang,&nbsp;Peng Tao,&nbsp;Suran Liu,&nbsp;Luonan Chen","doi":"10.3390/e24111651","DOIUrl":"https://doi.org/10.3390/e24111651","url":null,"abstract":"<p><p>Predicting high-dimensional short-term time-series is a difficult task due to the lack of sufficient information and the curse of dimensionality. To overcome these problems, this study proposes a novel spatiotemporal transformer neural network (STNN) for efficient prediction of short-term time-series with three major features. Firstly, the STNN can accurately and robustly predict a high-dimensional short-term time-series in a multi-step-ahead manner by exploiting high-dimensional/spatial information based on the spatiotemporal information (STI) transformation equation. Secondly, the continuous attention mechanism makes the prediction results more accurate than those of previous studies. Thirdly, we developed continuous spatial self-attention, temporal self-attention, and transformation attention mechanisms to create a bridge between effective spatial information and future temporal evolution information. Fourthly, we show that the STNN model can reconstruct the phase space of the dynamical system, which is explored in the time-series prediction. The experimental results demonstrate that the STNN significantly outperforms the existing methods on various benchmarks and real-world systems in the multi-step-ahead prediction of a short-term time-series.</p>","PeriodicalId":520609,"journal":{"name":"Entropy (Basel, Switzerland)","volume":" ","pages":""},"PeriodicalIF":2.7,"publicationDate":"2022-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9689721/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40703423","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A New Class of Weighted CUSUM Statistics.","authors":"Xiaoping Shi,&nbsp;Xiang-Sheng Wang,&nbsp;Nancy Reid","doi":"10.3390/e24111652","DOIUrl":"https://doi.org/10.3390/e24111652","url":null,"abstract":"<p><p>A change point is a location or time at which observations or data obey two different models: before and after. In real problems, we may know some prior information about the location of the change point, say at the right or left tail of the sequence. How does one incorporate the prior information into the current cumulative sum (CUSUM) statistics? We propose a new class of weighted CUSUM statistics with three different types of quadratic weights accounting for different prior positions of the change points. One interpretation of the weights is the mean duration in a random walk. Under the normal model with known variance, the exact distributions of these statistics are explicitly expressed in terms of eigenvalues. Theoretical results about the explicit difference of the distributions are valuable. The expansions of asymptotic distributions are compared with the expansion of the limit distributions of the Cramér-von Mises statistic and the Anderson and Darling statistic. We provide some extensions from independent normal responses to more interesting models, such as graphical models, the mixture of normals, Poisson, and weakly dependent models. Simulations suggest that the proposed test statistics have better power than the graph-based statistics. We illustrate their application to a detection problem with video data.</p>","PeriodicalId":520609,"journal":{"name":"Entropy (Basel, Switzerland)","volume":" ","pages":""},"PeriodicalIF":2.7,"publicationDate":"2022-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9689417/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40703424","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An Improved Human-Body-Segmentation Algorithm with Attention-Based Feature Fusion and a Refined Stereo-Matching Scheme Working at the Sub-Pixel Level for the Anthropometric System.","authors":"Lei Yang,&nbsp;Xiaoyu Guo,&nbsp;Xiaowei Song,&nbsp;Deyuan Lu,&nbsp;Wenjing Cai,&nbsp;Zixiang Xiong","doi":"10.3390/e24111647","DOIUrl":"https://doi.org/10.3390/e24111647","url":null,"abstract":"<p><p>This paper proposes an improved human-body-segmentation algorithm with attention-based feature fusion and a refined corner-based feature-point design with sub-pixel stereo matching for the anthropometric system. In the human-body-segmentation algorithm, four CBAMs are embedded in the four middle convolution layers of the backbone network (ResNet101) of PSPNet to achieve better feature fusion in space and channels, so as to improve accuracy. The common convolution in the residual blocks of ResNet101 is substituted by group convolution to reduce model parameters and computational cost, thereby optimizing efficiency. For the stereo-matching scheme, a corner-based feature point is designed to obtain the feature-point coordinates at sub-pixel level, so that precision is refined. A regional constraint is applied according to the characteristic of the checkerboard corner points, thereby reducing complexity. Experimental results demonstrated that the anthropometric system with the proposed CBAM-based human-body-segmentation algorithm and corner-based stereo-matching scheme can significantly outperform the state-of-the-art system in accuracy. It can also meet the national standards GB/T 2664-2017, GA 258-2009 and GB/T 2665-2017; and the textile industry standards FZ/T 73029-2019, FZ/T 73017-2014, FZ/T 73059-2017 and FZ/T 73022-2019.</p>","PeriodicalId":520609,"journal":{"name":"Entropy (Basel, Switzerland)","volume":" ","pages":""},"PeriodicalIF":2.7,"publicationDate":"2022-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9689509/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40703419","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Three-Dimensional Face Recognition Using Solid Harmonic Wavelet Scattering and Homotopy Dictionary Learning.","authors":"Yi He,&nbsp;Peng Cheng,&nbsp;Shanmin Yang,&nbsp;Jianwei Zhang","doi":"10.3390/e24111646","DOIUrl":"https://doi.org/10.3390/e24111646","url":null,"abstract":"<p><p>Data representation has been one of the core topics in 3D graphics and pattern recognition in high-dimensional data. Although the high-resolution geometrical information of a physical object can be well preserved in the form of metrical data, e.g., point clouds/triangular meshes, from a regular data (e.g., image/audio) processing perspective, they also bring excessive noise in the course of feature abstraction and regression. For 3D face recognition, preceding attempts focus on treating the scan samples as signals laying on an underlying discrete surface (mesh) or morphable (statistic) models and by embedding auxiliary information, e.g., texture onto the regularized local planar structure to obtain a superior expressive performance to registration-based methods, but environmental variations such as posture/illumination will dissatisfy the integrity or uniform sampling condition, which holistic models generally rely on. In this paper, a geometric deep learning framework for face recognition is proposed, which merely requires the consumption of raw spatial coordinates. The non-uniformity and non-grid geometric transformations in the course of point cloud face scanning are mitigated by modeling each identity as a stochastic process. Individual face scans are considered realizations, yielding underlying inherent distributions under the appropriate assumption of ergodicity. To accomplish 3D facial recognition, we propose a windowed solid harmonic scattering transform on point cloud face scans to extract the invariant coefficients so that unrelated variations can be encoded into certain components of the scattering domain. With these constructions, a sparse learning network as the semi-supervised classification backbone network can work on reducing intraclass variability. Our framework obtained superior performance to current competing methods; without excluding any fragmentary or severely deformed samples, the rank-1 recognition rate (RR1) achieved was 99.84% on the Face Recognition Grand Challenge (FRGC) v2.0 dataset and 99.90% on the Bosphorus dataset.</p>","PeriodicalId":520609,"journal":{"name":"Entropy (Basel, Switzerland)","volume":" ","pages":""},"PeriodicalIF":2.7,"publicationDate":"2022-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9689438/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40703418","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An Edge-Supported Blockchain-Based Secure Authentication Method and a Cryptocurrency-Based Billing System for P2P Charging of Electric Vehicles.","authors":"A F M Suaib Akhter,&nbsp;Tawsif Zaman Arnob,&nbsp;Ekra Binta Noor,&nbsp;Selman Hizal,&nbsp;Al-Sakib Khan Pathan","doi":"10.3390/e24111644","DOIUrl":"https://doi.org/10.3390/e24111644","url":null,"abstract":"<p><p>The popularity of electric vehicles (EVs) is constantly increasing, as they use relatively greener, sustainable energy. However, it is a fact that the charging stations for EVs are yet to meet the demand. It could be a great solution if a peer-to-peer (P2P) charging system could be initiated by anyone who wants to make their garage's charge points publicly available for commercial purposes, named a home charging station (HCS). In this work, our idea is to bring interested charging stations under a network of nodes and a blockchain-based management system, where the blockchain is responsible for ensuring the authenticity of both the charging stations and charge receiver. A cryptocurrency-based payment system has also been proposed to ensure transactions' security, integrity, transparency, and immutability. A reputation management system is applied to maintain the quality of service. Miners with high processing power are used to alleviate lagging during block creation, supported by edge servers. The proposed system has been implemented by using virtual machines. A theoretical analysis is presented to assess the compatibility and possible cost requirements to implement the system in a real-world scenario.</p>","PeriodicalId":520609,"journal":{"name":"Entropy (Basel, Switzerland)","volume":" ","pages":""},"PeriodicalIF":2.7,"publicationDate":"2022-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9689731/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40509025","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Levitated Micromagnets in Superconducting Traps: A New Platform for Tabletop Fundamental Physics Experiments.","authors":"Andrea Vinante,&nbsp;Chris Timberlake,&nbsp;Hendrik Ulbricht","doi":"10.3390/e24111642","DOIUrl":"https://doi.org/10.3390/e24111642","url":null,"abstract":"<p><p>Magnetically levitated microparticles have been proposed as mechanical sensors with extreme sensitivity. In particular, micromagnets levitated above a superconductor can achieve very low levels of dissipation and thermal noise. In this paper, we review recent initial experiments and discuss the potential for using these systems as sensors of magnetic fields and rotational motion, as well as possible applications to fundamental physics.</p>","PeriodicalId":520609,"journal":{"name":"Entropy (Basel, Switzerland)","volume":" ","pages":""},"PeriodicalIF":2.7,"publicationDate":"2022-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9688962/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40509023","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Improved Black Widow Spider Optimization Algorithm Integrating Multiple Strategies.","authors":"Chenxin Wan,&nbsp;Bitao He,&nbsp;Yuancheng Fan,&nbsp;Wei Tan,&nbsp;Tao Qin,&nbsp;Jing Yang","doi":"10.3390/e24111640","DOIUrl":"https://doi.org/10.3390/e24111640","url":null,"abstract":"<p><p>The black widow spider optimization algorithm (BWOA) had the problems of slow convergence speed and easily to falling into local optimum mode. To address these problems, this paper proposes a multi-strategy black widow spider optimization algorithm (IBWOA). First, Gauss chaotic mapping is introduced to initialize the population to ensure the diversity of the algorithm at the initial stage. Then, the sine cosine strategy is introduced to perturb the individuals during iteration to improve the global search ability of the algorithm. In addition, the elite opposition-based learning strategy is introduced to improve convergence speed of algorithm. Finally, the mutation method of the differential evolution algorithm is integrated to reorganize the individuals with poor fitness values. Through the analysis of the optimization results of 13 benchmark test functions and a part of CEC2017 test functions, the effectiveness and rationality of each improved strategy are verified. Moreover, it shows that the proposed algorithm has significant improvement in solution accuracy, performance and convergence speed compared with other algorithms. Furthermore, the IBWOA algorithm is used to solve six practical constrained engineering problems. The results show that the IBWOA has excellent optimization ability and scalability.</p>","PeriodicalId":520609,"journal":{"name":"Entropy (Basel, Switzerland)","volume":" ","pages":""},"PeriodicalIF":2.7,"publicationDate":"2022-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9689898/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40509021","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Observing Cryptocurrencies through Robust Anomaly Scores.","authors":"Geumil Bae,&nbsp;Jang Ho Kim","doi":"10.3390/e24111643","DOIUrl":"https://doi.org/10.3390/e24111643","url":null,"abstract":"<p><p>The cryptocurrency market is understood as being more volatile than traditional asset classes. Therefore, modeling the volatility of cryptocurrencies is important for making investment decisions. However, large swings in the market might be normal for cryptocurrencies due to their inherent volatility. Deviations, along with correlations of asset returns, must be considered for measuring the degree of market anomaly. This paper demonstrates the use of robust Mahalanobis distances based on shrinkage estimators and minimum covariance determinant for observing anomaly scores of cryptocurrencies. Our analysis shows that anomaly scores are a critical complement to volatility measures for understanding the cryptocurrency market. The use of anomaly scores is further demonstrated through portfolio optimization and scenario analysis.</p>","PeriodicalId":520609,"journal":{"name":"Entropy (Basel, Switzerland)","volume":" ","pages":""},"PeriodicalIF":2.7,"publicationDate":"2022-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9689272/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40509024","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Decision Probability Transformation Method Based on the Neural Network.","authors":"Junwei Li,&nbsp;Aoxiang Zhao,&nbsp;Huanyu Liu","doi":"10.3390/e24111638","DOIUrl":"https://doi.org/10.3390/e24111638","url":null,"abstract":"<p><p>When the Dempster-Shafer evidence theory is applied to the field of information fusion, how to reasonably transform the basic probability assignment (BPA) into probability to improve decision-making efficiency has been a key challenge. To address this challenge, this paper proposes an efficient probability transformation method based on neural network to achieve the transformation from the BPA to the probabilistic decision. First, a neural network is constructed based on the BPA of propositions in the mass function. Next, the average information content and the interval information content are used to quantify the information contained in each proposition subset and combined to construct the weighting function with parameter <i>r</i>. Then, the BPA of the input layer and the bias units are allocated to the proposition subset in each hidden layer according to the weight factors until the probability of each single-element proposition with the variable is output. Finally, the parameter <i>r</i> and the optimal transform results are obtained under the premise of maximizing the probabilistic information content. The proposed method satisfies the consistency of the upper and lower boundaries of each proposition. Extensive examples and a practical application show that, compared with the other methods, the proposed method not only has higher applicability, but also has lower uncertainty regarding the transformation result information.</p>","PeriodicalId":520609,"journal":{"name":"Entropy (Basel, Switzerland)","volume":" ","pages":""},"PeriodicalIF":2.7,"publicationDate":"2022-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9689871/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40509019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Time-Aware Explainable Recommendation via Updating Enabled Online Prediction.","authors":"Tianming Jiang,&nbsp;Jiangfeng Zeng","doi":"10.3390/e24111639","DOIUrl":"https://doi.org/10.3390/e24111639","url":null,"abstract":"<p><p>There has been growing attention on explainable recommendation that is able to provide high-quality results as well as intuitive explanations. However, most existing studies use offline prediction strategies where recommender systems are trained once while used forever, which ignores the dynamic and evolving nature of user-item interactions. There are two main issues with these methods. First, their random dataset split setting will result in data leakage that knowledge should not be known at the time of training is utilized. Second, the dynamic characteristics of user preferences are overlooked, resulting in a model aging issue where the model's performance degrades along with time. In this paper, we propose an updating enabled online prediction framework for the time-aware explainable recommendation. Specifically, we propose an online prediction scheme to eliminate the data leakage issue and two novel updating strategies to relieve the model aging issue. Moreover, we conduct extensive experiments on four real-world datasets to evaluate the effectiveness of our proposed methods. Compared with the state-of-the-art, our time-aware approach achieves higher accuracy results and more convincing explanations for the entire lifetime of recommendation systems, i.e., both the initial period and the long-term usage.</p>","PeriodicalId":520609,"journal":{"name":"Entropy (Basel, Switzerland)","volume":" ","pages":""},"PeriodicalIF":2.7,"publicationDate":"2022-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9689638/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40509020","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}