Search

Ultra-short baseline (USBL) underwater positioning systems are widely used in marine scientific research and ocean engineering. Angle misalignment is a main error that reduces the accuracy of USBL underwater positioning. The conventional angle-calibration method assumes that the transponder position obtained by USBL positioning is an errorless coefficient matrix. However, errors inevitably exist in the estimation of the transponder's position via USBL positioning, and the precision varies at different epochs. Ignoring the error in the transponder's position will significantly reduce the precision of the angle misalignment estimation. In this paper, a new angle-calibration method is proposed for precise USBL underwater positioning. The angle alignment model is derived by treating the transponder's position obtained by USBL positioning as an observation, and the stochastic model is then established according to the bearing angles. Robust estimation is likewise applied to further improve the precision of the angle misalignment estimation. To verify the performance of the proposed method, a sea experiment was performed. The results show that the new method has high calibration accuracy and robustness. The estimation precision of this method is improved by 0.0457°~0.6896° in heading, 0.0125°~0.8072° in roll, and 0.0077°~0.9436° in pitch, compared with that of the conventional angle alignment method. [ABSTRACT FROM AUTHOR]

In coal mine engineering, numerical software is used to analyze the behavior of coal rock damage and fluid migration. The order of the coefficient matrix used in numerical calculations is increasing, and this increases the computation steps in obtaining the coefficient matrix solution. The storage and solution of the coefficient matrix are key factors influencing the efficiency of the numerical software. Therefore, to save storage space and reduce the computation steps, the coefficient matrix must be effectively compressed and stored. In this work, the structural characteristics of different coefficient matrices are analyzed in detail, and we find that for different computational regions, as long as the nodes are numbered according to certain rules, the corresponding coefficient matrices will have similar structural characteristics. The nonzero elements are symmetrically distributed in the diagonal band, and all the elements on both sides outside the band are zero. Based on this, the coefficient matrix is compressed by a pivoting scheme, and the compressed matrix is directly eliminated by dislocation Gaussian elimination. Thus, a compressed storage method that integrates the compression and solution of the coefficient matrix is established. The compressed storage and calculation module is incorporated into our self-developed simulation software COMBUSS-3D to simulate the evolution of the temperature field in the goaf of Luling Coal Mine. Compared with the conventional method, the compressed storage module can significantly improve the computing rate of the simulation, by approximately 80%. [ABSTRACT FROM AUTHOR]

Advances in information technology have harnessed the application of Quick Response (QR) codes in day-to-day activities, simplifying information exchange. QR codes are witnessed almost everywhere, on consumables, newspapers, information bulletins, etc. The simplicity of QR code creation and ease of scanning with free software have tremendously influenced their wide usage, and since QR codes place information on an object they are a tool for the IoT. Many healthcare IoT applications are deployed with QR codes for data-labeling and quick transfer of clinical data for rapid diagnosis. However, these codes can be duplicated and tampered with easily, attributed to open- source QR code generators and scanners. This paper presents a novel (n,n) secret-sharing scheme based on Nonnegative Matrix Factorization (NMF) for secured transfer of QR codes as multiple shares and their reconstruction with a regularized Super Resolution Convolutional Neural Network (SRCNN). This scheme is an alternative to the existing polynomial and visual cryptography-based schemes, exploiting NMF in part-based data representation and structural regularized SRCNN to capture the structural elements of the QR code in the super-resolved image. The experimental results and theoretical analyses show that the proposed method is a potential solution for secured exchange of QR codes with different error correction levels. The security of the proposed approach is evaluated with the difficulty in launching security attacks to recover and decode the secret QR code. The experimental results show that an adversary must try 258 additional combinations of shares and perform 3 × 288 additional computations, compared to a representative approach, to compromise the proposed system. [ABSTRACT FROM AUTHOR]