Hyperparameter on-line learning of stochastic resonance based threshold networks

Aiming at training the feed-forward threshold neural network consisting of nondifferentiable activation functions, the approach of noise injection forms a stochastic resonance based threshold network that can be optimized by various gradient-based optimizers. The introduction of injected noise extends the noise level into the parameter space of the designed threshold network, but leads to a highly non-convex optimization landscape of the loss function. Thus, the hyperparameter on-line learning procedure with respective to network weights and noise levels becomes of challenge. It is shown that the Adam optimizer, as an adaptive variant of stochastic gradient descent, manifests its superior learning ability in training the stochastic resonance based threshold network effectively. Experimental results demonstrate the significant improvement of performance of the designed threshold network trained by the Adam optimizer for function approximation and image classification.     

An efficient edge based data structure for the compressible Reynolds-averaged Navier–Stokes equations on hybrid unstructured meshes

An efficient edge based data structure has been developed in order to implement an unstructured vertex based finite volume algorithm for the Reynolds-averaged Navier–Stokes equations on hybrid meshes. In the present approach, the data structure is tailored to meet the requirements of the vertex based algorithm by considering data access patterns and cache efficiency. The required data are packed and allocated in a way that they are close to each other in the physical memory. Therefore, the proposed data structure increases cache performance and improves computation time. As a result, the explicit flow solver indicates a significant speed up compared to other open-source solvers in terms of CPU time. A fully implicit version has also been implemented based on the PETSc library in order to improve the robustness of the algorithm. The resulting algebraic equations due to the compressible Navier–Stokes and the one equation Spalart–Allmaras turbulence equations are solved in a monolithic manner using the restricted additive Schwarz preconditioner combined with the FGMRES Krylov subspace algorithm. In order to further improve the computational accuracy, the multiscale metric based anisotropic mesh refinement library PyAMG is used for mesh adaptation. The numerical algorithm is validated for the classical benchmark problems such as the transonic turbulent flow around a supercritical RAE2822 airfoil and DLR-F6 wing-body-nacelle-pylon configuration. The efficiency of the data structure is demonstrated by achieving up to an order of magnitude speed up in CPU times.     

An approach of dynamic mesh adaptation for simulating 3‐dimensional unsteady moving‐immersed‐boundary flows

In this paper, we present an approach of dynamic mesh adaptation for simulating complex 3‐dimensional incompressible moving‐boundary flows by immersed boundary methods. Tetrahedral meshes are adapted by a hierarchical refining/coarsening algorithm. Regular refinement is accomplished by dividing 1 tetrahedron into 8 subcells, and irregular refinement is only for eliminating the hanging points. Merging the 8 subcells obtained by regular refinement, the mesh is coarsened. With hierarchical refining/coarsening, mesh adaptivity can be achieved by adjusting the mesh only 1 time for each adaptation period. The level difference between 2 neighboring cells never exceeds 1, and the geometrical quality of mesh does not degrade as the level of adaptive mesh increases. A predictor‐corrector scheme is introduced to eliminate the phase lag between adapted mesh and unsteady solution. The error caused by each solution transferring from the old mesh to the new adapted one is small because most of the nodes on the 2 meshes are coincident. An immersed boundary method named local domain‐free discretization is employed to solve the flow equations. Several numerical experiments have been conducted for 3‐dimensional incompressible moving‐boundary flows. By using the present approach, the number of mesh nodes is reduced greatly while the accuracy of solution can be preserved.     

A post curing strategy toward the feasible covalent adaptable networks in polyacrylate latex films

The implementation of covalent adaptable networks (CANs) in general resin system is becoming attractive. In this work, we propose a simple post-curing strategy based on the core-shell structured acrylate latex for the achievement on both the improved general performance and the CANs characteristics in latex films. The building to the CANs was relied on the introduction of 4,4′-diaminophenyl disulfide as the curing agent, which cured the acetoacetoxy decorated shell polymer through the ketoamine reaction. The metathesis reaction of aromatic disulfides in the crosslinking segments enabled the thermally induced dynamic behavior of the network as revealed in the stress relaxation tests by comparison with other diamine crosslinking agents without the incorporation of disulfide. The synergism of the dynamic crosslinking of the shell polymer and static crosslinking in the core polymer contributed to the improved mechanical strength (15 MPa, strain% = 250%) and the suppressed water adsorption (~1% in 24 h of soaking) of the latex film, which exhibited above 90% of recovery in both strength and strain from a cut-off film damage within 1 h at 80°C. Moreover, the cured latex film could be recycled, and 75% of the mechanical performance was regained after three fragmentation-hot-pressing cycles. These, in addition with the feasible and environmental friendly characteristics, suggest a sustainable paradigm toward the smart thermosetting latex polymers.     

Efficient Collocation Schemes for Singular Boundary Value Problems

We discuss an error estimation procedure for the global error of collocation schemes applied to solve singular boundary value problems with a singularity of the first kind. This a posteriori estimate of the global error was proposed by Stetter in 1978 and is based on the idea of Defect Correction, originally due to Zadunaisky. Here, we present a new, carefully designed modification of this error estimate which not only results in less computational work but also appears to perform satisfactorily for singular problems. We give a full analytical justification for the asymptotical correctness of the error estimate when it is applied to a general nonlinear regular problem. For the singular case, we are presently only able to provide computational evidence for the full convergence order, the related analysis is still work in progress. This global estimate is the basis for a grid selection routine in which the grid is modified with the aim to equidistribute the global error. This procedure yields meshes suitable for an efficient numerical solution. Most importantly, we observe that the grid is refined in a way reflecting only the behavior of the solution and remains unaffected by the unsmooth direction field close to the singular point.     

Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation

