Corrigendum to “Complex flow simulation in natural aquifer” [Adv. Eng. Inform. 23 (2009) 288–293]: An algorithm for parallel flow simulations in the finite element framework

The high advanced techniques in parallel computing can be employed for a better understanding of groundwater flow fluids. Generally, the geological media are very heterogeneous and contain complex structures. Decomposing these structures into, approximately, equivalent sub-structures for a load-balancing is a major challenge. This paper proposes and analyses a new algorithm to simulate parallel flow fluid in such complex media. Fully parallel software is developed, and two well-known sparse linear solvers, based respectively on a multifrontal Cholesky factorization and an iterative structured multigrid method, are compared. The mixed finite element (MFE) method is used to discretize Darcy’s equation. Numerical examples are presented to show the efficiency and robustness of the algorithm proposed.     

一种基于复杂网络的P2P流媒体拓扑构建算法

按照何种拓扑结构来构建覆盖网络是P2P流媒体网络中的热点问题,而已有的拓扑构建算法大多采用启发式算法,参数由经验值确定,缺乏理论分析。针对此问题,运用复杂网络中小世界效应的理论知识和簇结构的概念,提出了一种基于复杂网络的P2P流媒体拓扑构建算法,用所有的簇头节点构成一个小世界网络,利用小世界网络的特性来改善P2P流媒体网络的性能。对该算法和经典的CoolStreaming方法分别进行了仿真实验,比较了启动延迟、服务器负载、消息开销和抖动率等参数。实验结果表明新提出的算法相对于CoolStreaming方法具有显著的性能提高。复杂网络理论的运用是P2P流媒体系统研究的一个新方向,对今后的工作有重要的指导意义。     

Numerical methods for diffusion-reaction-transport processes in unsaturated porous media

This paper introduces a new grid refinement and coarsening technique for the approximation of partial differential equations including a first order time derivative. This hierarchical movement algorithm is based on the nested iteration method. The combination of this algorithm, a quasi Newton method and the Schur-complement multi-grid method leads to an efficient method for the solution of partial differential equations describing complex real life problems. As a test case, diffusion-reaction-transport processes in heterogeneous unsaturated porous media are considered. Some simulation results are presented. Received: 10 March 1997 / Accepted: 16 June 1997     

The finite superelement method and its application for solving science and technology problems

The algorithm for the construction and study of Fedorenko’s finite superelements method (FSEM) is described. Different variants of Fedorenko’s FSEM for simulation of media with small inclusions are presented. The algorithms are implemented and a software complex for the numerical solution of boundary value problems with singularities is developed. The theoretical substantiation of different variants of the method for elliptic equations on the example of the Laplace equation is implemented. The results of the numerical solution for several tasks are presented.     

Visible watermarking with reversibility of multimedia images for ownership declarations

Digital watermarking technology is primarily the joining of the rightful owner of the protected media. Once the media are suspected to be illegally used, an open algorithm can be used to extract the digital watermark for the purpose of showing the media’s ownership. From a hidden watermark in the media from the appearance point of view, general digital watermarking technologies can be divided into two categories: visible watermark technology and invisible watermark technology. Visual watermark technology embeds a watermark into the protected media to declare ownership and deter pirate behavior. In this paper, we propose a reversible visible watermark method, which embeds a binary-imaged watermark into gray-scale images to create a visible watermark. Not using complex calculations, this paper tries to simply change the pixel value to achieve the digital watermark, where our scheme is also against the possible detections with LSB-based manners in use. Furthermore, a reversible steganographic method is used to embed the watermarking information into the watermarking images. The watermark information can then be used to recover the original images.     

基于TensorFlow的恶意代码片段自动取证检测算法

