非线性单纯形的修改算法

提出了非线性单纯形算法的修改算法。在原单纯形算法的基础上增加了一种新的反射方向的计算方法;用“映射单纯形”方法代替“单纯形顶点代换”方法;有选择地采用“单纯形压缩”计算。修改单纯形算法对初值的适应范围更亮、能有效加快收敛速度。     

一个改进的非线性单纯形算法

提出了非线性单纯形算法的修改算法．在原单纯形算法的基础上结合线性搜索算法；用线性搜索方向最优点代替原算法的反射点；修改后的单纯形算法能加快收敛速度．     

太阳影子定位参数反演模型的混合粒子群算法

针对非线性太阳影子定位参数反演问题,给出一种基于单纯形算法的权重线性递减的粒子群混合算法,此混合算法融合了单纯形算法的精确局部搜索能力和粒子群算法全局搜索能力,且采用权重线性递减的粒子群算法加快了算法的收敛速度。在太阳影子定位参数反演的数值实验中,所提算法不仅成功反演参数,而且拥有较高的计算精度和更快的收敛速度。     

混联结构微波网络的计算机辅助设计

本文讨论了混联结构微波网络的计算机辅助设计问题。根据国产小型计算机的特点,提出了一种描述网络拓扑结构的N矩阵。为了对网络参数进行优化,本文提出了一种一般单纯形算法,这种方法比单纯形法收敛速度要快。根据N矩阵方法,单纯形及一般单纯形组合算法,编制了相应的设计程序CADMN。计算结果表明,该方法是有效的和可行的。     

一种高效混合遗传算法

针对基本遗传算法在优化应用中遇到的诸如局部搜索能力差、计算量大、对较大搜索空间适应能力差和早熟收敛等问题，将传统的单纯形搜索算法与遗传算相结合，提出了一种混合遗传算法，并在算法中增加了小生境淘汰运算和加速循环操作，典型测试函数数值算例验证表明，主方法不但可以有效地克服基本遗传算法的上述缺陷，而且计算速度和计算精度都有显著提高。     

基于距离和信息的单目标精确跟踪

对仅有“距离和”测量信息的多传感器系统提出了一种对量测方程预处理的快速卡尔曼跟踪算法．该卡尔曼跟踪算法通过对量测方程预处理得到目标位置与“距离和”测量量成线性关系的观测方程；状态变量只选目标的空间坐标，而速度矢量仅作为确定性输入量加入状态方程，速度矢量通过引入速度“伪测量值”滤波得到．并同以前的跟踪算法仿真比较表明，该方法计算量小，收敛速度快，精度高，具有一定的实用价值．     

离散变量结构优化设计的混沌遗传算法

利用混沌搜索的遍历性、随机性、规律性等特点，提出了一种求解离散变量结构优化设计的混沌搜索方法；将混沌搜索技术嵌入遗传算法，与基本遗传算子共同构成了一种离散变量结构优化设计的混合遗传算法一混沌遗传算法；通过自适应的退火因子和罚函数来处理约束条件，使算法逐渐收敛于全局可行最优解。计算结果表明，该方法有效地克服了基本遗传算法中的“早熟”现象，并具有更快的收敛速度。     

一种新的快速BP神经网络算法--QLMBP

对反向传播（BP）算法中收敛速度最快的改进版本Levenberg-Marquardt BP（LMBP）进行了研究，找出了收敛速度的瓶颈：迭代控制参数的初始化会严重地影响到算法的选代次数；涉及的矩阵求逆是每次迭代中最耗时的计算；如果每次迭代中的误差平方和没有变小，该次迭代可能需要很长时间．本文通过上下三角（LU）分解去除耗时的矩阵求逆，并采取一维搜索来加速目标函数值的下降，使得LMBP不再依赖于迭代控制参数，从而提出了一种快速神经网络算法QLMBP．QLMBP算法的收敛速度比LMBP算法快100倍左右．     

基于改进单纯形算法的药物动力学参数计算

基于改进的单纯形算法和残数法,对药物动力学房室模型中的有关参数计算进行了研究。通过实例表明,将改进的单纯形算法和残数法相结合得到的混合算法其计算精度高、收敛速度快、具有很好的稳定性,而且该算法对初值的选取要求不高,故有一定的实用价值。     

求线性方程组极小l1范数解的一种算法

陈中文研究中关于求线性方程组极小l1范数解问题有着较为广泛的应用。本文研究了该问题的最优性条件，给出最优解的充分必要条件。进一步研究了该问题最优解的一种表现形式，提出一个单纯形方法的算法，该算法解决了退化问题，且收敛速度较快，同时给出确定初始基的方法。     

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).     

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.     

Tracking data management using topology of moving object database system for moving object constrained trajectory in LBS application

Advances in wireless technologies and positioning technologies and spread of wireless devices, an interest in LBS (Location Based Service) is arising. To provide location based service, tracking data should have been stored in moving object database management system (called MODBMS) with proper policies and managed efficiently. So the methods which acquire the location information at regular time intervals then, store and manage have been studied. In this paper, we suggest tracking data management techniques using topology that is corresponding to the moving path of moving object. In our techniques, we update the MODBMS when moving object arrived at a street intersection or a curved road which is represented as the node in topology and predict the location at past and future with attribute of topology and linear function. In this technique, location data that are corresponding to the node in topology are stored, thus reduce the number of update and amount of data. Also in case predicting the location,because topology are used as well as existing location information, accuracy for prediction is increased than applying linear function or spline function.