2.1 Greedy algorithm We can think of the cut as a partition of verticesl C = (S, V \ S) whiere S ⊆ V . We can switch between different cuts by moving vertices across the cut, in to or out of S. Moving v across the cut swaps its cut edges with its non-cut edges. This increase the value of the cut when the total weight of its non-cut edges exceeds the weight of the cut edges. If v ∈ S (and simila...

Defocusing effects in modulation transfer function (MTF) measurement of charge coupled device (CCD) cameras is the main focus of current paper. We introduce measuring Point-spread function (PSF) in order to calculate the MTF and further more we will study the shape of MTF and its cut-off frequency by adjusting the lens focusing in different locations. A collimated white light LED by broadband s...

Purpose of review: Enzymatic browning of fruits and vegetables during postharvest handling and processing degrades the sensory properties and nutritional value and discourages consumer purchase of fresh-cut products. Consequently, enzymatic browning results in significant economic losses for the fresh produce industry. This paper discusses the biochemistry of enzymatic browning, and focuses on ...

An instance of the max k−cut game is an edge weighted graph. Every vertex is controlled by an autonomous agent with strategy space [1..k]. Given a player i, his payoff is defined as the total weight of the edges [i, j] such that player j’s strategy is different from player i’s strategy. The social welfare is defined as the weight of the cut, i.e. half the sum of the players payoff. It is known ...

We consider the analysis of linear programming relaxations of a large class of combinatorial problems that can be formulated as problems of covering cuts, including the Steiner tree, the traveling salesman, the vehicle routing, the matching, the T-join and the survivable network design problem, to name a few. We prove that all of the problems in the class satisfy a nice structural property, the...

This paper presents an epistemological analysis of the search for new conservation laws in particle physics. Discovering conservation laws has posed various challenges concerning the underdetermination of theory by evidence, to which physicists have found various responses. These responses include an appeal to a plenitude principle, a maxim for inductive inference, looking for a parsimonious sy...

Motivated by the recent progress in improving efficiency of secure computation, we study cut-and-choose oblivious transfer—a basic building block of state-of-the-art constant round two-party secure computation protocols that was introduced by Lindell and Pinkas (TCC 2011). In particular, we study the question of realizing cut-and-choose oblivious transfer and its variants in the OT-hybrid model...