针对数字犯罪事件调查,在复杂、异构及底层的海量证据数据中恶意代码片段识别难的问题,通过分析TensorFlow深度学习模型结构及其特性,提出一种基于TensorFlow的恶意代码片段检测算法框架;通过分析深度学习算法训练流程及其机制,提出一种基于反向梯度训练的算法;为解决不同设备、不同文件系统的证据源中恶意代码片段特征提取问题,提出一种基于存储介质底层的二进制特征预处理算法;为进行反向传播训练,设计并实现了一个代码片段数据集制作算法。实验结果表明,基于TensorFlow的恶意代码片段检测算法针对不同存储介质以及证据存储容器中恶意代码片段的自动取证检测,综合评价指标F₁达到 0.922,并且和 CloudStrike、Comodo、FireEye 等杀毒引擎相比,该算法在处理底层代码片段数据方面具有绝对优势。     

Efficient approach and application of the Green’s functions in spatial domain in multilayered media

Based on the dipole source method, all components of the Green＇s functions in spectral domain are restructured concisely by four basis functions, and in terms of the two-level discrete complex image method （DCIM） with the high order Sommerfeld identities, an efficient algorithm for closed-form Green＇s functions in spatial domain in multilayered media is presented. This new work enjoys the advantages of the surface wave pole extraction directly carried out by the generalized integral path without troubles of that all components of Green＇s function in spectral domain should be reformed respectively in transmission line network analogy, and then the Green＇s functions for mixed-potential integral equation （MPIE） analysis in both near-field and far-field in multilayered media are obtained. In addition, the curl operator for coupled field in MPIE is avoided conveniently. It is especially applicable and useful to characterize the electromagnetic scattering by, and radiation in the presence of, the electrically large 3-D objects in multilayered media. The numerical results of the S-parameters of a microstrip periodic bandgap （PBG） filter, the radar cross section （RCS） of a large microstrip antenna array, the characteristics of scattering, and radiation from the three-dimensional （3-D） targets in multilayered media are obtained, to demonstrate better effectiveness and accuracy of this technique.     

Study of a Jacobian-free approach in the simulation of compressible fluid flows in porous media using a derivative-free spectral method

The development of Jacobian-free software for solving problems formulated by nonlinear partial differential equations is of increasing interest to simulate practical engineering processes. For the first time, this work uses the so-called derivative-free spectral algorithm for nonlinear equations in the simulation of flows in porous media. The model considered here is the one employed to describe the displacement of miscible compressible fluid in porous media with point sources and sinks, where the density of the fluid mixture varies exponentially with the pressure. This spectral algorithm is a modern method for solving large-scale nonlinear systems, which does not use any explicit information associated with the Jacobin matrix of the considered system, being a Jacobian-free approach. Two dimensional problems are presented, along with numerical results comparing the spectral algorithm to a well-developed Jacobian-free inexact Newton method. The results of this paper show that this modern spectral algorithm is a reliable and efficient method for simulation of compressible flows in porous media.     

Progressive Transient Photon Beams

In this work, we introduce a novel algorithm for transient rendering in participating media. Our method is consistent, robust and is able to generate animations of time‐resolved light transport featuring complex caustic light paths in media. We base our method on the observation that the spatial continuity provides an increased coverage of the temporal domain, and generalize photon beams to transient‐state. We extend stead‐state photon beam radiance estimates to include the temporal domain. Then, we develop a progressive variant of our approach which provably converges to the correct solution using finite memory by averaging independent realizations of the estimates with progressively reduced kernel bandwidths. We derive the optimal convergence rates accounting for space and time kernels, and demonstrate our method against previous consistent transient rendering methods for participating media.     

基于子图相交的社交账号与知识图谱实体对齐

