# Path analysis

Xem 1-20 trên 421 kết quả Path analysis
• ### Statistical analysis on the cost and duration of public building projects

A probabilistic model is proposed to predict the risk effects on time and cost of public building projects. The research goal is to utilize a real history data in estimating project cost and duration. The model results can be used to adjust floats and budgets of the planning schedule before project commencement. Statistical regression models and sample tests are developed using real data of 113 public projects. The model outputs can be used by project managers in the planning phase to validate the schedule critical path time and project budget.

• ### Advanced Algorithms Analysis and Design - Lecture 28: Breadth first search

Advanced Algorithms Analysis and Design - Lecture 28: Breadth first search. In this lecture we will cover the following: representation of graphs; breadth first search; supporting lemmas in the proof; proof of correctness; shortest paths, for un-weighted edges, based on breadth first search;...

• ### Advanced Algorithms Analysis and Design - Lecture 30: Proof (white path theorem) & Applications of depth first search

Advanced Algorithms Analysis and Design - Lecture 30: Proof (white path theorem) & Applications of depth first search. In this lecture we will cover the following: algorithm depth first search; classification of edges; white-path theorem; topological sort; strongly connected components;...

• ### Advanced Algorithms Analysis and Design - Lecture 33: Single-source shortest path

Advanced Algorithms Analysis and Design - Lecture 33: Single-source shortest path. In this lecture we will cover the following: road map problem; linking road map problem with graph theory; paths and shortest paths; cycles and their role in finding shortest paths; the Bellman-Ford algorithm;...

• ### Advanced Algorithms Analysis and Design - Lecture 34: Proof: Bellman-Ford algorithm and Shortest paths in Directed acyclic graphs

Advanced Algorithms Analysis and Design - Lecture 34: Proof: Bellman-Ford algorithm and Shortest paths in Directed acyclic graphs. In this lecture we will cover the following: Bellman-Ford algorithm (analysis, proof); shortest path in directed acyclic graphs (assumptions, algorithm, analysis, proof of correctness);...

• ### Advanced Algorithms Analysis and Design - Lecture 36: All pairs shortest paths

Advanced Algorithms Analysis and Design - Lecture 36: All pairs shortest paths. In this lecture we will cover the following: all pairs shortest paths; algorithms - matrix multiplication, the floyd-warshall algorithm; time complexity;...

• ### Behavioural and psychological symptoms of dementia in patients with Alzheimer’s disease and family caregiver burden: A path analysis

Studies reported the relationship between behavioural and psychological symptoms of dementia (BPSD), cognitive function, caregiver burden, and therapeutic effects. However, the causal relationship between BPSD in community-dwelling patients with Alzheimer’s disease (AD) and caregiver burden is yet to be established. This study aimed to classify BPSD in patients with AD and identify the relationship between BPSD and the factors affecting family caregiver burden.

• ### Lecture Design and Analysis of Algorithms: Lecture 28 - Dr. Sohail Aslam

The main contents of "Lecture Design and Analysis of Algorithms: Lecture 28" include all of the following: Degree of a vertex, observations about graphs, paths and cycles, graph representations, shortest path.

• ### Lecture Design and Analysis of Algorithms: Lecture 29 - Dr. Sohail Aslam

The main contents of this lecture include all of the following: Shortest Path, breadth-first search, traversing connected graphs, depth-first search, traversing connected graphs, generic graph traversal algorithm, breadth-first search.

• ### Lecture Design and Analysis of Algorithms: Lecture 38 - Dr. Sohail Aslam

A motorist wishes to find the shortest possible route between Peshawar and Karachi. Given a road map of Pakistan on which the distance between each pair of adjacent cities is marked Can the motorist determine the shortest route? In this lecture, you find clear explanations of Shortest Path.

• ### Lecture Design and Analysis of Algorithms: Lecture 39 - Dr. Sohail Aslam

Dijkstra’s algorithm is a simple greedy algorithm for computing the single-source shortest-paths to all other vertices. Dijkstra’s algorithm works on a weighted directed graph G = (V, E) in which all edge weights are non-negative, i.e., w(u, v) ≥ 0 for each edge (u, v) ∈ E. In this lecture, you find clear explanations of Dijkstra’s Algorithm.

