求总级值的一个实现算法

郑权等在“一个求总极值的方法”一文中给出了一个积分－水平集求总极值的概念性算法及Ｍｏｎｔｅ－Ｃａｒｌｏ随机投点的实现算法。给出了总极值存在的充分和必要条件,而实现算法由于用了Ｍｏｎｔｅ－Ｃａｒｌｏ随机投点的方法。     

一种修正的求总极值的积分—水平集方法

1978年,郑权等给出了一个积分型求总极值的概念性算法及Monte-Carlo随机取点的实验途径,该文给 一种修正的求总有值的积发－－水平集方法,它有两个方面的特点：（1）每一步需构造一新函,而其与原目标函数具有相同的部极值;（2）避免了郑权算法在一般情况下,由于水平集不易求得而造成难以求出水平的困难,该文同样出了求总极的收敛准则。     

从随机到确定性的积分型全局优化方法

郑权等于1978年提出了积分水平集求总极值的方法，其主要特点有判别总极值的收敛准则，但其概念算法与Monte-Carlo随机投点的实现算法不匹配，易遗失总极值外，其实现算法收敛性至今未解决．该文在张连生、邬冬华等提出的修正算法的基础上，将积分型方法中的Monte-Carlo随机投点与确定性的数论方法相结合，以提高修正算法的计算效率，并在文中给出了这种从随机到确定性的积分型全局优化方法全局收敛性的证明．     

变测度算法的最优性条件

郑权首先提出了求总极值的积分-水平集方法及其算法的最优性条件.此后,邬冬华等人给出了一种修正的积分-水平集算法及相应的最优性条件.在此基础上,该文提出一个变测度的积分 水平集概念性算法,并给出类似的最优性条件.     

Schrodinger方程的Dirichlet问题的概率表达式解法

给出用Ｍｏｎｔｅ－Ｃａｒｌｏ方法求在某布朗运动中首达时的期望值的数值解法，并证明了此数值解的依概率收敛性．     

一种单片微波集成电路中心值设计算法

提出一种适于单片微波集成电路（ＭＭＩＣ）中心值设计的高效算法——多目标选优法。算法基于ＭｏｎｔｅＣａｒｌｏ分析和成品率直方图理论，先从直方图中提取出多个目标中心值点，再通过成品率比较寻优；算法实现时综合运用插值抽样、参量抽样和抽样识别等技术改进ＭｏｎｔｅＣａｒｌｏ分析，既保证采用标准ＭｏｎｔｅＣａｒｌｏ分析时的优化精度，又将其效率提高十余倍。多目标选优法为引进数值型物理模型，实现高精度、高可靠性的ＭＭＩＣ中心值设计打下基础。     

基于Excel的蒙特卡罗模拟方法的实现

以ＭｉｃｒｏｓｏｆｔＥｘｃｅｌ电子表格软件为基础,探讨了Ｅｘｃｅｌ在开发决策支持系统方面的功能,在研究给出了ＭｏｎｔｅＣａｒｌｏ模拟算法之后,通过一案例实现了基于Ｅｘｃｅｌ的ＭｏｎｔｅＣａｒｌｏ摸拟系统．工作表明,Ｅｘｃｅｌ软件在管理决策中具有较好的应用前景     

重积分的Monte—Carlo的计算法及计算机实现

利用Ｍｏｎｔｅ－Ｃａｒｌｏ的计算法,求出近似计算二重积分的公式,运用ＢＡＳＩＣ语言来实现。之后又将公式向Ｋ重积分作一推广。     

全局优化问题的最优性条件及其实现算法

基于求总极小值的积分水平集算法,提出另一类求总极大值的积分水平集算法;并根据权重的概念,对其中的积分均值函数进行修正,建立了求总极大值的积分水平集算法,以及相应的收敛准则;同时,对不同的权重值进行了数值试验,并对结果作出了客观评价.     

甲醇羰基化制乙醇催化剂的共聚物配体交替结构的…

采用以ＡＳＥＤ－ＭＯ（含原子对排斥的ＥＨＭＯ法）为基础的结构自动化的ＥＨＴＯＰＴ法及Ｍｏｎｔｅ－Ｃａｒｌｏ法对甲醇羰基化制乙酸催化剂的共聚物配体结构进行了理论研究。计算了ＡＡ，ＡＢ，ＢＢ，ＢＡ二聚反应的反应途径，找出了过渡态，并确定了反应活化势垒，在假设两反应频率因子相同的前提下，求现竞聚率，采用Ｍｏｎｔｅ－Ｃａｒｌｏ法模拟共聚物结构，计算出共聚物配体中起催化活性的ＡＢ交替结构所占比率，比较不同共     

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.