analysis of the stresses, displacements, and horizontal strains of the ground subsidence due to underground excavation in rocks can be accomplished by means of a hybridized higher order indirect boundary element/finite difference (be/fd) formulation. a semi-infinite displacement discontinuity field is discretized (numerically) using the cubic displacement discontinuity elements (i.e. each highe...

the rapid melting of a semi- infinite body due to the absorption of a cw laser beam radiation has been studied. the enthalpy technique for the solution of phase change problems has been used in an explicit finite difference form to calculate the transient temperature distribution in the semi-infinite body and the growth rate of the melt pool. the technique has been modified so that it is not ne...

We present the infinite dynamic Bayesian network model (iDBN), a nonparametric, factored state-space model that generalizes dynamic Bayesian networks (DBNs). The iDBN can infer every aspect of a DBN: the number of hidden factors, the number of values each factor can take, and (arbitrarily complex) connections and conditionals between factors and observations. In this way, the iDBN generalizes o...

In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.

for dynamic analyses of railway track structures, the algorithm of solution is very important. for estimating the important problems in the railway tracks such as the effects of rail joints, rail supports, rail modeling in the nearness of bridge and other problems, the models of the axially beam model on the elastic foundation can be utilized. for studying the effects of axially beam on the ela...

1.3 We argue by contradiction. Thus we suppose that A is infinite and derive a contradiction. As a preliminary, observe that A is non-empty and hence has a ≤-least element, a first element. It also has a ≤∗-least element, a ≤-greatest element, a last element. For each element x let ↑x be the ≤-upper set generated by x, that is y ∈ ↑x ⇐⇒ x ≤ y for each y ∈ A. Consider the subset X ⊆ A given by x...