We consider the problem of finding a feasible flow in a directed network G = (N,A) in which each node i N has a supply b(i), and each arc (i,j) A has a zero lower bound on flow and an upper bound uij. It is well known that this feasibility problem can be transformed into a maximum flow problem. It is also well known that there is no feasible flow in the network G if and only if there is a subse...

The controlled generation of entangled states and their subsequent detection are integral aspects of quantum information science. In this Letter, we implement a simple and precise technique that produces any of the four Bell states in the orbital angular momentum degree of freedom. We then use these states to perform the first experimental demonstration of an accessible nonlinear entanglement w...

In a plasma wakefield accelerator in the nonlinear regime the accelerated bunch electrons oscillate in a pure ion column. They emit strong synchrotron, also known as betatron radiation, in the keV to MeV photon range [1]. In previous experiments with a single electron bunch the oscillating electrons where distributed symmetrically about the beam axis or the ion column axis. However, with a driv...

Edge states lying at the edge of PPT entangled states have a very intriguing existence and their detection is equally interesting. We present here a new witness for detection of edge states. We then compare between our proposed witness operator and the witness operator proposed in [Physical Review A, 62, 052310 (2000)] in terms of the efficiency in the detection of PPT entangled states. In this...

A recommendation system (or recommender) is an algorithm whose goal is to recommend products to potential users. To achieve its task, it uses information about some user preferences. We present recommenders that use information about the preferences of only a very small subset of users (called a committee) on a very small set of products called the witness products set. The main interest of our...

As the amount of sequencing efforts and genomic data volume continue to increase at an accelerated rate, phylogenetic analysis provides an evolutionary context for understanding and interpreting this growing set of complex data. We introduce a novel quartet based method for inferring molecular based phylogeny called hypercleaning* (HC). The HC method is based on the hypercleaning (HC) technique...

In this paper, we analyze the complexity of a zero test for expressions built from formal power series solutions of first order differential equations with non degenerate initial conditions. We will prove a doubly exponential complexity bound. This bound establishes a power series analogue for “witness conjectures”.

This paper addresses how to use public-keys of several different signature schemes to generate 1-out-of-n signatures. Previously known constructions are for either RSA-keys only or DL-type keys only. We present a widely applicable method to construct a 1-out-of-n signature scheme that allows mixture use of different flavors of keys at the same time. The resulting scheme is more efficient than p...

We propose a new witness encryption based on Subset-Sum which achieves extractable security without relying on obfuscation and is more efficient than the existing ones. Our witness encryption employs multilinear maps of arbitrary order and it is independent of the implementations of multilinear maps. As an application, we construct a new timed-release encryption based on the Bitcoin protocol an...