利用HJ-1B模拟数据反演地表温度的两种单通道算法

现有的两种单通道算法（覃志豪单通道算法和Jimenez-Munoz＆Sobrino单通道算法）都是针对LandsatTM提出的,中国即将发射的HJ-1B卫星传感器也仅有一个热红外波段,要想应用这两种算法对HJ-1B数据进行地表温度的反演,需要根据HJ-1B热红外波段的通道响应函数来重新得到算法中的经验关系．文中针对HJ-1B卫星传感器对这两种算法进行了修订,通过大气辐射传输软件MODTRAN4模拟数据对算法进行了精度评价和参数的敏感性分析．并在此基础上考虑HJ-1B卫星传感器的噪声等效温差（NE△T）和各种参数的估计误差对算法进行了综合误差分析,发现在NE△T≤0．3K的情况下,覃志豪单通道算法平均综合误差为1．14K,而Jimenez-Munozoz＆Sobrino单通道算法平均综合误差为0．94K．基于模拟的HJ-1B热红外波段数据,采用修订后的算法进行了地表温度的反演实验,通过对反演结果的分析,发现覃志豪单通道算法反演的地表温度比模拟的地表温度低1．2K左右,而Jimenez—Munozoz＆Sobrino单通道算法比模拟的地表温度低0．8K左右．从算法验证和应用的结果来看,修订的这两种算法可以方便地应用到对HJ-1B热红外波段数据的地表温度反演．     

预先知道总加工时间的一类特殊的三台平行同类机在线排序

研究三台平行同类机在线排序问题的一种特殊情形,即三台同类机的加工速度分别为s1=s2=1,s3=s≥1．利用“总加工时间”这一部分信息来设计算法,证明了该算法的竞争比为(s 2)/s~(1/2)．结合文献中曾有的关于此问题在线算法的下界,可以知道当S≥2时,该算法比可能有的最好的在线算法在性能上要好．     

低维函数的快速优化算法

基于群体的进化算法是求解函数优化问题的常用方法,但存在收敛速度慢和易陷入早熟的缺点．提出了一个基于（1＋1）-ES分块进化的低维函数优化算法,采用分块进化,引入丢弃不重要分块和二次优化求精的策略,实现了全局搜索过程和局部搜索过程的分离．通过算法分析,表明了算法比较适合于低维函数．仿真结果表明了提出的算法的抗早熟能力和求解效率均优于FEP．     

改进的MODIS海洋气溶胶本征信息反演算法的验证

介绍了改进的MODIS海洋气溶胶反演算法,并重点对该算法进行了验证,结果表明：（1）改进算法纠正了原算法对较大的气溶胶光学厚度的低估和对较小的气溶胶光学厚度的高估现象;其反演得到的气溶胶光学厚度与AERONET的气溶胶光学厚度的相关系数为0．87,高于原算法与AERONET间气溶胶光学厚度的相关系数（0．84）;且有62．1％的反演结果落在误差限内,高于原算法的60．5％。（2）改进算法纠正了原算法对较大的气溶胶尺度分布参数ηss0的低估和较小的气溶胶尺度分布参数卵。的高估现象;其反演得到的气溶胶尺度分布参数与AERONET的气溶胶尺度分布参数的相关系数为0．89,高于原算法与AERONET间气溶胶尺度分布参数的相关系数（0．8）。     

求解多目标规划的一种模糊目标算法

本文在文献[1]的基础上,引入模糊数学思想,提出了一种全新的求解多目标规划算法．其不仅简化了文献[1]的算法过程,还解决了如何判断解的有效性问题．     

G.729.1 算法的改进与 DSP 全汇编优化设计

在G．729．1宽带语音编码算法中,时域混叠编码器的谱包络编码根据帧内子带的相关性,采用差分霍夫曼编码来减少编码的比特分配。针对相邻帧对应子带的谱包络存在相关性,给出了在原有谱包络编码模式的基础上,增加一种帧间对应子带差分霍夫曼编码的模式来进一步减少谱包络的编码比特数,从而提高合成语音的质量。由于G．729．1可以根据信道的特征随时调整编码速率以取得更好的宽带语音质量,这使得该编码算法具有很高的复杂度。为了能在数字信号处理器（digital signal processor,DSP）上实时实现G．729．1,结合TMS320VC5505数字信号处理器对G．729．1算法采用全汇编实现,并对汇编后的G．729．1代码做了进一步的汇编优化,优化后的G．729．1算法在保证了高质量语音输出的同时,提高了编码效率,实现了对语音信号的实时处理。     

多叉树Huffman算法

改进Huffnan算法，提出了多叉树Huffnan算法．理论分析表明该算法优于常规的Huffnan算法，其平均码长已接近信源的熵函数值，且其解码速度快．将其实现用于文本压缩，压缩比大约为3：1左右．该算法已长期用于众多产品中，取得了良好的效果。     

基于改进的模拟退火算法求解0／1背包问题

提出了一种改进的具有变异和倒位算子的模拟退火算法,并将其用于求解0／1背包问题,其性能较标准模拟退火算法和贪心算法都有很大的改善．通过大量的数值实验,证明了文中改进的模拟退火算法求解背包问题的有效性和实用性．     

非线性l1 问题的光滑近似算法

利用“ ”函数的光滑近似函数和无约束优化方法给出非线性l1的一种算法．在适当的假设下，算法是全局收敛的．初步的数值试验结果表明算法的有效性．     

一种圆形窗口的多边形裁剪新算法

提出了一种新的裁剪算法，并讨论了算法的正确性和可靠性．该算法是文献［1］的改进，裁剪速度比［1］快。     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.