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...

Switzerland's diversity of flat, rolling and Alpine terrain makes it ideal territory for geometric validation studies. We describe here two parallel investigations of TerraSAR-X (TSX) high-resolution data: geometric validation and estimation of the tropospheric path delay using measurements of corner reflectors (CRs) placed at different altitudes but nearly identical ranges. Geometric validatio...

For an optimal control problem of Itô’s type stochastic differential equation, the process could be taken in open-loop or closed-loop forms. In standard literature, provided appropriate regularity, value functions under these two types controls are equal and unique (viscosity) solution to corresponding (path-dependent) HJB equation. this short note, we provide a counterexample path dependent se...

A tree is a structure T = (T,E), where T is a nonempty set whose elements are called nodes and E is a relation on T , E ⊆ T × T , called the immediate edge relation, satisfying the following conditions: for all nodes, n, n′,m ∈ T , • Every node has a unique predecessor: If nEm and n′Em, then n = n′, • There are no cycles: If (n1, . . . , nk) is a sequence of nodes where for each i = 1, . . . , ...

This paper is devoted to the stochastic optimal control problem of ordinary differential equations allowing for both path-dependence and measurable randomness. As opposed deterministic path-dependent cases, value function turns out be a random field on path space it characterized by Hamilton–Jacobi (SPHJ) equation. A notion viscosity solution proposed proved unique associated SPHJ

Web service paths can accomplish customer requirements. During the execution of a web service path, violations of service level agreements (SLAs) will cause the path to be re-planed (healed). Existing re-planning techniques generally suffer from shortcomings of ignoring the effect of requirement change. This paper proposes a two-leveled path re-planning technique (TLPRP), which offers the follo...