Computing upward topological book embeddings of upward planar digraphs

We describe a unified approach for studying book, point-set, and simultaneous embeddability problems of upward planar digraphs. The approach is based on a linear time strategy to compute an upward planar drawing of an upward planar digraph such that all vertices are collinear. Besides having impact in relevant application domains of graph drawing and computational geometry, the presented results open new research directions in the area of upward planarity with constraints of the positions of the vertices.     

A note on Hadwiger’s conjecture for W5-free graphs with independence number two

The Hadwiger number of a graph $G$, denoted $h\left(G\right)$, is the largest integer $t$ such that $G$ contains $K_t$ as a minor. A famous conjecture due to Hadwiger in 1943 states that for every graph $G$, $h\left(G\right)\ge \chi \left(G\right)$, where $\chi \left(G\right)$ denotes the chromatic number of $G$. Let $\alpha \left(G\right)$ denote the independence number of $G$. A graph is $H$-free if it does not contain the graph $H$ as an induced subgraph. In 2003, Plummer, Stiebitz and Toft proved that $h\left(G\right)\ge \chi \left(G\right)$ for all $H$-free graphs $G$ with $\alpha \left(G\right)\le 2$, where $H$ is any graph on four vertices with $\alpha \left(H\right)\le 2$, $H=C_5$, or $H$ is a particular graph on seven vertices. In 2010, Kriesell subsequently generalized the statement to include all forbidden subgraphs $H$ on five vertices with $\alpha \left(H\right)\le 2$. In this note, we prove that $h\left(G\right)\ge \chi \left(G\right)$ for all $W_5$-free graphs $G$ with $\alpha \left(G\right)\le 2$, where $W_5$ denotes the wheel on six vertices.     

Uniform bounds under increment conditions

We apply a majorizing measure theorem of Talagrand to obtain uniform bounds for sums of random variables satisfying increment conditions of the type considered in Gál-Koksma Theorems. We give some applications.

     

遥感相机自动检焦技术研究

将基于图像处理的自动检焦技术应用于线阵CCD推扫成像的空间遥感相机中。图像法检焦的关键在于对焦评价函数的选取。通常对焦评价函数是在摄影目标不变的情况下得出的,而推扫成像的线阵CCD相机在任意时刻所拍摄的景物都是不同的,这就给对焦评价函数的选取增加了难度。用功率谱的方法对任意景物在空间频域进行分析表明,功率谱对于自然景物具有一定的不变性。由此建立了基于功率谱的对焦评价函数,采用小波去噪与亮度归一化相结合的图像预处理技术有效地去除了图像噪声和亮度变化对对焦精度的影响。通过对功率谱评价函数进行加权处理,提高了对焦评价函数曲线的灵敏度。仿真实验表明了所构造的对焦评价函数是可行的。     

Around Multicolour Disordered Lattice Gas

We consider a system of multicolour disordered lattice gas, following closely the (monocolour) introduced by Faggionato and Martinelli^(3,4). We study the projection on the monocolour system and we derive an estimate of the closeness between grand canonical and canonical Gibbs measures. AMS Classification: Primary: 60K35, 82C20, 82C22     

从 ${\cal B}^0$ 到 $E(p,q)$ 和 $E_0(p,q)$ 空间的复合算子

设 $\varphi$ 是单位园盘 $D$ 到自身的解析映射, $X$ 是 $D$ 上解析函数的 Banach 空间, 对 $f\in X$, 定义复合算子$C_\varphi $ : $C_\varphi (f)=f\circ \varphi$. 我们利用从 ${\cal B}^0$到 $E(p,q)$ 和 $E_0(p,q)$ 空间的复合算子研究了空间 $E(p,q)$ 和 $E_0(p,q)$, 给出了一个新的特征.