A Poisson–Boltzmann solver on irregular domains with Neumann or Robin boundary conditions on non-graded adaptive grid

We introduce a second-order solver for the Poisson–Boltzmann equation in arbitrary geometry in two and three spatial dimensions. The method differs from existing methods solving the Poisson–Boltzmann equation in the two following ways: first, non-graded Quadtree (in two spatial dimensions) and Octree (in three spatial dimensions) grid structures are used; Second, Neumann or Robin boundary conditions are enforced at the irregular domain’s boundary. The irregular domain is described implicitly and the grid needs not to conform to the domain’s boundary, which makes grid generation straightforward and robust. The linear system is symmetric, positive definite in the case where the grid is uniform, nonsymmetric otherwise. In this case, the resulting matrix is an M-matrix, thus the linear system is invertible. Convergence examples are given in both two and three spatial dimensions and demonstrate that the solution is second-order accurate and that Quadtree/Octree grid structures save a significant amount of computational power at no sacrifice in accuracy.     

考虑壁面接触效应的微流动数值模拟

使用level set和volume of fluid(VOF)方法对考虑壁面接触效应的不可压缩两相微流动进行数值模拟.对于level set方法,计算基于MAC网格,使用二阶投影算法求解二维Navier-Stokes(N-S)方程和level set函数方程;对于VOF方法,通过引入计算网格内的体积分数,将流场的参数转化为体积平均值,界面的形状由体积分数连续方程的解决定.给出一些计算实例,并和现有的实验结果进行比较.     

基于窄带多区域水平集方法的遥感图像分割

由于遥感图像存在边缘混叠等问题,经典的C-V模型会产生大量的冗余轮廓,而且无法分割多个同质区域的目标.为此,提出了基于C-V模型的窄带多区域水平集图像分割方法,采用N-1个水平集函数将图像分割成N(N＞1)个区域,每个水平集函数表达一个区域.该方法一方面通过建立独立多区域水平集模型可以消除多余的轮廓,避免分割区域的重叠...     

相对性原理及其对自然界定律的协变性要求--机械能守恒定律协变性疑难的解答

阐明狭义相对性原理的准确含义,批出它并不要求自然界每条定律都单独协变,但要求每条定律至少属于一个协变集合,给出最小协变集的求法。表明机械能守恒定律满足狭义相对性原理及其对自然界定律的协变性要求,还指出一切社会科学定律也都满足狭义相对性原理。     

Homogeneous Isotropic Turbulence: Geometric and Isometry Properties of the 2-point Velocity Correlation Tensor

The emphasis of this review is both the geometric realization of the 2-point velocity correlation tensor field B_ij (x,x′,t) and isometries of the correlation space K³ equipped with a (pseudo-) Riemannian metrics ds²(t) generated by the tensor field. The special form of this tensor field for homogeneous isotropic turbulence specifies ds²(t) as the semi-reducible pseudo-Riemannian metric. This construction presents the template for the application of methods of Riemannian geometry in turbulence to observe, in particular, the deformation of length scales of turbulent motion localized within a singled out fluid volume of the flow in time. This also allows to use common concepts and technics of Lagrangian mechanics for a Lagrangian system (M^t, ds²(t)), M^t ? K³. Here the metric ds²(t), whose components are the correlation functions, evolves due to the von Kármán-Howarth equation. We review the explicit geometric realization of ds²(t) in K³ and present symmetries (or isometric motions in K³) of the metric ds²(t) which coincide with the sliding deformation of a surface arising under the geometric realization of ds²(t). We expose the fine structure of a Lie algebra associated with this symmetry transformation and construct the basis of differential invariants. Minimal generating set of differential invariants is derived. We demonstrate that the well-known Taylor microscale λ_g is a second-order differential invariant and show how λ_g can be obtained by the minimal generating set of differential invariants and the operators of invariant differentiation. Finally, we establish that there exists a nontrivial central extension of the infinite-dimensional Lie algebra constructed wherein the central charge is defined by the same bilinear skew-symmetric form c as for the Witt algebra which measures the number of internal degrees of freedom of the system. For turbulence, we give the asymptotic expansion of the transversal correlation function for the geometry generated by a quadratic form.     

Erdős matching conjecture for almost perfect matchings

In 1965 Erd?s asked, what is the largest size of a family of k-element subsets of an n-element set that does not contain a matching of size $s+1$? In this note, we improve upon a recent result of Frankl and resolve this problem for $s>101k^3$ and $(s+1)k?n<(s+1)(k+\frac{1}{100k})$.     

On reachable set bounding for discrete-time switched nonlinear positive systems with mixed time-varying delays and disturbance

This paper addresses the reachable set bounding for discrete-time switched nonlinear positive systems with mixed time-varying delays and disturbance, which contains switched linear positive systems as a special case. By resorting to a new method that does not involve the common Lyapunov–Krasovskii functional one, explicit criteria to ensure any state trajectory of the system converges exponentially into a prescribed sphere are obtained under average dwell time switching. The results can then be extended to more general time-varying systems. Finally, two numerical examples are used to demonstrate the effectiveness of the obtained results.     

Foundations of the quantum statistics of systems in equilibrium: A measuretheoretic approach

The fundamental equations of equilibrium quantum statistical mechanics are derived in the context of a measure-theoretic approach to the quantum mechanical ergodic problem. The method employed is an extension, to quantum mechanical systems, of the techniques developed by R. M. Lewis for establishing the foundations of classical statistical mechanics. The existence of a complete set of commuting observables is assumed, but no reference is made a priori to probability or statistical ensembles. Expressions for infinite-time averages in the microcanonical, canonical, and grand canonical ensembles are developed which reduce to conventional quantum statistical mechanics for systems in equilibrium when the total energy is the only conserved quantity. No attempt is made to extend the formalism at this time to deal with the difficult problem of the approach to equilibrium.     

基于正极性或-符合展开的易测性网络

为提高数字电路的可测性,提出了可实现任意逻辑函数的正极性或-符合网络的易测性实现,并给出了测试网络中所有单固定故障的通用测试集．该实现基于逻辑函数的正极性或-符合展开,网络的同或部分分别采用了串联和树形结构．为提高可测性,同或串的实现结构只需增加1个控制端及1个观察端,同或树的实现结构只需增加3个控制端及1个观察端．对于1个n变量的逻辑函数,两种实现结构下通用测试集的基数分别为（n＋4）和（n＋5）．这样短的通用测试集非常适合用内建自测试实现,从而有效地缩短测试时间．