This study evaluates five representative linear explicit finite difference schemes for solving the energy transport equation in district heating networks (DHN). Specifically for the QUICKEST scheme a robust modification to the original formulation is proposed which overcomes the problem originating from different flow situations at pipe junctions. All methods were put into the versatile state s...

Path problems were basically studied to find an alternate path that is, finding a second shortest route, if the route is blocked. The problem mainly focused on paths between vertices of given network. A new variant quickest problem, where predetermined data sent from source sink. flow relaxes limitations single multiple paths. In this paper we reviewed and problem. Later on, each clarified with...

This paper addresses the risk of fraud in credit card transactions by developing a probabilistic model for quickest detection illegitimate purchases. Using optimal stopping theory, goal is to determine moment, known as disorder or time, at which continuously monitored process consumer’s exhibits due fraud, order return best trade-off between two sources cost: on one hand, time should be detecte...

The quickest detection problem is formulated for processes defined on a two-dimensional lattice. Solutions are given when only the class of sequential probability ratio tests is considered.