帐篷映射的顶点计数公式

本文讨论了不同参数取值帐篷映射的顶点个数的计算公式.在此基础上,本文给出了当参数a=0.5,b=1+5~(1/2)/4时的顶点个数公式,进而给出了b=1时的n-周期点个数公式.     

一类集值映射在迭代下集值点个数不增的条件

集值点个数的增加是集值映射迭代之所以复杂的根本原因.本文研究一类只有一个集值点的集值映射的迭代,给出这类映射在迭代下集值点个数不增加的条件.     

复余弦解析映射的广义M集、充满Julia集与其非线性迭代函数系的分形

目的研究复余弦映射族f(z)=λcos~n(z)的广义M集、充满Julia集与其非线性迭代函数系的构造关系.方法分析复映射的数学特性:在动力平面上的中心周期窗口,考察指定参数下的迭代映射极值点的轨道是否有界,构造参数平面上的广义M集并寻找M集上周期参数区域的排列规律;在M集的不同周期参数区域挑选参数,构造动力平面上具有高周期吸引轨道的充满Julia集;选用N(N≥2)个广义M集1周期参数,在动力平面上x轴方向的中心周期窗口内构造出N个迭代映射;在N个迭代映射的充满Julia集的公共吸引域上,构造迭代函数系;采用迭代函数系中一个迭代映射的吸引不动点作为初始迭代点,通过随机选取迭代函数系中的迭代映射,跟踪这个吸引不动点在公共吸引域内的迭代轨道,构造出分形.结果采用单参n次复余弦映射族f(z)=λcos~n(z)的广义M集的高周期参数可以构造出在x轴方向具有可数无穷多周期窗口的连续排列的充满Julia集图形;采用N(N≥2)个M集的1周期参数可以构造出在动力平面上的中心周期窗口中充满Julia集的公共吸引域内的有效的非线性迭代函数系.结论提出的构造参数平面上的M集、并在M集上的1周期参数区域选取2个以上的参数构造出相应迭代迭代函数的方法,可以被用于大量构造复映射族f(z)=λcos~n(z)的非线性迭代函数系,随机迭代这种迭代函数系可以大量生成新颖分形.     

兼有上、下界约束混料凸多面体的面数与顶点坐标的一种计算方法

兼有上、下界约束条件的混料问题的利益区域是(n-1)维空间内的一个不规则多面体,利用拟分量变换可以将(1)转化成只有上界约束的混料同题这里, 本文给出了一种利用(b″_1,6′_2,…,b″_n)来直接构造(1)中各顶点坐标的计算程序,与传统的方法相比,大大地简化了计算。 本文同时给出了利用(b″_1,6′_2,…,b″_n)直接计算(n-1)维凸多面体(1)的(n-2)维边界面个数的公式:这里, l——(n-2)维边界面个数; u——6″_i (i=1,2,…,n)中等于1的个数; w——“倒置单纯形” 的顶点个数,它们位于正规单纯形之外。     

平面帐篷映射的研究

研究了一种基于平面上方体的帐篷映射，给出了帐篷映射迭代序列分布图，通过在显著水平5％下的均匀分布假设检验，得出帐篷映射fα，β在I0上遍历并具有不变的均匀分布。     

周期点计数及费马小定理的推广

本文在研究迭代周期数列的基础上，得到周期点个数有限时的一个计数公式，它推广了费马小定理和费马－欧拉定理。     

具有参数超平方收敛的抛物线法公式类

在有记忆单点迭代的Muller法中,通过引入多点迭代思想,提出了一类具有参数有记忆两点迭代的抛物线法公式,其收敛阶为1+√2,达到了超平方收敛.并且给出了该类方法的最佳迭代参数,使其收敛阶达到3.30.数值试验表明该类方法优于Muller法和Newton法.     

具有对称实焦点的分段线性类-Liénard系统的穿越周期轨（英文）

本文研究了具有对称实焦点的分段线性类-Liénard系统的穿越周期轨.通过把系统约化成一个有更少参数的正规形并构造左右子系统的Poincaré映射,本文证明了系统至少存在一个穿越周期轨.此外,本文还给出了一个系统不存在穿越周期轨的充分条件并在一定条件下对穿越周期轨的个数给出了一个上界.     

具有对称实焦点的分段线性类-Lienard系统的穿越周期轨

在这篇文章中, 我们研究了具有对称实焦点的分段线性类-Lienard系统的穿越周期轨. 我们把这个系统约化成一个有更少参数的正规形. 通过构造左右子系统的 Poincare 映射, 我们证明了至少一个穿越周期轨的存在性, 给出了一个不存在穿越周期轨的充分条件和在一定条件下对 穿越周期轨的个数给出了一个上界.     

二维环面及平面分片抛物型映射的若干动力学性质

对于二维环面抛物型映射,给出部分可逆环面抛物型映射的同构分类,证明了极限圆映射有稠密的周期点集,且某些有理抛物型映射具有任意周期的周期点.对于整数抛物型映射,证明了其拓扑熵为零.通过比较极限圆映射分别在环面拓扑和平面拓扑下的符号熵、复杂度,展现了同一个映射在不同拓扑下量的差异.     

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.