三维Minkowski空间中的类光Bertrand曲线

在三维Minkowski空间中,为了讨论伪正交标架下Bertrand曲线的性质以及对三维Minkowski 空间与三维欧式空间中Bertrand曲线的性质作比较,类似于三维欧式空间,首先给出伪正交标架下曲线的Frenet公式,然后针对不同标架的特点及Bertrand曲线的定义,系统地讨论不同情况下类光Bertrand曲线的性质.最后得到了在三维Minkowski空间中当一条挠曲线有常挠率,则它是一条Bertrand曲线以及Bertrand 曲线对的对应点之间的距离为弧长的线性函数等结论.     

曲线按其从可展曲面分类

本文利用微分几何的方法给出了一种曲线的分类法。将非直线的曲线按其从可展曲面分为柱面曲线、锥面曲线和切线面曲线三大类,并证明了这三类曲线的曲率及挠率特征。讨论了Bertrand曲线与广义螺线的分类问题,提出了Bertrand曲线与柱面螺线的又一充要条件,并进一步讨论了切线面曲线及其对应曲线问题。     

三维Minkowski空间中两类伴侣曲线

讨论了幂零曲线和主法向量是幂零的类空曲线，得到了关于它们的Bertrand伴侣曲线和Mannheim伴侣曲线的一些结果，并给出一些例子。     

广义螺线

本文提出了一类新的曲线—广义螺线,给出了这类螺线的充要条件和标准方程,并进一步讨论了这类螺线和一般柱面螺线、Bertrand曲线之间的关系。 定义 主法线和固定方向作固定角的曲线称为广义螺线。     

曲线的主法线曲面

在三维欧氏空间中,作为特殊曲线,Mannheim曲线、Bertrand曲线以及一般螺线具有良好的几何和代数性质.讨论了三维欧氏空间中特殊曲线的主法线曲面.根据渐近曲线的方程,具体给出主法线曲面的一族非直线的渐近曲线.再根据平均曲率、高斯曲率及主曲率函数,能得到曲线的主法线曲面的极小轨迹、常高斯曲率曲线及两个主曲率函数之比为常数的曲线.还给出曲面上测地线和腰曲线的性质.     

关于Bertrand奇论问题的合理解释

Bertrand奇论问题作为概率论中的一个著名问题,人们为此试图给出合理的解释。本文试图给出任意性与均匀性的之间联系,以浅显直观的形式对奇论问题给出令人信服的正确解释,从而比较妥当地解决了Bertrand奇论问题,而且对初等概率论的直观均匀分布(尤其是非点情形均匀分布)概念提供一种新认识。     

三维欧氏空间中的特殊曲线

利用活动标架及曲线的理论与性质等研究了曲线的密切球中心轨迹以及从切平圆的性质.首先,研究了曲线和曲线的密切球中心轨迹之间的关系,并利用原曲线的曲率、挠率来确定曲线密切球中心轨迹的形状.当原曲线的曲率、挠率满足一定关系,它的密切球中心轨迹分别是一般螺线、Bertrand曲线、Mannheim曲线对、从切曲线和球面曲线.其次,利用密切球面和从切平面的交线定义了从切圆并且研究了从切圆中心轨迹的性质.     

Bertrand共轭曲面基本原理研究

通过对回转面、可展面、法向圆弧曲面等工程常用曲面“沿母线法线共面”这一共性特征的提炼与升华，提出Bertrand曲面的概念，并研究了其性质．作为在高副传动领域的应用与延伸，研究了Bertrand共轭原理。其基本特征是一对Bertrand曲面在共轭的各瞬时接触线均为母线．将Bertrand共轭按母线分为3种典型类型，分别给出共轭的基本条件．为了研究共轭条件的相客性，给出了反映各类共轭传动形式与准线特征的结构条件，并在此基础上建立共轭的微分关系武．这些研究为Bertrand共轭原理向工程转化奠定了基础．     

基于三角形分布的多维Bertrand模型及均衡分析

在不完全信息一维Bertrand模型博弈的基础上,讨论了两个企业关于具有一定替代性的两种产品在三角形分布下不完全信息的Bertrand多维博弈模型,并通过一个数值例子对均衡结果进行了分析.     

特征为2的有限域上Edwards曲线的可除多项式

椭圆曲线上的可除多项式能用来表征椭圆曲线上有限阶点, 也能用于描述椭圆曲线的倍乘映射. 它具有一些性质和应用, 例如在ECM中构造具有给定扭点性质的椭圆曲线.本文作者给出了二元域上Edwards曲线的可除多项式及其迭代公式, 它是关于x,y的对称多项式. 同样地, 此多项式也能刻画Edwards曲线上有限阶点和Edwards曲线的倍点运算. 此外, 作者也给出了具有12阶点的Edwards曲线的构造方法     

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.