社交媒体与知识图谱的数据各具特点,相互之间的数据互通具有较强的现实意义,而社交账号与知识图谱实体的对齐是数据互通的前提。针对社交媒体与知识图谱的特点,提出了一种基于子图相交的对齐方法,旨在给定社交账号的情况下,根据社交账号的相关信息在知识图谱中找到正确的对应条目。该方法在候选实体生成阶段对比实验了不同的生成策略。在目标实体选择阶段提出一种基于子图相交的算法,利用社交账号的社交关系在知识图谱中映射成子图。子图相交算法通过考察子图中候选实体周围顶点的"稠密"程度,确定社交账号所对应的目标实体。由于该领域尚无公开可用的测试数据集,构造了一个基于Twitter与Wikidata的对齐数据集,使用该数据集对该方法进行评估,对比测试了标题匹配算法和AGDISTIS算法,子图相交算法能够达到更好的效果。     

An efficient and accurate alternative to subincrementation for elastic-plastic analysis by the finite element method

In this paper a new and efficient alternative to subincrementation is developed for analysis of solid media with rate independent elastic-plastic material behavior. This alternative method is not unlike the subincrementation procedure in that it represents an Euler integration of the nonlinear constitutive equations. However, it takes advantage of the fact that the Euler integration procedure assumes proportional loading steps so that when the uniaxial stress-strain curve is idealized as a piecewise linear relation very large forward integration steps give accurate results. The new procedure, which we call the ζ method, is equally appropriate for cyclic loading with combined isotropic and kinematic hardening. However, due to the nonuniqueness of the monotonic uniaxial stress-strain relation in rate dependent media, the method is not appropriate for use in viscoplastic media. Although the algorithm deals only with the evaluation of a classical plasticity based constitutive law, numerical results are reported herein for an assortment of problems by the finite element method. It is shown via these results that the ζ method discussed herein provides not only accuracy which is superior to the subincrementation method, but the resulting algorithm also shows improved numerical efficiency.     

一种基于GOP的MPEG-2媒体流动切割与合并方法

MPEG-2视频编码技术由于其较高的压缩比和高质量图像，在数字电视及电影等方面具有重要应用。由于编码算法相对较为复杂，迫切需要解决MPEG-2媒体流的切割和合并问题，从而实现有效的节目制作。本文正是针对MPEG-2媒体流，提出了一种基于GOP的压缩域视频分割与合并方法。通过分析媒体流的数据结构，详细蛤出了算法的原理和实现过程。最后，还通过实验证明了该方法的可行性和高效率。     

P2P视频直播数据调度算法

P2P技术解决了传统流媒体应用中的不能支持大用户的问题.而数据调度算法一直是P2P研究中的热点问题.在给出了P2P视频直播系统中节点能力的定义和计算方法后,结合BT中的Rarest First策略,提出了一种基于节点能力的适用于P2P视频直播系统的数据调度算法.该算法既考虑了流媒体数据具有时间限制的特性,同时也考虑了如何能充分的利用节点的上传带宽,增进了系统的负载平衡.     

一种根据实际用户行为分析的大容量缓存算法

缓存是解决流媒体网络瓶颈和磁盘I/O瓶颈的重要方法.用户在访问流媒体系统的时候呈现出非常复杂的行为,这些行为对于设计有效的流媒体缓存方法至关重要.现有的算法往往以泊松分布,zipf分布来表示用户行为,这往往就失之精确.本文根据用户的点播行为和操作行为,设计了符合实际用户行为的大容量缓存算法,并进行实验,实验结果表明效果良好.     

基于QoS控制的连续媒体服务任务调度

连续媒体服务如视频,音频等是一类新的实时应用,要求在一统一的操作系统框架内支持强,弱实时应用,而传统的操作系统中的调度策略不能很好的支持该类应用。文中提出了一种新的ＱｏＳ描述方法,并在此基础上提出支持连续媒体流的,基于ＱｏＳ的启发式任务调度算法。该算法考虑了多媒体任务的成功率和连续失败数在资源有限的前提下,尽量保证所有媒体流的服务质量。     

Detecting and tagging users’ social circles in social media

