Unfamiliar Aspects of Bäcklund Transformations and an Associated Degasperis–Procesi Equation

We summarize the results of our recent work on Bäcklund transformations (BTs), particularly focusing on the relation between BTs and infinitesimal symmetries. We present a BT for an associated Degasperis–Procesi (aDP) equation and its superposition principle and investigate the solutions generated by applying this BT. Following our general methodology, we use the superposition principle of the BT to generate the infinitesimal symmetries of the aDP equation.     

A Preamble Re-utilizing Access Scheme for Machine-Type Communications with Optimal Access Class Barring

Wireless Personal Communications - The existing long term evolution networks originally designed for human-to-human communications are hard to tackle numerous and bursty random access requests from...     

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.