We study unitary random matrix ensembles in the critical regime where a new cut arises away from the original spectrum. We perform a double scaling limit where the size of the matrices tends to infinity, but in such a way that only a bounded number of eigenvalues is expected in the newborn cut. It turns out that limits of the eigenvalue correlation kernel are given by Hermite kernels correspond...

PURPOSE A definition of cut-off points for nodal size is essential to determine whether cervical lymph nodes are metastatic or not. Because the currently used size criteria are defined for random populations of patients with head and neck cancer, we set out to study whether these criteria are optimal for patients without palpable metastases in different levels of the neck We defined optimal siz...

1. Let G = (V,E) be a c-edge connected graph. In other words, assume that the size of minimum cut in G is at least c. Construct a graph G′(V,E ′) by sampling each edge of G with probability p independently at random and reweighing each edge with weight 1/p. Suppose c > log n, and is such that 10 log(n) c 2 ≤ 1. Show that as long as p ≥ 10 log(n) c 2 , with high probability the size of every cut...

. eight holstein cows in early lactating stage were used in a 4×4 change-over design within 4 periods of 21-d to determine the effects of alfalfa hay particle size and soybean oil supplementation on intake, digestibility, ruminal and blood metabolites, chewing activity, milk yield and compositions. four total mixed rations containing 20, 20 and 60% corn silage, alfalfa hay and concentrate respe...

We study the boundary of tractability for the Max-Cut problem in graphs. Our main result shows that Max-Cut above the EdwardsErdős bound is fixed-parameter tractable: we give an algorithm that for any connected graph with n vertices and m edges finds a cut of size

1. Let G = (V,E) be a c-edge connected graph. In other words, assume that the size of minimum cut in G is at least c. Construct a graph G′(V,E ′) by sampling each edge of G with probability p independently at random and reweighing each edge with weight 1/p. Suppose c > log n, and is such that log(n) c 2 ≤ 1. Show that as long as p ≥ log(n) c 2 , with high probability the size of every cut in G′...

Background: In myocardial perfusion SPECT imaging, images are degraded by photon attenuation, the distance-dependent collimator, detector response and photons scatter. Filters greatly affect quality of nuclear medicine images Materials and Methods: A phantom simulating heart left ventricle was built. About 1mCi of 99mTc was injected into the phantom. Images were taken from this phantom. Some fi...

A k-cut of a graph G = (V,E) is a partition of its vertex set into k parts; the size of the k-cut is the number of edges with endpoints in distinct parts. MAX-k-CUT is the optimization problem of finding a k-cut of maximal size and the case where k = 2 (often called MAX-CUT) has attracted a lot of attention from the research community. MAX-CUT —more generally, MAX-k-CUT— is NP-hard and it appea...