This paper deals with the problem of testing hypothesis when both the hypotheses and the available data are fuzzy. First, four different kinds of fuzzy hypotheses are defined. Then, a procedure is developed for constructing the fuzzy point estimation based on fuzzy data. Also, the concept of fuzzy test statistic is defined based on the α-cuts of the fuzzy null hypothesis and the α-cuts of the c...

We consider a reliable network design problem under uncertain edge failures. Our goal is to select a minimum-cost subset of edges in the network to connect multiple terminals together with high probability. This problem can be seen as a stochastic variant of the Steiner tree problem. We propose two scenario-based Steiner cut formulations, study the strength of the proposed valid inequalities, a...

Many graph-based learning problems can be cast as finding a good set of vertices nearby a seed set, and a powerful methodology for these problems is based on maximum flows. We introduce and analyze a new method for locally-biased graphbased learning called SimpleLocal, which finds good conductance cuts near a set of seed vertices. An important feature of our algorithm is that it is strongly-loc...

We developed a method for introducing an N-glycosylation cassette into proteins at random sites by constructing cDNAs and expressing it in mammalian cells. The protocol entails four steps: (i) generation of cDNAs that contain single, randomly-located blunt end cuts; (ii) ligation of N-glycosylation cassettes into the blunt end cuts in three-frame formats; (iii) selection of the cDNA clones enco...

This paper introduces a class of cuts, called reachability cuts, for the Vehicle Routing Problem with Time Windows (VRPTW). Reachability cuts are closely related to cuts derived from precedence constraints in the Asymmetric Traveling Salesman Problem with Time Windows and to k-path cuts for the VRPTW. In particular, any reachability cut dominates one or more k-path cuts. The paper presents sepa...

Recently, graph cuts algorithms have been used to solve variational image restoration problems, especially for noise removal and segmentation. Compared to time-marching PDE methods, graph cuts based methods are more efficient and able to obtain the global minimizer. However, for high resolution and large-scale images, the cost of both memory and computational time increases dramatically. In thi...

This tutorial presents a theory of valid inequalities for mixed integer linear sets. It introduces the necessary tools from polyhedral theory and gives a geometric understanding of several classical families of valid inequalities such as lift-and-project cuts, Gomory mixed integer cuts, mixed integer rounding cuts, split cuts and intersection cuts, and it reveals the relationships between these...

In this paper we propose an algorithm that automatically detects clear scene cut locations from an MPEG-1 video bit streams coded with a GOP structure of M=1, without B pictures. The algorithm detects scene cuts at P type pictures by monitoring the percentage of Intramacroblocks per P picture. while scene cuts at I pictures are detected by matching the macroblocks type of the two P pictures at ...

A market basket survey for beef retail cut composition at the retail level (four stores each from two chains in each city) was conducted in 11 US cities from January to March 2006. Beef cuts (n=17,495) were measured for external fat thickness with cuts from the chuck (0.05cm), round (0.05cm), and miscellaneous (0.04cm) having less (P<0.05) fat than cuts from the loin (0.11cm) and rib (0.11cm). ...

We present a survey of nondiierentiable optimization problems and methods with special focus on the analytic center cutting plane method. We propose a self-contained convergence analysis, that uses the formalism of the theory of self-concordant functions, but for the main results, we give direct proofs based on the properties of the logarithmic function. We also provide an in depth analysis of ...