浅论计算智能中的计算方法

计算智能的发展过程,也是计算智能学中的计算方法不断完善的过程.阐述计算智能所涉及的计算方法特点,并以一个数值计算方法在计算智能学中应用实例,说明自然计算依然是计算智能的重要算法.     

任意复杂薄壁截面自由扭转常数的数值计算方法

针对任意复杂薄壁截面自由扭转常数的计算,提出一种便于计算机实现的建模方式和计算方法.采用一系列具有宽度的线段模拟薄壁截面,根据薄壁截面剪力流计算理论,编写相应计算程序,计算得到任意复杂薄壁截面的自由扭转常数.把本文的计算理论和计算方法运用到大型斜拉桥苏通大桥的截面计算中,并与Midas计算结果进行比较.计算结果表明:本文的建模方式实现了与CAD的无缝连接,方便工程应用;本文的计算方法对于不同剪力流指定方式得到相同的计算结果,克服了Midas的计算缺陷,验证了本文计算方法的正确性和稳定性.     

中厚板轧机设定计算功能的在线实施

针对中厚板轧机,研究了如何将设定计算功能嵌入过程控制系统,并应用于在线·将设定计算功能划分成轧制规程计算、轧机设定及控制参数计算以及模型自学习计算三个组成部分,分析了各部分的主要功能及其联系·设计了设定计算功能的在线数据流程和调用逻辑,根据具体轧线的检测仪表布置和生产工艺过程,多次调用设定计算功能·通过预设定计算、再设定计算、阶段前修正计算、道次修正计算、自学习计算以及待温时间修正计算,发挥设定计算及生产过程中实测数据的作用·     

基于分子重组技术的DNA计算

DNA计算是计算科学和分子生物学相结合的新领域。目前关于DNA计算的研究主要是抽象的计算模型和简单的原理性试验。DNA剪接计算模型是以生物DNA分子重组技术为基础的文法系统。本文主要介绍DNA剪接计算模型的文法结构及计算方法,证明了DNA剪接模型可以计算所有图灵机可计算函数。     

自由曲面多轴加工中行距的高精度计算

在自由曲面加工中,行距的计算精度直接影响着曲面的加工精度和加工效率.现有的行距计算方法,要么过于简略而导致计算精度不高;要么只追求计算精度而忽略计算效率.文中提出以圆弧或双圆弧样条来逼近曲面的法截线,再以此为基础进行行距计算.该算法在保证行距计算精度的前提下,尽可能地提高了算法的计算效率.此外,该算法每一次的行距计算时间相对稳定,因此适用于定周期插补计算.实例分析结果表明即使在曲面几何性质变化较大的情况下,该算法能够保证行距的计算精度及计算效率.     

基于互联协作的高性能嵌入式计算模型应用研究

传统的嵌入式计算受应用的限制,资源十分有限,计算功能较为单一,这种计算架构限制了其功能扩展和可重用性。为此,提出了一种互联协作的高性能嵌入式计算模型——NHPEC。该模型是通过多种具备计算能力的设备的互联协作,来实现复杂嵌入式计算;并能够通过对嵌入式计算设备的现场动态配置,进行功能重组,来实现嵌入式计算的重用。该模型能够有效实现传统嵌入式计算不能实现的复杂嵌入式计算,极大地提高嵌入式计算的性能和可重用性,可以广泛应用于普适计算环境中的复杂计算需求。     

面向智能空间的普适计算技术

普适计算作为智能空间的一种新型计算模式,从根本上改变人们对什么是计算的思考。普适计算是信息空间与物理空间的融合,在这个融合的空间中人们可以随时随地和透明地获得数字化的服务。本文综述了普适计算研究的现状和发展趋势,并讨论了普适计算关键研究内容—普适计算体系结构、觉察上下文计算和游牧计算。     

热带钢轧机轧辊热变形的快速有限元模型

分析了解析法与简化方法的缺点,采用有限元法建立轧辊热变形计算模型.针对轧制过程中轧辊热变形计算数据特点,将计算任务分为负责静态数据准备的预计算和负责动态数据准备与热变形求解的更新计算,换辊时进行预计算,计算任意时刻的热变形时只需进行更新计算,计算量远小于标准有限元程序.根据特殊处理的计算流程,编写了基于轴对称有限元法的轧辊热变形程序,其计算结果与ANSYS结果一致,精度均高于简化方法约30%.自编轧辊热膨胀有限元程序计算精度高,耗时少,满足在线热膨胀预报要求.     

当前基于架线弛度进行计算以及调整的思路研究

在电力网络的建设过程中,架空线是其输电线路中一种非常常见的施工形式,但是在其施工的过程中,要能够保证较好的工作质量,对其架线驰度进行有效的计算是非常必要,在传统的计算方法中,应用手工的计算方法对其架线驰度进行计算与调整,计算量加大,存在较大的计算误差,而将Excel自动计算方法应用于架线驰度的计算中,具有较高的计算效率,本文就主要介绍了其计算流程、实现方案及计算方法。     

图算力法

受力矩分配法和力法的启发,图算力法发展成为适用广泛、力学概念清晰、计算程式规范的一种精确计算方法.将结构计算图转化为等价的0阶计算图.由构建方法的需要,区分为主、附未知量.边看计算图边计算其主附未知量,图算有收敛计算和复原计算.     

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.