OBJECTIVE To identify key factors for predicting positive cone margin and appropriate cone length. METHODS We retrospectively reviewed the margin status of patients who received conization with high grade cervical intraepithelial neoplasia, along with other factors such as patient age, parity, preoperative cytology, size of disease, type of transformation zone, and cone length from patient re...

When ionizing radiation strikes a cell it induces DNA double strand breaks (DSBs). Subsequently, some of the DSBs misrejoin and thus cause alterations in the size distribution of the DNA fragments. We derive a system of non-linear integro-differential equations describing the misrejoining interactions of five classes of DNA fragments, including rings and various types of linear fragments. The f...

Motivated by a numerical example which shows that a feasible version of Mehrotra’s original predictor-corrector algorithm might be inefficient in practice, Salahi et al., proposed a so-called safeguard based variant of the algorithm that enjoys polynomial iteration complexity while its practical efficiency is preserved. In this paper we analyze the same Mehrotra’s algorithm from a different per...

A two-phase subgrid combustion model has been developed for large-eddy simulations (LES). This approach includes a more fundamental treatment of the effects of the final stages of droplet vaporization, molecular diffusion, chemical reactions and small scale turbulent mixing than other LES closure techniques. In the present approach, the liquid droplets are tracked using the Lagrangian approach ...

The asymptotic properties of random regular graphs are objects of extensive study in mathematics and physics. In this paper we argue, using the theory of spin glasses in physics, that in random regular graphs the maximum cut size asymptotically equals the number of edges in the graph minus the minimum bisection size. Maximum cut and minimal bisection are two famous NP-complete problems with no ...

ulet size and girdle thickness are important elements in the Gemological Institute of America’s (GIA) new Diamond Cut Grading System, as they can affect evaluations of the face-up appearance and design aspects of overall cut quality (see figure 1).This article reviews the criteria and methods used by the GIA Laboratory to assess culet and girdle, explains their role in the new cut grading syste...

It has recently been shown that cut-free deep inference systems exhibit an exponential speed-up over cut-free sequent systems, in terms of proof size. While this is good for proof complexity, there remains the problem of typically high proof search non-determinism induced by the deep inference methodology: the higher the depth of inference, the higher the non-determinism. In this work we improv...

The MAXIMUM CUT problem (MAX-CUT) is one of the simplest graph partitioning problems to conceptualize, and yet it is one of the most difficult combinatorial optimization problems to solve. The objective of MAX-CUT is to partition the set of vertices of a graph into two subsets, such that the sum of the weights of the edges having one endpoint in each of the subsets is maximum. This problem is k...

In the last lecture, we analyzed the problem of finding the maximum flow in a graph, and how it can be efficiently solved using the Ford-Fulkerson algorithm. We also came across the Min Cut-Max Flow Theorem which relates the size of the maximum flow to the size of the minimal cut in the graph. In this lecture, we will be seeing how various different problems can be solved by reducing the proble...