Body fitted link-cell algorithm for particulate flow simulation in curved pipeline domain

The link-cell (LC) algorithm is widely used in discrete element method (DEM) simulation, in order to increase computational efficiency. The common way is to divide the entire computational domain into a series of square sub-cells. A huge index matrix, Ω$\Omega$, is required to store the information of particles located in each of these sub-cells. However, most of these sub-cells are always empty for some anomalistic computational domain, such as particulate flow in a pipeline. These empty sub-cells also consume the limited memory bandwidth and lower the computational power. In order to reduce the size of the index matrix, a body fitted link-cell (BFLC) algorithm is established to identify the neighbors quickly. Furthermore, a simplified algorithm for simulation of two dimensional particulate flow in curved pipelines is presented. Lastly, an example is presented to validate the BFLC algorithm.     

Theoretical line list of D2 O up to 16,000 cm with an accuracy close to experimental

A line list for D₂ ¹⁶O isotopologue of water molecule was calculated in the region 0-16,000 cm⁻¹ with energy levels up to J=30. Variational calculations are based on the semi-theoretical potential energy surface obtained by morphing ab initio potential using the experimental energy levels of D₂ ¹⁶O. For energy levels with J=0, 2, 5 and 10, the standard deviation of the fit is 0.023 cm⁻¹. This line list should make an excellent starting point for spectroscopic modeling and analysis of D₂O rovibrational spectra.     

List coloring triangle-free planar graphs

This paper proves the following result. Assume $G$ is a triangle-free planar graph, $X$ is an independent set of $G$. If $L$ is a list assignment of $G$ such that $\text{◂=▸}|L\left(v\right)|=4$ for each vertex $\text{◂+▸}v\in V\left(G\right)-X$ and $\text{◂=▸}|L\left(v\right)|=3$ for each vertex $v\in X$, then $G$ is $L$-colorable.     

Arc reversals of cycles in orientations of G vertex-multiplications

Ryser proved that any two tournaments with the same score sequence are $C_3$-equivalent while Beineke and Moon proved the $C_4$-equivalence for any two bipartite tournaments with the same score lists. In this paper, we extend these results to orientations of G vertex-multiplications. We focus on two main areas, namely orientations with the same score list and with score-list parity. Our main tools are extensions of the refinement technique, directed difference graph and a reduction lemma.     

Degree constrained subgraphs

In this paper, we present new structural results about the existence of a subgraph where the degrees of the vertices are pre-specified. Further, we use these results to prove a 16-edge-weighting version of a conjecture by Karoński, ?uczak and Thomason, an asymptotic 2-edge-weighting version of the same conjecture, and a version of Louigi's Conjecture.     

List colorings with measurable sets

The measurable list chromatic number of a graph G is the smallest number ξ such that if each vertex v of G is assigned a set L(v) of measure ξ in a fixed atomless measure space, then there exist sets such that each c(v) has measure one and for every pair of adjacent vertices v and v'. We provide a simpler proof of a measurable generalization of Hall's theorem due to Hilton and Johnson [J Graph Theory 54 (2007), 179–193] and show that the measurable list chromatic number of a finite graph G is equal to its fractional chromatic number. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 229–238, 2008     

基于几何差异的目标识别算法

为降低目标识别算法复杂性且提高其抗噪能力,提出一种基于几何特征差异的目标识别算法。将获取到的目标图片经图像处理后提取轮廓,并以最小周长多边形算法构造目标轮廓的近似多边形;然后根据模板库标准目标做放大或缩小处理后使其面积与模板面积相等;再使用摆放算法使其与模板库图形部分重合;并提出一种改进型双向链表算法求多边形相交部分,通过计算相交部分面积大小达到识别图像的目的。经过仿真实验验证了此方法简单易行,能够快速识别目标。     

A simple algorithm to accelerate the computation of non-bonded interactions in cell-based molecular dynamics simulations

Cell lists are ubiquitous in molecular dynamics simulations--be it for the direct computation of short-range inter-atomic potentials, the short-range direct part of a long-range interaction or for the periodic construction of Verlet lists. The conventional approach to computing pairwise interactions using cell lists leads to a large number of unnecessary interparticle distance calculations. In this paper, an algorithm is presented which reduces the number of spurious distance calculations by first sorting the particles along the cell pair axis and then only interacting two particles if their distance along the axis is smaller than the cutoff distance of the interaction. This approach is shown to be more efficient than the conventional approach and similar approaches using smaller cells.