A reference length approach for the 3D strip packing problem

In the three-dimensional strip packing problem (3DSP), we are given a container with an open dimension and a set of rectangular cuboids (boxes) and the task is to orthogonally pack all the boxes into the container such that the magnitude of the open dimension is minimized. We propose a block building heuristic based on extreme points for this problem that uses a reference length to guide its solution. Our 3DSP approach employs this heuristic in a one-step lookahead tree search algorithm using an iterative construction strategy. We tested our approach on standard 3DSP benchmark test data; the results show that our approach produces better solutions on average than all other approaches in literature for the majority of these data sets using comparable computation time.     

Numerical prediction of locally forced turbulent separated and reattaching flow

An unsteady numerical simulation was performed for locally forced separated and reattaching flow over a backward-facing step. The local forcing was given to the separated and reattaching flow by means of a sinusoidally oscillating jet from a separation line. A version of the k––f_μ model was employed, in which the near-wall behavior without reference to distance and the nonequilibrium effect in the recirculation region were incorporated. The Reynolds number based on the step height (H) was fixed at Re_H=33 000, and the forcing frequency was varied in the range 0St_H2. The predicted results were compared and validated with the experimental data of Chun and Chun. It was shown that the unsteady locally forced separated and reattaching flows are predicted reasonably well with the k––f_μ model. To characterize the large-scale vortex evolution due to the local forcing, numerical flow visualizations were carried out.     

对乙酰基偶氮胂吸光光度法测定微量铜

在pH5.0的(CH2)6N4-HCl缓冲介质中,Cu(Ⅱ)与对乙酰基偶氮胂(ASApA)形成1比2络合物,λmax＝598nm,εmax=1.30×104L·mol-l·cm-1,铜浓度在0～2.0mg·L-1范围内遵从比耳定律。方法用于粮食、食品、水、树叶及人发等试样中铜的测定,结果满意。     

λ_5-geometry中的Steiner树问题(Ⅰ)

本文首先提出了 λ5-geometry中的 Steiner最小树问题 .讨论了 λ5-ge-ometry中的 Steiner最小树的若干性质 ,并给出了给定点数为 3或 4时 Steiner最小树的基本结构 .     

Reeb posets and tree approximations

A well known result in the analysis of finite metric spaces due to Gromov says that given any metric space $(X,d_X)$ there exists a tree metric $t_X$ on $X$ such that ${|d_X-t_X|}_{\infty }$ is bounded above by twice $\mathrm{hyp}\left(X\right)\cdot log\left(2\left|X\right|\right)$. Here $\mathrm{hyp}\left(X\right)$ is the hyperbolicity of $X$, a quantity that measures the treeness of 4-tuples of points in $X$. This bound is known to be asymptotically tight.We improve this bound by restricting ourselves to metric spaces arising from filtered posets. By doing so we are able to replace the cardinality appearing in Gromov’s bound by a certain poset theoretic invariant which can be much smaller thus significantly improving the approximation bound.The setting of metric spaces arising from posets is rich: For example, every finite metric graph can be induced from a filtered poset. Since every finite metric space can be isometrically embedded into a finite metric graph, our ideas are applicable to finite metric spaces as well.At the core of our results lies the adaptation of the Reeb graph and Reeb tree constructions and the concept of hyperbolicity to the setting of posets, which we use to formulate and prove a tree approximation result for any filtered poset.     

Efficient coupling of direct forcing immersed boundary-lattice Boltzmann method and finite element method to simulate fluid-structure interactions

Fluid-structure interactions (FSI) of rigid and flexible bodies are simulated in this article. For the fluid flow, multidirect forcing immersed boundary method (IBM) is adopted to capture the moving boundary, and lattice Boltzmann method (LBM) is used to evolve the flow field. Compared with our previous no-penetration IBM, less iterations are required in this work. In addition, larger velocity in lattice units can be used and the nonphysical force oscillations are suppressed due to the C³ 6-point kernel. Multi-relaxation-time collision operator and local grid refinement are also adopted in LBM to enhance the numerical stability and efficiency. To improve the efficiency of the FSI coupling algorithm, the mesh of the deformable structure can be coarser than the Lagrangian mesh using Newton-Cotes formulas to integrate the traction on the structure surface. A variety of benchmarks, including flow around a circular cylinder with Reynold number ranging from 20 to 200, forced oscillation of a circular cylinder, vortex-induced vibration (VIV) of an elastically mounted circular cylinder in two degrees of freedom, and VIV of an elastic cantilever beam attached to a circular cylinder, are carried out to evaluate the accuracy and stability of the present coupling algorithm. For the benchmark FSI problem considered in this article, a reduction of 54% of the calculation time is achieved using coarser structure mesh. As an application of the FSI coupling algorithm, the mechanism of an elastic beam in the wake of a circular cylinder is discussed.     

More on the Least Strongly Compact Cardinal

We show that it is consistent, relative to a supercompact limit of supercompact cardinals, for the least strongly compact cardinal k to be both the least measurable cardinal and to be > 2^k supercompact.     

Algebraic connectivity of weighted trees under perturbation

We investigate how the algebraic connectivity of a weighted tree behaves when the tree is perturbed by removing one of its branches and replacing it with another. This leads to a number of results, for example the facts that replacing a branch in an unweighted tree by a star on the same number of vertices will not decrease the algebraic connectivity, while replacing a certain branch by a path on the same number of vertices will not increase the algebraic connectivity. We also discuss how the arrangement of the weights on the edges of a tree affects the algebraic connectivity, and we produce a lower bound on the algebraic connectivity of any unweighted graph in terms of the diameter and the number of vertices. Throughout, our techniques exploit a connection between the algebraic connectivity of a weighted tree and certain positive matrices associated with the tree.     

Generalized random energy model

This paper applies the large deviation technique to a general tree formulation of Generalized Random Energy Model. The similarities and dissimilarities between the exponential and the Gaussian model are discussed. Formulae for limiting free energies, characterization of energy functions are obtained. Limiting case of the tree structure and randomization of the trees are also investigated.