• ### Lecture Design and Analysis of Algorithms: Lecture 40 - Dr. Sohail Aslam

Negative edges weights maybe counter to intuition but this can occur in real life problems. However, we will not allow negative cycles because then there is no shortest path. If there is a negative cycle between, say, s and t, then we can always find a shorter path by going around the cycle one more time. In this lecture, you find clear explanations of Dijkstra’s Algorithm (con't).

• ### Lecture Design and Analysis of Algorithms: Lecture 41 - Dr. Sohail Aslam

Dijkstra’s single-source shortest path algorithm works if all edges weights are non-negative and there are no negative cost cycles. Bellman-Ford allows negative weights edges and no negative cost cycles. The algorithm is slower than Dijkstra’s, running in Θ(VE) time. In this lecture, you find clear explanations of Bellman-Ford Algorithm.

• ### Lecture Design and Analysis of Algorithms: Lecture 42 - Dr. Sohail Aslam

We consider the generalization of the shortest path problem: to compute the shortest paths between all pairs of vertices. This is called the all-pairs shortest paths problem. In this lecture, you find clear explanations of Floyd-Warshall Algorithm.

• ### Analysis Urban traffic vehicle routing based on Dijkstra algorithm optimization

This paper suggests an analysis of urban traffic vehicle routing based on the Dijkstra algorithm optimization that is as a solution to the road selection and optimization under various constraints jointly built in the central metropolitan area. The leading metropolitan area road network's various constraints are to consider the road condition factors and the risk resistance in road planning. The analysis and realization are verified with the geocoding, network topology, and network analysis.

• ### Lecture Methods of Electric power systems analysis - Lesson 9: Sparse systems, advanced power flow

Lecture Methods of Electric power systems analysis - Lesson 9: Sparse systems, advanced power flow provide students with knowledge about Tinney scheme 2; coding Tinney 2; Tinney scheme 3; sparse forward substitution with a permutation vector; sparse vector methods; factorization paths; path table and path graph; computation with complex and blocked matrices;...

• ### Lecture Methods of Electric power systems analysis - Lesson 21: Optimal power flow, linear programming (LP)

Lecture Methods of Electric power systems analysis - Lesson 21: Optimal power flow, linear programming (LP) provide students with knowledge about OPF problem formulation; two bus with unconstrained line; power flow in a simple network distributes inversely to impedance of path; LP OPF solution method; enforces real/reactive power balance at each bus;...

• ### Fruitful analysis of sex chromosomes reveals X-treme genetic diversity

The evolution of sex chromosomes has occurred many times in highly divergent taxa. The bulk of the research that has shaped our expectations for their evolutionary path has focused on model organisms that have older sex chromosomes; In these organisms, the two sex chromosomes are highly differentiated from each other in form and function.

• ### Molecular mechanism of Diels–Alder reaction between (E)-3,3,3-trichloro-1-nitropropene and cyclopentadiene: B3LYP/6-31G(d) computational study

Analysis of reactivity indexes supports the polar character of the reaction between (E)-3,3,3-trichloro-1- nitropropene and cyclopentadiene. This is confirmed by the analysis of electronic properties of transition complexes involved in the reaction paths using the B3LYP/6-31G(d) algorithm. The transition state’s asymmetry is large, but it is insufficient to provoke a zwitterionic reaction mechanism. Attempts to find a heterocyclic intermediate 7 in the reaction path ultimately leading to 5-endo-nitro-6-exo-trichloromethylnorbornene 3 have been unsuccessful.

• ### Economic growth path of EU countries and turkey under the consideration of e-commerce market

The analysis shows the ecommerce market of EU-27 is developed while there is limited usage of the internet and ICT in Turkey, which enhances opportunities for growth in the region.The findings of this study reveal that among the chosen regions i.e. EU-15, EU-27, and Turkey, the positive contribution of ecommerce towards economic growth can be witnessed for EU-27 and Turkey.