A model is provided for crack problem in a functionally graded semi-infinite plate under an anti-plane load. The characteristic of material behavior is assumed to change in a linear manner along the plate length. Also the embedded crack is placed in the direction of the material change. The problem is solved using two separate techniques. Primary, by applying Laplace and Fourier transformation,...

Limited by the deficiency of the finite element method (FEM) to deal with infinite domain problems, the traditional FEM rolling model is not suitable enough to study the effect of the complex internal stress of the incoming strip on hot rolling deformation. To solve this problem, the finite element and infinite element (FE-IE) coupling method is adopted, where the finite element is for the roll...

In 2013, Tommi Lehtinen and Alexander Okhotin proved that if X is a code, then it has infinite deciphering delay if and only if there exist + ∈ A z y x , , with * , , , X zy yz xy x ∈ and * , X z y ∉ . In this paper, we give a sufficient and necessary condition for codes with infinite deciphering delay. Then, we construct two kinds of three-element codes with infinite deciphering delay.

In order to study the spectral decomposition (a,f(a» of Procaccia of the limit set L(G) of a finitely generated Fuchsian group G of rigid movements in the hyperbolic half plane IH, it is necessary to calculate the a of each element of L(G). Each such element is an allowed infinite word, each letter a generator of G. In this paper we calculate first the 0' of the periodic infinite words, and use...

In several problems of interest in computational modeling there is a media that is either infinite or semi-infinite. Some examples include: modeling the ocean when doing ship analysis, modeling the soil underneath a footing, and modeling the air around an airplane. However, every finite element model must be terminated at some finite boundary. Unfortunately, for problems involving wave propagat...

We show that in the setting of fair-coin measure on the power set of the natural numbers, each sufficiently random set has an infinite subset that computes no random set. That is, there is an almost sure event A such that if X ∈ A then X has an infinite subset Y such that no element of A is Turing computable from Y .