Imposing accurate wall boundary conditions in corrective‐matrix‐based moving particle semi‐implicit method for free surface flow

Corrective matrix that is derived to restore consistency of discretization schemes can significantly enhance accuracy for the inside particles in the Moving Particle Semi‐implicit method. In this situation, the error due to free surface and wall boundaries becomes dominant. Based on the recent study on Neumann boundary condition (Matsunaga et al, CMAME, 2020), the corrective matrix schemes in MPS are generalized to straightforwardly and accurately impose Neumann boundary condition. However, the new schemes can still easily trigger instability at free surface because of the biased error caused by the incomplete/biased neighbor support. Therefore, the existing stable schemes based on virtual particles and conservative gradient models are applied to free surface and nearby particles to produce a stable transitional layer at free surface. The new corrective matrix schemes are only applied to the particles under the stable transitional layer for improving the wall boundary conditions. Three numerical examples of free surface flows demonstrate that the proposed method can help to reduce the pressure/velocity fluctuations and hence enhance accuracy further.     

介观电路中量子纠缠的经典对应

从量子力学诞生日起,它的经典对应(或类比)一直是物理学家关心的话题.本文以介观电路量子化的框架中,带有互感的两个介观电容-电感(LC)电路为例,首次讨论了量子纠缠的经典类比(或对应)问题.先用有序算符内的积分理论证明其互感是产生量子纠缠的源头;再推导出求解特征频率的公式,就发现它与一个经典系统的小振动频率的表达式有相似之处,该经典系统组成如下:两个墙壁各连一个相同的弹簧,两个弹簧之间接着一个滑动小车可以在光滑的桌面上运动,小车挂有一根单摆.用分析力学求此系统的小振动频率,发现与上述介观电路的特征频率形式类似,单摆的摆动会造成小车来回振动,摆、小车和弹簧的互相牵制效应反映了小车和摆的"纠缠".     

Quantifier-free epistemic term-modal logic with assignment operator

In standard epistemic logic, the names and the existence of agents are usually assumed to be common knowledge implicitly. This is unreasonable for various applications in computer science and philosophy. Inspired by term-modal logic and assignment operators in dynamic logic, we introduce a lightweight modal predicate logic where names can be non-rigid, and the existence of agents can be uncertain. The language can handle various de dicto/de re distinctions in a natural way. We characterize the expressive power of our language, obtain complete axiomatisations of the logics over several classes of varying-domain/constant-domain epistemic models, and show their (un)decidability.