Based on protein-DNA complex crystal structural data in up-to-date Nucleic Acid Database,the related parameters of DNA Kinetic Structure were investigated by Monte-Carlo Multiple Integrals on the base of modified DNA ...Based on protein-DNA complex crystal structural data in up-to-date Nucleic Acid Database,the related parameters of DNA Kinetic Structure were investigated by Monte-Carlo Multiple Integrals on the base of modified DNA structure statistical mechanical model,and time complexity and precision were analyzed on the calculated results.展开更多
The problem caused by shortness or excessiveness of snapshots and by coherent sources in underwater acoustic positioning is considered.A matched field localization algorithm based on CS-MUSIC(Compressive Sensing Multi...The problem caused by shortness or excessiveness of snapshots and by coherent sources in underwater acoustic positioning is considered.A matched field localization algorithm based on CS-MUSIC(Compressive Sensing Multiple Signal Classification) is proposed based on the sparse mathematical model of the underwater positioning.The signal matrix is calculated through the SVD(Singular Value Decomposition) of the observation matrix.The observation matrix in the sparse mathematical model is replaced by the signal matrix,and a new concise sparse mathematical model is obtained,which means not only the scale of the localization problem but also the noise level is reduced;then the new sparse mathematical model is solved by the CS-MUSIC algorithm which is a combination of CS(Compressive Sensing) method and MUSIC(Multiple Signal Classification) method.The algorithm proposed in this paper can overcome effectively the difficulties caused by correlated sources and shortness of snapshots,and it can also reduce the time complexity and noise level of the localization problem by using the SVD of the observation matrix when the number of snapshots is large,which will be proved in this paper.展开更多
Future space missions demand operations on large flexible structures,for example,space webs,the lightweight cable nets deployable in space,which can serve as platforms for very large structures or be used to capture o...Future space missions demand operations on large flexible structures,for example,space webs,the lightweight cable nets deployable in space,which can serve as platforms for very large structures or be used to capture orbital objects.The interest in research on space webs is likely to increase in the future with the development of promising applications such as Furoshiki sat-ellite of JAXA,Robotic Geostationary Orbit Restorer (ROGER) of ESA and Grapple,Retrieve And Secure Payload (GRASP) of NASA.Unlike high-tensioned nets in civil engineering,space webs may be low-tensioned or tensionless,and extremely flexible,owing to the microgravity in the orbit and the lack of support components,which may cause computational difficulties.Mathematical models are necessary in the analysis of space webs,especially in the conceptual design and evaluation for prototypes.A full three-dimensional finite element (FE) model was developed in this work.Trivial truss elements were adopted to reduce the computational complexity.Considering cable is a compression-free material and its tensile stiffness is also variable,we introduced the cable material constitutive relationship to work out an accurate and feasible model for prototype analysis and design.In the static analysis,the stress distribution and global deformation of the webs were discussed to get access to the knowledge of strength of webs with different types of meshes.In the dynamic analysis,special attention was paid to the impact problem.The max stress and global deformation were investigated.The simulation results indicate the interesting phenomenon which may be worth further research.展开更多
In some fields such as Mathematics Mechanization, automated reasoning and Trustworthy Computing, etc., exact results are needed. Symbolic computations are used to obtain the exact results. Symbolic computations are of...In some fields such as Mathematics Mechanization, automated reasoning and Trustworthy Computing, etc., exact results are needed. Symbolic computations are used to obtain the exact results. Symbolic computations are of high complexity. In order to improve the situation, exact interpolating methods are often proposed for the exact results and approximate interpolating methods for the ap- proximate ones. In this paper, the authors study how to obtain exact interpolation polynomial with rational coefficients by approximate interpolating methods.展开更多
基金Supported by Inner Mongolia Natural Science Foundation(200711020112)Innovation Fundation of Inner Mongolia University of Science and Technology (2009NC064)~~
文摘Based on protein-DNA complex crystal structural data in up-to-date Nucleic Acid Database,the related parameters of DNA Kinetic Structure were investigated by Monte-Carlo Multiple Integrals on the base of modified DNA structure statistical mechanical model,and time complexity and precision were analyzed on the calculated results.
基金supported by the National Natural Science Foundation of China (61202208)
文摘The problem caused by shortness or excessiveness of snapshots and by coherent sources in underwater acoustic positioning is considered.A matched field localization algorithm based on CS-MUSIC(Compressive Sensing Multiple Signal Classification) is proposed based on the sparse mathematical model of the underwater positioning.The signal matrix is calculated through the SVD(Singular Value Decomposition) of the observation matrix.The observation matrix in the sparse mathematical model is replaced by the signal matrix,and a new concise sparse mathematical model is obtained,which means not only the scale of the localization problem but also the noise level is reduced;then the new sparse mathematical model is solved by the CS-MUSIC algorithm which is a combination of CS(Compressive Sensing) method and MUSIC(Multiple Signal Classification) method.The algorithm proposed in this paper can overcome effectively the difficulties caused by correlated sources and shortness of snapshots,and it can also reduce the time complexity and noise level of the localization problem by using the SVD of the observation matrix when the number of snapshots is large,which will be proved in this paper.
文摘Future space missions demand operations on large flexible structures,for example,space webs,the lightweight cable nets deployable in space,which can serve as platforms for very large structures or be used to capture orbital objects.The interest in research on space webs is likely to increase in the future with the development of promising applications such as Furoshiki sat-ellite of JAXA,Robotic Geostationary Orbit Restorer (ROGER) of ESA and Grapple,Retrieve And Secure Payload (GRASP) of NASA.Unlike high-tensioned nets in civil engineering,space webs may be low-tensioned or tensionless,and extremely flexible,owing to the microgravity in the orbit and the lack of support components,which may cause computational difficulties.Mathematical models are necessary in the analysis of space webs,especially in the conceptual design and evaluation for prototypes.A full three-dimensional finite element (FE) model was developed in this work.Trivial truss elements were adopted to reduce the computational complexity.Considering cable is a compression-free material and its tensile stiffness is also variable,we introduced the cable material constitutive relationship to work out an accurate and feasible model for prototype analysis and design.In the static analysis,the stress distribution and global deformation of the webs were discussed to get access to the knowledge of strength of webs with different types of meshes.In the dynamic analysis,special attention was paid to the impact problem.The max stress and global deformation were investigated.The simulation results indicate the interesting phenomenon which may be worth further research.
基金supported by China 973 Frogram 2011CB302402the Knowledge Innovation Program of the Chinese Academy of Sciences(KJCX2-YW-S02)+1 种基金the National Natural Science Foundation of China(10771205)the West Light Foundation of the Chinese Academy of Sciences
文摘In some fields such as Mathematics Mechanization, automated reasoning and Trustworthy Computing, etc., exact results are needed. Symbolic computations are used to obtain the exact results. Symbolic computations are of high complexity. In order to improve the situation, exact interpolating methods are often proposed for the exact results and approximate interpolating methods for the ap- proximate ones. In this paper, the authors study how to obtain exact interpolation polynomial with rational coefficients by approximate interpolating methods.
