基于应用特征的启发式可重构SoC任务分配

本文提出了一种基于应用特征的启发式任务分配方法,适用于对可重构SoC进行系统级任务划分。实验以可重构密码处理SoC为目标,对密码处理任务进行任务划分,实验结果验证了任务分配方法的有效性和实用性。     

动态可重构众核处理器仿真平台设计

针对众核处理器,提出了一种基于计算资源划分机制的动态可重构技术.该技术以虚拟计算群为核心,设计了基于硬件支持的动态可重构子网划分和动态可重构的Cache一致性协议以及动态在线的计算资源调度算法,并对系统级多核仿真平台Gem 5进行了扩展.同时,采用实际测试结果验证了众核处理器中动态可重构技术的有效性.结果表明,动态可重构技术可以提高众核处理器的资源利用率,实现动态可重构的Cache一致性协议以及单一矩形物理子网覆盖的子网划分机制.     

一种基于顶点位置树的可重构软硬件迭代协同算法

可重构计算分时复用有限的面积资源,实现更多的任务硬件加速运行,同时也给传统的软硬件协同设计带来了新的挑战.为此设计了一种基于顶点位置树的迭代协同ICS-VPT算法针对离线型、集中共享式可重构计算平台,综合软硬件划分、硬件布局和任务调度,提升系统性能:首次提出顶点位置树的数据结构,以较小的存储空间快速查找布局位置;迭代协同算法根据数据依赖图分组任务,结合通信代价获取软/硬件任务的优先级,进行合理划分和调度.实验结果表明,ICS-VPT算法在高效管理可重构资源和灵活处理通信代价的同时,保持了较低的系统运行时间.     

支持动态重构的制造系统逻辑控制器设计方法

支持动态重构的制造系统可通过组元升级、组态调整形成新的生产能力和功能,针对制造系统混流生产、快速重构的特点,其逻辑控制器也必须适应这一要求.提出了一种基于可重构Petri网的制造系统逻辑控制器设计方法.首先,根据制造系统的加工控制需求建立逻辑控制器形式化模型;其次,根据系统重构方式给出网重写规则;最后,逻辑控制器根据重写规则动态重构自身结构以适应新的生产需求.制造系统的变化通过重写规则可快速、自动重构成新的系统逻辑控制器并且其行为特性是可判定的.实际应用证明了该逻辑控制器设计方法的有效性和正确性.     

一种用于可重构计算系统的软硬件划分算法

在编译过程中,为了对运行于可重构计算系统上的应用程序自动地进行软硬件划分,提出一种基于模拟退火和链式调度的划分算法,该算法将程序的划分和调度结合起来,采用软硬件协同工作的方式,利用系统中微处理器核与可重构硬件之间的并行性加速程序的执行,同时在调度过程中,通过配置预取减少系统的重构开销.实验结果表明,相对于现有软硬件自动划分方法,该算法可以平均减少25%左右的程序执行时间.     

风力发电场风险评价单元划分模型的构建与应用

为更好的进行风力发电场风险评价单元划分研究,采用系统理论方法,在分析风力发电场风险评价单元的层次模型、集合模型和关联网模型基础上,从理论上构建了风力发电场风险评价单元划分的层次模型、集合模型和关联网线模型.研究结果表明:三种评价单元划分模型思想在对一个复杂系统的实际应用中可以结合应用,对不同的系统、不同的评估方法可采用不同的评价单元划分模型,也可混合使用,会得到更好的评价单元划分结果.该成果对风力发电场风险评价单元划分研究提供了新的思路,具有一定的参考价值.     

一种基于DAG图的异构可重构任务划分方法

为了实现高性能低功耗的计算,以任务划分为研究对象,提出了异构可重构计算的基本概念和形式化描述方法,给出了基于异构计算任务和异构可重构体系结构相结合的异构可重构两种任务划分方法:节点内部可重组及网络可重建的任务划分及算法,最后验证了其任务划分方法的有效性.     

用于低功耗的动态可重构cache结构

提出一种针对嵌入式应用的动态cache重构管理机制.根据应用程序的不同,它能在一定范围内自动搜索,并快速决定出与当前程序最佳匹配的cache结构,然后系统根据最佳匹配结果重新配置cache的3个典型参数:容量、块大小和关联度.实验证明:相对于传统结构,动态可重构cache在不损失性能的前提下,取得了很好的降低系统功耗的效果.     

基于FPGA的动态部分可重构高性能计算实现

针对大规模集群系统中的加速计算阵列或工作组内加速计算节点资源共享模式,提出了一个通用处理节点通过网络互联动态部分可重构计算节点的高性能计算体系架构,设计实现了一种基于FPGA的动态部分可重构计算节点,该动态部分可重构计算节点具备动态部分重构能力,可以根据应用需求动态加载不同的计算功能单元.基于Avnet的Virtex-4开发板,实现了基本硬件结构和动态部分可重构计算节点硬件原型,在此基础上生成全局配置数据文件及计算功能单元对应的部分配置数据文件,实现了动态部分可重构计算节点上的软件系统及远程访问接口库.实验结果表明,该设计以较小的资源实现了较多的功能,动态部分可重构计算节点可以很好的完成计算任务,并能有效地提高系统性能.     

无人机神经网络重构控制

针对无人机可重构飞行控制系统提出一种基于径向基神经网络的模型跟随自适应逆重构控制方法,其核心是建立内外控制回路,内回路运用自适应逆控制,使得系统不受外部扰动和测量噪声的影响。外回路采用神经网络模型跟随自适应控制结构,使用神经网络和比例混合控制器,对参考模型和系统输出之间的误差进行自适应调整,利用误差来改变神经网络控制器的参数,使得系统达到满意的动态性能。并通过一个具体重构仿真结果证实了该方法的有效性。     

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.