工程实践中的体系与系统

 介绍了国际上通行的体系概念，通过实例阐述了常见的体系类型，从多个维度描述了系统与体系的区别，根据实践总结，提出体系与系统的核心界定准则，并结合工程实践进行了详细描述。     

Springer basic sets and modular Springer correspondence for classical types

We define the notion of basic set data for finite groups (building on the notion of basic set, but including an order on the irreducible characters as part of the structure), and we prove that the Springer correspondence provides basic set data for Weyl groups. Then we use this to determine explicitly the modular Springer correspondence for classical types (defined over a base field of odd characteristic $p$, and with coefficients in a field of odd characteristic $?\ne p$): the modular case is obtained as a restriction of the ordinary case to a basic set. In order to do so, we compare the order on bipartitions introduced by Dipper and James with the order induced by the Springer correspondence. We provide a quick proof, by sorting characters according to the dimension of the corresponding Springer fibre, an invariant which is directly computable from symbols.     

A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form

The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot. It is believed that the structural characteristics of different SAT formula classes are the reasons behind this difference. In this paper, we study the structural properties of propositional formulas in conjunctive normal form (CNF) by the principle of structural entropy of formulas. First, we used structural entropy to measure the complex structure of a formula and found that the difficulty solving the formula is related to the structural entropy of the formula. The smaller the compressing information of a formula, the more difficult it is to solve the formula. Secondly, we proposed a λ-approximation strategy to approximate the structural entropy of large formulas. The experimental results showed that the proposed strategy can effectively approximate the structural entropy of the original formula and that the approximation ratio is more than 92%. Finally, we analyzed the structural properties of a formula in the solution process and found that a local search solver tends to select variables in different communities to perform the next round of searches during a search and that the structural entropy of a variable affects the probability of the variable being flipped. By using these conclusions, we also proposed an initial candidate solution generation strategy for a local search for SAT, and the experimental results showed that this strategy effectively improves the performance of the solvers CCAsat and Sparrow2011 when incorporated into these two solvers.     

考虑外委的露天矿剥岩计划的优化研究

针对“剥岩高峰”对矿山生产带来的不利影响，研究了设备配置更新策略与露天开采外委剥离的优化问题.基于铲运设备的运营成本与生产能力随设备役龄变化的关系，建立了决策单台设备退役时间的动态经济寿命计算模型，并根据此模型给出了具体的设备配置算法步骤.设置一系列不同的矿山自剥离量与外委剥离量的分界水平，计算各分界水平条件下的外委单价可行区间，然后在区间内确定外委商谈价格并分析得出与之对应的总成本净现值最低的外委方案.实例计算证明，采用该方法减少设备投资的成本要高于外委岩石剥离成本.     

Pure tetrahedral quadruple systems with index two

An oriented tetrahedron defined on four vertices is a set of four cyclic triples with the property that any ordered pair of vertices is contained in exactly one of the cyclic triples. A tetrahedral quadruple system of order $n$ with index $\lambda$, denoted by ${\text{TQS}}_{\lambda }\left(n\right)$, is a pair $\left(X,\mathrm{?}\right)$, where $X$ is an $n$‐set and $\mathrm{?}$ is a set of oriented tetrahedra (blocks) such that every cyclic triple on $X$ is contained in exactly $\lambda$ members of $\mathrm{?}$. A ${\text{TQS}}_{\lambda }\left(n\right)$ is pure if there do not exist two blocks with the same vertex set. When $\lambda =1$, the spectrum of a pure TQS $\left(n\right)$ has been completely determined by Ji. In this paper, we show that there exists a pure ${\text{TQS}}_2\left(n\right)$ if and only if $n\equiv 1,2\left(\mathrm{mod}3\right)$ and $n\ge 7$. A corollary is that a simple ${\text{QS}}_4\left(n\right)$ also exists if and only if $n\equiv 1,2\left(\mathrm{mod}3\right)$ and $n\ge 7$.     

Collective Tunnelling of Strongly Interacting Cold Atoms in a Double-Well Potential

It is known that under resonance conditions, a group of strongly interacting bosonic atoms, trapped in a double-well potential, mimics a single particle, performing Rabi oscillations between the wells. By implication, all atoms need to tunnel at roughly the same time, even though the Bose–Hubbard Hamiltonian accounts only for one-atom-at-a-time transfers. The mechanism of this collective behavior is analyzed, the Rabi frequencies in the process are evaluated, and the limitation of this simple picture is discussed. In particular, it is shown that the small rapid oscillations superimposed on the slow Rabi cycle result from splitting the transferred cluster at the sudden onset of tunnelling, and disappear if tunnelling is turned on gradually.