约束条件下带误差线性协变量的变系数部分线性模型的统计推断

研究了当模型中带有误差线性协变量但有辅助信息,且参数部分有附加的线性约束时,变系数部分线性模型的统计推断问题。给出了线性约束条件下参数的profile最小二乘估计,并且证明该估计满足渐近正态性。同时基于profile拉格朗日乘子检验方法检验约束条件的合理性,证明了在原假设成立时,所给出的检验统计量服从渐近标准卡方分布。最后通过数值模拟验证上述参数估计和检验方法的有限样本性质。     

P阶自回归模型中的变点检验问题

变点问题是统计学中一个较新的课题.本文讨论了p阶自回归模型中的变点检验问题,对于自回归模型在模型的白噪声序列的方差σ2未知的条件下,分别利用最大似然估计方法和最小二乘法给出了变点的检验统计量,并得到统计量的渐近分布,最后给出了证明.     

变系数部分线性EV面板数据模型的效应检验

研究了带测量误差的变系数部分线性面板数据模型中个体效应的检验问题。 基于截面最小二乘方法分别对固定效应模型和随机效应模型中参数部分和非参数部分进行估计,经过纠偏处理后分别得到修正后的估计量,并构造出参数 Hausman 检验统计量和非参 Hausman 检验统计量;进一步,在小样本下结合 Bootstrap 抽样方法和Hausman 检验统计量得到检验的拒绝域,并通过模拟来检验统计量的功效;最后利用本文方法实证分析研究了国内 16 家上市银行绩效影响因素,并给出了实质性建议。     

长记忆时间序列趋势项变点的CUSUM检验

本文研究长记忆时间序列趋势项的变点检验问题.基于最小二乘拟合残差构造了一种新的CUSUM型检验统计量,在无变点原假设下证明了检验统计量的极限分布是I型分数布朗运动的泛函,在备择假设下证明了检验统计量的一致性,并提出用Sieve Bootstrap方法确定检验统计量的临界值来避免精确估计冗余参数.数值模拟结果表明,提出的新方法在原假设下能较好地控制检验水平,在备择假设下能达到满意的检验势.     

全局连续的分段最小二乘曲线拟合方法

针对传统最小二乘的曲线拟合方法不适合单一应用在具有复杂结构的试验观测数据中,本文提出一种满足全局连续性约束的多分段区间的最小二乘数据拟合方法.通过把每个相邻分段点上要求拟合连续的约束条件转化成一个矩阵等式Zα=0,建立一个只包含线性等式约束的最小二乘模型min ‖ Xα -y‖ 2,最后通过应用拉格朗日的乘数方法推导出...     

异常点检测后的偏最小二乘回归模型

偏最小二乘回归是通过一组自变量来预测一个或一组因变量的统计方法。但在很多情况下用于建模的样本点由于种种原因会出现一些异常情况,这些异常点和其他样本点之间都存在着很大的偏差。异常点的存在对所建立的模型和真实模型就有很大的偏差。基于这一问题本文通过构造统计量对所给的样本点进行选择,剔除对模型的构造有很大影响力的样本异常点,从而获得一个相对合理的样本空间。在相对合理的样本空间中采用偏最小二乘回归建立模型。运用MATLAB编程,通过一个实例说明在对于异常点剔除后的样本空间中建立模型的精确程度有了很大的提高。     

基于面板数据均值变点的股市收益率分析

随着经济全球化的迅速发展,各国股市间日指数的结构变化存在明显的联动性。文章针对面板数据,采取基于最小二乘法的均值共同变点检验统计量,利用Monte Carlo模拟出检验统计量的临界值,探讨面板数据均值共同变点的存在性及估计,并对Nasdaq、Xetra DAX、Hang Seng等六大股市的日收益率进行实证分析,分析结果说明了基于均值共同变点理论寻找变点的方法是有效的。     

完全样本下威布尔分布参数的加权最小二乘估计

借助图法估计的思想和次序统计量的性质,给出了完全样本下威布尔分布参数的改进最小二乘估计与加权最小二乘估计.     

边界条件下线性模型的影响分析(英文)

建立了边界条件下线性模型中的Cook距离,W—K统计量和A—P统计量。用它们研究了数据对约束最小二乘估计及拟合值的影响问题,得到了一些有意义的结果。     

最小二乘支持向量机的算法研究

最小二乘支持向量机(LS-SVM)作为一种新颖的人工智能技术,已越来越广泛地运用于各个学科领域。该文阐述了最小二乘支持向量机的主要思想和基本算法;结合统计学习理论和算例分析了模型参数对模型精度、复杂度和计算量等的影响,为模型参数的确定提供了理论参考;还提出了最小二乘支持向量机的一种改进算法,通过工程实例对比了基于改进算法和原算法的最小二乘支持向量机模型的性能。算例表明该改进算法可以有效地提高模型的整体性能,便于模型在工程上推广使用。     

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.     

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.     

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.