Characterization and linear-time detection of minimal obstructions to concave-round graphs and the circular-ones property

A graph is concave-round if its vertices can be circularly enumerated so that the closed neighborhood of each vertex is an interval in the enumeration. In this study, we give a minimal forbidden induced subgraph characterization for the class of concave-round graphs, solving a problem posed by Bang-Jensen, Huang, and Yeo [SIAM J. Discrete Math., 13 (2000), pp. 179–193]. In addition, we show that it is possible to find one such forbidden induced subgraph in linear time in any given graph that is not concave-round. As part of the analysis, we obtain characterizations by minimal forbidden submatrices for the circular-ones property for rows and for the circular-ones property for rows and columns and show that, also for both variants of the property, one of the corresponding forbidden submatrices can be found (if present) in any given matrix in linear time. We make some final remarks regarding connections to some classes of circular-arc graphs.     

Change of evaporation rate of single monocomponent droplet with temperature using time-resolved phase rainbow refractometry

Droplet evaporation characterization, although of great significance, is still challenging. The recently developed phase rainbow refractometry (PRR) is proposed as an approach to measuring the droplet temperature, size as well as evaporation rate simultaneously, and is applied to a single flowing n-heptane droplet produced by a droplet-on-demand generator. The changes of droplet temperature and evaporation rate after a transient spark heating are reflected in the time-resolved PRR image. Results show that droplet evaporation rate increases with temperature, from ?1.28$\times {10}^{?8}$ m²/s at atmospheric 293 K to a range of (?1.5, ?8)$\times {10}^{?8}$ m²/s when heated to (294, 315) K, agreeing well with the Maxwell and Stefan–Fuchs model predictions. Uncertainty analysis suggests that the main source is the indeterminate gradient inside droplet, resulting in an underestimation of droplet temperature and evaporation rate. With the demonstration on simultaneous measurements of droplet refractive index as well as droplet transient and local evaporation rate in this work, PRR is a promising tool to investigate single droplet evaporation in real engine conditions.     

Estimations of subgraph positions in molecular graphs and their common subgraph peculiarities

Some questions emerged from electronic data processing of molecular structures (graphs) and its fragments have been considered in this work. Quantitative estimations of subgraph positions in molecular graphs are presented and some properties of their maximal common subgraphs are described.     

Law of the iterated logarithm for random graphs

A milestone in probability theory is the law of the iterated logarithm (LIL), proved by Khinchin and independently by Kolmogorov in the 1920s, which asserts that for iid random variables with mean 0 and variance 1 In this paper we prove that LIL holds for various functionals of random graphs and hypergraphs models. We first prove LIL for the number of copies of a fixed subgraph H. Two harder results concern the number of global objects: perfect matchings and Hamiltonian cycles. The main new ingredient in these results is a large deviation bound, which may be of independent interest. For random k‐uniform hypergraphs, we obtain the Central Limit Theorem and LIL for the number of Hamilton cycles.     

On percolation and ‐hardness

The edge‐percolation and vertex‐percolation random graph models start with an arbitrary graph G, and randomly delete edges or vertices of G with some fixed probability. We study the computational complexity of problems whose inputs are obtained by applying percolation to worst‐case instances. Specifically, we show that a number of classical ‐hard problems on graphs remain essentially as hard on percolated instances as they are in the worst‐case (assuming ). We also prove hardness results for other ‐hard problems such as Constraint Satisfaction Problems and Subset‐Sum, with suitable definitions of random deletions. Along the way, we establish that for any given graph G the independence number and the chromatic number are robust to percolation in the following sense. Given a graph G, let be the graph obtained by randomly deleting edges of G with some probability . We show that if is small, then remains small with probability at least 0.99. Similarly, we show that if is large, then remains large with probability at least 0.99. We believe these results are of independent interest.     

彩虹自标定方法对混合喷雾比例的原位测量

传统彩虹测量技术标定复杂、精度可重复性差且难以适应密闭空间。一种基于多彩虹谱线自标定方法,可省去原有的标定系统装置,将标定过程内化于对彩虹信号的处理,以水为例的测量偏差仅为0.13%。将该技术应用于混合喷雾液滴组分浓度测量中,探究并优化了参与混合的两种液体组分的方案。实验采用60%乙醇-水混合喷雾,原位测量了混合喷雾场多点组分浓度,测量结果差别可以控制在0.5%以内,表明该方法技术在相关领域的应用潜力。     

多层球对高斯波束散射的德拜级数研究

基于广义洛伦兹-米氏理论,利用多层球粒子散射系数的德拜级数展开公式,提出了一种新的研究多层球粒子对高斯波束散射的方法。计算结果与已有的广义洛伦兹-米氏理论算法的计算结果吻合得很好。利用该方法有效分离了折射率分布满足指数变化规律的多层球粒子对高斯波束散射的远区散射场中多阶彩虹的干涉强度分布。数值模拟了双层球的归一化双一阶彩虹强度分布以及各层的一阶彩虹艾里结构。最后分析讨论了高斯波束的入射位置和束腰半径对多层球单阶彩虹强度分布的影响。     

狭缝的演变与彩虹全息术的发展

彩虹全息术的发生与发展是与狭缝的引入与演变相关的。本文试图用一个简明的表格形式把迄今为止存在着的各种彩虹全息图及其变化状态做一个形象化的小结。     

真彩色彩虹全息图图像合成技术

介绍了真彩色虹全息图图像的合成技术，讨论了合成的记录光路和两个物体的相对位置随Ｈ１的记录光波长而变化所应满足的关系，以防止两个物体的再现像因错位而发生互相干扰的现象。