Assembling hydrodynamic cloaks to conceal complex objects from drag

Transformation hydrodynamics and the corresponding metamaterials have been proposed as a means to exclude the drag force acting on an object. Here, we report a strategy to deploy the hydrodynamic cloaks in a more practical manner by assembling different-shaped cloaking parts. Our strategy is to first model a square-shaped cloak and a carpet cloak and then combine them to conceal a more complex-shaped space in the three-dimensional hydrodynamic flow. With the derivation of transformation hydrodynamics, the coordinate transformations for each hydrodynamic cloaking are demonstrated with the calculated viscosity tensors. The pressure and velocity fields of the square, triangular (carpet), and exemplary three-dimensional house-shaped cloaks are numerically simulated, thus showing a cloaking effect and reduced drag. This study suggests an efficient way of cloaking complex architectures from fluid-dynamic forces.     

Schwinger boson mapping of SO(8) fermion model

The Schwinger representation of the SO(8) fermion pair algebra in terms ofd and quasispin vector (u, s, v) bosons is used in deriving a microscopic boson coherent state having both particle-hole and pair excitations. The coherent state is the exact boson image of the HFB variational solution. We can study the shape phase transition and pairing behaviour of the nuclear ground states using the coherent states.     

An Improved Gradient Projection-based Decomposition Technique for Support Vector Machines

In this paper we propose some improvements to a recent decomposition technique for the large quadratic program arising in training support vector machines. As standard decomposition approaches, the technique we consider is based on the idea to optimize, at each iteration, a subset of the variables through the solution of a quadratic programming subproblem. The innovative features of this approach consist in using a very effective gradient projection method for the inner subproblems and a special rule for selecting the variables to be optimized at each step. These features allow to obtain promising performance by decomposing the problem into few large subproblems instead of many small subproblems as usually done by other decomposition schemes. We improve this technique by introducing a new inner solver and a simple strategy for reducing the computational cost of each iteration. We evaluate the effectiveness of these improvements by solving large-scale benchmark problems and by comparison with a widely used decomposition package.     

The Chang-Łoś-Suszko theorem in a topological setting

The Chang-Łoś-Suszko theorem of first-order model theory characterizes universal-existential classes of models as just those elementary classes that are closed under unions of chains. This theorem can then be used to equate two model-theoretic closure conditions for elementary classes; namely unions of chains and existential substructures. In the present paper we prove a topological analogue and indicate some applications.     

Banach空间中强增生型变分包含解的具误差的Ishikawa迭代逼近

该文研究Ｂａｎａｃｈ空间中一类强增生型变分包含解的存在性及其具误差的Ｉｓｈｉｋａｗａ迭代程序的收敛性问题．该文结果是几位作者早期与最近的相应结果的改进和推广．     

准晶体中八方晶系点群的对称性与矩阵表示

从理论上对准晶体中八方晶系各点群进行了研究.运用八方晶系各点群的极赤投影图,列出了各点群的所有对称操作;填出了固有点群822的群乘表.运用坐标变换和群论在自定义的八方坐标系中,推导出八方晶系点群所有对称操作的矩阵.这32个3×3矩阵的结构是相当简洁的,它们的矩阵元只有5种可能取值:0,±1,±2.其中2是反映八方晶系准晶体所具有的准周期性的特殊无理数.     

An applied cell mapping method for optimal control problems

From the application point of view, a series of modifications are proposed for the cell mapping method discussed in Ref. 1 for the optimal control analysis of dynamical systems. The cell order around the target set is rearranged. A set of common discriminate principles is used for the selection of the optimal one among competing control strategies of the same cost. Inequality constraints of the system are taken into account. The number of elements in the set of allowable time intervals is not prescribed, but left open. These modifications seem to make the cell mapping method more efficient for analyzing feedback systems and for obtaining their global optimal control information. The algorithms presented in this paper could broaden the application of the cell mapping approach of Ref. 1 to a wider class of engineering problems.     

在一个新步长规则下梯度投影算法的全局收敛性

考虑约束最优化问题：minx∈Ωf(x)其中:f:R^n→R是连续可微函数，Ω是一闭凸集。本文研究了解决此问题的梯度投影方法，在步长的选取时采用了一种新的策略，在较弱的条件下，证明了梯度投影响方法的全局收敛性。     

弱(L_1,L_2)-BLD映射的正则性

本文首先将文［１］中的ＢＬＤ映射推广为弱（Ｌ１，Ｌ２）－ＢＬＤ映射，并证明了如下正则性结果：存在两个可积指数 Ｐ１＝Ｐ１（ｎ，Ｌ１，Ｌ２）＜ｎ＜ｑ１＝ｑ１（ｎ，Ｌ１，Ｌ２），使得对任意弱（Ｌ１，Ｌ２）－ＢＬＤ映射ｆ∈（Ω，Ｒｎ），都有ｆ∈（Ω，Ｒｎ），即ｆ为（Ｌ１，Ｌ２）－ＢＬＤ映射．