The 1st-order symmetry energy coefficient of nuclear matter induced merely by the neutron-proton （n p） mass difference is derived analytically, which turns out to be completely model-independent. Based on this resul...The 1st-order symmetry energy coefficient of nuclear matter induced merely by the neutron-proton （n p） mass difference is derived analytically, which turns out to be completely model-independent. Based on this result, （npDM） the 1st-order symmetry energy Esym,1 （A） of heavy nuclei such as 2~spb induced by the np mass difference is investigated with the help of a local density approximation combined with the Skyrme energy density functionals. Although /U（npDM） Esym,1 （A） is small compared with the second-order symmetry energy, it cannot be dropped simply for an accurate estimation of nuclear masses as it is still larger than the rms deviation given by some accurate mass formulas. It is therefore suggested that one perhaps needs to distinguish the neutron mass from the proton one in the construction of nuclear density funetionals.展开更多
In this paper, we consider the initial-boundary value problem of two-dimensional first-order linear hyperbolic equation with variable coefficients. By using the upwind difference method to discretize the spatial deriv...In this paper, we consider the initial-boundary value problem of two-dimensional first-order linear hyperbolic equation with variable coefficients. By using the upwind difference method to discretize the spatial derivative term and the forward and backward Euler method to discretize the time derivative term, the explicit and implicit upwind difference schemes are obtained respectively. It is proved that the explicit upwind scheme is conditionally stable and the implicit upwind scheme is unconditionally stable. Then the convergence of the schemes is derived. Numerical examples verify the results of theoretical analysis.展开更多
This paper presents a method to characterize asphalt pavement macrotexture using the gray-tone difference matrix （GTDM）and discusses the potentials of the GTDM indicators for skid resistance evaluation.There are 37 ...This paper presents a method to characterize asphalt pavement macrotexture using the gray-tone difference matrix （GTDM）and discusses the potentials of the GTDM indicators for skid resistance evaluation.There are 37 field sites included in the data collection,which cover 6 types of asphalt pavement surfaces. The mean profile depth derived from 3-D macrotexture measurements （MPD3 ） has a significant relationship with the mean texture depth （MTD ）,which can be described by a logarithm model with R2 of 0.962.There is no significant linear relationship between the friction coefficient at a speed of 60 km/h （DFT60 ）and macrotexture indicators.A nonlinear model with British pendulum number （BPN ） incorporated can relate DFT60 to MTD or indicator fcon .A comparison with MTD shows that GTDM-based fcon has a potential to be a macrotexture indicator for skid resistance evaluation,which describes the general height difference and the average local height difference of pavement macrotexture. A relatively high fcon is helpful for improving asphalt pavement skid resistance.展开更多
A new method for solving the 1D Poisson equation is presented using the finite difference method. This method is based on the exact formulation of the inverse of the tridiagonal matrix associated with the Laplacian. T...A new method for solving the 1D Poisson equation is presented using the finite difference method. This method is based on the exact formulation of the inverse of the tridiagonal matrix associated with the Laplacian. This is the first time that the inverse of this remarkable matrix is determined directly and exactly. Thus, solving 1D Poisson equation becomes very accurate and extremely fast. This method is a very important tool for physics and engineering where the Poisson equation appears very often in the description of certain phenomena.展开更多
This study discussed the division of matrix- and fracture-type shale oils in the Jiyang Depression, and proposed the concept of fracture development coefficient. The fracture development coefficient is defined as the ...This study discussed the division of matrix- and fracture-type shale oils in the Jiyang Depression, and proposed the concept of fracture development coefficient. The fracture development coefficient is defined as the ratio of fault throw to the distance between a shale oil well and the nearest fault. Based on CO_2 content, state of water, oil production and logging response of shale oil formations, the classification of shale oils was established, i.e., a fracture-type shale oil well has a fracture development coefficient greater than 0.2, while a matrix-type one has a fracture development coefficient less than 0.2. Furthermore, the key control factors of matrix- and fracture-type shale oil enrichment were analyzed using typical anatomical and statistical methods. For matrix-type shale oil enrichment, these factors are lithofacies, total organic carbon（TOC）, shale porosity and abnormal pressure; for fracture-type shale oil enrichment, they are lithofacies, extent of fracture development, and abnormal pressure. This study also first described the differences between matrix- and fracture-type shale oils. The results provide reference for the exploration of terrestrial faulted basins in eastern China.展开更多
Kizmaz [13] studied the difference sequence spaces ∞（A）, c（A）, and co（A）. Several article dealt with the sets of sequences of m-th order difference of which are bounded, convergent, or convergent to zero. Alta...Kizmaz [13] studied the difference sequence spaces ∞（A）, c（A）, and co（A）. Several article dealt with the sets of sequences of m-th order difference of which are bounded, convergent, or convergent to zero. Altay and Basar [5] and Altay, Basar, and Mursaleen [7] introduced the Euler sequence spaces e0^r, ec^r, and e∞^r, respectively. The main purpose of this article is to introduce the spaces e0^r△^（m））, ec^r△^（m））, and e∞^r△^（m））consisting of all sequences whose mth order differences are in the Euler spaces e0^r, ec^r, and e∞^r, respectively. Moreover, the authors give some topological properties and inclusion relations, and determine the α-, β-, and γ-duals of the spaces e0^r△^（m））, ec^r△^（m））, and e∞^r△^（m））, and the Schauder basis of the spaces e0^r△^（m））, ec^r△^（m））. The last section of the article is devoted to the characterization of some matrix mappings on the sequence space ec^r△^（m））.展开更多
In the past, several authors studied spaces of m-th order difference sequences, among them, H.Polat and F.Basar （[17]） defined the Euler spaces of m-th order difference sequences e r 0 （△ （ m ） ）, e r c （△ （...In the past, several authors studied spaces of m-th order difference sequences, among them, H.Polat and F.Basar （[17]） defined the Euler spaces of m-th order difference sequences e r 0 （△ （ m ） ）, e r c （△ （ m ） ） and e r ∞ （△ （ m ） ） and characterized some classes of matrix transformations on them. In our paper, we add a new supplementary aspect to their research by characterizing classes of compact operators on those spaces. For that purpose, the spaces are treated as the matrix domains of a triangle in the classical sequence spaces c 0 , c and ∞ . The main tool for our characterizations is the Hausdorff measure of noncompactness.展开更多
In this article, using generalized weighted mean and difference matrix of order m, we introduce the paranormed sequence space l（u, v, p; △（m））, which consist of the sequences whose generalized weighted △（m）-di...In this article, using generalized weighted mean and difference matrix of order m, we introduce the paranormed sequence space l（u, v, p; △（m））, which consist of the sequences whose generalized weighted △（m）-difference means are in the linear space l（p） defined by I.J.Maddox. Also, we determine the basis of this space and compute its α-, β- and γ-duals. Further, we give the characterization of the classes of matrix mappings from l（u, v, p, △（m）） to l∞, c, and co. Finally, we apply the Hausdorff measure of noncompacness to characterize some classes of compact operators given by matrices on the space lp（U, v, △（m）） （1 ≤ p 〈 ∞）.展开更多
In this work, by extending the method of Hockney into three dimensions, the Poisson’s equation in cylindrical coordinates system with the Dirichlet’s boundary conditions in a portion of a cylinder for is solved dire...In this work, by extending the method of Hockney into three dimensions, the Poisson’s equation in cylindrical coordinates system with the Dirichlet’s boundary conditions in a portion of a cylinder for is solved directly. The Poisson equation is approximated by fourth-order finite differences and the resulting large algebraic system of linear equations is treated systematically in order to get a block tri-diagonal system. The accuracy of this method is tested for some Poisson’s equations with known analytical solutions and the numerical results obtained show that the method produces accurate results.展开更多
This work deals with a second order linear general equation with partial derivatives for a two-variable function. It covers a wide range of applications. This equation is solved with a finite difference hybrid method:...This work deals with a second order linear general equation with partial derivatives for a two-variable function. It covers a wide range of applications. This equation is solved with a finite difference hybrid method: BTCS + CTCS. This scheme is simple, precise, and economical in terms of time and space occupancy in memory.展开更多
An exact solution of a linear difference equation in a finite number of steps has been obtained. This refutes the conventional wisdom that a simple iterative method for solving a system of linear algebraic equations i...An exact solution of a linear difference equation in a finite number of steps has been obtained. This refutes the conventional wisdom that a simple iterative method for solving a system of linear algebraic equations is approximate. The nilpotency of the iteration matrix is the necessary and sufficient condition for getting an exact solution. The examples of iterative equations providing an exact solution to the simplest algebraic system are presented.展开更多
Unique correct correspondence cannot be obtained only by use of gray correlation technique, which describes gray similar degree of feature points between the left and right images too unilaterally. The gray correlatio...Unique correct correspondence cannot be obtained only by use of gray correlation technique, which describes gray similar degree of feature points between the left and right images too unilaterally. The gray correlation technique is adopted to extract gray correlation peaks as a coarse matching set called multi-peak set. The disparity gradient limited constraint is utilized to optimize the multi-peak set. Unique match will be obtained by calculating the correlation of hybrid matrices consisting of reference differences and disparities from the multi-peak set. Two of the known corresponding points in the left and right images, respectively, are set as a pair of reference points to determine search direction and search scope at first. After the unique correspondence is obtained by calculating the correlation of the hybrid matrices from the multi-peak set, the obtained match is regarded as a new reference point till all feature points in the left (or right) image have been processed. Experimental results proved that the proposed algorithm was feasible and accurate.展开更多
A new first-order optimality condition for the basis pursuit denoise （BPDN） problem is derived. This condition provides a new approach to choose the penalty param- eters adaptively for a fixed point iteration algori...A new first-order optimality condition for the basis pursuit denoise （BPDN） problem is derived. This condition provides a new approach to choose the penalty param- eters adaptively for a fixed point iteration algorithm. Meanwhile, the result is extended to matrix completion which is a new field on the heel of the compressed sensing. The numerical experiments of sparse vector recovery and low-rank matrix completion show validity of the theoretic results.展开更多
An innovative, extremely fast and accurate method is presented for Neumann-Dirichlet and Dirichlet-Neumann boundary problems for the Poisson equation, and the diffusion and wave equation in quasi-stationary regime;usi...An innovative, extremely fast and accurate method is presented for Neumann-Dirichlet and Dirichlet-Neumann boundary problems for the Poisson equation, and the diffusion and wave equation in quasi-stationary regime;using the finite difference method, in one dimensional case. Two novels matrices are determined allowing a direct and exact formulation of the solution of the Poisson equation. Verification is also done considering an interesting potential problem and the sensibility is determined. This new method has an algorithm complexity of O(N), its truncation error goes like O(h2), and it is more precise and faster than the Thomas algorithm.展开更多
This paper deals with the fixed-time adaptive time-varying matrix projective synchronization(ATVMPS)of different dimensional chaotic systems(DDCSs)with time delays and unknown parameters.Firstly,to estimate the unknow...This paper deals with the fixed-time adaptive time-varying matrix projective synchronization(ATVMPS)of different dimensional chaotic systems(DDCSs)with time delays and unknown parameters.Firstly,to estimate the unknown parameters,adaptive parameter updated laws are designed.Secondly,to realize the fixed-time ATVMPS of the time-delayed DDCSs,an adaptive delay-unrelated controller is designed,where time delays of chaotic systems are known or unknown.Thirdly,some simple fixed-time ATVMPS criteria are deduced,and the rigorous proof is provided by employing the inequality technique and Lyapunov theory.Furthermore,the settling time of fixed-time synchronization(Fix-TS)is obtained,which depends only on controller parameters and system parameters and is independent of the system’s initial states.Finally,simulation examples are presented to validate the theoretical analysis.展开更多
In this paper,we focus on inferring graph Laplacian matrix from the spatiotemporal signal which is defined as“time-vertex signal”.To realize this,we first represent the signals on a joint graph which is the Cartesia...In this paper,we focus on inferring graph Laplacian matrix from the spatiotemporal signal which is defined as“time-vertex signal”.To realize this,we first represent the signals on a joint graph which is the Cartesian product graph of the time-and vertex-graphs.By assuming the signals follow a Gaussian prior distribution on the joint graph,a meaningful representation that promotes the smoothness property of the joint graph signal is derived.Furthermore,by decoupling the joint graph,the graph learning framework is formulated as a joint optimization problem which includes signal denoising,timeand vertex-graphs learning together.Specifically,two algorithms are proposed to solve the optimization problem,where the discrete second-order difference operator with reversed sign(DSODO)in the time domain is used as the time-graph Laplacian operator to recover the signal and infer a vertex-graph in the first algorithm,and the time-graph,as well as the vertex-graph,is estimated by the other algorithm.Experiments on both synthetic and real-world datasets demonstrate that the proposed algorithms can effectively infer meaningful time-and vertex-graphs from noisy and incomplete data.展开更多
In this paper,we propose a novel approach to recognise human activities from a different view.Although appearance-based recognition methods have been shown to be unsuitable for action recognition for varying views,the...In this paper,we propose a novel approach to recognise human activities from a different view.Although appearance-based recognition methods have been shown to be unsuitable for action recognition for varying views,there must be some regularity among the same action sequences of different views.Selfsimilarity matrices appear to be relative stable across views.However,the ability to effectively realise this stability is a problem.In this paper,we extract the shape-flow descriptor as the low-level feature and then choose the same number of key frames from the action sequences.Self-similarity matrices are obtained by computing the similarity between any pair of the key frames.The diagonal features of the similarity matrices are extracted as the highlevel feature representation of the action sequence and Support Vector Machines(SVM) is employed for classification.We test our approach on the IXMAS multi-view data set.The proposed approach is simple but effective when compared with other algorithms.展开更多
In 3D frequency domain seismic forward and inversion calculation,the huge amount of calculation and storage is one of the main factors that restrict the processing speed and calculation efficiency.The frequency domain...In 3D frequency domain seismic forward and inversion calculation,the huge amount of calculation and storage is one of the main factors that restrict the processing speed and calculation efficiency.The frequency domain finite-difference forward simulation algorithm based on the acoustic wave equation establishes a large bandwidth complex matrix according to the discretized acoustic wave equation,and then the frequency domain wave field value is obtained by solving the matrix equation.In this study,the predecessor's optimized five-point method is extended to a 3D seven-point finite-difference scheme,and then a perfectly matched layer absorbing boundary condition(PML)is added to establish the corresponding matrix equation.In order to solve the complex matrix,we transform it to the equivalent real number domain to expand the solvable range of the matrix,and establish two objective functions to transform the matrix solving problem into an optimization problem that can be solved using gradient methods,and then use conjugate gradient algorithm to solve the problem.Previous studies have shown that in the conjugate gradient algorithm,the product of the matrix and the vector is the main factor that affects the calculation efficiency.Therefore,this study proposes a method that transform bandwidth matrix and vector product problem into some equivalent vector and vector product algorithm,thereby reducing the amount of calculation and storage.展开更多
基金Supported by the National Natural Science Foundation of China under Grant Nos 11405223,11175219,11275271 and 11435014the National Basic Research Program of China under Grant No 2013CB834405+3 种基金the Knowledge Innovation Project of Chinese Academy of Sciences under Grant No KJCX2-EW-N01the Funds for Creative Research Groups of China under Grant No 11321064the Youth Innovation Promotion Association of Chinese Academy of Sciencesthe K.C.Wong Education Foundation
文摘The 1st-order symmetry energy coefficient of nuclear matter induced merely by the neutron-proton （n p） mass difference is derived analytically, which turns out to be completely model-independent. Based on this result, （npDM） the 1st-order symmetry energy Esym,1 （A） of heavy nuclei such as 2~spb induced by the np mass difference is investigated with the help of a local density approximation combined with the Skyrme energy density functionals. Although /U（npDM） Esym,1 （A） is small compared with the second-order symmetry energy, it cannot be dropped simply for an accurate estimation of nuclear masses as it is still larger than the rms deviation given by some accurate mass formulas. It is therefore suggested that one perhaps needs to distinguish the neutron mass from the proton one in the construction of nuclear density funetionals.
文摘In this paper, we consider the initial-boundary value problem of two-dimensional first-order linear hyperbolic equation with variable coefficients. By using the upwind difference method to discretize the spatial derivative term and the forward and backward Euler method to discretize the time derivative term, the explicit and implicit upwind difference schemes are obtained respectively. It is proved that the explicit upwind scheme is conditionally stable and the implicit upwind scheme is unconditionally stable. Then the convergence of the schemes is derived. Numerical examples verify the results of theoretical analysis.
基金The National Natural Science Foundation of China(No.50908004,51178013)
文摘This paper presents a method to characterize asphalt pavement macrotexture using the gray-tone difference matrix （GTDM）and discusses the potentials of the GTDM indicators for skid resistance evaluation.There are 37 field sites included in the data collection,which cover 6 types of asphalt pavement surfaces. The mean profile depth derived from 3-D macrotexture measurements （MPD3 ） has a significant relationship with the mean texture depth （MTD ）,which can be described by a logarithm model with R2 of 0.962.There is no significant linear relationship between the friction coefficient at a speed of 60 km/h （DFT60 ）and macrotexture indicators.A nonlinear model with British pendulum number （BPN ） incorporated can relate DFT60 to MTD or indicator fcon .A comparison with MTD shows that GTDM-based fcon has a potential to be a macrotexture indicator for skid resistance evaluation,which describes the general height difference and the average local height difference of pavement macrotexture. A relatively high fcon is helpful for improving asphalt pavement skid resistance.
文摘A new method for solving the 1D Poisson equation is presented using the finite difference method. This method is based on the exact formulation of the inverse of the tridiagonal matrix associated with the Laplacian. This is the first time that the inverse of this remarkable matrix is determined directly and exactly. Thus, solving 1D Poisson equation becomes very accurate and extremely fast. This method is a very important tool for physics and engineering where the Poisson equation appears very often in the description of certain phenomena.
基金supported by the National Basic Research Program of China(973 Program)(Grant No2014CB239104)
文摘This study discussed the division of matrix- and fracture-type shale oils in the Jiyang Depression, and proposed the concept of fracture development coefficient. The fracture development coefficient is defined as the ratio of fault throw to the distance between a shale oil well and the nearest fault. Based on CO_2 content, state of water, oil production and logging response of shale oil formations, the classification of shale oils was established, i.e., a fracture-type shale oil well has a fracture development coefficient greater than 0.2, while a matrix-type one has a fracture development coefficient less than 0.2. Furthermore, the key control factors of matrix- and fracture-type shale oil enrichment were analyzed using typical anatomical and statistical methods. For matrix-type shale oil enrichment, these factors are lithofacies, total organic carbon（TOC）, shale porosity and abnormal pressure; for fracture-type shale oil enrichment, they are lithofacies, extent of fracture development, and abnormal pressure. This study also first described the differences between matrix- and fracture-type shale oils. The results provide reference for the exploration of terrestrial faulted basins in eastern China.
文摘Kizmaz [13] studied the difference sequence spaces ∞（A）, c（A）, and co（A）. Several article dealt with the sets of sequences of m-th order difference of which are bounded, convergent, or convergent to zero. Altay and Basar [5] and Altay, Basar, and Mursaleen [7] introduced the Euler sequence spaces e0^r, ec^r, and e∞^r, respectively. The main purpose of this article is to introduce the spaces e0^r△^（m））, ec^r△^（m））, and e∞^r△^（m））consisting of all sequences whose mth order differences are in the Euler spaces e0^r, ec^r, and e∞^r, respectively. Moreover, the authors give some topological properties and inclusion relations, and determine the α-, β-, and γ-duals of the spaces e0^r△^（m））, ec^r△^（m））, and e∞^r△^（m））, and the Schauder basis of the spaces e0^r△^（m））, ec^r△^（m））. The last section of the article is devoted to the characterization of some matrix mappings on the sequence space ec^r△^（m））.
基金supported by the research project#144003 of the Serbian Ministry of Science, Technology and Development
文摘In the past, several authors studied spaces of m-th order difference sequences, among them, H.Polat and F.Basar （[17]） defined the Euler spaces of m-th order difference sequences e r 0 （△ （ m ） ）, e r c （△ （ m ） ） and e r ∞ （△ （ m ） ） and characterized some classes of matrix transformations on them. In our paper, we add a new supplementary aspect to their research by characterizing classes of compact operators on those spaces. For that purpose, the spaces are treated as the matrix domains of a triangle in the classical sequence spaces c 0 , c and ∞ . The main tool for our characterizations is the Hausdorff measure of noncompactness.
文摘In this article, using generalized weighted mean and difference matrix of order m, we introduce the paranormed sequence space l（u, v, p; △（m））, which consist of the sequences whose generalized weighted △（m）-difference means are in the linear space l（p） defined by I.J.Maddox. Also, we determine the basis of this space and compute its α-, β- and γ-duals. Further, we give the characterization of the classes of matrix mappings from l（u, v, p, △（m）） to l∞, c, and co. Finally, we apply the Hausdorff measure of noncompacness to characterize some classes of compact operators given by matrices on the space lp（U, v, △（m）） （1 ≤ p 〈 ∞）.
文摘In this work, by extending the method of Hockney into three dimensions, the Poisson’s equation in cylindrical coordinates system with the Dirichlet’s boundary conditions in a portion of a cylinder for is solved directly. The Poisson equation is approximated by fourth-order finite differences and the resulting large algebraic system of linear equations is treated systematically in order to get a block tri-diagonal system. The accuracy of this method is tested for some Poisson’s equations with known analytical solutions and the numerical results obtained show that the method produces accurate results.
文摘This work deals with a second order linear general equation with partial derivatives for a two-variable function. It covers a wide range of applications. This equation is solved with a finite difference hybrid method: BTCS + CTCS. This scheme is simple, precise, and economical in terms of time and space occupancy in memory.
文摘An exact solution of a linear difference equation in a finite number of steps has been obtained. This refutes the conventional wisdom that a simple iterative method for solving a system of linear algebraic equations is approximate. The nilpotency of the iteration matrix is the necessary and sufficient condition for getting an exact solution. The examples of iterative equations providing an exact solution to the simplest algebraic system are presented.
文摘Unique correct correspondence cannot be obtained only by use of gray correlation technique, which describes gray similar degree of feature points between the left and right images too unilaterally. The gray correlation technique is adopted to extract gray correlation peaks as a coarse matching set called multi-peak set. The disparity gradient limited constraint is utilized to optimize the multi-peak set. Unique match will be obtained by calculating the correlation of hybrid matrices consisting of reference differences and disparities from the multi-peak set. Two of the known corresponding points in the left and right images, respectively, are set as a pair of reference points to determine search direction and search scope at first. After the unique correspondence is obtained by calculating the correlation of the hybrid matrices from the multi-peak set, the obtained match is regarded as a new reference point till all feature points in the left (or right) image have been processed. Experimental results proved that the proposed algorithm was feasible and accurate.
基金supported by the National Natural Science Foundation of China(No.61271014)the Specialized Research Fund for the Doctoral Program of Higher Education(No.20124301110003)the Graduated Students Innovation Fund of Hunan Province(No.CX2012B238)
文摘A new first-order optimality condition for the basis pursuit denoise （BPDN） problem is derived. This condition provides a new approach to choose the penalty param- eters adaptively for a fixed point iteration algorithm. Meanwhile, the result is extended to matrix completion which is a new field on the heel of the compressed sensing. The numerical experiments of sparse vector recovery and low-rank matrix completion show validity of the theoretic results.
文摘An innovative, extremely fast and accurate method is presented for Neumann-Dirichlet and Dirichlet-Neumann boundary problems for the Poisson equation, and the diffusion and wave equation in quasi-stationary regime;using the finite difference method, in one dimensional case. Two novels matrices are determined allowing a direct and exact formulation of the solution of the Poisson equation. Verification is also done considering an interesting potential problem and the sensibility is determined. This new method has an algorithm complexity of O(N), its truncation error goes like O(h2), and it is more precise and faster than the Thomas algorithm.
基金supported by the National Natural Science Foundation of China under Grant 61977004.This support is gratefully acknowledged.
文摘This paper deals with the fixed-time adaptive time-varying matrix projective synchronization(ATVMPS)of different dimensional chaotic systems(DDCSs)with time delays and unknown parameters.Firstly,to estimate the unknown parameters,adaptive parameter updated laws are designed.Secondly,to realize the fixed-time ATVMPS of the time-delayed DDCSs,an adaptive delay-unrelated controller is designed,where time delays of chaotic systems are known or unknown.Thirdly,some simple fixed-time ATVMPS criteria are deduced,and the rigorous proof is provided by employing the inequality technique and Lyapunov theory.Furthermore,the settling time of fixed-time synchronization(Fix-TS)is obtained,which depends only on controller parameters and system parameters and is independent of the system’s initial states.Finally,simulation examples are presented to validate the theoretical analysis.
基金supported by the National Natural Science Foundation of China(Grant No.61966007)Key Laboratory of Cognitive Radio and Information Processing,Ministry of Education(No.CRKL180106,No.CRKL180201)+1 种基金Guangxi Key Laboratory of Wireless Wideband Communication and Signal Processing,Guilin University of Electronic Technology(No.GXKL06180107,No.GXKL06190117)Guangxi Colleges and Universities Key Laboratory of Satellite Navigation and Position Sensing.
文摘In this paper,we focus on inferring graph Laplacian matrix from the spatiotemporal signal which is defined as“time-vertex signal”.To realize this,we first represent the signals on a joint graph which is the Cartesian product graph of the time-and vertex-graphs.By assuming the signals follow a Gaussian prior distribution on the joint graph,a meaningful representation that promotes the smoothness property of the joint graph signal is derived.Furthermore,by decoupling the joint graph,the graph learning framework is formulated as a joint optimization problem which includes signal denoising,timeand vertex-graphs learning together.Specifically,two algorithms are proposed to solve the optimization problem,where the discrete second-order difference operator with reversed sign(DSODO)in the time domain is used as the time-graph Laplacian operator to recover the signal and infer a vertex-graph in the first algorithm,and the time-graph,as well as the vertex-graph,is estimated by the other algorithm.Experiments on both synthetic and real-world datasets demonstrate that the proposed algorithms can effectively infer meaningful time-and vertex-graphs from noisy and incomplete data.
基金supported by a Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions(Information and Communication Engineering)the Natural Science Foundation of Jiangsu Province under Grant No.BK2010523+2 种基金the National Natural Science Foundation of China under Grants No.61172118,No.61001152the University Natural Science Research Project of Jiangsu Province under Grant No.11KJB510012the Scientific Research Foundation of Nanjing University of Posts and Telecommunications under Grant No.NY210073
文摘In this paper,we propose a novel approach to recognise human activities from a different view.Although appearance-based recognition methods have been shown to be unsuitable for action recognition for varying views,there must be some regularity among the same action sequences of different views.Selfsimilarity matrices appear to be relative stable across views.However,the ability to effectively realise this stability is a problem.In this paper,we extract the shape-flow descriptor as the low-level feature and then choose the same number of key frames from the action sequences.Self-similarity matrices are obtained by computing the similarity between any pair of the key frames.The diagonal features of the similarity matrices are extracted as the highlevel feature representation of the action sequence and Support Vector Machines(SVM) is employed for classification.We test our approach on the IXMAS multi-view data set.The proposed approach is simple but effective when compared with other algorithms.
基金supported by the National Natural Science Foundation of China(Project U1901602&41790465)Key Special Project for Introduced Talents Team of Southern Marine Science and Engineering Guangdong Laboratory(Guangzhou)(GML2019ZD0203)+2 种基金Shenzhen Key Laboratory of Deep Offshore Oil and Gas Exploration Technology(Grant No.ZDSYS20190902093007855)Shenzhen Science and Technology Program(Grant No.KQTD20170810111725321)the leading talents of Guangdong province program(Grant No.2016LJ06N652).
文摘In 3D frequency domain seismic forward and inversion calculation,the huge amount of calculation and storage is one of the main factors that restrict the processing speed and calculation efficiency.The frequency domain finite-difference forward simulation algorithm based on the acoustic wave equation establishes a large bandwidth complex matrix according to the discretized acoustic wave equation,and then the frequency domain wave field value is obtained by solving the matrix equation.In this study,the predecessor's optimized five-point method is extended to a 3D seven-point finite-difference scheme,and then a perfectly matched layer absorbing boundary condition(PML)is added to establish the corresponding matrix equation.In order to solve the complex matrix,we transform it to the equivalent real number domain to expand the solvable range of the matrix,and establish two objective functions to transform the matrix solving problem into an optimization problem that can be solved using gradient methods,and then use conjugate gradient algorithm to solve the problem.Previous studies have shown that in the conjugate gradient algorithm,the product of the matrix and the vector is the main factor that affects the calculation efficiency.Therefore,this study proposes a method that transform bandwidth matrix and vector product problem into some equivalent vector and vector product algorithm,thereby reducing the amount of calculation and storage.
