Abstract The presence of an economical solution to predict soil behaviour is essential for new construction areas. This paper aims investigate the ultimate interpolation method predicting bearing capacity An-Najaf city-Iraq based on field investigation information. Firstly, engineering was calculated in-site N-SPT values using dynamic loading 464 boreholes with depths 0–2 m, Meyerhof formula. d...

The reaction of O((3)P) with HCl at hyperthermal collision energies (45-116 kcal mol(-1)) has been investigated with crossed-molecular beams experiments and direct dynamics quasi-classical trajectory calculations. The reaction may proceed by two primary pathways, (1) H-atom abstraction to produce OH and Cl and (2) H-atom elimination to produce H and ClO. The H-atom abstraction reaction follows ...

We address the problem of learning discrete hidden Markov models from very long sequences of observations. Incremental versions of the Baum-Welch algorithm that approximate the β-values used in the backward procedure are commonly used for this problem, since their memory complexity is independent of the sequence length. We introduce an improved incremental Baum-Welch algorithm with a new backwa...

This paper addresses a previous claim (Brysbaert & Praet, 1992) that the use of prelexical phonology in visual word recognition is optional in the Dutch language. One backward masking experiment and two masked priming experiments are reported. The experimental task was perceptual identification. Pseudohomophones, graphemic controls, and unrelated controls of the target words were used as masks ...

We describe a symbolic procedure for solving the reachability problem of transition systems that use formulae of Effectively Propositional Logic to represent sets of backward reachable states. We discuss the key ideas for the mechanization of the procedure where fix-point checks are reduced to SMT problems. We also show the termination of the procedure on a sub-class of transition systems. Then...

We investigate the prescriptive power of sequential iterated admissibility in coordination games of the Gale-Stewart style, i.e., perfectinformation games of infinite duration with only two payoffs. We show that, on this kind of games, the procedure of eliminating weakly dominated strategies is independent of the elimination order and that, under maximal simultaneous elimination, the procedure ...

In this paper we introduce a cut-elimination procedure for classical logic, which is both strongly normalising and consisting of local proof transformations. Traditional cut-elimination procedures, including the one by Gentzen, are formulated so that they only rewrite neighbouring inference rules; that is they use local proof transformations. Unfortunately, such local proof transformation, if d...

The backward Viterbi beam search has not received enough attentions other than being used in the second pass. The reason is that the speech recognition society has long ignored the concept of dynamic complexities of a speech recognition task which can help us to determine whether we should operate Viterbi decoding in forward or backward direction. We use the U.S. street address entry task as on...