基于面元素重排的三维网格模型数据隐藏算法

目的 为了解决目前三维数据隐藏算法不能兼顾无失真和盲提取的问题，提出一种新的完全无失真的三维网格模型数据隐藏盲算法。方法 首先使用混沌逻辑映射选择嵌入与提取模式，保证数据的安全性。然后利用面元素重排，完全不会造成三维模型失真的性质，通过不同嵌入模式规则对三角面元素进行重排，以嵌入秘密数据。接收端则可根据相应的提取模式规则提取秘密数据。结果 仿真结果与分析表明，该算法不会对三维模型造成任何失真，嵌入容量为每顶点2比特，且能抵抗仿射变换攻击、噪声攻击和平滑攻击等。结论 这种三维数据隐藏盲算法无失真，容量大、安全性高、鲁棒性强，适用于三维载体不容修改的情形，如军事、医学、秘密通信和版权保护等。     

A multigrid accelerated hybrid unstructured mesh method for 3D compressible turbulent flow

 A cell vertex finite volume method for the solution of steady compressible turbulent flow problems on unstructured hybrid meshes of tetrahedra, prisms, pyramids and hexahedra is described. These hybrid meshes are constructed by firstly discretising the computational domain using tetrahedral elements and then by merging certain tetrahedra. A one equation turbulence model is employed and the solution of the steady flow equations is obtained by explicit relaxation. The solution process is accelerated by the addition of a multigrid method, in which the coarse meshes are generated by agglomeration, and by parallelisation. The approach is shown to be effective for the simulation of a number of 3D flows of current practical interest. Sponsored by The Research Council of Norway, project number 125676/410 Dedicated to the memory of Prof. Mike Crisfield, a respected colleague     

Dynamic Multicast Session Provisioning in WDM Optical Networks with Sparse Splitting Capability

In this work, we study dynamic provisioning of multicast sessions in a wavelength-routed sparse splitting capable WDM network with an arbitrary mesh topology where the network consists of nodes with full, partial, or no wavelength conversion capabilities and a node can be a tap-and-continue (TaC) node or a splitting and delivery (SaD) node. The objectives are to minimize the network resources in terms of wavelength-links used by each session and to reduce the multicast session blocking probability. The problem is to route the multicast session from each source to the members of every multicast session, and to assign an appropriate wavelength to each link used by the session. We propose an efficient online algorithm for dynamic multicast session provisioning. To evaluate the proposed algorithm, we apply the integer linear programming (ILP) optimization tool on a per multicast session basis to solve off-line the optimal routing and wavelength assignment given a multicast session and the current network topology as well as its residual network resource information. We formulate the per session multicast routing and wavelength assignment problem as an ILP. With this ILP formulation, the multicast session blocking probability or success probability can then be estimated based on solving a series of ILPs off-line. We have evaluated the effectiveness of the proposed online algorithm via simulation in terms of session blocking probability and network resources used by a session. Simulation results indicate that our proposed computationally efficient online algorithm performs well even when a fraction of the nodes are SaD nodes.     

Three-dimensional MHD high-resolution computations with CWENO employing adaptive mesh refinement

Until recently, numerical simulations of discontinuities in highly super-Alfvénic plasmas have been severely limited by comparatively crude resolution and accuracy. Significant progress in the numerical simulation of such plasmas was achieved with the recently implemented Central Weighted Essentially Non-Oscillatory (CWENO) scheme. Combining this technique with that of adaptive mesh refinement (AMR), we have developed a third-order numerical scheme, which is able to efficiently capture strong gradients on spatial scales being small compared to the overall scale of the plasma system considered. Here, we first describe important algorithmic aspects of the scheme as well as the physics included in it. Second, we present the results of various performance tests. And, third, we illustrate its application to ‘real world problems’ using the example of the dynamics of a Sedov-type explosion.     

Anisotropic mesh adaption by metric‐driven optimization

We describe a Gauss–Seidel algorithm for optimizing a three‐dimensional unstructured grid so as to conform to a given metric. The objective function for the optimization process is based on the maximum value of an elemental residual measuring the distance of any simplex in the grid to the local target metric. We analyse different possible choices for the objective function, and we highlight their relative merits and deficiencies. Alternative strategies for conducting the optimization are compared and contrasted in terms of resulting grid quality and computational costs. Numerical simulations are used for demonstrating the features of the proposed methodology, and for studying some of its characteristics. Copyright © 2004 John Wiley & Sons, Ltd.     

高可靠性烧结金属丝网防爆元件的应用研究

烧结金属多孔元件作为隔爆元件的应用，很好地满足了火焰过滤元件的性能要求，进一步拓宽了烧结金属多孔元件的应用领域，章在论述其性能特点、结构类型的同时，对其在微孔结构设计上的差异也进行了描述。     

高炉煤气净化系统新技术研究与应用

济钢第二炼铁厂针对原高炉煤气净化系统处理能力不足等问题，研制了新的煤气净化系统。该系统采用单根文氏管、串联花环、丝网脱水器湿法除尘，取代原串联文氏管电除尘净化工艺。应用表明，新系统运行安全，净煤气含尘量小于10^mg／m^3，含水量小于5g／m^3，高炉风温提高90℃。     

Mesh data structure selection for mesh generation and FEA applications

The data structure representing a mesh and the operators to create and query such a database play a crucial role in the performance of mesh generation and FE analysis applications. The design of such a database must balance the conflicting requirements of compactness and computational efficiency. In this article, 10 different mesh representations are reviewed for linear tetrahedral and hexahedral meshes. A methodology for calculating the storage and computational costs of mesh representations is presented and the 10 data structures are analysed. Also, a system for ranking different data structures based on their computational and storage costs is devised and the various mesh representations are ranked according to this measure. Copyright © 2002 John Wiley & Sons, Ltd.     

网格曲面中孔洞的光滑填充算法研究

三角网格模型是几何描述的一种重要形式，有着广泛的应用。但三角网络模型常常会存在孔洞缺陷。这些孔洞的存在一方面影响视觉效果，另一方面会影响许多后续的操作，如快速原型制造、有限元分析等，因此有必要对这些孔洞进行修补。目前绝大多数孔洞填充算法是将网格模型中的孔洞提取成空间多边形，并对孔洞多边形进行三角化。这种处理方法的主要缺陷是没有考虑网格曲面在孔洞附近的几何形态，因而填充部分不能与整个曲面光滑地融为一体。笔者提出了一种三角网格曲面中孔洞的光滑填充算法。该算法根据孔洞周围网格曲面的几何信息来增加孔洞内部的采样点，然后再对增加的采样点进行三角化，较好地解决了填充部分与整体曲面光滑连接的问题。     

Material state remapping in computational solid mechanics

A computational procedure for remapping material state information from one finite element mesh to another is described. The procedure is useful in connection with evolving meshes for inelastic problems, as for example occur in the context of fracture simulation and adaptive mesh refinement. The proposed method is based on weak enforcement of equality between corresponding fields on the two meshes, where piecewise‐constant fields on both meshes are generalized from the quadrature‐point values. The essential algorithmic problem is that of calculating the volume partition of an arbitrary convex region with respect to a covering set of disjoint convex regions. Instead of geometrically resolving the associated intersections, the problem is herein approximated by a constrained optimization problem, which may be readily and efficiently solved computationally. This formulation is a main contribution of the paper. Computational examples are given that illustrate the effectiveness of the proposed procedure. Copyright © 2002 John Wiley & Sons, Ltd.