计算机管理信息系统的敏捷性分析

针对计算机管理信息系统的敏捷性问题,对计算机管理信息系统的灵活性、适应性方面作了一些研究工作,将它拓展为处理敏捷、沟通敏感、重构敏感和决策敏感四个方面,构建出便于研究它们的系统框架,总结出支持计算机管理信息系统敏捷性的关键技术和软件开发方法及模型。     

敏捷信息系统建模

敏捷信息系统是具有可重构能力的快速适应性系统。为了实现信息系统的敏捷性,采用规范化方法建立系统模型是其核心所在。本文在深入分析企业业务活动本质特征的基础上,运用面向对象方法、企业过程重组（ＢＰＲ）的基本思想及统一建模语言（ＵＭＬ）的表示方法,分析了敏捷信息系统模型的基本要素及其相互关系,给出了系统的模型结构。该模型结构不仅反映了企业业务活动中相对稳定的部分与随环境变化的部分,明确了两部分之间的相互关系,还将信息系统开发过程中的信息有机地集成起来,为实现快速的系统重构奠定了基础。     

敏捷信息系统体系结构的研究

根据现代制造环境下业务流程重组和动态企业建模的需要 ,提出敏捷信息系统的体系结构 ,讨论了敏捷信息系统体系结构的概念、组成、构造原则和结构框架。该结构采用构件支持动态企业建模 ,实现了系统级的软件重用 ,通过建立管理任务平台实现 MIS应用系统和企业过程的分离 ,从而使信息系统支持复杂的动态企业过程。     

Strategic Management of Enterprise Agile Manufacturing

在分析企业生产战略演变的基础上,明确了敏捷性已成为新的竞争重点和竞争优势。提出了敏捷生产战略管理的基本框架,即生产敏捷性的辨识、度量和控制三个环节。将层次分析法应用于生产敏捷性的度量,给出了敏捷性控制的基本思路。     

企业敏捷生产战略管理

在分析企业生产战略演变的基础上,明确了敏捷性已成为新的竞争重点和竞争优势。提出了敏捷生产战略管理的基本框架,即生产敏捷性的辨识、度量和控制三个环节。将层次分析法应用于生产敏捷性的度量,给出了敏捷性控制的基本思路。     

虚拟企业模型及协同运作研究

虚拟企业可通过整合若干优势互补的企业资源来增加企业的敏捷性，而逐渐成为制造企业的一种新型组织形式，建立虚拟企业的关键之一就是开发一种支持这种新型合作方式的信息系统。首先讨论虚拟企业信息系统的需求和虚拟企业信息特点；在此基础上，综合运用多Agent建立基于Agent的虚拟企业信息基础结构，并对多Agent之间的通信和虚拟企业信息系统的协同运作进行讨论。     

现代会计信息系统财务业务过程敏捷现金链模型研究

在现代会计信息系统财务业务过程中,现金业务事件REAL模型的建立,完成了企业关键的现金业务活动分析过程。对如何完成现金业务活动的决策过程,本文提出了敏捷现金链概念,运用管理信息系统中决策支持理论,建立了现代会计信息系统财务业务过程敏捷现金链模型,为企业实现一个整体有较好柔性与快速反映能力的动态现金供需网络提供了科学、快捷的决策工具。     

航天器姿态机动的敏捷性评估

利用最优控制提高传统卫星的敏捷性收益巨大,但风险并存,为了量化敏捷性的改善程度,评估不同航天器的敏捷性,该文提出了一种评估方法。首先,对航天器传统机动和时间最优机动进行了分析。其次,以姿态机动的时间为中间量,构建了近似角加速度包络和等效敏捷包络。然后,引入了敏捷因子和敏捷性曲线的概念,对姿态机动的敏捷性进行定量评估。最后,给出了仿真算例验证方法的可靠性。仿真结果与前人的研究相印证,准确地预估了航天器的平均机动时间。结果表明:该方法可以定量地评估航天器的敏捷性,广泛适合于有角速度、角加速度等各种约束的情况。     

敏捷供应链知识服务主体交互的影响因素及激励模型研究

从敏捷供应链整体、供应链成员企业之间以及企业内部等角度出发,分析影响知识服务主体交互的各项因素;并在此基础上提出了主体参与知识交互的激励模型,模型包括主体进行知识交互之前进行的供应链整合处理,提高供应链敏捷性处理以及知识交互过程中的激励机制、利益分配机制4个模块。     

SOA敏捷架构的TOGAF层次化迭代建模

针对面向服务(SOA)敏捷架构演进周期短、业务与IT对齐要求高的特点,提出一套基于开放组架构框架(TOGAF)的层次化迭代建模方法:外层迭代通过敏捷演进闭环使得企业架构能够随架构愿景的调整敏捷地实施增量化更新;内层迭代通过三维迭代矩阵建立架构模型组在需求、语义、粒度3个方面的对齐机制。对内层迭代进一步探讨了基于BPM+SOA的业务架构、信息系统架构及技术架构模型组语义对齐建模方法与典型建模过程,为SOA敏捷架构提供了一种可迭代的、阶段化交付的、业务流程与信息系统对齐的实现方案。     

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…     

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.     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

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.