Virtual reality (VR) distraction has become increasingly available in health care contexts and is used in acute pain management. However, there has been no systematic exploration of the importance of the content of VR environments. Two studies tested how interacting with nature VR influenced experienced and recollected pain after 1 week. Study 1 (n = 85) used a laboratory pain task (cold presso...

In this paper we introduce the concept of generalized d-graph (admitting cycles) as special dependency-graphs for modelling dynamic programming (DP) problems. We describe the d-graph versions of three famous single-source shortest algorithms (The algorithm based on the topological order of the vertices, Dijkstra algorithm and Bellman-Ford algorithm), which can be viewed as general DP strategies...

In this paper, we investigate the performance of Thorup’s algorithm by comparing it to Dijkstra’s algorithm for large-scale network simulations. One of the challenges toward the realization of large-scale network simulations is the efficient execution to find shortest paths in a graph with N vertices and M edges. The time complexity for solving a single-source shortest path (SSSP) problem with ...

It is nearly 50 years since Dijkstra argued that goto obscures the flow of control in program execution and urged programmers to abandon the goto statement. While past research has shown that goto is still in use, little is known about whether goto is used in the unrestricted manner that Dijkstra feared, and if it is ‘harmful’ enough to be a part of a post-release bug. We, therefore, conduct a ...

Self-stabilization was rst introduced by Dijkstra Dij74]: it is the property for a system to eventually recover itself a legitimate state after any perturbation modifying the memory state. In its pioneering paper, Dijkstra proposed three algorithms for token ring systems. Such systems are very useful to solve distributed mutual exclusion. Using the token deenition introduced by Dijkstra, i.e. t...

The shortest path problem is the problem of finding the shortest distance from a specified source node to all other nodes in the graph. The best known algorithm for arbitrary graphs with real-valued weights is known as Bellman-Ford, and runs in O(nm) time, where m and n are the number of vertices and nodes in the graph, respectively. For an arbitrary graph with non-negative weights, the best kn...

Shown below is pseudocode for Dijkstra’s algorithm. The input is a directed graph G = (V,E) with nonnegative edge weights wt(u, v) for every edge (u, v) ∈ E, and a distinguished node s, called the source (or start) node. The algorithm computes, for each node u ∈ V , the weight of a shortest path from s to u. (It can be easily modified to compute, for each node u, the predecessor of u in a short...

This paper describes a practical dynamic route planning method using real road maps in a wide area. The maps include traffic signals, road classes, and the number of lanes. The proposed solution is using a genetic algorithm adopting viral infection. The method is to use viruses as domain specific knowledge. A part of an arterial road is regarded as a virus. A population of viruses is generated ...

Gunung Tangkuban Perahu adalah salah satu gunung berapi aktif yang berada di Kecamatan Lembang, Kabupaten Bandung Barat, Provinsi Jawa Indonesia. Dalam menghadapi bahaya ketika terjadi bencana berapi, pemerintah menerapkan sistem peringatan dini sebagai mekanisme kesiapsiagaan masyarakat. Untuk meminimalisir waktu tempuh agar penduduk dengan cepat terevakuasi menuju ke titik kumpul, diperlukan ...