基于Sinc插值与相关谱的纵横波速度比扫描方法

在多分量地震技术中，准确地求取出纵、横波速比（γ）是多分量资料处理、反演、解释各环节中的一个重要步骤。由于地下同一层位具有相同的波阻抗比，因此该层位的反射纵波和反射转换波相互关联，纵横波速比与时间比存在相互转化关系。基于Sinc插值算法与相关系数谱分析的纵横波速比扫描方法是通过设置一系列γ，利用Sinc插值算法将纵波拉伸后与转换波进行互相关，当互相关系数达到最大时即可求出相应的γ。理论数据和实际资料的测试，验证了该方法的有效性、准确性和实用性。     

Rocky coast processes: with special reference to the recession of soft rock cliffs

Substantial progress in research on the recession of coastal cliffs composed of soft materials has been made in recent years and data with higher accuracy have been accumulated. This paper provides the state of the art review in the recession studies and highlights two new findings obtained from the reanalysis of existing data. The review topics are: episodic and localized nature of cliff recession; the development of cliffline; the relationship between cliff height and recession rate; mechanisms of cliff toe erosion by waves; a fundamental equation for wave-induced toe erosion; factors controlling toe erosion; and slope instabilities and mass movements. The findings are presented on (1) the temporal change in cliffline recession mode and (2) the effect of beach sediment at the cliff base on the cliff erosion.     

2018年天文学热点回眸

 天文学是一门以观测为基础的学科，其发展主要依靠观测和数据的支持。基于SAO/NASA Astrophysics Data System天文物理学数据系统中高被引文章并结合热点新闻报道，回顾了2018年天文学热点的进展和发现，以观测和基础研究、仪器研制及工具开发两大方面论述了2018年天文学研究热点。     

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.     

定逆序数的n元数码置换个数的一种方法

一个确定的n元数码的排列,其道序数是不难求得的;反之,“已知逆序数,求有多少个n元置换”的问题要复杂得多。从最小数码的位置着手,充分利用逆序数是定数,给出一种解决此问题的新方法——最小数码定位法。此法通俗易懂,由此得到了逆序数为k(k=1,2,3……c_n~2)的n元数码的置换个数的一个递推公式:q_k(n)=1+q_1(n-l)+q_2(n-1)+q_3(n-1)+…+q_k(n-1)。     

4一致C-超图的最小边数问题

研究了上色数为3的4一致C-超图的最小边数问题，并给出了上色数为3的4一致C-超图的最小边数的一个上界．     

Approximation of bandlimited functions

Many signals encountered in science and engineering are approximated well by bandlimited functions. We provide suitable error bounds for the approximation of bandlimited functions by linear combinations of certain special functions—the prolate spheroidal wave functions of order 0. The coefficients in the approximating linear combinations are given explicitly via appropriate quadrature formulae.     

Proof of a conjecture on irredundance perfect graphs

Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002