数值模拟网格数据模型设计与实现

在等离子体动力学、电磁学理论等物理问题的数值模拟中,各类数值模拟程序产生了大量复杂结构的科学数据.一方面,计算程序需要以高效率的I/O方式存储数据,另一方面,数据需要在各类程序间很容易地交换与共享.随着数据的规模与复杂度不断增加,传统数据管理方式的局限性日益突出.为此,设计了面向计算物理领域的数据存储模型--数值模拟网格数据模型(JAD),引入元数据管理机制,对数值模拟程序数据对象进行抽象与封装,在HDF5软件库基础上实现了高层I/O函数库(JADLib),集成先进的数据存储技术,提供直观、易用的应用程序编程接口(API),使得数值模拟数据以统一格式高效率地存储.目前,JADLib已推广应用于高功率微波、惯性约束聚变等领域多个数值模拟程序中,与元数据管理系统(JADIS)、并行可视化系统(JaVis)建立了耦合,使得用户可以直接利用这些系统进行数据的浏览、分析及可视化,促进了应用程序间的数据共享.     

一种应用于Deep Web环境下的重复记录识别模型

随着Web数据库数量和其蕴含数据量飞速的增长,对Deep Web数据的集成越来越成为研究领域关注的问题.然而由于Web上的信息以半结构化及无结构化的数据信息居多,导致了抽取的结果中包含诸多的不确定性.如有噪音数据、重复字符、简写与全称混合等问题.这给识别重复记录带来了很大不便,导致传统的去重算法无法达到很好的效果.为此,提出了一种面向deep Web结果整合的重复记录识别模型.在该模型中,提出了一种基于编辑距离的改进算法,基于该算法实现字符串匹配;通过构建属性匹配图,并采用二次确认机制实现识别重复记录.应用该模型,既提高了识别效率又保证了识别精确度,并通过实验证明了提出的算法和模型的可行性.     

VLCC中的DAG并行算法

基于组件的密码学虚拟实验室（VLCC）采用有向无环图（DAG）的拓扑排序机制管理组件。在分析VLCC各组件之间的数据依赖和运行次序关系的基础上,提出一种新的基于Java多线程机制和“唤醒”机制的DAG并行算法。与拓扑排序算法相比,具有低算法时间复杂度的特点。实验结果表明,系统在新算法下较大地缩短了系统运行时间,提高资源使用效率和用户满意度,能更好地完善VLCC。     

软件可靠性预测的增强贝叶斯组合模型

针对当前可靠性预测模型的预测精度问题,提出一种增强贝叶斯组合的短期软件可靠性预测模型。该模型以基于小波分解的单个可靠性预测模型作为基本预测模型, 根据当前相邻几个失效时间间隔的预测精度,更新组合模型中各个基本预测模型的权重,解决了贝叶斯组合模型权重计算采用全部历史数据而导致某个基本预测模型权值占主导地位的缺陷,提高了贝叶斯组合模型对软件可靠性的预测精度。实验结果表明,增强贝叶斯组合预测模型的预测精度不仅优于单一的预测方法,而且也优于传统的软件组合预测模型,能显著提高软件可靠性预测的精度和模型对数据的适应性。     

Stabilisation and consensus of linear systems with multiple input delays by truncated pseudo-predictor feedback

This paper provides a new approach referred to as pseudo-predictor feedback (PPF) for stabilisation of linear systems with multiple input delays. Differently from the traditional predictor feedback which is from the model reduction appoint of view, the proposed PPF utilises the idea of prediction by generalising the corresponding results for linear systems with a single input delay to the case of multiple input delays. Since the PPF will generally lead to distributed controllers, a truncated pseudo-predictor feedback (TPPF) approach is established instead, which gives finite dimensional controllers. It is shown that the TPPF can compensate arbitrarily large yet bounded delays as long as the open-loop system is only polynomially unstable. The proposed TPPF approach is then used to solve the consensus problems for multi-agent systems characterised by linear systems with multiple input delays. Numerical examples show the effectiveness of the proposed approach.     

Robust admissibility and admissibilisation of uncertain discrete singular time-delay systems

This paper is concerned with the characterisation of robust admissibility and admissibilisation for uncertain discrete-time singular system with interval time-varying delay. Considering the norm-bounded uncertainty and the interval time-varying delay, a new comparison model is introduced to transform the original singular system into two connected subsystems. After this transformation, a singular system without uncertainty and delay can be handled by the Lyapunov–Krasovskii functional method. By virtue of the scaled small gain theorem, an admissibility condition of the original singular system is proposed in terms of linear matrix inequalities. Moreover, the problem of robust admissibilisation of uncertain discrete singular time-varying system is also studied by iterative linear matrix inequality algorithm with initial condition optimisation. Several numerical examples are used to illustrate that the results are less conservative than existing ones.     

Containment control of multi-agent systems with unbounded communication delays

In this paper, we address the containment control problem for multi-agent systems under heterogeneous unbounded communication delays with emphasis on the convergence rate analysis. Different from most works on multi-agent systems, we resort to a viewpoint from the area of positive delay systems. We first cast the containment control problem into the stability analysis of an associated error system. In order to capture the convergence rate, we introduce a nondecreasing positive function whose reciprocal represents the decay rate of the associated error system. Under the assumption that each follower has access to at least one leader and some mild hypotheses on the communication delays, an explicit condition is given to characterise the decay rate of the associated error system in terms of linear programming. In addition, we provide several special cases when the communication delays are restricted by linear, sublinear and logarithmic growth rates, respectively. Finally, through numerical examples, it is shown that the convergence rate is dominated by the delays being the highest order infinitely large quantity.     

PolSAR anisotropic diffusion filter with a refined similarity measure and an adaptive fidelity constraint

The presence of speckle complicates the tasks of interpreting and analysing polarimetric synthetic aperture radar (PolSAR) images. The nonlinear anisotropic diffusion (AD) method has been found to perform well in removing image noise. In this article, we propose a new AD method for PolSAR speckle reduction. An iterative refinement method is employed to measure the similarity between pixels and construct the diffusion coefficient in the iteration process, by considering both information in the original speckled image and the restored image of the last iteration. In addition, to alleviate the over-smoothing problem the conventional AD methods often encounter, an adaptive fidelity constraint is added into the diffusion equation by considering local heterogeneity information and the amount of noise. Experiments on both simulated and real PolSAR images confirm the ability of the proposed method to both suppress speckle and retain image details.