stability of foundations near slopes is one of the important and complicated problems in geotechnical engineering, which has been investigated by various methods such as limit equilibrium, limit analysis, slip-line, finite element and discrete element. the complexity of this problem is resulted from the combination of two probable failures: foundation failure and overall slope failure. the curr...

thanks to the development of the concept of metadiscourse, it is now widely acknowledged that academic/scientific writing is not only concerned with communicating purely propositional meanings: what is communicated through academic/scientific communication is seen to be intertwined with the negotiation of social and interpersonal meanings. while a large number of so called metadiscoursal resour...

One of the major disadvantages of using Branch and Bound algorithm to solve permutation bases problems by computer is the size of main memory required. The single Array Branch and Bound (SABB) method introduction here aims to overcome this deficiency, using only N memory locations as a vector of size N, and a single cell C with N bits.

this paper considers the economic lot scheduling problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. combination of frequency and timing as well as production quantity make this problem np-hard. a heuristic is developed to obtain a good solution to elsp. the proposed heuristic makes use of the simulated annealing technique...

Combining linear programming approach with the Plotkin-Johnson argument for constant weight codes, we derive upper bounds on the size of codes of length n and minimum distance d = (n j)=2, 0 < j < n 1=3 . For j = o(n 1=3 ) these bounds practically coincide (are slightly better) with the Tietav ainen bound. For xed j and j proportional to n 1=3 , j < n 1=3 (2=9) lnn, it improves on the earlier...

We currently know the following four bounds on rate as a function of relative distance, three of them upper bounds (which tell us what rate-distance combinations are impossible), and one lower bound (which tells us what rate-distance combinations we can achieve). In the following, R is the rate and δ the relative distance of a code. For example, a (n, k, d) code has R = k/n and δ = d/n. Hq(x) i...

This letter investigates hybrid lower bounds on the mean square error in order to predict the so-called threshold effect. A new family of tighter hybrid large error bounds based on linear transformations (discrete or integral) of a mixture of the McAulay-Seidman bound and the Weiss-Weinstein bound is provided in multivariate parameters case with multiple test points. For use in applications, we...

In this paper, by using the exponential convexity property of a barrier function, we propose an infeasible interior-point method for Cartesian P_*(k) horizontal linear complementarity problem over symmetric cones. The method uses Nesterov and Todd full steps, and we prove that the proposed algorithm is well define. The iteration bound coincides with the currently best iteration bound for the Ca...

there are different processes to form new words in every language, including compounding, derivation, inflection, etc. in compounding, two lexical stems form a compound. in derivation and inflection, new words are coined by affixation or some phonetic changes. this kind of affixation is applied on the simple or compound stem. here our compound stem is a bound compound stem, consisting of a noun...