Several promising approaches for hexahedral mesh generation work as follows: Given a prescribed quadrilateral surface mesh they first build the combinatorial dual of the hexahedral mesh. This dual mesh is converted into the primal hexahedral mesh, and finally embedded and smoothed into the given domain. Two such approaches, the modified whisker weaving algorithm by Folwell and Mitchell, as well as a method proposed by the author, rely on an iterative elimination of certain dual cycles in the surface mesh. An intuitive interpretation of the latter method is that cycle eliminations correspond to complete sheets of hexahedra in the volume mesh.

Although these methods can be shown to work in principle, the quality of the generated meshes heavily relies on the dual cycle structure of the given surface mesh. In particular, it seems that difficulties in the hexahedral meshing process and poor mesh qualities are often due to self-intersecting dual cycles. Unfortunately, all previous work on quadrilateral surface mesh generation has focused on quality issues of the surface mesh alone but has disregarded its suitability for a high-quality extension to a three-dimensional mesh.

In this paper, we develop a new method to generate quadrilateral surface meshes without self-intersecting dual cycles. This method reuses previous b-matching problem formulations of the quadrilateral mesh refinement problem. The key insight is that the b-matching solution can be decomposed into a collection of simple cycles and paths of multiplicity two, and that these cycles and paths can be consistently embedded into the dual surface mesh.

A second tool uses recursive splitting of components into simpler subcomponents by insertion of internal two-manifolds. We show that such a two-manifold can be meshed with quadrilaterals such that the induced dual cycle structure of each subcomponent is free of self-intersections if the original component satisfies this property. Experiments show that we can achieve hexahedral meshes with a good quality.     

用自适应脉冲微扰引导混沌系统到周期解

用自适应脉冲微扰方法控制的系统的某个系统变量作为驱动,设计了一种自适应控制器方法对两个或多个响应混沌系统进行脉冲微扰,引导这些系统从混沌运动到低周期运动,实现同时控制多个混沌系统到不同的周期态. 当选择相同的自适应控制器输入变量实施脉冲微扰时,还可控制两个或多个混沌系统达到不同的周期态同步. 通过对R?ssler混沌系统的仿真研究证实了方法的有效性. 关键词： 混沌控制 系统参量 自适应控制器 脉冲微扰 周期态同步     

Simulation of viscous water column collapse using adapting hierarchical grids

An adaptive hierarchical grid‐based method for predicting complex free surface flows is used to simulate collapse of a water column. Adapting quadtree grids are combined with a high‐resolution interface‐capturing approach and pressure‐based coupling of the Navier–Stokes equations. The Navier–Stokes flow solution scheme is verified for simulation of flow in a lid‐driven cavity at Re=1000. Two approaches to the coupling of the Navier–Stokes equations are investigated as are alternative face velocity and hanging node interpolations. Collapse of a water column as well as collapse of a water column and its subsequent interaction with an obstacle are simulated. The calculations are made on uniform and adapting quadtree grids, and the accuracy of the quadtree calculations is shown to be the same as those made on the equivalent uniform grids. Results are in excellent agreement with experimental and other numerical data. A sharp interface is maintained at the free surface. The new adapting quadtree‐based method achieves a considerable saving in the size of the computational grid and CPU time in comparison with calculations made on equivalent uniform grids. Copyright © 2005 John Wiley & Sons, Ltd.     

束晕-混沌的复杂性理论与控制方法及其应用前景

本文系统论述涉及强流加速器等强流离子束装置中产生的束晕-混沌的复杂性理论与控制方法及其应用前景。强流离子束在核材料生产与增殖、洁净核能、放射性废物嬗变、放射性药物生产、重离子聚变、高能物理、核科学与工程、国防与民用工业和医疗等许多方面都有极其重要的应用潜力和诱人的发展前景。尤其是，近年来强流加速器驱动的放射性洁净核能系统是国内外关注的热门课题，因为它比常规核电更安全、更干净、更便宜。但是，强流离子束形成的束晕-混沌的复杂性现象已引起了国内外广泛关注，需要加以抑制、控制和消除这类现象，解决这一难题已经成为强流离子束应用中的关键问题之一。目前不仅必须深入研究这类束晕-混沌的复杂特性及其产生的物理机制，而且需要研究如何实现对束晕-混沌的有效控制，并寻求和发展其新理论、新方法和新技术。这就向强流离子束物理和非线性-复杂性科学及其技术提出了一系列极富挑战性的新课题。本文结合国内外的研究概况，根据我们多年来的研究成果，特别是我们首创性地提出了一些束晕-混沌的有效控制方法，它们包括：非线性反馈控制法，小波反馈控制法，变结构控制法，延迟反馈控制法，参数自适应控制法等，进行重点的介绍。对上述课题当前的主要进展及相关问题进行系统的总结和比较全面综述的评论。最后，指出该领域今后的研究方向，以推动这个崭新领域的深入研究和应用发展。