(ψ)-混合误差下半参数回归模型小波估计的γ阶矩收敛速度

考虑一类固定设计下的半参数回归模型yi=xiβ+ g(ti)+ei,i=1,2,…,n,对于模型中的未知参数β和未知函数g(t)的小波估计(∧β)n和(∧g)n(t).,在{ei,1≤i≤n)是(ψ)-混合随机误差时,研究了(∧β)n和(∧g)n(t)的γ阶矩一致收敛速度.     

正相协误差半参数回归模型小波估计的强相合性

研究半参数回归模型yi=xiβ+ g(ti)+ei(1≤i≤n),｛ei,1≤i≤n｝为正相协序列的未知参数β和未知函数g(t)小波估计的强相合性,得到它们的强收敛速度.     

LNQD序列半参数回归模型小波估计的强相合性

对于半参数回归模型yi=xiβ+g(ti) +ei(1≤i≤n),误差{ei,1≤i≤n}为平稳LNQD序列,研究了未知参数β和未知函数g(t)小波估计的强相合性,在一定的条件下,得到了合理的结果,把非参数回归模型的相应结果推广到半参数回归模型.     

PA序列下半参数回归函数估计的强相合性

对于半参数回归模型Yni=β.tni＋g（xni）＋εni,（1≤i≤n）,在误差{εni,1≤i≤n}为平稳PA相依序列条件下,得到未知函数g（x）的权函数估计和未知参数β估计的强相合性.     

广义曲线回归的小波估计

考虑广义回归模型 yi=g( ti) εi,1≤ i≤n,其中 g(· )为 R上的未知函数 ,误差 εi 是均值为零的平稳序列 .利用线性小波光滑的方法 ,讨论了 g(· )的小波估计 g(· )的收敛性 .     

一类与位数码有关的数的阶

设正整数 n的二进制表示是 n =ak2 k+… +a1 2 +a0 ,称 s(n) =ak +… +a0 是 n的位数码和 .对于任意给定的正实数α及正整数 y0 ,以 yn+ 1 =yn+(s(yn) ) α定义数列 {yn},则 yn=12 n(logn) α+O(n(log) α2log logn ) .     

随机删失半参数回归模型参数估计的渐近性质

考虑半参数回归模型Yi=Xiβ+g(Ti)+ei,i=1,2…,n,β∈Rd为未知回归参数,g(·)为[0,1]上的未知Borel函数.利用偏残差法并综合最小二乘法,定义了右删失数据情形下参数β、g(T)的核估计^β 、^g (T),在一定条件下,证明了^β 的渐近正态性,同时得到了^g (T)的最优收敛速度.     

单调有界准则的推广与级数sum from n=1 to ∞ sin~m(an+b)/n~α的敛散性

利用致密性定理获得有界数列{y_n}收敛的一个充分条件:∨ε>0,■N∈Z+,使得当n>Z时,不等式yn-yn-1<ε恒成立。并发现任意项级数收敛的一个判定定理:如果级数sum from n=1 to ∞ a_n有界,且limn→∞a_n=0,则该级数收敛。由此获得:级数sum from n=1 to ∞ sin~(1+2s/t)=n/n~α收敛,其中s∈Z,t∈Z+,0<α≤1。并进行推广:如果s∈Z,t∈Z~+,0<α≤1,则级数sum from n=1 to ∞sin~1+2s/t)(an)/n~α收敛。再获得一个一般性结论:设有界函数f(n)满足0≤f(n)0,k,l∈Z。     

一种非对称损失下分布函数的最优不变估计

给定来自一未知连续分布函数F的容量为n的子样x1,x2,…,xn,考虑分布函数F的不变估计问题.在非对称损失函数L(F(t),d(t))=b∫(exp{a[d(t)-F(t)]}-a[d(t)-F(t)]-1)dF(t)和单调变换群下得到F的最优不变估计为d(t,X)=∑ni=0ciI(x(i)≤t≤x(i 1)),其中ci=1/aln(∫01ti(1-t)n-idt)/(∫01exp{-at}ti(1-t)n-idt),a≠0,b>0.     

固定设计下半参数回归模型小波估计的收敛速度

对一类固定设计下的半参数回归模型进行了研究.通过利用加权最小二乘法及小波估计法给出了未知参数β和未知函数f(·)、g(·)的估计;在较弱的条件下给出了最终加权二乘估计βn的弱收敛速度,(^f)n(·),的弱收敛速度、强相合性以及(g-)n(·)的弱收敛速度.     

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.