基于约束满足神经网络的整体影像匹配

将影像匹配看作一个约束满足问题（ＣＳＰｓ）,并用约束满足神经网络（ＣＳＮＮ）来实现整体影像匹配。根据新松弛标号法对网络的结构和迭代方式进行了改进,使其能够处理复杂地形条件下影像匹配中存在的“零匹配”和“多匹配”问题。实验表明,该匹配算法可快速、有效地处理复杂地形条件下的影像匹配问题     

库尔勒断层氡气观测实验研究

根据库尔勒断层氡气在观测中遇到的一些问题,做了一系列观测实验,结果表明,氡探头的标定值的大小反映了氡探头的灵敏度,决定了测值的高低,因为地下１ｍ内的浅层气体与大气连通,所以观测值受气象因素影响较大,同时认为,在土壤相对潮湿的寒冷地区,冬季较厚的冻土层形成了良好的封闭系统,使地下氡气浓度相对增高,测值呈“冬高夏低”的变化形态,实验中还根据氡的衰变规律验证了所观测的大幅变化的测值确为氡气含量。     

2.5维电阻率成像的新方法

以作者提出的正演方法为基础,给出一种新的2.5维电阻率成像方法,节省了计算时间,使成像迭代过程很稳定,可以对实际上广泛存在的大电性对比度的介质成像,从而提高了电阻率层析成像技术的实用性.     

The Upper Stratospheric Ozone Budget: An Update of Calculations Based on HALOE Data

On the basis of data obtained by the Halogen Occultation Experiment (HALOE) on the Upper Atmosphere Research Satellite (UARS) box model calculations are performed to investigate the ozone budget in the upper stratosphere. The HALOE data comprise measurements of major source gases and key chemical species involved in the ozone destruction cycles. In comparison to earlier calculations using version 17 of the HALOE data, the calculated ozone destruction rate increases when the updated data version 18 is used. However, as with the previous study using version 17 of the HALOE data, no evidence for a significant model ozone deficit is found.     

可持续发展及其在中国的重大战略问题及对策

从可持续发展的内涵出发,分析了可持续发展的机制,阐述了中国可持续发展过程中应注意的重大战略问题,最后提出了相应的对策。     

An analysis of the scalar geodetic boundary-value problem with natural regularity results

A new local existence and uniqueness theorem is obtained for the scalar geodetic boundary-value problem in spherical coordinates. The regularities H _α and H _1+α are assumed for the boundary data g (gravity) and v (gravitational potential) respectively. Received: 27 July 1998 / Accepted: 19 April 1999     

Maximum Entropy Density Determination for the Earth and Terrestrial Planets

The maximum entropy principle of the information theory gives rise to a general regularization strategy for ill-posed inverse problems. The methods based on this principle have become standard in various branches of engineering sciences. Of course, ill-posed problems frequently appear in Earth sciences, too. Nonetheless, the concept of maximum entropy is not very popular here. Therefore, we review the basic approaches employing the principle of maximum entropy in one way or another. We can distinguish at least three different approaches, partly yielding coincident results. One possible area of application is the determination of Earth and planetary models, although the paper cannot treat this in its practical complexity. Most of the discussion is restricted to the determination of the Earth's mass density function from various sources of data. Three sample problems are solved using the principle of maximum entropy: a spherical and an ellipsoidal problem related to the Earth and an ellipsoidal problem related to Mars. This illustrates the numerical procedure, which is non-trivial in many cases. It also shows some results, partly compared to standard solutions. The pros and cons of the approaches are discussed.     

Keplerian periodic orbits in the isosceles problem

The planar isosceles three-body problem where the two symmetric bodies have small masses is considered as a perturbation of the Kepler problem. We prove that the circular orbits can be continued to saddle orbits of the Isosceles problem. This continuation is not possible in the elliptic case. Their perturbed orbits tend to a continued circular one or approach a triple collision. The basic tool used is the study of the Poincaré maps associated with the periodic solutions. This revised version was published online in July 2006 with corrections to the Cover Date.     

The Inverse Problem for Collinear Central Configurations

We consider the problem: given a collinear configuration of n bodies, find the masses which make it central. We prove that for n ≤ 6, each configuration determines a one-parameter family of masses (after normalization of the total mass). The parameter is the center of mass when n is even and the square of the angular velocity of the corresponding circular periodic orbit when n is odd. The result is expected to be true for any n. This revised version was published online in July 2006 with corrections to the Cover Date.