one of the common problems in reflective seismic records is the existence of coherent linear and random noises which cause covering of the most important parts of reflective signals; therefore, it is necessary to attenuate them by processing methods. several processing techniques have been devised for attenuation of coherent linear noises and linear radon or ?-? transform is a powerful techniqu...

the steger and warming flux vector splitting implicit scheme is used to numerically solve two dimensional reynolds averaged navier–stokes (rans) equations governing the vortex induced vibration of a flexible riser laterally supported by a spring and a damper. the k–ε model is used as turbulence model to simulate the turbulent flow in the wake of the riser. to update the new position of the rise...

This paper designs a set of graph operations and proves that starting from Gd , by repeatedly applying these operations, one can construct all graphs G with χc(G) ≥ k/d (for k/d ≥ 3). This can be viewed as an analogue of Hajós’ Theorem for the circular chromatic number.

The Grundy number of a graph G, denoted by Γ (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm according to some ordering of the vertices of G. Trivially Γ (G) ≤ ∆(G) + 1. In this paper, we show that deciding if Γ (G) ≤ ∆(G) is NP-complete. We then show that deciding if Γ (G) ≥ |V (G)| − k is fixed parameter ...

This paper designs a set of graph operations and proves that starting from Gd , by repeatedly applying these operations, one can construct all graphs G with χc(G) ≥ k/d (for k/d ≥ 3). This can be viewed as an analogue of Hajós’ Theorem for the circular chromatic number.

Let p(n) be the number of partitions of the positive integer n. A new q-series identity is presented which witnesses Ramanujan’s observation that 11|p(11n+6) for all n ≥ 0 at one glance. This identity can be derived in a natural way by applying an algorithm to present subalgebras of the polynomial ring K[z] as K[z]-modules.

For an n×n random image with independent pixels, black with probability p(n) and white with probability 1−p(n), the probability of satisfying any given firstorder sentence tends to 0 or 1, provided both p(n)n 2 k and (1 − p(n))n 2 k tend to 0 or +∞, for any integer k. The result is proved by computing the threshold function for basic local sentences, and applying Gaifman’s theorem.

The Grundy number of a graph G is the largest k such that G has a greedy k-coloring, that is, a coloring with k colors obtained by applying the greedy algorithm according to some ordering of the vertices of G. In this article, we give new bounds on the Grundy number of the product of two graphs. 2011 Wiley Periodicals, Inc. J Graph Theory

The study area, located in the southern section of the Central Iranian volcano–sedimentary complex, contains a large number of mineral deposits and occurrences which is currently facing a shortage of resources. Therefore, the prospecting potential areas in the deeper and peripheral spaces has become a high priority in this region. Different direct and indirect methods try to predict promising a...

In this article we consider the differential inclusion − div(|∇u|p(x)−2∇u) ∈ ∂F (x, u) in Ω, u = 0 on ∂Ω which involves the p(x)-Laplacian. By applying the nonsmooth Mountain Pass Theorem, we obtain at least one nontrivial solution; and by applying the symmetric Mountain Pass Theorem, we obtain k-pairs of nontrivial solutions in W 1,p(x) 0 (Ω).