This paper introduces a fast high-resolution imaging algorithm designed for ultra-wideband radar, and combines modified Kirchhoff migration and frequency-wavenumber (F-K) migration. The proposed algorithm also uses the texture method and inverse boundary scattering transform to calculate efficiently the integral arising in modified Kirchhoff migration, and thus enabling the integral in the F-K ...

The hyper-Kirchhoff index is introduced when the hyper-Wiener operator is applied to the resistance-distance matrix of a connected graph. We give lower and upper bounds for the hyper-Kirchhoff index, and determine the n-vertex unicyclic graphs with the smallest, the second and the third smallest as well as the largest, the second and the third largest hyper-Kirchhoff indices for n ≥ 5. We also ...

the degree kirchhoff index of a connected graph $g$ is defined as‎ ‎the sum of the terms $d_i,d_j,r_{ij}$ over all pairs of vertices‎, ‎where $d_i$ is the‎ ‎degree of the $i$-th vertex‎, ‎and $r_{ij}$ the resistance distance between the $i$-th and‎ ‎$j$-th vertex of $g$‎. ‎bounds for the degree kirchhoff index of the line and para-line‎ ‎graphs are determined‎. ‎the special case of regular grap...

Biogeography-Based Optimization (BBO) has recently gained interest of researchers due to its simplicity in implementation, efficiency and existence of very few parameters. The BBO algorithm is a new type of optimization technique based on biogeography concept. This population-based algorithm uses the idea of the migration strategy of animals or other species for solving optimization problems. t...

For the SEG-EAGE salt data set, common-azimuth migration produces better images in the subsalt than single-arrival Kirchhoff migration, at a similar computational cost. Subsalt reflectors are better imaged and the typical Kirchhoff artifacts caused by severe multipathing disappear. We show how angle-domain Common Image Gathers (CIG) can be easily extracted from prestack wavefield downward conti...

In this paper, I present a modification of the Beylkin inversion operator. This modification accounts for the band-limited nature of the data and makes the role of discontinuities in the sound speed more precise. The inversion presented here partially dispenses with the small-parameter constraint of the Born approximation. This is shown by applying the proposed inversion operator to upward scat...

A frequently used broadband array imaging method is Kirchhoff or travel time migration. In smooth and known media Kirchhoff migration works quite well, with range resolution proportional to the reciprocal of the bandwidth and cross range resolution that is proportional to the reciprocal of the array size. In a randomly inhomogeneous medium, Kirchhoff migration is unreliable because the images d...

We prove the existence of multiple solutions for following sixth-order $p(x)$-Kirchhoff-type problem: $-M(\int_\Omega \frac{1}{p(x)}|\nabla \Delta u|^{p(x)}dx)\Delta^3_{p(x)} u = \lambda f(x)|u|^{q(x)-2}u + g(x)|u|^{r(x)-2}u h(x) \ \mbox{on} \Omega$ and $ u=\Delta u=\Delta^2 u=0 \partial\Omega,$ where $\Omega \subset \mathbb{R}^N$ is a smooth bounded domain, $N > 3$, $\Delta_{p(x)}^3u \operator...

We study the problem of enumerating all rooted directed spanning trees (arborescences) of a directed graph (digraph) G = (V,E) of n vertices. An arborescence A consisting of edges e1, . . . , en−1 can be represented as a monomial e1 · e2 · · · en−1 in variables e ∈ E. All arborescences arb(G) of a digraph then define the Kirchhoff polynomial ∑ A∈arb(G) ∏ e∈A e. We show how to compute a compact ...