future increase of mobile communication subscribers will require a great capacity expansion of the cellular systems. in order to accommodate the increasing number of subscribers, the cell size will have to be much smaller than current size. therefore, it is predictable that the location updating and paging procedures will produce a major part of signaling traffic in these networks. this pape...

network expansion studies normally offer new power lines, new substations or expansion of existing substations. they are generally proposed based on technical requirements, but financial restrictions are not considered. because of financial restrictions, ranking of network expansion plans is required. in this paper an algorithm for such ranking, based on technical and financial view points and ...

This paper deals with the implementation of an efficient Arbitrary Lagrangian Eulerian (ALE) formulation for the three dimensional finite element modeling of mode I self-similar dynamic fracture process. Contrary to the remeshing technique, the presented algorithm can continuously advance the crack with the one mesh topology. The uncoupled approach is employed to treat the equations. So, each t...

this study is investigated the optimum parameters for a tuned mass damper (tmd) under the seismic excitation. shuffled complex evolution (sce) is a meta-heuristic optimization method which is used to find the optimum damping and tuning frequency ratio for a tmd. the efficiency of the tmd is evaluated by decreasing the structural displacement dynamic magnification factor (ddmf) and acceleration ...

We present the first provably optimal polynomial time dynamic programming (DP) algorithm for best-first shift-reduce parsing, which applies the DP idea of Huang and Sagae (2010) to the best-first parser of Sagae and Lavie (2006) in a non-trivial way, reducing the complexity of the latter from exponential to polynomial. We prove the correctness of our algorithm rigorously. Experiments confirm th...

The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...

In open-pit mine planning, the design of the most profitable ultimate pit limit is a prerequisite to developing a feasible mining sequence. Currently, the design of an ultimate pit is achieved through a computer program in most mining companies. The extraction of minerals in open mining methods needs a lot of capital investment, which may take several decades. Before the extraction, the p...

With a nonequilibrium relaxation method, we calculate the dynamic critical exponent z of the two-dimensional Ising model for the SwendsenWang and Wolff algorithms. We examine dynamic relaxation processes following a quench from a disordered or an ordered initial state to the critical temperature Tc, and measure the exponential relaxation time of the system energy. For the Swendsen-Wang algorith...

In order to meet the performance requirements of global optimality and path smoothness in robot planning, a new fusion algorithm jump-A* dynamic window approach is proposed. First, A* optimized by using jump point search method distance evaluation function defined Manhattan Euclidean obtain information. Then take as core integrating information safely plan op...