A novel color image encryption scheme is developed to enhance the security of encryption without increasing the complexity. Firstly, the plain color image is decomposed into three grayscale plain images, which are con...A novel color image encryption scheme is developed to enhance the security of encryption without increasing the complexity. Firstly, the plain color image is decomposed into three grayscale plain images, which are converted into the frequency domain coefficient matrices(FDCM) with discrete cosine transform(DCT) operation. After that, a twodimensional(2D) coupled chaotic system is developed and used to generate one group of embedded matrices and another group of encryption matrices, respectively. The embedded matrices are integrated with the FDCM to fulfill the frequency domain encryption, and then the inverse DCT processing is implemented to recover the spatial domain signal. Eventually,under the function of the encryption matrices and the proposed diagonal scrambling algorithm, the final color ciphertext is obtained. The experimental results show that the proposed method can not only ensure efficient encryption but also satisfy various sizes of image encryption. Besides, it has better performance than other similar techniques in statistical feature analysis, such as key space, key sensitivity, anti-differential attack, information entropy, noise attack, etc.展开更多
In this paper, we provide some new necessary and sufficient conditions for generalized diagonally dominant matrices and also obtain some criteria for nongeneralized dominant matrices.
Let DD_0(R)={A∈C^(n×#)||Rea_(ii)Rea_(jj)|≥A_iA_j,i≠j,i,j∈N}.PD_0(R)={A∈C^(n×#)||Rea_(ii)Rea_(kk)|≥A_iA_jA_k,i≠j≠k,i,j,k∈N}. In this paper,we show DD_0(R)PD_0(R),and the conditions under which the nu...Let DD_0(R)={A∈C^(n×#)||Rea_(ii)Rea_(jj)|≥A_iA_j,i≠j,i,j∈N}.PD_0(R)={A∈C^(n×#)||Rea_(ii)Rea_(kk)|≥A_iA_jA_k,i≠j≠k,i,j,k∈N}. In this paper,we show DD_0(R)PD_0(R),and the conditions under which the numbers of eigen vance of A∈PD_0(R)\DD_0(R)are equal to the numbers of a_(ii),i∈N in positive and negative real part respectively.Some couter examples are given which present the condnions can not be omitted.展开更多
The frequent missing values in radar-derived time-series tracks of aerial targets(RTT-AT)lead to significant challenges in subsequent data-driven tasks.However,the majority of imputation research focuses on random mis...The frequent missing values in radar-derived time-series tracks of aerial targets(RTT-AT)lead to significant challenges in subsequent data-driven tasks.However,the majority of imputation research focuses on random missing(RM)that differs significantly from common missing patterns of RTT-AT.The method for solving the RM may experience performance degradation or failure when applied to RTT-AT imputation.Conventional autoregressive deep learning methods are prone to error accumulation and long-term dependency loss.In this paper,a non-autoregressive imputation model that addresses the issue of missing value imputation for two common missing patterns in RTT-AT is proposed.Our model consists of two probabilistic sparse diagonal masking self-attention(PSDMSA)units and a weight fusion unit.It learns missing values by combining the representations outputted by the two units,aiming to minimize the difference between the missing values and their actual values.The PSDMSA units effectively capture temporal dependencies and attribute correlations between time steps,improving imputation quality.The weight fusion unit automatically updates the weights of the output representations from the two units to obtain a more accurate final representation.The experimental results indicate that,despite varying missing rates in the two missing patterns,our model consistently outperforms other methods in imputation performance and exhibits a low frequency of deviations in estimates for specific missing entries.Compared to the state-of-the-art autoregressive deep learning imputation model Bidirectional Recurrent Imputation for Time Series(BRITS),our proposed model reduces mean absolute error(MAE)by 31%~50%.Additionally,the model attains a training speed that is 4 to 8 times faster when compared to both BRITS and a standard Transformer model when trained on the same dataset.Finally,the findings from the ablation experiments demonstrate that the PSDMSA,the weight fusion unit,cascade network design,and imputation loss enhance imputation performance and confirm the efficacy of our design.展开更多
In contrast to the solutions of applied mathematics to Zeno’s paradoxes, I focus on the concept of motion and show that, by distinguishing two different forms of motion, Zeno’s apparent paradoxes are not paradoxical...In contrast to the solutions of applied mathematics to Zeno’s paradoxes, I focus on the concept of motion and show that, by distinguishing two different forms of motion, Zeno’s apparent paradoxes are not paradoxical at all. Zeno’s paradoxes indirectly prove that distances are not composed of extensionless points and, in general, that a higher dimension cannot be completely composed of lower ones. Conversely, lower dimensions can be understood as special cases of higher dimensions. To illustrate this approach, I consider Cantor’s only apparent proof that the real numbers are uncountable. However, his widely accepted indirect proof has the disadvantage that it depends on whether there is another way to make the real numbers countable. Cantor rightly assumes that there can be no smallest number between 0 and 1, and therefore no beginning of counting. For this reason he arbitrarily lists the real numbers in order to show with his diagonal method that this list can never be complete. The situation is different if we start with the largest number between 0 and 1 (0.999…) and use the method of an inverted triangle, which can be understood as a special fractal form. Here we can construct a vertical and a horizontal stratification with which it is actually possible to construct all real numbers between 0 and 1 without exception. Each column is infinite, and each number in that column is the starting point of a new triangle, while each row is finite. Even in a simple sine curve, we experience finiteness with respect to the y-axis and infinity with respect to the x-axis. The first parts of this article show that Zeno’s assumptions contradict the concept of motion as such, so it is not surprising that this misconstruction leads to contradictions. In the last part, I discuss Cantor’s diagonal method and explain the method of an inverted triangle that is internally structured like a fractal by repeating this inverted triangle at each column. The consequence is that we encounter two very different methods of counting. Vertically it is continuous, horizontally it is discrete. While Frege, Tarski, Cantor, Gödel and the Vienna Circle tried to derive the higher dimension from the lower, a procedure that always leads to new contradictions and antinomies (Tarski, Russell), I take the opposite approach here, in which I derive the lower dimension from the higher. This perspective seems to fail because Tarski, Russell, Wittgenstein, and especially the Vienna Circle have shown that the completeness of the absolute itself is logically contradictory. For this reason, we agree with Hegel in assuming that we can never fully comprehend the Absolute, but only its particular manifestations—otherwise we would be putting ourselves in the place of the Absolute, or even God. Nevertheless, we can understand the Absolute in its particular expressions, as I will show with the modest example of the triangle proof of the combined horizontal and vertical countability of the real numbers, which I developed in rejection of Cantor’s diagonal proof. .展开更多
In this paper, the nonnull moments and the distributions of the likelihood ratio criterion for testing the equality of diagonal blocks with blockwise independence under certain alternatives have derived.
The derivation of a diagonally loaded sample-matrix inversion (LSMI) algorithm on the busis of inverse matrix recursion (i.e.LSMI-IMR algorithm) is conducted by reconstructing the recursive formulation of covarian...The derivation of a diagonally loaded sample-matrix inversion (LSMI) algorithm on the busis of inverse matrix recursion (i.e.LSMI-IMR algorithm) is conducted by reconstructing the recursive formulation of covariance matrix. For the new algorithm, diagonal loading is by setting initial inverse matrix without any addition of computation. In addition, a corresponding improved recursive algorithm is presented, which is low computational complexity. This eliminates the complex multiplications of the scalar coefficient and updating matrix, resulting in significant computational savings. Simulations show that the LSMI-IMR algorithm is valid.展开更多
A study of bispectral analysis in gearbox condition monitoring is presented.The theory of bispectrum and quadratic phase coupling (QPC) is first introduced, and then equationsfor computing bispectrum slices are obtain...A study of bispectral analysis in gearbox condition monitoring is presented.The theory of bispectrum and quadratic phase coupling (QPC) is first introduced, and then equationsfor computing bispectrum slices are obtained. To meet the needs of online monitoring, a simplifiedmethod of computing bispectrum diagonal slice is adopted. Industrial gearbox vibration signalsmeasured from normal and tooth cracked conditions are analyzed using the above method. Experimentsresults indicate that bispectrum can effectively suppress the additive Gaussian noise andchracterize the QPC phenomenon. It is also shown that the 1-D bispectrum diagonal slice can capturethe non-Gaussian and nonlinear feature of gearbox vibration when crack occurred, hence, this methodcan be employed to gearbox real time monitoring and early diagnosis.展开更多
With a focus on an industrial multivariable system, two subsystems including the flow and the level outputs are analysed and controlled, which have applicability in both real and academic environments. In such a case,...With a focus on an industrial multivariable system, two subsystems including the flow and the level outputs are analysed and controlled, which have applicability in both real and academic environments. In such a case, at first, each subsystem is distinctively represented by its model, since the outcomes point out that the chosen models have the same behavior as corresponding ones. Then, the industrial multivariable system and its presentation are achieved in line with the integration of these subsystems, since the interaction between them can not actually be ignored. To analyze the interaction presented, the Gershgorin bands need to be acquired, where the results are used to modify the system parameters to appropriate values. Subsequently, in the view of modeling results, the control concept in two different techniques including sequential loop closing control(SLCC) scheme and diagonal dominance control(DDC) schemes is proposed to implement on the system through the Profibus network, as long as the OPC(OLE for process control) server is utilized to communicate between the control schemes presented and the multivariable system. The real test scenarios are carried out and the corresponding outcomes in their present forms are acquired. In the same way, the proposed control schemes results are compared with each other, where the real consequences verify the validity of them in the field of the presented industrial multivariable system control.展开更多
In order to enhance the robustness and contrast in the minimum variance(MV) beamformer, adaptive diagonal loading method was proposed. The conventional diagonal loading technique has already been used in the MV beamfo...In order to enhance the robustness and contrast in the minimum variance(MV) beamformer, adaptive diagonal loading method was proposed. The conventional diagonal loading technique has already been used in the MV beamformer, but has the drawback that its level is specified by predefined parameter and without consideration of input-data. To alleviate this problem, the level of diagonal loading was computed appropriately and automatically from the given data by shrinkage method in the proposed adaptive diagonal loaded beamformer. The performance of the proposed beamformer was tested on the simulated point target and cyst phantom was obtained using Field II. In the point target simulation, it is shown that the proposed method has higher lateral resolution than the conventional delay-and-sum beamformer and could be more robust in estimating the amplitude peak than the MV beamformer when acoustic velocity error exists. In the cyst phantom simulation, the proposed beamformer has shown that it achieves an improvement in contrast ratio and without distorting the edges of cyst.展开更多
This study was conducted to analyze the effect of joint type, and numbers and types of dovetail keys on diagonal tension and compression performance of corner joints in a furniture frame. Joint members were cut from w...This study was conducted to analyze the effect of joint type, and numbers and types of dovetail keys on diagonal tension and compression performance of corner joints in a furniture frame. Joint members were cut from white fir lumber. Butted and mitered joints were constructed with one and two dovetail key(s) with butterfly and H shapes. Joints were glued by polyvinyl acetate (PVAc) and cynoacrylate (CA). Compression capacity of joints was higher than diagonal tension. Mitered joints were stronger than butted ones. Butterfly dovetail keys were superior to H shape keys. Double keys performed better than single key. Experimental joints glued with PVAc were stronger than those glued with CA glue and control specimens. In terms of strength, butterfly dovetailed joints were comparable with doweled joints.展开更多
A DRNN (diagonal recurrent neural network) and its RPE (recurrent prediction error) learning algorithm are proposed in this paper .Using of the simple structure of DRNN can reduce the capacity of calculation. The prin...A DRNN (diagonal recurrent neural network) and its RPE (recurrent prediction error) learning algorithm are proposed in this paper .Using of the simple structure of DRNN can reduce the capacity of calculation. The principle of RPE learning algorithm is to adjust weights along the direction of Gauss-Newton. Meanwhile, it is unnecessary to calculate the second local derivative and the inverse matrixes, whose unbiasedness is proved. With application to the extremely short time prediction of large ship pitch, satisfactory results are obtained. Prediction effect of this algorithm is compared with that of auto-regression and periodical diagram method, and comparison results show that the proposed algorithm is feasible.展开更多
The interaction of diagonal waves with perforated-wall breakwater partially filled with rock fill is studied using the linear potential theory. By means of the matched eigenfunction expansion method, an analytical met...The interaction of diagonal waves with perforated-wall breakwater partially filled with rock fill is studied using the linear potential theory. By means of the matched eigenfunction expansion method, an analytical method is presented to calculate the reflection coefficient and the wave force coefficient of the breakwater. The calculated results of the reflection coefficient for limiting cases are the same to the existing results. The main effect factors of the reflection coefficient and the wave force coefficient are analyzed by numerical examples. With the increasing of thickness of rock fill, the wave force coefficient on the perforated wall generally decreases, while the reflection coefficient increases. With the increasing of the incident angle of the wave, the reflection coefficient of the breakwater first decreases, reaches its minimum, and then increases monotonously.展开更多
In view of the low performance of adaptive asymmetric joint diagonalization(AAJD), especially its failure in tracking high maneuvering targets, an adaptive asymmetric joint diagonalization with deflation(AAJDd) al...In view of the low performance of adaptive asymmetric joint diagonalization(AAJD), especially its failure in tracking high maneuvering targets, an adaptive asymmetric joint diagonalization with deflation(AAJDd) algorithm is proposed. The AAJDd algorithm improves performance by estimating the direction of departure(DOD) and direction of arrival(DOA) directly, avoiding the reuse of the previous moment information in the AAJD algorithm.On this basis, the idea of sequential estimation of the principal component is introduced to turn the matrix operation into a constant operation, reducing the amount of computation and speeding up the convergence. Meanwhile, the eigenvalue is obtained, which can be used to estimate the number of targets. Then, the estimation of signal parameters via rotational invariance technique(ESPRIT) algorithm is improved to realize the automatic matching and association of DOD and DOA. The simulation results show that the AAJDd algorithm has higher tracking performance than the AAJD algorithm, especially when the high maneuvering target is tracked. The efficiency of the proposed method is verified.展开更多
A new algorithm is proposed for joint diagonalization. With a modified objective function, the new algorithm not only excludes trivial and unbalanced solutions successfully, but is also easily optimized. In addition, ...A new algorithm is proposed for joint diagonalization. With a modified objective function, the new algorithm not only excludes trivial and unbalanced solutions successfully, but is also easily optimized. In addition, with the new objective function, the proposed algorithm can work well in online blind source separation (BSS) for the first time, although this family of algorithms is always thought to be valid only in batch-mode BSS by far. Simulations show that it is a very competitive joint diagonalization algorithm.展开更多
We study diagonal invariant ideals of topologically graded C*-algebras over discrete groups. Since all Toeplitz algebras defined on discrete groups are topologically graded, the results in this paper have improved the...We study diagonal invariant ideals of topologically graded C*-algebras over discrete groups. Since all Toeplitz algebras defined on discrete groups are topologically graded, the results in this paper have improved the first author's previous works on this topic.展开更多
Inspired by total variation(TV), this paper represents a new iterative algorithm based on diagonal total variation(DTV) to address the computed tomography image reconstruction problem. To improve the quality of a reco...Inspired by total variation(TV), this paper represents a new iterative algorithm based on diagonal total variation(DTV) to address the computed tomography image reconstruction problem. To improve the quality of a reconstructed image, we used DTV to sparsely represent images when iterative convergence of the reconstructed algorithm with TV-constraint had no effect during the reconstruction process. To investigate our proposed algorithm, the numerical and experimental studies were performed, and rootmean-square error(RMSE) and structure similarity(SSIM)were used to evaluate the reconstructed image quality. The results demonstrated that the proposed method could effectively reduce noise, suppress artifacts, and reconstruct highquality image from incomplete projection data.展开更多
The following is proved: 1) The linear independence of assumed stress modes is the necessary and sufficient condition for the nonsingular flexibility matrix; 2) The equivalent assumed stress modes lead to the identica...The following is proved: 1) The linear independence of assumed stress modes is the necessary and sufficient condition for the nonsingular flexibility matrix; 2) The equivalent assumed stress modes lead to the identical hybrid element. The Hilbert stress subspace of the assumed stress modes is established. So, it is easy to derive the equivalent orthogonal normal stress modes by Schmidt's method. Because of the resulting diagonal flexibility matrix, the identical hybrid element is free from the complex matrix inversion so that the hybrid efficiency, is improved greatly. The numerical examples show that the method is effective.展开更多
基金Project supported by the National Natural Science Foundation of China(Grant Nos.62105004 and 52174141)the College Student Innovation and Entrepreneurship Fund Project(Grant No.202210361053)+1 种基金Anhui Mining Machinery and Electrical Equipment Coordination Innovation Center,Anhui University of Science&Technology(Grant No.KSJD202304)the Anhui Province Digital Agricultural Engineering Technology Research Center Open Project(Grant No.AHSZNYGC-ZXKF021)。
文摘A novel color image encryption scheme is developed to enhance the security of encryption without increasing the complexity. Firstly, the plain color image is decomposed into three grayscale plain images, which are converted into the frequency domain coefficient matrices(FDCM) with discrete cosine transform(DCT) operation. After that, a twodimensional(2D) coupled chaotic system is developed and used to generate one group of embedded matrices and another group of encryption matrices, respectively. The embedded matrices are integrated with the FDCM to fulfill the frequency domain encryption, and then the inverse DCT processing is implemented to recover the spatial domain signal. Eventually,under the function of the encryption matrices and the proposed diagonal scrambling algorithm, the final color ciphertext is obtained. The experimental results show that the proposed method can not only ensure efficient encryption but also satisfy various sizes of image encryption. Besides, it has better performance than other similar techniques in statistical feature analysis, such as key space, key sensitivity, anti-differential attack, information entropy, noise attack, etc.
文摘In this paper, we provide some new necessary and sufficient conditions for generalized diagonally dominant matrices and also obtain some criteria for nongeneralized dominant matrices.
文摘Let DD_0(R)={A∈C^(n×#)||Rea_(ii)Rea_(jj)|≥A_iA_j,i≠j,i,j∈N}.PD_0(R)={A∈C^(n×#)||Rea_(ii)Rea_(kk)|≥A_iA_jA_k,i≠j≠k,i,j,k∈N}. In this paper,we show DD_0(R)PD_0(R),and the conditions under which the numbers of eigen vance of A∈PD_0(R)\DD_0(R)are equal to the numbers of a_(ii),i∈N in positive and negative real part respectively.Some couter examples are given which present the condnions can not be omitted.
基金supported by Graduate Funded Project(No.JY2022A017).
文摘The frequent missing values in radar-derived time-series tracks of aerial targets(RTT-AT)lead to significant challenges in subsequent data-driven tasks.However,the majority of imputation research focuses on random missing(RM)that differs significantly from common missing patterns of RTT-AT.The method for solving the RM may experience performance degradation or failure when applied to RTT-AT imputation.Conventional autoregressive deep learning methods are prone to error accumulation and long-term dependency loss.In this paper,a non-autoregressive imputation model that addresses the issue of missing value imputation for two common missing patterns in RTT-AT is proposed.Our model consists of two probabilistic sparse diagonal masking self-attention(PSDMSA)units and a weight fusion unit.It learns missing values by combining the representations outputted by the two units,aiming to minimize the difference between the missing values and their actual values.The PSDMSA units effectively capture temporal dependencies and attribute correlations between time steps,improving imputation quality.The weight fusion unit automatically updates the weights of the output representations from the two units to obtain a more accurate final representation.The experimental results indicate that,despite varying missing rates in the two missing patterns,our model consistently outperforms other methods in imputation performance and exhibits a low frequency of deviations in estimates for specific missing entries.Compared to the state-of-the-art autoregressive deep learning imputation model Bidirectional Recurrent Imputation for Time Series(BRITS),our proposed model reduces mean absolute error(MAE)by 31%~50%.Additionally,the model attains a training speed that is 4 to 8 times faster when compared to both BRITS and a standard Transformer model when trained on the same dataset.Finally,the findings from the ablation experiments demonstrate that the PSDMSA,the weight fusion unit,cascade network design,and imputation loss enhance imputation performance and confirm the efficacy of our design.
文摘In contrast to the solutions of applied mathematics to Zeno’s paradoxes, I focus on the concept of motion and show that, by distinguishing two different forms of motion, Zeno’s apparent paradoxes are not paradoxical at all. Zeno’s paradoxes indirectly prove that distances are not composed of extensionless points and, in general, that a higher dimension cannot be completely composed of lower ones. Conversely, lower dimensions can be understood as special cases of higher dimensions. To illustrate this approach, I consider Cantor’s only apparent proof that the real numbers are uncountable. However, his widely accepted indirect proof has the disadvantage that it depends on whether there is another way to make the real numbers countable. Cantor rightly assumes that there can be no smallest number between 0 and 1, and therefore no beginning of counting. For this reason he arbitrarily lists the real numbers in order to show with his diagonal method that this list can never be complete. The situation is different if we start with the largest number between 0 and 1 (0.999…) and use the method of an inverted triangle, which can be understood as a special fractal form. Here we can construct a vertical and a horizontal stratification with which it is actually possible to construct all real numbers between 0 and 1 without exception. Each column is infinite, and each number in that column is the starting point of a new triangle, while each row is finite. Even in a simple sine curve, we experience finiteness with respect to the y-axis and infinity with respect to the x-axis. The first parts of this article show that Zeno’s assumptions contradict the concept of motion as such, so it is not surprising that this misconstruction leads to contradictions. In the last part, I discuss Cantor’s diagonal method and explain the method of an inverted triangle that is internally structured like a fractal by repeating this inverted triangle at each column. The consequence is that we encounter two very different methods of counting. Vertically it is continuous, horizontally it is discrete. While Frege, Tarski, Cantor, Gödel and the Vienna Circle tried to derive the higher dimension from the lower, a procedure that always leads to new contradictions and antinomies (Tarski, Russell), I take the opposite approach here, in which I derive the lower dimension from the higher. This perspective seems to fail because Tarski, Russell, Wittgenstein, and especially the Vienna Circle have shown that the completeness of the absolute itself is logically contradictory. For this reason, we agree with Hegel in assuming that we can never fully comprehend the Absolute, but only its particular manifestations—otherwise we would be putting ourselves in the place of the Absolute, or even God. Nevertheless, we can understand the Absolute in its particular expressions, as I will show with the modest example of the triangle proof of the combined horizontal and vertical countability of the real numbers, which I developed in rejection of Cantor’s diagonal proof. .
文摘In this paper, the nonnull moments and the distributions of the likelihood ratio criterion for testing the equality of diagonal blocks with blockwise independence under certain alternatives have derived.
文摘The derivation of a diagonally loaded sample-matrix inversion (LSMI) algorithm on the busis of inverse matrix recursion (i.e.LSMI-IMR algorithm) is conducted by reconstructing the recursive formulation of covariance matrix. For the new algorithm, diagonal loading is by setting initial inverse matrix without any addition of computation. In addition, a corresponding improved recursive algorithm is presented, which is low computational complexity. This eliminates the complex multiplications of the scalar coefficient and updating matrix, resulting in significant computational savings. Simulations show that the LSMI-IMR algorithm is valid.
基金This project is supported by 95 Pan Deng Program of China (No.PD952l908) National Key Basic Research Special Foundation of China (No.Gl998020320)Provincial Natural Science Foundation of Hubei, China (No.2000J125)
文摘A study of bispectral analysis in gearbox condition monitoring is presented.The theory of bispectrum and quadratic phase coupling (QPC) is first introduced, and then equationsfor computing bispectrum slices are obtained. To meet the needs of online monitoring, a simplifiedmethod of computing bispectrum diagonal slice is adopted. Industrial gearbox vibration signalsmeasured from normal and tooth cracked conditions are analyzed using the above method. Experimentsresults indicate that bispectrum can effectively suppress the additive Gaussian noise andchracterize the QPC phenomenon. It is also shown that the 1-D bispectrum diagonal slice can capturethe non-Gaussian and nonlinear feature of gearbox vibration when crack occurred, hence, this methodcan be employed to gearbox real time monitoring and early diagnosis.
文摘With a focus on an industrial multivariable system, two subsystems including the flow and the level outputs are analysed and controlled, which have applicability in both real and academic environments. In such a case, at first, each subsystem is distinctively represented by its model, since the outcomes point out that the chosen models have the same behavior as corresponding ones. Then, the industrial multivariable system and its presentation are achieved in line with the integration of these subsystems, since the interaction between them can not actually be ignored. To analyze the interaction presented, the Gershgorin bands need to be acquired, where the results are used to modify the system parameters to appropriate values. Subsequently, in the view of modeling results, the control concept in two different techniques including sequential loop closing control(SLCC) scheme and diagonal dominance control(DDC) schemes is proposed to implement on the system through the Profibus network, as long as the OPC(OLE for process control) server is utilized to communicate between the control schemes presented and the multivariable system. The real test scenarios are carried out and the corresponding outcomes in their present forms are acquired. In the same way, the proposed control schemes results are compared with each other, where the real consequences verify the validity of them in the field of the presented industrial multivariable system control.
基金Project(2013GZX0147-3)supported by the Science and Technology Pillar Program of Sichuan Province,China
文摘In order to enhance the robustness and contrast in the minimum variance(MV) beamformer, adaptive diagonal loading method was proposed. The conventional diagonal loading technique has already been used in the MV beamformer, but has the drawback that its level is specified by predefined parameter and without consideration of input-data. To alleviate this problem, the level of diagonal loading was computed appropriately and automatically from the given data by shrinkage method in the proposed adaptive diagonal loaded beamformer. The performance of the proposed beamformer was tested on the simulated point target and cyst phantom was obtained using Field II. In the point target simulation, it is shown that the proposed method has higher lateral resolution than the conventional delay-and-sum beamformer and could be more robust in estimating the amplitude peak than the MV beamformer when acoustic velocity error exists. In the cyst phantom simulation, the proposed beamformer has shown that it achieves an improvement in contrast ratio and without distorting the edges of cyst.
文摘This study was conducted to analyze the effect of joint type, and numbers and types of dovetail keys on diagonal tension and compression performance of corner joints in a furniture frame. Joint members were cut from white fir lumber. Butted and mitered joints were constructed with one and two dovetail key(s) with butterfly and H shapes. Joints were glued by polyvinyl acetate (PVAc) and cynoacrylate (CA). Compression capacity of joints was higher than diagonal tension. Mitered joints were stronger than butted ones. Butterfly dovetail keys were superior to H shape keys. Double keys performed better than single key. Experimental joints glued with PVAc were stronger than those glued with CA glue and control specimens. In terms of strength, butterfly dovetailed joints were comparable with doweled joints.
文摘A DRNN (diagonal recurrent neural network) and its RPE (recurrent prediction error) learning algorithm are proposed in this paper .Using of the simple structure of DRNN can reduce the capacity of calculation. The principle of RPE learning algorithm is to adjust weights along the direction of Gauss-Newton. Meanwhile, it is unnecessary to calculate the second local derivative and the inverse matrixes, whose unbiasedness is proved. With application to the extremely short time prediction of large ship pitch, satisfactory results are obtained. Prediction effect of this algorithm is compared with that of auto-regression and periodical diagram method, and comparison results show that the proposed algorithm is feasible.
基金The Natural Science Foundation of Shandong Province under contract No.Q2008F01the Specialized Research Fund for the Doctoral Program of Higher Education under contract No.200804231006the Found of Shandong Province Key Laboratory of Ocean Engineering
文摘The interaction of diagonal waves with perforated-wall breakwater partially filled with rock fill is studied using the linear potential theory. By means of the matched eigenfunction expansion method, an analytical method is presented to calculate the reflection coefficient and the wave force coefficient of the breakwater. The calculated results of the reflection coefficient for limiting cases are the same to the existing results. The main effect factors of the reflection coefficient and the wave force coefficient are analyzed by numerical examples. With the increasing of thickness of rock fill, the wave force coefficient on the perforated wall generally decreases, while the reflection coefficient increases. With the increasing of the incident angle of the wave, the reflection coefficient of the breakwater first decreases, reaches its minimum, and then increases monotonously.
基金supported by the National Natural Science Foundation of China(6167145361201379)Anhui Natural Science Foundation of China(1608085MF123)
文摘In view of the low performance of adaptive asymmetric joint diagonalization(AAJD), especially its failure in tracking high maneuvering targets, an adaptive asymmetric joint diagonalization with deflation(AAJDd) algorithm is proposed. The AAJDd algorithm improves performance by estimating the direction of departure(DOD) and direction of arrival(DOA) directly, avoiding the reuse of the previous moment information in the AAJD algorithm.On this basis, the idea of sequential estimation of the principal component is introduced to turn the matrix operation into a constant operation, reducing the amount of computation and speeding up the convergence. Meanwhile, the eigenvalue is obtained, which can be used to estimate the number of targets. Then, the estimation of signal parameters via rotational invariance technique(ESPRIT) algorithm is improved to realize the automatic matching and association of DOD and DOA. The simulation results show that the AAJDd algorithm has higher tracking performance than the AAJD algorithm, especially when the high maneuvering target is tracked. The efficiency of the proposed method is verified.
基金supported partly by the Key Program of National Natural Science Foundation of China (U0635001U0835003)+3 种基金the National Natural Science Foundation of China (60505005 60674033 60774094)the Natural Science Fundof Guangdong Province (05006508).
文摘A new algorithm is proposed for joint diagonalization. With a modified objective function, the new algorithm not only excludes trivial and unbalanced solutions successfully, but is also easily optimized. In addition, with the new objective function, the proposed algorithm can work well in online blind source separation (BSS) for the first time, although this family of algorithms is always thought to be valid only in batch-mode BSS by far. Simulations show that it is a very competitive joint diagonalization algorithm.
基金Supported by the National Natural Science Foundation of China(10371051)
文摘We study diagonal invariant ideals of topologically graded C*-algebras over discrete groups. Since all Toeplitz algebras defined on discrete groups are topologically graded, the results in this paper have improved the first author's previous works on this topic.
基金supported in part by the National Natural Science Foundation of China(No.61401049)the Chongqing Foundation and Frontier Research Project(Nos.cstc2016jcyjA0473,cstc2013jcyjA0763)+3 种基金the Graduate Scientific Research and Innovation Foundation of Chongqing,China(No.CYB16044)the Strategic Industry Key Generic Technology Innovation Project of Chongqing(No.cstc2015zdcy-ztzxX0002)China Scholarship Councilthe Fundamental Research Funds for the Central Universities Nos.CDJZR14125501,106112016CDJXY120003,10611CDJXZ238826
文摘Inspired by total variation(TV), this paper represents a new iterative algorithm based on diagonal total variation(DTV) to address the computed tomography image reconstruction problem. To improve the quality of a reconstructed image, we used DTV to sparsely represent images when iterative convergence of the reconstructed algorithm with TV-constraint had no effect during the reconstruction process. To investigate our proposed algorithm, the numerical and experimental studies were performed, and rootmean-square error(RMSE) and structure similarity(SSIM)were used to evaluate the reconstructed image quality. The results demonstrated that the proposed method could effectively reduce noise, suppress artifacts, and reconstruct highquality image from incomplete projection data.
文摘The following is proved: 1) The linear independence of assumed stress modes is the necessary and sufficient condition for the nonsingular flexibility matrix; 2) The equivalent assumed stress modes lead to the identical hybrid element. The Hilbert stress subspace of the assumed stress modes is established. So, it is easy to derive the equivalent orthogonal normal stress modes by Schmidt's method. Because of the resulting diagonal flexibility matrix, the identical hybrid element is free from the complex matrix inversion so that the hybrid efficiency, is improved greatly. The numerical examples show that the method is effective.