As a media and communication platform, microblog becomes more popular around the world. Most users follow a large number of celebrities and public medias on microblog; however, these celebrities do not necessarily follow all their fans. Such one-way relationship abounds in ego network and is displayed by the forms of users’ followees and followers, which make it difficult to identify users’ real friends who are contained in merged lists of followees and followers. The aim of this paper is to propose a general algorithm for detecting users’ real friends in social media and dividing them into different social circles automatically according to the closeness of their relationships. Then we analyze these social circles and detect social attributes of these social circles. To verify the effectiveness of the proposed algorithm, we build a microblog application which displays algorithm results of social circles for users and enables users to adjust proposed results according to her/his real social circles. We demonstrate that our algorithm is superior to the traditional clustering method in terms of F value and mean average precision. Furthermore, our method of tagging social attributes of social circles gets high performance by NDCG (normalized discounted cumulative gain).     

基于改进SA算法在智能制造生产调动模型研究

智能制造生产调动是一个复杂的多目标优化问题,传统的生产调动方法多采用启发式方法,在面对复杂的制造环境,传统方法可能会出现早熟收敛或搜索精度下降的问题；因此为了解决这些问题,研究构建了基于改进SA算法的智能制造生产调动模型；首先对SA算法进行了优化,其次利用优化后的算法构建了生产调动模型,最后通过仿真实验去验证模式算法的性能。实验结果表明,在数据集中,真实值、模型方法和传统方法的平均完成时间分别为85.33min、89.92min和93.81min,其中模型方法与真实值的差距仅为4.59min。这说明模型方法可以用于解决现有生产模式存在拖期的情况,及时完成生产任务。模型算法能够为智能制造生产调动提供新的思路。     

基于复合形法的聚类遗传算法

针对标准遗传算法的未成熟收敛问题和局部收敛能力不佳等情况,提出一种基于复合形法的聚类遗传算法。通过使用复合形法结合聚类小生境技术对传统的遗传算法进行改进,得到基于复合形法的自适应聚类遗传算法（NCGA）。该算法使用FORTRAN语言进行编程,通过使用三种复杂的测试函数对其性能进行测试,并与自适应遗传算法（AGA）进行了性能比较,还分析了初始种群的优劣对算法性能的影响。测试结果表明：对于遗传算法的改进效果明显,在遗传算法中融入复合形操作能明显增强遗传算法的局部搜索能力,且聚类技术使得遗传算法的全局搜索能力得到显著增强,反向学习操作的添加能增强算法的稳定性。改进后的遗传算法的性能明显好于传统的遗传算法。     

局部关联度最优的手写汉字骨架提取

目的 研究手写汉字图像时,骨架是最为常见的切入点之一。利用传统细化算法提取手写汉字骨架,容易在笔画交叉等情况复杂的区域产生形变。针对此问题,提出一种基于局部关联度的手写汉字骨架提取算法。方法 首先对手写汉字图像进行细化以获取原始骨架,按照端点、普通点和复杂点3种类别标注骨架点;利用8邻域窗口扫描相互连通的复杂点,检测并提取复杂区域;删除复杂区域,将原始骨架拆分为若干简单笔画段,形变部分在此过程中被一并移除;提取局部子段,根据笔画段间的方向差异程度和曲率变化程度,计算局部关联度;制定一种局部关联度最优的连接策略,对满足连接条件的笔画段进行插值补偿,从而修正形变,并得到完整的汉字骨架。结果 对于600个实验样本,从骨架直接检测复杂区域所得结果十分接近理想情况,而轮廓法所得数量是理论值的2.5倍;基于局部关联度重组笔画段,绝大多数形变得到修正,重组后的骨架符合真实拓扑结构;以标准骨架为参考,骨架提取准确率达到了98.41%。结论 局部关联度最优的手写汉字骨架提取算法,能够有效检测复杂区域,对形变具有良好的修正作用,提取所得骨架能够正确反映复杂笔画间的位置结构关系,是一种实用有效的骨架提取方法。