求解声波动方程的隐格式有限体积法

为研究声传播问题,提出一种声波动方程的隐格式有限体积法,该方法将格点型有限体积法与Newmark格式相结合.模拟平面波的传播过程,对比分析隐格式有限体积法和文献中显格式有限体积法的精度、稳定性及计算消耗等方面的性能.数值结果表明:当λ/Δx≥10时,两种算法均能得到满足精度要求的解;采用无条件稳定的隐格式算法,当满足ω0Δt≤0.3时,预测声压的相对峰值误差1%;当采用相同时间、空间步长时,隐格式算法精度高于显格式算法;隐格式算法对吸收边界的处理精度高于显格式算法,但对全反射边界的处理精度低于显格式算法;两种算法内存消耗比较接近,显格式算法的CPU耗时较少.     

Finite difference method for dynamic response analysis of anchorage system简

Based on some assumptions, the dynamic analysis model of anchorage system is established. The dynamic governing equation is expressed as finite difference format and programmed by using MATLAB language. Compared with theoretical method, the finite difference method has been verified to be feasible by a case study. It is found that under seismic loading, the dynamic response of anchorage system is synchronously fluctuated with the seismic vibration. The change of displacement amplitude of material points is slight, and comparatively speaking, the displacement amplitude of the outside point is a little larger than that of the inside point, which shows amplification effect of surface. While the axial force amplitude transforms considerably from the inside to the outside. It increases first and reaches the peak value in the intersection between the anchoring section and free section, then decreases slowly in the free section. When considering damping effect of anchorage system, the finite difference method can reflect the time attenuation characteristic better, and the calculating result would be safer and more reasonable than the dynamic steady-state theoretical method. What is more, the finite difference method can be applied to the dynamic response analysis of harmonic and seismic random vibration for all kinds of anchor, and hence has a broad application prospect.     

The weak aggregating algorithm and weak mixability

This paper resolves the problem of predicting as well as the best expert up to an additive term of the order o(n), where n is the length of a sequence of letters from a finite alphabet. We call the games that permit this weakly mixable and give a geometrical characterisation of the class of weakly mixable games. Weak mixability turns out to be equivalent to convexity of the finite part of the set of superpredictions. For bounded games we introduce the Weak Aggregating Algorithm that allows us to obtain additive terms of the form .     

A numerical modelling for the extraction of decay regions from color images of monuments

An innovative application focused on the segmentation of decay zones from images of stone materials is presented. The adopted numerical approach to extract decay regions from the color images of monuments provides a tool that helps experts analyze degraded regions by contouring them. In this way even if the results of the proposed procedure depend on the evaluation of experts, the approach can be a contribution to improving the efficiency of the boundary detection process. The segmentation is a process that allows an image to be divided into disjoint zones so that partitioned zones contain homogeneous characteristics. The numerical method, used to segment color images, is based on the theory of interface evolution, which is described by the eikonal equation. We adopted the fast marching technique to solve the upwind finite difference approximation of the eikonal equation. The fast marching starts from a seed point in the region of interest and generates a front which evolves according to a specific speed function until the boundary of the region is identified. We describe the segmentation results obtained with two speed functions, attained by the image gradient computation and color information about the object of interest. Moreover, we present the extension of the working modality of the method by introducing the possibility to extract the regions not only in a local way but also in a global way on the entire image. In this case, in order to improve the segmentation efficiency the application of the fast marching technique starts with more seed points defined as seed regions. The study case concerns the impressive remains of the Roman Theatre in the city of Aosta (Italy). In the image segmentation process the color space L^∗a^∗b^∗$L^{\ast }{a}^{\ast }{b}^{\ast }$ is utilized.     

基于特征的文档图像检索

提出一种综合利用文档图像的段落特征和局部像素分布相对差特征进行文档图像检索的方法。给出段落特征和局部像素分布相对差特征的定义、提取方法以及基于这2个特征结合使用的检索方法。段落特征这一全局特征以及局部像素分布相对差特征这一局部特征相结合能够较好地表征和区分文档图像,检索方法将两者充分结合取得较好的效果。     

基于差值扩展和纠错编码的可逆图像认证

针对一些敏感数字图像在认证水印嵌入过程中不能引入失真的问题,提出一种能够定位图像篡改块的可逆图像认证方案,利用纠错编码使认证数据能抵抗可能受到的篡改攻击,并用差值扩展的方式将编码后的认证数据嵌入到图像中。仿真实验结果表明,若认证通过,则图像可完全恢复到原始状态,否则,图像中篡改的块可被定位,并完全恢复其他未篡改的区域。     

面向本体的服务组合差分进化策略

针对目前Web服务描述服务功能的语义不够深入而使服务识别组合能力欠佳的问题,提出一种面向本体的语义服务功能描述方法,建立本体间的映射关系模型和服务质量关系模型,通过改进差分进化算法求解,得到一种较好的服务组合识别方法。在九寨沟旅游管理信息系统中的应用表明,该方法比传统的方法优越。     

基于FDI算法在软件测试实践中的应用

软件测试对于软件系统的性能以及功能都有很重要的意义,是保证软件可靠运行的关键.在软件测试的实践应用中,对于软件故障定位时,提出了基于谓词统计故障定位的算法,也就是FDI频率差异积分算法.在软件测试实践中采用基于FDI频率差异积分算法,可以很好地监控软件程序,测试软件的覆盖率以及执行时间等内存占用情况,并找到软件的故障瓶颈,以便采取更好的方法改进软件性能.探讨了实践中基于FDI频率差异积分算法在软件测试内的应用.     

高雷诺数流动的平均化差分格式

本文在N—S方程涡量一流函数形式的经典ADI格式和SOR松驰迭代公式的基础上,对其“外来项”进行平均化处理,构造出了平均化差分格式及迭代求解程序。对雷诺数Re=100,1000,10000的空腔流动分别进行了数值计算,并与各数值方法的结果及实验资料进行了比较,结果令人满意。