基于gridport的计算服务网格门户的设计与实现

为了充分利用部署在网格系统中的计算服务，增加用户使用网格资源的透明度，设计了基于Gridport的计算服务网格门户（CSGP）。应用Globus的Pre-WS GRAM技术和Gridport网格门户开发工具包实现了作业提交、作业运行状态查询和网格资源监控等功能。实验测试表明CSGP能够为用户提供良好的计算服务接口，并改善计算任务的执行效率。     

基于改建Portlet技术的数字化校园信息门户建设

校园信息门户（Campus Information Portal，CIP）是校园的信息应用集成的战略和技术框架。本文针对信息门户现状，提出运用改进Portlet技术架构的信息门户系统开发平台，实现门户的SSO功能及应用集成功能，为了把各类用户进行有机的联系，将通过对消息、事件的处理和传输等方法，使校园信息门户平台为学校的各类用户提供高效、生动、个性化的服务。     

门户集成Struts应用的Portlet化模型研究

在最少改变编码的前提下,将现有运行良好的应用系统移植到门户中是门户集成所面临的首要问题. 针对门户构建中基于Struts框架的Web应用集成,分析了Struts框架和Portlet运行机制及二者的关联性,提出了一个Struts应用的Portlet化模型,并实现该模型. 实例证明遵循Struts标准的应用均可以利用该模型实现为Portlet,作为组件集成到门户中,从而有效地提高了现有系统的可重用性.     

基于Web的网格监控系统研究

网格监控是网格管理和网格优化的核心．本文提出了基于Web的网格监控系统——GMSWeb．该系统采用浏览器／服务器（B／S）模式来构建网格监控系统,通过友好的浏览器界面实现网格资源网格环境中分布式、大规模、动态、异构的计算及存储资源的各种参数的监视和控制．GMSWeb底层采用生产者／消费者模式和SOA架构实现了对网格环境下各类资源的订阅发布,显示层对中国教育网格平台CGSP中资源、网格服务、网格用户、网格作业、网络状态等信息的可视化监控．     

GridSphere portal框架下网格Web应用程序的开发

基于Portlet的门户设计正在日趋成熟,已成为Web应用程序开发的主流工具.GridShpere作为开源Portal的代表,为Web应用程序的开发提供了一个主流模型,为开发人员编写与发布Web应用程序提供了一套方便快捷的平台.从开发人员的角度出发,介绍了GridShpere的基本原理及技术,并就如何开发基于网格Portal应用程序提供了基本过程.     

支持资源自动发现的网格计算门户原型研究

针对保障网格计算透明性与科学应用提交接口的用户友好性问题,以哈尔滨工业大学的网格计算环境为基础,分析了网格门户的关键技术,提出了面向科学应用的计算网格门户的体系结构--HITGridPortal.在元目录服务的基础上,提出了一种支持并发多线程扫描的资源自动发现技术,保证发现模块系统开销和运行效率之间的均衡.以天体物理中的N体问题为案例,验证了网格门户的易用性与有效性.     

大规模电力网格体系结构

大规模电力系统往往需要跨多个具有自治性的子网,是典型的网格系统.根据电力系统的实际需要,将网格计算技术应用于电力系统之中,为电力系统提供先进的方法和平台.提出了基于网格的大规模电力系统体系结构,对各层进行了详尽的讨论,设计和分析了电力网格中间件（PGM）,并给出了基于电力网格中间件技术进行在线安全评估的应用示范.实验结果显示,基于提出的体系结构进行DSA应用耗时较短.     

网格技术在智能公交系统中的应用

主要研究了将网格技术应用于实现智能公交系统的基本思想和部分技术的实现方法.网格技术通过对异构资源的整合,能够实现更高程度的资源共享和更强的计算能力,它为实现智能公交系统提供了一种有效的解决方案.首先提出了基于"服务"的系统分层体系结构,包括资源服务层、基础服务层与系统服务层,然后阐述了基于OGSA的关于智能公交系统的信息集成、功能封装和应用开发的设计思想和方法,并且采用请求/应答与订阅/通知两种方式实现了信息集成.     

协同设计网格及其关键技术

针对协同设计中的资源共享和协同工作问题，通过分析产品设计和仿真过程对协同设计网格的功能需求提出了协同设计网格的概念．基于网格中间件建立了协同设计网格的4层体系结构，利用Globus工具集实现了协同设计网格服务，并基于web开发协同设计网格的门户来封装网格服务．该技术为分布在异地的设计人员提供了高级的网格服务和友好的图形化界面，从而最大程度地实现资料共享和协同工作．为远程协同设计的实施提供了新思路和新方法．     

企业信息门户的构建技术研究

本文首先介纠了企业信息门户的技术框架，其次，重点探讨了构建企业信息门户所要遵循的两个重要技术规范即Portlet技术规范（JSR168）和远程Portlet网络服务规范（WSRP），最后，文章对以上两个技术规范的作用和联系进行了概括。     

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.