计算机化自适应诊断测验新的选题策略

提出了一种既能满足属性平衡又能有效处理相似属性模式的新方法——改进的极大化整体判别认知诊断模型信息量指标法(MGCDI).对无结构型的属性,讨论定长CD-CAT的选题策略.研究结果表明,使用相同选题策略选题时,先选择可达矩阵的所有列对应的项目比不使用这些项目的诊断准确率高.     

利用局部Moran''''s Ii统计量检验回归模型的残差之间的趋势性

局部Moran'sIi统计量是在检验空间的局部相关性时经常用到的一个统计量.本文基于正态变量二次型分布的理论,利用局部Moran'sIi统计量来检验经典线性回归模型的拟合残差之间的趋势性,并给出了计算检验p-值的精确方法与三阶矩χ2逼近方法.     

径流中长期预报模糊优选神经网络模型应用研究

预报因子选择与模型训练精度确定,是模糊优选神经网络模型应用于径流中长期预报时有待研究解决的两个重要问题.应用预报因子集与预报量间的复合非线性相关分析方法选择预报因子(集),克服了通常单因子线性相关分析选择预报因子的不适用性;通过定义综合效应系数来综合评价模糊优选神经网络模型的拟合能力与外推预报能力,为研究模型的拟合精度高而外推预测精度低的问题提供了一种解决方法.     

基于亚组的准参数模型简介及SAS程序应用

在心理学研究中,研究者常常关注个体某一行为或心理特质随时间的变化趋势.笔者介绍了一种新的用于处理纵向数据的统计模型--基于亚组的准参数模型,该模型可以很好的拟合总体中存在不同发展轨迹亚组的数据.本研究结合实例,介绍了如何通过SAS软件PROC TRAJ程序来进行实际操作,并对模型的选择和拟合指标等进行了详细的说明.     

认知诊断模型参数估计算法比较

该文在不同条件的组合下考查了EM算法和MCMC算法对3种常用的认知诊断模型(DINA模型、DINO模型和G-DINA模型)的参数估计返真性问题.借助项目参数或作答概率分布的偏差、均方根误差、平均绝对离差以及被试的平均属性判准率等指标,评价这2类算法的表现.模拟研究结果表明:MCMC算法更适用于低质量题目、小样本、测验短的条件,而在其他条件下EM算法的表现与MCMC算法的表现相当.     

目标区域下汇率扩散模型的统计分析

将汇率目标区域下的扩散模型应用到我国,探讨人民币对美元的汇率满足的扩散方程.选择2种目标区域下的汇率扩散模型,并给出这2种模型的统计特征,为后面的参数估计和实证分析作准备.选用人民币对美元的汇率数据在2种模型下利用GMM方法进行参数估计和拟合.由于第2种模型估计出的人民币和美元的相关系数失真,得出第1种模型更适合我国的短期汇率市场.     

基于属性掌握概率的认知诊断模型

认知诊断模型研究主要包括模型建构、模型性能评估及结果报告几个方面.用多维连续向量表示被试的属性掌握概率,并假设属性应用满足局部独立的条件下建构属性掌握概率认知诊断模型,然后运用马尔科夫链蒙特卡洛方法估计模型参数,模拟研究表明该算法的准确性和稳定性较好.最后,运用该模型分析分数减法数据的结果表明被试属性水平和项目参数的诊断结果与规则空间方法分析的结果一致,从而表明该模型是可信和有效的.     

语音识别中ARMA模型的研究

在用线性时间序列模型拟合语音数据时(例如用AR模型拟合),模型阶数越高,参数个数越多,统计计算时误差越大.本文在理论上对ARMA(1,q)模型的参数估计进行了推导,在数值计算上,得到了ARMA(1,0)模型的参数估计并对模型进行拟合,解决了用AR模型拟合语音数据时,统计计算时误差较大的问题.     

P-Ⅲ型分布与信息扩散理论的风险估算模型比较研究

在国际灾害数据库支持下,获取了中国1988—2007年发生的洪水灾害次数、人口死亡数和洪水灾害经济损失3项统计指标;利用P-Ⅲ型分布估算模型和信息扩散模型进行洪水灾害风险分析,并对二者方法进行结果对比分析.结果表明:在样本数据量较少的情况下,当风险水平在6或8时,P-Ⅲ型分布的重现期估计值变化迅速,这与实际灾害发生情况不符,不能很好地拟合洪水灾情情况;而信息扩散变幅不大,能够很好地拟合洪水灾情情况;说明信息扩散方法在小样本数据量情况下明显优于P-Ⅲ型分布估算模型,可以解决样本资料短缺的问题,是一种有效的处理小样本的方法.信息扩散理论对洪灾风险研究具有一定的理论参考价值.     

基于模糊Petri网的供应链诊断建模分析

以模糊Petri网为工具,参照绩效评价指标,构造供应链的诊断模型,给出诊断算法.以制造商、销售商组成的简单供应链为例,选择供应链运作中的14个关键因素,模拟给出其因果关系,建立了基于模糊Petri网的简单供应链诊断模型,通过仿真分析,验证了模型的正确性和算法的有效性.该模型的建立形象描述了供应链运作管理中关键因素之间的影响关系,为供应链的诊断研究以及供应链的绩效评价提供一个新的思路.     

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.