A class of parallel hybrid iteration method and its accelerated overrelaxation variant are established for solving the large sparse block bordered system of linear equations, and their convergence are proved when the ...
A class of parallel hybrid iteration method and its accelerated overrelaxation variant are established for solving the large sparse block bordered system of linear equations, and their convergence are proved when the coefficient matrix of the linear system is an M-matrix, an II-matrix, and a symmetric positive definite matrix, respectively. (C) Elsevier Science Inc., 1997.
The collaboration of computing powers (CPs) among unmanned aerial vehicles (UAVs)-mounted edge servers is essential to handle data-intensive tasks of user equipments (UEs). This paper presents a multi-UAV computing po...
详细信息
Large Eddy Simulation (LES) was coupled with a mass transfer cavitation model to predict unsteady 3-D turbulent cavita- ting flows around a twisted hydrofoil. The wall-adapting local eddy-viscosity (WALE) model wa...
详细信息
Large Eddy Simulation (LES) was coupled with a mass transfer cavitation model to predict unsteady 3-D turbulent cavita- ting flows around a twisted hydrofoil. The wall-adapting local eddy-viscosity (WALE) model was used to give the Sub-Grid Scale (SGS) stress term. The predicted 3-D cavitation evolutions, including the cavity growth, break-off and collapse downstream, and the shedding cycle as well as its frequency agree fairly well with experimental results. The mechanism for the interactions between the cavitation and the vortices was discussed based on the analysis of the vorticity transport equation related to the vortex stretching, volumetric expansion/contraction and baroclinic torque terms along the hydrofoil mid-plane. The vortical flow analysis demonstrates that cavitation promotes the vortex production and the flow unsteadiness. In non-cavitation conditions, the streamline smoothly passes along the upper wall of the hydrofoil with no boundary layer separation and the boundary layer is thin and attached to the foil except at the trailing edge. With decreasing cavitation number, the present case has O" = 1.07, and the attached sheet cavitation beco- mes highly unsteady, with periodic growth and break-off to form the cavitation cloud. The expansion due to cavitation induces boun- dary layer separation and significantly increases the vorticity magnitude at the cavity interface. A detailed analysis using the vorticity transport equation shows that the cavitation accelerates the vortex stretching and dilatation and increases the baroclinic torque as the major source of vorticity generation. Examination of the flow field shows that the vortex dilatation and baroclinic torque terms in- crease in the cavitating case to the same magnitude as the vortex stretching term, while for the non-cavitating case these two terms are zero.
Deconvolution problem is a main topic in signal processing. Many practical applications are re-quired to solve deconvolution problems. An important example is image reconstruction. Usually, researcherslike to use regu...
详细信息
Deconvolution problem is a main topic in signal processing. Many practical applications are re-quired to solve deconvolution problems. An important example is image reconstruction. Usually, researcherslike to use regularization method to deal with this problem. But the cost of computation is high due to thefact that direct methods are used. This paper develops a trust region-cg method, a kind of iterative methodsto solve this kind of problem. The regularity of the method is proved. Based on the special structure of thediscrete matrix, FFT can be used for calculation. Hence combining trust region-cg method with FFT is suitablefor solving large scale problems in signal processing.
In recent years,the rapid development of computer software has led to numerous security problems,particularly software *** flaws can cause significant harm to users’privacy and *** security defect detection technolog...
详细信息
In recent years,the rapid development of computer software has led to numerous security problems,particularly software *** flaws can cause significant harm to users’privacy and *** security defect detection technology relies on manual or professional reasoning,leading to missed detection and high false detection *** intelligence technology has led to the development of neural network models based on machine learning or deep learning to intelligently mine holes,reducing missed alarms and false ***,this project aims to study Java source code defect detection methods for defects like null pointer reference exception,XSS(Transform),and Structured Query Language(SQL)***,the project uses open-source Javalang to translate the Java source code,conducts a deep search on the AST to obtain the empty syntax feature library,and converts the Java source code into a dependency *** feature vector is then used as the learning target for the neural *** types of Convolutional Neural Networks(CNN),Long Short-Term Memory(LSTM),Bi-directional Long Short-Term Memory(BiLSTM),and Attention Mechanism+Bidirectional LSTM,are used to investigate various code defects,including blank pointer reference exception,XSS,and SQL injection *** results show that the attention mechanism in two-dimensional BLSTM is the most effective for object recognition,verifying the correctness of the method.
NTRU is one of the most widely used public-key cryptosystems and its security has been an active research *** paper proposes a new way to find NTRU-2005 private *** algorithm is based on meet-in-the-middle attack and ...
详细信息
NTRU is one of the most widely used public-key cryptosystems and its security has been an active research *** paper proposes a new way to find NTRU-2005 private *** algorithm is based on meet-in-the-middle attack and a quantum algorithm for searching the fixed weight *** with the current classical and quantum meet-in-the-middle attacks,our algorithm has lower time and space ***,this attack can also be applied against different versions of *** result can help to understand the security of NTRU better.
Silicon nitride (Si3N4) waveguide with thickness of > 600 nm having strong mode confinement and anomalous group velocity dispersion (GVD) has today become the leading photonic integration platform for linear and Ke...
详细信息
At present, steganalysis research focuses on detecting the existence of a hidden message. However,extracting the hidden information, i.e., an extracting attack, is crucial in obtaining effective evidence in computer f...
详细信息
At present, steganalysis research focuses on detecting the existence of a hidden message. However,extracting the hidden information, i.e., an extracting attack, is crucial in obtaining effective evidence in computer forensics. Due to the difficulty of an extracting attack, research in this field is limited. In steganography with a stego key, an extracting attack is equivalent to recovering the stego key. In this paper we study a method for recovering the stego key in least significant bit(LSB) steganography with a decompressed JPEG image as the cover image. Firstly, the recovery of the stego key is translated into a cryptanalysis problem for a sequential cipher. The method for recovering the stego key is based on estimating the modification positions. The minimum size of the data used to recover the stego key successfully is discussed. Secondly, when a decompressed JPEG image is used as the cover image, the probability of recovering the cover pixels using recompression is *** is used to compute the error of the estimated sequence. Finally, an algorithm to recover the stego key in LSB steganography with a decompressed JPEG image as the cover image is proposed. The experimental results for the steganographic software, Hide and Seek 4.1 and its variant, which is a typical representative of LSB steganography, show that the proposed method can successfully recover the stego key in LSB replacement and LSB matching, i.e., the extracting attack is successful, and it outperforms three previous methods in terms of computational complexity.
作者:
张磊刘斌School of Mathematics and Statistics
Hubei Key Laboratory of Engineering Modeling and Scientific Computing Huazhong University of Science and Technology
This article is concerned with the existence of global attractor of a weakly dissipative generalized two-component μ-Hunter-Saxton (gμHS2) system with viscous terms. Under the period boundary conditions and with t...
详细信息
This article is concerned with the existence of global attractor of a weakly dissipative generalized two-component μ-Hunter-Saxton (gμHS2) system with viscous terms. Under the period boundary conditions and with the help of the Galerkin procedure and compactness method, we first investigate the existence of global solution for the viscous weakly dissipative (gμHS2) system. On the basis of some uniformly prior estimates of the solution to the viscous weakly dissipative (gμHS2) system, we show that the semi-group of the solution operator {S(t)}t≥0 has a bounded absorbing set. Moreover, we prove that the dynamical system {S(t)}t≥0 possesses a global attractor in the Sobolev space H2(S) × H2(S).
PRIDE is a lightweight block cipher proposed at CRYPTO 2014 by Albrecht et al., who claimed that the construction of linear layers is efficient and secure. In this paper, we investigate the key schedule and find eight...
详细信息
PRIDE is a lightweight block cipher proposed at CRYPTO 2014 by Albrecht et al., who claimed that the construction of linear layers is efficient and secure. In this paper, we investigate the key schedule and find eight 2-round iterative related-key differential characteristics, which can be used to construct 18-round related-key differentials. A study of the first subkey derivation function reveals that there exist three weak-key classes, as a result of which all the differences of subkeys for each round are identical. For the weak-key classes,we also find eight 2-round iterative related-key differential characteristics. Based on one of the related-key differentials, we launch an attack on the full PRIDE block cipher. The data and time complexity are 2;chosen plaintexts and 2;encryptions, respectively. Moreover, by using multiple related-key differentials, we improve the cryptanalysis, which then requires 2;chosen plaintexts and 2;encryptions, respectively. Finally, we use two 17-round related-key differentials to analyze full PRIDE, which requires 2;plaintexts and 2;*** are the first results on full PRIDE, and show that the PRIDE block cipher is not secure against related-key differential attack.
暂无评论