We deal with a consensus control problem for a group of third order agents which are networked by digraphs.Assuming that the control input of each agent is constructed based on weighted difference between its states a...We deal with a consensus control problem for a group of third order agents which are networked by digraphs.Assuming that the control input of each agent is constructed based on weighted difference between its states and those of its neighbor agents, we aim to propose an algorithm on computing the weighting coefficients in the control input. The problem is reduced to designing Hurwitz polynomials with real or complex coefficients. We show that by using Hurwitz polynomials with complex coefficients, a necessary and sufficient condition can be obtained for designing the consensus algorithm. Since the condition is both necessary and sufficient, we provide a kind of parametrization for all the weighting coefficients achieving consensus. Moreover, the condition is a natural extension to second order consensus, and is reasonable and practical due to its comparatively decreased computation burden. The result is also extended to the case where communication delay exists in the control input.展开更多
The Gaussian kernel operators on white noise functional spaces, including second quantization, Fourier-Mehler transform, scaling, renormalization, etc. are studied by means of symbol calculus, and characterized by the...The Gaussian kernel operators on white noise functional spaces, including second quantization, Fourier-Mehler transform, scaling, renormalization, etc. are studied by means of symbol calculus, and characterized by the intertwining relations with annihilation and creation operators. The infinitesimal generators of the Gaussian kernel operators are second order white noise operators of which the number operator and the Gross Laplacian are particular examples.展开更多
The theory of phase transitions is one of the branches of statistical physics in which smoothness and continuity play an important role. In fact, phase transitions are characterized mathematically by the degree of non...The theory of phase transitions is one of the branches of statistical physics in which smoothness and continuity play an important role. In fact, phase transitions are characterized mathematically by the degree of non-analyticity of the thermodynamic potentials associated with the given system. In this paper, we propose a method that is not based on cluster expansions for computing the higher derivatives of the free energy and estimating the error between the finite and infinite volume free energy in certain continuum gas models. Our approach is suitable for a direct proof of the analyticity of the pressure or free energy in certain models of Kac-type. The methods known up to now strongly rely on the validity of the cluster expansion. An extension of the method to classical lattice gas models is also discussed.展开更多
What is the suitable Laplace operator on vector fields for the Navier-Stokes equation on a Riemannian manifold?In this note,by considering Nash embedding,we will try to elucidate different aspects of different Laplace...What is the suitable Laplace operator on vector fields for the Navier-Stokes equation on a Riemannian manifold?In this note,by considering Nash embedding,we will try to elucidate different aspects of different Laplace operators such as de Rham-Hodge Laplacian as well as Ebin-Marsden’s Laplacian.A probabilistic representation formula for Navier-Stokes equations on a general compact Riemannian manifold is obtained when de Rham-Hodge Laplacian is involved.展开更多
We present a direct and short proof of the non-degeneracy of the harmonic structures on the level-n Sierpinski gaskets for any n≥2,which was conjectured by Hino in[1,2]and confirmed to be true by Tsougkas[8]very rece...We present a direct and short proof of the non-degeneracy of the harmonic structures on the level-n Sierpinski gaskets for any n≥2,which was conjectured by Hino in[1,2]and confirmed to be true by Tsougkas[8]very recently using Tutte’s spring theorem.展开更多
A new (non-unitary) representation of the general linear group of white noise space on Hida’s test and distribution spaces is presented. The relevant representative operators are natural generalization of Fourier-Meh...A new (non-unitary) representation of the general linear group of white noise space on Hida’s test and distribution spaces is presented. The relevant representative operators are natural generalization of Fourier-Mehler transforms.展开更多
In this paper,we introduce a special class of nilpotent Lie groups defined by hermitian maps,which includes all the groups of affine holomorphic automorphisims of Siegel domains of type Ⅱ,in particular,the Heisenberg...In this paper,we introduce a special class of nilpotent Lie groups defined by hermitian maps,which includes all the groups of affine holomorphic automorphisims of Siegel domains of type Ⅱ,in particular,the Heisenberg group.And we study harmonic analysis on these groups as spectral theory of the associated Sub-Laplacian instead of the group representation theory in usual way.展开更多
In the paper, we propose a robust and fast image denoising method. The approach integrates both Non- Local means algorithm and Laplacian Pyramid. Given an image to be denoised, we first decompose it into Laplacian pyr...In the paper, we propose a robust and fast image denoising method. The approach integrates both Non- Local means algorithm and Laplacian Pyramid. Given an image to be denoised, we first decompose it into Laplacian pyramid. Exploiting the redundancy property of Laplacian pyramid, we then perform non-local means on every level image of Laplacian pyramid. Essentially, we use the similarity of image features in Laplacian pyramid to act as weight to denoise image. Since the features extracted in Laplacian pyramid are localized in spatial position and scale, they are much more able to describe image, and computing the similarity between them is more reasonable and more robust. Also, based on the efficient Summed Square Image （SSI） scheme and Fast Fourier Transform （FFT）, we present an accelerating algorithm to break the bottleneck of non-local means algorithm - similarity computation of compare windows. After speedup, our algorithm is fifty times faster than original non-local means algorithm. Experiments demonstrated the effectiveness of our algorithm.展开更多
In this work we propose a centrality measure for networks, which we refer to as Laplacian centrality, that provides a general framework for the centrality of a vertex based on the idea that the importance (or centrali...In this work we propose a centrality measure for networks, which we refer to as Laplacian centrality, that provides a general framework for the centrality of a vertex based on the idea that the importance (or centrality) of a vertex is related to the ability of the network to respond to the deactivation or removal of that vertex from the network. In particular, the Laplacian centrality of a vertex is defined as the relative drop of Laplacian energy caused by the deactivation of this vertex. The Laplacian energy of network G with?n?vertices is defined as , where ?is the eigenvalue of the Laplacian matrix of G. Other dynamics based measures such as that of Masuda and Kori and PageRank compute the importance of a node by analyzing the way paths pass through a node while our measure captures this information as well as the way these paths are “redistributed” when the node is deleted. The validity and robustness of this new measure are illustrated on two different terrorist social network data sets and 84 networks in James Moody’s Add Health in school friendship nomination data, and is compared with other standard centrality measures.展开更多
基金supported by Japan Ministry of Education,Sciences and Culture(C21560471)the National Natural Science Foundation of China(61603268)+1 种基金the Research Project Supported by Shanxi Scholarship Council of China(2015-044)the Fundamental Research Project of Shanxi Province(2015021085)
文摘We deal with a consensus control problem for a group of third order agents which are networked by digraphs.Assuming that the control input of each agent is constructed based on weighted difference between its states and those of its neighbor agents, we aim to propose an algorithm on computing the weighting coefficients in the control input. The problem is reduced to designing Hurwitz polynomials with real or complex coefficients. We show that by using Hurwitz polynomials with complex coefficients, a necessary and sufficient condition can be obtained for designing the consensus algorithm. Since the condition is both necessary and sufficient, we provide a kind of parametrization for all the weighting coefficients achieving consensus. Moreover, the condition is a natural extension to second order consensus, and is reasonable and practical due to its comparatively decreased computation burden. The result is also extended to the case where communication delay exists in the control input.
文摘The Gaussian kernel operators on white noise functional spaces, including second quantization, Fourier-Mehler transform, scaling, renormalization, etc. are studied by means of symbol calculus, and characterized by the intertwining relations with annihilation and creation operators. The infinitesimal generators of the Gaussian kernel operators are second order white noise operators of which the number operator and the Gross Laplacian are particular examples.
文摘The theory of phase transitions is one of the branches of statistical physics in which smoothness and continuity play an important role. In fact, phase transitions are characterized mathematically by the degree of non-analyticity of the thermodynamic potentials associated with the given system. In this paper, we propose a method that is not based on cluster expansions for computing the higher derivatives of the free energy and estimating the error between the finite and infinite volume free energy in certain continuum gas models. Our approach is suitable for a direct proof of the analyticity of the pressure or free energy in certain models of Kac-type. The methods known up to now strongly rely on the validity of the cluster expansion. An extension of the method to classical lattice gas models is also discussed.
文摘What is the suitable Laplace operator on vector fields for the Navier-Stokes equation on a Riemannian manifold?In this note,by considering Nash embedding,we will try to elucidate different aspects of different Laplace operators such as de Rham-Hodge Laplacian as well as Ebin-Marsden’s Laplacian.A probabilistic representation formula for Navier-Stokes equations on a general compact Riemannian manifold is obtained when de Rham-Hodge Laplacian is involved.
基金the Nature Science Foundation of China,Grant No.12071213.
文摘We present a direct and short proof of the non-degeneracy of the harmonic structures on the level-n Sierpinski gaskets for any n≥2,which was conjectured by Hino in[1,2]and confirmed to be true by Tsougkas[8]very recently using Tutte’s spring theorem.
文摘A new (non-unitary) representation of the general linear group of white noise space on Hida’s test and distribution spaces is presented. The relevant representative operators are natural generalization of Fourier-Mehler transforms.
文摘In this paper,we introduce a special class of nilpotent Lie groups defined by hermitian maps,which includes all the groups of affine holomorphic automorphisims of Siegel domains of type Ⅱ,in particular,the Heisenberg group.And we study harmonic analysis on these groups as spectral theory of the associated Sub-Laplacian instead of the group representation theory in usual way.
基金This work is supported by the National Grand Fundamental Research 973 Program of China(Grant No.2002CB312101)the National Natural Science Foundation of China(Grant Nos.60403038 and 60703084)the Natural Science Foundation of Jiangsu Province(Grant No.BK2007571).
文摘In the paper, we propose a robust and fast image denoising method. The approach integrates both Non- Local means algorithm and Laplacian Pyramid. Given an image to be denoised, we first decompose it into Laplacian pyramid. Exploiting the redundancy property of Laplacian pyramid, we then perform non-local means on every level image of Laplacian pyramid. Essentially, we use the similarity of image features in Laplacian pyramid to act as weight to denoise image. Since the features extracted in Laplacian pyramid are localized in spatial position and scale, they are much more able to describe image, and computing the similarity between them is more reasonable and more robust. Also, based on the efficient Summed Square Image （SSI） scheme and Fast Fourier Transform （FFT）, we present an accelerating algorithm to break the bottleneck of non-local means algorithm - similarity computation of compare windows. After speedup, our algorithm is fifty times faster than original non-local means algorithm. Experiments demonstrated the effectiveness of our algorithm.
文摘In this work we propose a centrality measure for networks, which we refer to as Laplacian centrality, that provides a general framework for the centrality of a vertex based on the idea that the importance (or centrality) of a vertex is related to the ability of the network to respond to the deactivation or removal of that vertex from the network. In particular, the Laplacian centrality of a vertex is defined as the relative drop of Laplacian energy caused by the deactivation of this vertex. The Laplacian energy of network G with?n?vertices is defined as , where ?is the eigenvalue of the Laplacian matrix of G. Other dynamics based measures such as that of Masuda and Kori and PageRank compute the importance of a node by analyzing the way paths pass through a node while our measure captures this information as well as the way these paths are “redistributed” when the node is deleted. The validity and robustness of this new measure are illustrated on two different terrorist social network data sets and 84 networks in James Moody’s Add Health in school friendship nomination data, and is compared with other standard centrality measures.
