In this study,the problem of bundle adjustment was revisited,and a novel algorithm based on block matrix Cholesky decomposition was proposed to solve the thorny problem of self-calibration bundle adjustment.The innova...In this study,the problem of bundle adjustment was revisited,and a novel algorithm based on block matrix Cholesky decomposition was proposed to solve the thorny problem of self-calibration bundle adjustment.The innovation points are reflected in the following aspects:①The proposed algorithm is not dependent on the Schur complement,and the calculation process is simple and clear;②The complexities of time and space tend to O(n)in the context of world point number is far greater than that of images and cameras,so the calculation magnitude and memory consumption can be reduced significantly;③The proposed algorithm can carry out self-calibration bundle adjustment in single-camera,multi-camera,and variable-camera modes;④Some measures are employed to improve the optimization effects.Experimental tests showed that the proposed algorithm has the ability to achieve state-of-the-art performance in accuracy and robustness,and it has a strong adaptability as well,because the optimized results are accurate and robust even if the initial values have large deviations from the truth.This study could provide theoretical guidance and technical support for the image-based positioning and 3D reconstruction in the fields of photogrammetry,computer vision and robotics.展开更多
Cloud computing provides powerful processing capabilities for large-scale intelligent Internet of things(IoT)terminals.However,the massive realtime data processing requirements challenge the existing cloud computing m...Cloud computing provides powerful processing capabilities for large-scale intelligent Internet of things(IoT)terminals.However,the massive realtime data processing requirements challenge the existing cloud computing model.The edge server is closer to the data source.The end-edge-cloud collaboration offloads the cloud computing tasks to the edge environment,which solves the shortcomings of the cloud in resource storage,computing performance,and energy consumption.IoT terminals and sensors have caused security and privacy challenges due to resource constraints and exponential growth.As the key technology of IoT,Radio-Frequency Identification(RFID)authentication protocol tremendously strengthens privacy protection and improves IoT security.However,it inevitably increases system overhead while improving security,which is a major blow to low-cost RFID tags.The existing RFID authentication protocols are difficult to balance overhead and security.This paper designs an ultra-lightweight encryption function and proposes an RFID authentication scheme based on this function for the end-edge-cloud collaborative environment.The BAN logic proof and protocol verification tools AVISPA formally verify the protocol’s security.We use VIVADO to implement the encryption function and tag’s overhead on the FPGA platform.Performance evaluation indicates that the proposed protocol balances low computing costs and high-security requirements.展开更多
In order to alleviate the shortcomings of most blind deconvolution algorithms,this paper proposes an improved fast algorithm for blind deconvolution based on decorrelation technique and broadband block matrix.Althougt...In order to alleviate the shortcomings of most blind deconvolution algorithms,this paper proposes an improved fast algorithm for blind deconvolution based on decorrelation technique and broadband block matrix.Althougth the original algorithm can overcome the shortcomings of current blind deconvolution algorithms,it has a constraint that the number of the source signals must be less than that of the channels.The improved algorithm deletes this constraint by using decorrelation technique.Besides,the improved algorithm raises the separation speed in terms of improving the computing methods of the output signal matrix.Simulation results demonstrate the validation and fast separation of the improved algorithm.展开更多
In this paper, we present a method how to get the expression for the group inverse of 2×2 block matrix and get the explicit expressions of the block matrix (A C B D) under some conditions.
A novel carbon matrix/silicon nanowires(SiNWs) heterogeneous block was successfully produced by dispersing SiNWs into templated carbon matrix via a modified evaporation induced self-assembly method. The heterogeneous ...A novel carbon matrix/silicon nanowires(SiNWs) heterogeneous block was successfully produced by dispersing SiNWs into templated carbon matrix via a modified evaporation induced self-assembly method. The heterogeneous block was determined by X-ray diffraction, Raman spectra and scanning electron microscopy. As an anode material for lithium batteries, the block was investigated by cyclic voltammograms(CV), charge/discharge tests, galvanostatic cycling performance and A. C. impedance spectroscopy. We show that the SiNWs disperse into the framework, and are nicely wrapped by the carbon matrix. The heterogeneous block exhibits superior electrochemical reversibility with a high specific capacity of 529.3 mAh/g in comparison with bare SiNWs anode with merely about 52.6 mAh/g capacity retention. The block presents excellent cycle stability and capacity retention which can be attributed to the improvement of conductivity by the existence of carbon matrix and the enhancement of ability to relieve the large volume expansion of SiNWs during the lithium insertion/extraction cycle. The results indicate that the as-prepared carbon matrix/SiNWs heterogeneous block can be an attractive and potential anode material for lithium-ion battery applications.展开更多
The first path-independent insertion-loss（PILOSS） strictly non-blocking 4×4 silicon electro–optic switch matrix is reported. The footprint of this switch matrix is only 4.6 mm×1.0 mm. Using single-arm mod...The first path-independent insertion-loss（PILOSS） strictly non-blocking 4×4 silicon electro–optic switch matrix is reported. The footprint of this switch matrix is only 4.6 mm×1.0 mm. Using single-arm modulation, the crosstalk measured in this test is-13 dB --27 dB. And a maximum crosstalk deterioration of 6d B caused by two-path interference is also found.展开更多
Based on the block style spectral decomposition,this paper deals with the optimal backward perturbation analysis for the linear system with block cyclic coefficient matrix.
a Pole voltage waveforms (VA20 and VA40) for modulation index 0.4 (middle trace is A-phase voltage waveform) x-axis: 1 div.=10ms, y-axis: 1 div.= 100V b Normalized harmonic spectrum for pole voltage of Fig. 9a c A-pha...a Pole voltage waveforms (VA20 and VA40) for modulation index 0.4 (middle trace is A-phase voltage waveform) x-axis: 1 div.=10ms, y-axis: 1 div.= 100V b Normalized harmonic spectrum for pole voltage of Fig. 9a c A-phase current and phase voltage for modulation index 0.4 (reference space vector is in inner layer)展开更多
a Pole voltage waveforms (VA20 and VA40) for modulation index 0.4 (middle trace is A-phase voltage waveform) x-axis: 1 div.=10ms, y-axis: 1 div.= 100V b Normalized harmonic spectrum for pole voltage of Fig. 9a c A-pha...a Pole voltage waveforms (VA20 and VA40) for modulation index 0.4 (middle trace is A-phase voltage waveform) x-axis: 1 div.=10ms, y-axis: 1 div.= 100V b Normalized harmonic spectrum for pole voltage of Fig. 9a c A-phase current and phase voltage for modulation index 0.4 (reference space vector is in inner layer)展开更多
In this paper, we make further discussions and improvements on the results presented in the previously published work ＂Block H-matrices and spectrum of block matrices＂. Furthermore, a new bound for eigenvalues of bl...In this paper, we make further discussions and improvements on the results presented in the previously published work ＂Block H-matrices and spectrum of block matrices＂. Furthermore, a new bound for eigenvalues of block matrices is given with examples to show advantages of the new result.展开更多
The matrix Wiener algebra,W_(N):=M_(N)(W)of order N>0,is the matrix algebra formed by N×N matrices whose entries belong to the classical Wiener algebraWof functions with absolutely convergent Fourier series.A ...The matrix Wiener algebra,W_(N):=M_(N)(W)of order N>0,is the matrix algebra formed by N×N matrices whose entries belong to the classical Wiener algebraWof functions with absolutely convergent Fourier series.A block-Toeplitz matrix T(a)=[A_(i,j)]i,j≥0is a block semi-infinite matrix such that its blocks A_(i,j) are finite matrices of order N,A_(i,j)=A^(r,s) whenever i-j=r-s and its entries are the coefficients of the Fourier expansion of the generator a:T→M_(N)(C).Such a matrix can be regarded as a bounded linear operator acting on the direct sum of N copies of L^(2)(T).We show that exp(T(a))differes from T(exp(a))only in a compact operator with a known bound on its norm.In fact,we prove a slightly more general result:for every entire function f and for every compact operator E,there exists a compact operator F such that f(T(a)+E)=T(f(a))+F.We call these T(a)+E′s matrices,the quasi block-Toeplitz matrices,and we show that via a computation-friendly norm,they form a Banach algebra.Our results generalize and are motivated by some recent results of Dario Andrea Bini,Stefano Massei and Beatrice Meini.展开更多
We present some representations for the generalized Drazin inverse of a block matrix x =[cd ab]in a Banach algebra ~4 in terms of ad and （be）d under certain conditions,extending some recent result related to the gen...We present some representations for the generalized Drazin inverse of a block matrix x =[cd ab]in a Banach algebra ~4 in terms of ad and （be）d under certain conditions,extending some recent result related to the generalized Drazin inverse of an anti-triangular operator matrix. Also, several particular cases of this result are considered.展开更多
This work essentially consists in inverting in an exact, explicit, and original way the pentadiagonal Toeplitz matrix or tridiagonal block matrix resulting from the discretization of the two-dimensional Laplace operat...This work essentially consists in inverting in an exact, explicit, and original way the pentadiagonal Toeplitz matrix or tridiagonal block matrix resulting from the discretization of the two-dimensional Laplace operator. This method is an algorithm facilitating the resolution of a large number of problems governed by PDEs involving the Laplacian in two dimensions. It guarantees high precision and high efficiency in solving various differential equations.展开更多
Necessary and sufficient conditions for the existence of the group inverse of the block matrix in Minkowski Space are studied, where are both square and . The representation of this group inverse and some related addi...Necessary and sufficient conditions for the existence of the group inverse of the block matrix in Minkowski Space are studied, where are both square and . The representation of this group inverse and some related additive results are also given.展开更多
For the large sparse block two-by-two real nonsingular matrices, we establish a general framework of structured preconditioners through matrix transformation and matrix approximations. For the specific versions such a...For the large sparse block two-by-two real nonsingular matrices, we establish a general framework of structured preconditioners through matrix transformation and matrix approximations. For the specific versions such as modified block Jacobi-type, modified block Gauss-Seidel-type, and modified block unsymmetric (symmetric) Gauss-Seidel-type preconditioners, we precisely describe their concrete expressions and deliberately analyze eigenvalue distributions and positive definiteness of the preconditioned matrices. Also, we show that when these structured preconditioners are employed to precondition the Krylov subspace methods such as GMRES and restarted GMRES, fast and effective iteration solvers can be obtained for the large sparse systems of linear equations with block two-by-two coefficient matrices. In particular, these structured preconditioners can lead to high-quality preconditioning matrices for some typical matrices from the real-world applications.展开更多
We investigate the Furi-Martelli-Vignoli spectrum and the Feng spectrum of continuous nonlinear block operator matrices,and mainly describe the relationship between the Furi-Martelli-Vignoli spectrum(compared to the F...We investigate the Furi-Martelli-Vignoli spectrum and the Feng spectrum of continuous nonlinear block operator matrices,and mainly describe the relationship between the Furi-Martelli-Vignoli spectrum(compared to the Feng spectrum)of the whole operator matrix and that of its entries.In addition,the connection between the Furi-Martelli-Vignoli spectrum of the whole operator matrix and that of its Schur complement is presented by means of Schur decomposition.展开更多
In this paper,algorithms for finding the inverse of a factor block circulant matrix, a factor block retrocirculant matrix and partitioned matrix with factor block circulant blocks over the complex field are presented ...In this paper,algorithms for finding the inverse of a factor block circulant matrix, a factor block retrocirculant matrix and partitioned matrix with factor block circulant blocks over the complex field are presented respectively.In addition,two algorithms for the inverse of a factor block circulant matrix over the quaternion division algebra are proposed.展开更多
基金National Natural Science Foundation of China(Nos.41571410,41977067,42171422)。
文摘In this study,the problem of bundle adjustment was revisited,and a novel algorithm based on block matrix Cholesky decomposition was proposed to solve the thorny problem of self-calibration bundle adjustment.The innovation points are reflected in the following aspects:①The proposed algorithm is not dependent on the Schur complement,and the calculation process is simple and clear;②The complexities of time and space tend to O(n)in the context of world point number is far greater than that of images and cameras,so the calculation magnitude and memory consumption can be reduced significantly;③The proposed algorithm can carry out self-calibration bundle adjustment in single-camera,multi-camera,and variable-camera modes;④Some measures are employed to improve the optimization effects.Experimental tests showed that the proposed algorithm has the ability to achieve state-of-the-art performance in accuracy and robustness,and it has a strong adaptability as well,because the optimized results are accurate and robust even if the initial values have large deviations from the truth.This study could provide theoretical guidance and technical support for the image-based positioning and 3D reconstruction in the fields of photogrammetry,computer vision and robotics.
基金supported in part by the “Pioneer” and “Leading Goose” R&D Program of Zhejiang (Grant No. 2022C03174)the National Natural Science Foundation of China (No. 92067103)+4 种基金the Key Research and Development Program of Shaanxi (No.2021ZDLGY06- 02)the Natural Science Foundation of Shaanxi Province (No.2019ZDLGY12-02)the Shaanxi Innovation Team Project (No.2018TD007)the Xi’an Science and technology Innovation Plan (No.201809168CX9JC10)National 111 Program of China B16037
文摘Cloud computing provides powerful processing capabilities for large-scale intelligent Internet of things(IoT)terminals.However,the massive realtime data processing requirements challenge the existing cloud computing model.The edge server is closer to the data source.The end-edge-cloud collaboration offloads the cloud computing tasks to the edge environment,which solves the shortcomings of the cloud in resource storage,computing performance,and energy consumption.IoT terminals and sensors have caused security and privacy challenges due to resource constraints and exponential growth.As the key technology of IoT,Radio-Frequency Identification(RFID)authentication protocol tremendously strengthens privacy protection and improves IoT security.However,it inevitably increases system overhead while improving security,which is a major blow to low-cost RFID tags.The existing RFID authentication protocols are difficult to balance overhead and security.This paper designs an ultra-lightweight encryption function and proposes an RFID authentication scheme based on this function for the end-edge-cloud collaborative environment.The BAN logic proof and protocol verification tools AVISPA formally verify the protocol’s security.We use VIVADO to implement the encryption function and tag’s overhead on the FPGA platform.Performance evaluation indicates that the proposed protocol balances low computing costs and high-security requirements.
基金Natural Science Fund of Anhui Province of China (050420101)
文摘In order to alleviate the shortcomings of most blind deconvolution algorithms,this paper proposes an improved fast algorithm for blind deconvolution based on decorrelation technique and broadband block matrix.Althougth the original algorithm can overcome the shortcomings of current blind deconvolution algorithms,it has a constraint that the number of the source signals must be less than that of the channels.The improved algorithm deletes this constraint by using decorrelation technique.Besides,the improved algorithm raises the separation speed in terms of improving the computing methods of the output signal matrix.Simulation results demonstrate the validation and fast separation of the improved algorithm.
基金Supported by the Fund for Postdoctoral of China(2015M581688)Supported by the National Natural Science Foundation of China(11371089)+2 种基金Supported by the Specialized Research Fund for the Doctoral Program of Higher Education(20120092110020)Supported by the Natural Science Foundation of Jiangsu Province(BK20141327)Supported by the Foundation of Xuzhou Institute of Technology(XKY2014207)
文摘In this paper, we present a method how to get the expression for the group inverse of 2×2 block matrix and get the explicit expressions of the block matrix (A C B D) under some conditions.
基金supported by the grants from the National Natural Science Foundation of China(Nos.51002129,51172191 and 11074211)the National Basic Research Program of China(2012CB921303)+2 种基金the Doctoral Program of Higher Education(No.200805300003)the Hunan Provincial InnovationFoundation for Graduate(No.CX2012B265)the Open Fund Based on Innovation Platform of Hunan Colleges and Universities(No.13K045)
文摘A novel carbon matrix/silicon nanowires(SiNWs) heterogeneous block was successfully produced by dispersing SiNWs into templated carbon matrix via a modified evaporation induced self-assembly method. The heterogeneous block was determined by X-ray diffraction, Raman spectra and scanning electron microscopy. As an anode material for lithium batteries, the block was investigated by cyclic voltammograms(CV), charge/discharge tests, galvanostatic cycling performance and A. C. impedance spectroscopy. We show that the SiNWs disperse into the framework, and are nicely wrapped by the carbon matrix. The heterogeneous block exhibits superior electrochemical reversibility with a high specific capacity of 529.3 mAh/g in comparison with bare SiNWs anode with merely about 52.6 mAh/g capacity retention. The block presents excellent cycle stability and capacity retention which can be attributed to the improvement of conductivity by the existence of carbon matrix and the enhancement of ability to relieve the large volume expansion of SiNWs during the lithium insertion/extraction cycle. The results indicate that the as-prepared carbon matrix/SiNWs heterogeneous block can be an attractive and potential anode material for lithium-ion battery applications.
基金Project supported by the National Basic Research Program of China(Grant No.2011CB301701)the National High Technology Research and Development Program of China(Grant Nos.2013AA014402+2 种基金2012AA012202and 2015AA016904)the National Natural Science Foundation of China(Grant Nos.61275065 and 61107048)
文摘The first path-independent insertion-loss（PILOSS） strictly non-blocking 4×4 silicon electro–optic switch matrix is reported. The footprint of this switch matrix is only 4.6 mm×1.0 mm. Using single-arm modulation, the crosstalk measured in this test is-13 dB --27 dB. And a maximum crosstalk deterioration of 6d B caused by two-path interference is also found.
基金This project is SUpported by Natioanl Science Foundation of China
文摘Based on the block style spectral decomposition,this paper deals with the optimal backward perturbation analysis for the linear system with block cyclic coefficient matrix.
文摘a Pole voltage waveforms (VA20 and VA40) for modulation index 0.4 (middle trace is A-phase voltage waveform) x-axis: 1 div.=10ms, y-axis: 1 div.= 100V b Normalized harmonic spectrum for pole voltage of Fig. 9a c A-phase current and phase voltage for modulation index 0.4 (reference space vector is in inner layer)
文摘a Pole voltage waveforms (VA20 and VA40) for modulation index 0.4 (middle trace is A-phase voltage waveform) x-axis: 1 div.=10ms, y-axis: 1 div.= 100V b Normalized harmonic spectrum for pole voltage of Fig. 9a c A-phase current and phase voltage for modulation index 0.4 (reference space vector is in inner layer)
基金Project supported by the National Natural Science Foundation of China (No.10671164)Important Project Foundation of Hunan Education Department (No.06A070)
文摘In this paper, we make further discussions and improvements on the results presented in the previously published work ＂Block H-matrices and spectrum of block matrices＂. Furthermore, a new bound for eigenvalues of block matrices is given with examples to show advantages of the new result.
文摘The matrix Wiener algebra,W_(N):=M_(N)(W)of order N>0,is the matrix algebra formed by N×N matrices whose entries belong to the classical Wiener algebraWof functions with absolutely convergent Fourier series.A block-Toeplitz matrix T(a)=[A_(i,j)]i,j≥0is a block semi-infinite matrix such that its blocks A_(i,j) are finite matrices of order N,A_(i,j)=A^(r,s) whenever i-j=r-s and its entries are the coefficients of the Fourier expansion of the generator a:T→M_(N)(C).Such a matrix can be regarded as a bounded linear operator acting on the direct sum of N copies of L^(2)(T).We show that exp(T(a))differes from T(exp(a))only in a compact operator with a known bound on its norm.In fact,we prove a slightly more general result:for every entire function f and for every compact operator E,there exists a compact operator F such that f(T(a)+E)=T(f(a))+F.We call these T(a)+E′s matrices,the quasi block-Toeplitz matrices,and we show that via a computation-friendly norm,they form a Banach algebra.Our results generalize and are motivated by some recent results of Dario Andrea Bini,Stefano Massei and Beatrice Meini.
基金supported by the Ministry of Education and Science,Republic of Serbia(174007)
文摘We present some representations for the generalized Drazin inverse of a block matrix x =[cd ab]in a Banach algebra ~4 in terms of ad and （be）d under certain conditions,extending some recent result related to the generalized Drazin inverse of an anti-triangular operator matrix. Also, several particular cases of this result are considered.
文摘This work essentially consists in inverting in an exact, explicit, and original way the pentadiagonal Toeplitz matrix or tridiagonal block matrix resulting from the discretization of the two-dimensional Laplace operator. This method is an algorithm facilitating the resolution of a large number of problems governed by PDEs involving the Laplacian in two dimensions. It guarantees high precision and high efficiency in solving various differential equations.
文摘Necessary and sufficient conditions for the existence of the group inverse of the block matrix in Minkowski Space are studied, where are both square and . The representation of this group inverse and some related additive results are also given.
文摘For the large sparse block two-by-two real nonsingular matrices, we establish a general framework of structured preconditioners through matrix transformation and matrix approximations. For the specific versions such as modified block Jacobi-type, modified block Gauss-Seidel-type, and modified block unsymmetric (symmetric) Gauss-Seidel-type preconditioners, we precisely describe their concrete expressions and deliberately analyze eigenvalue distributions and positive definiteness of the preconditioned matrices. Also, we show that when these structured preconditioners are employed to precondition the Krylov subspace methods such as GMRES and restarted GMRES, fast and effective iteration solvers can be obtained for the large sparse systems of linear equations with block two-by-two coefficient matrices. In particular, these structured preconditioners can lead to high-quality preconditioning matrices for some typical matrices from the real-world applications.
基金Supported by the National Natural Science Foundation of China(2 0 0 0 CG0 1 0 3) the Fund of"The Developing Program for Outstanding Person"in NPUS & T Innovation Foundation for Young Teachers of Northwestern Polytechnical University.
文摘In this paper, the spectrum and characteristic polynomial for a special kind of symmetric block circulant matrices are given.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.11561048 and 11761029)the Natural Science Foundation of Inner Mongolia,China(Grant Nos.2019MS01019 and 2020ZD01)。
文摘We investigate the Furi-Martelli-Vignoli spectrum and the Feng spectrum of continuous nonlinear block operator matrices,and mainly describe the relationship between the Furi-Martelli-Vignoli spectrum(compared to the Feng spectrum)of the whole operator matrix and that of its entries.In addition,the connection between the Furi-Martelli-Vignoli spectrum of the whole operator matrix and that of its Schur complement is presented by means of Schur decomposition.
基金The research is partially supported by the 35th Postdoctoral Work of the National Science Foundation of China(2004035684).
文摘In this paper,algorithms for finding the inverse of a factor block circulant matrix, a factor block retrocirculant matrix and partitioned matrix with factor block circulant blocks over the complex field are presented respectively.In addition,two algorithms for the inverse of a factor block circulant matrix over the quaternion division algebra are proposed.
