OBJECTIVE Our purpose was to describe the surgical procedure, its results, and its complications and to determine whether patients are satisfied with surgical reduction of labia minora in cases of hypertrophy. STUDY DESIGN The records of 163 patients who underwent reduction of the labia minora during a 9-year period were reviewed. The ages of the patients ranged from 12 to 67 years (median, 2...

INTRODUCTION Limited information is available regarding patients' indication for seeking labiaplasty of the labia minora. AIM The aim of this article is to investigate a patient's indications for seeking labiaplasty of the labia minora. METHODS This is a retrospective review of the medical records of all patients undergoing labiaplasty at our clinic over a 27-month period. MAIN OUTCOME ME...

In this paper we consider a kind of higher-order evolution equation as^{kt^{k} + ^{k&minus1}u/t^{k&minus1} +• • •+ut &minus{delta}u= f (u, {delta}u,x). For this equation, we investigate nonglobal solution, blow-up in finite time and instantaneous blow-up under some assumption on k, f and initial data. In this paper we employ the Test function method, the eneralized convexity method an...

In this paper, we study the Dominating Set problem in random graphs. In a random graph, each pair of vertices are joined by an edge with a probability of p, where p is a positive constant less than 1. We show that, given a random graph in n vertices, a minimum dominating set in the graph can be computed in expected 2 2 2 n) time. For the parameterized dominating set problem, we show that it can...

A global defensive alliance in a graph G = (V,E) is a dominating set S satisfying the condition that for every vertex v ∈ S, |N [v] ∩ S| ≥ |N(v) ∩ (V − S)|. In this note, a new upper bound on the global defensive alliance number of a tree is given in terms of its order and the number of support vertices. Moreover, we characterize trees attaining this upper bound.

In the present article, this paper provides a method for fast image segmentation computer vision, which is based on level set method. One dominating challenge in uneven illumination and inhomogeneous intensity, are caused by position of light source or convex surface. This proposes variational model Retinex theory. To be specific, firstly, figures out pre-fitting reflectance using an algorithm ...

In this paper, a delayed n-species nonautonomous Lotka–Volterra type food-chain system without dominating instantaneous negative feedback is investigated. By means of a Lyapunov functional, sufficient conditions are derived for the global asymptotic stability of the positive solution of the system. As a corollary, it is shown that the global asymptotic stability of the positive solution is main...

In this paper, we consider the dominance properties of the set of the pignistic k-additive belief functions. Then, given k, we conjecture the shape of the polytope of all the k-additive belief functions dominating a given belief function, starting from an analogy with the case of dominating probability measures. Under such conjecture, we compute the analytical form of the barycenter of the poly...