Consider the minimum s − t cut problem in an embedded undirected planar graph. Let p be the minimum number of faces that a curve from s to t passes through. If p = 1, that is, the vertices s and t are on the boundary of the same face, then the minimum cut can be found in O(n) time. For general planar graphs this cut can be found in O(n log n) time. We unify these results and give an O(n log p) ...

Background: Some recommendations and health protocols were presented for controlling COVID-19 after the outbreak such as the use of face masks, observing social distance, closure of schools, and etc. Despite these protocols, we witnessed different peaks and variants of COVID-19 during more than two years.This study investigated some risky behaviors such as not wearing face masks, violating soci...

introduction: patient education is influenced by cultural factors. this study aims to find out the role of culture in patient education. methods: a qualitative study was conducted on 23 iranian nurses. inclusion criteria were minimum 5 years of working experience in clinical nursing. semistructured face to face interviews were used to collect the data. interviews were taped, transcribed and ana...

It has been conjectured that any 5-connected graph embedded in a surface Σ with sufficiently large face-width is hamiltonian. This conjecture was verified by Yu for the triangulation case, but it is still open in general. The conjecture is not true for 4-connected graphs. In this paper, we shall study the existence of 2and 3-factors in a graph embedded in a surface Σ. A hamiltonian cycle is a s...

Domain specific architecture (DSA) design currently involves a lengthy process that requires significant designer knowledge, experience, and time in arriving at a suitable code generator and architecture for the target application suite. Given the stringent time to market constraints and the dynamic nature of embedded applications, designers face a huge challenge in delivering high performance ...

We present a new face detection algorithm based on a first-order reduced Coulomb energy (RCE) classifier. The algorithm locates frontal views of human faces at any degree of rotation and scale in complex scenes. The face candidates and their orientations are first determined by computing the Hausdorff distance between simple face abstraction models and binary test windows in an image pyramid. T...

A real time face recognition architecture using minimum number of face-measurements is presented in this paper. The measurements that we have taken are – neck width, eyebrow width, distance between eyebrow and eyeball, eyeball width, amount of black points in the eyebrow and eyeball regions and amount of forehead. In this paper we have presented an algorithm which is able to recognize faces wit...

In this paper we propose a low-complexity face verification system based on the Walsh–Hadamard transform. This system can be easily implemented on a fixed point processor and offers a good compromise between computational burden and verification rates. We have evaluated that with 36 integer coefficients per face we achieve better Detection Cost Function (6.05%) than the classical eigenfaces app...