critical path method (cpm) is one of the most popular techniques used by construction practitioners for construction project scheduling since the 1950s. despite its popularity, cpm has a major shortcoming, as it is schedule based on two impractical acceptance that the project deadline is not bounded and that resources are unlimited. the analytical competency and computing capability of cpm thus...

This paper studies the multiplicatively weighted crystal-growth Voronoi diagram, which describes the partition of the plane into crystals with different growth speeds. This type of the Voronoi diagram is defined, and its basic properties are investigated. The analytic equation describing the boundary curve is given for a simple case. For the general case, an approximation algorithm is proposed....

The phase diagram of water has been calculated from the TIP4PQ/2005 model, an empirical rigid non-polarisable model. The path integral Monte Carlo technique was used, permitting the incorporation of nuclear quantum effects. The coexistence lines were traced out using the Gibbs–Duhem integration method, once having calculated the free energies of the liquid and solid phases in the quantum limit,...

The phase diagram of water has been calculated from the TIP4PQ/2005 model, an empirical rigid non-polarisable model. The path integral Monte Carlo technique was used, permitting the incorporation of nuclear quantum effects. The coexistence lines were traced out using the Gibbs-Duhem integration method, once having calculated the free energies of the liquid and solid phases in the quantum limit,...

Introduction Rivers are one of the most important water resources and it is very important to study their water quality. Therefore, in this study, sampling was done from 15 permanent waterway stations of Pirbadush and Gashun of Qolyan River in Lorestan province, which are located in the path of oil shales.   Materials and Methods  Hydro-geochemical parameters were calculated by analyzing t...

We study dynamical systems acting on the path space of a stationary (non-simple) Bratteli diagram. For such systems we explicitly describe all ergodic probability measures invariant with respect to the tail equivalence relation (or the Vershik map). These measures are completely described by the incidence matrix of the diagram. Since such diagrams correspond to substitution dynamical systems, t...

The notorious middle two levels problem is to nd a Hamilton cycle in the middle two levels, M 2k+1 , of the Hasse diagram of B 2k+1 (the partially ordered set of subsets of a 2k + 1-element set ordered by inclusion). Previously, the best known result, due to Moews and Reid 11] in 1990, was that M 2k+1 is Hamiltonian for all positive k through k = 11. We show that if a Hamilton path between two ...

Given a point s and a set of h pairwise disjoint polygonal obstacles with a total of n vertices in the plane, after the free space is triangulated, we present an O(n + h log h) time and O(n) space algorithm for building a data structure (called shortest path map) of size O(n) such that for any query point t, the length of the L1 shortest obstacle-avoiding path from s to t can be reported in O(l...