We propose a novel approach to efficiently select informative samples for large-scale learning. Instead of directly feeding a learning algorithm with a very large amount of samples, as it is usually done to reach state-of-the-art performance, we have developed a “distillation” procedure to recursively reduce the size of an initial training set using a criterion that ensures the maximization of ...

In this paper, we propose a novel algorithm for the rigorous design of distillation columns that integrates a process simulator in a generalized disjunctive programming formulation. The optimal distillation column, or column sequence, is obtained by selecting, for each column section, among a set of column sections with different number of theoretical trays. The selection of thermodynamic model...

We show the equivalence of two approaches to the design of entanglement distillation protocols. The first approach is based on local unitary operations that yield permutations of tensor products of Bell states. The second approach is based on stabilizer codes.

Batch distillation is one of the most important unit operations for the small-scale production of specialty and fine chemicals. The so called Middle Vessel Batch Distillation (MVBD) with total reflux offers many advantages compared to conventional batch distillation. It is favourable due to the simultaneous production of three products of high purity. In this work, we present a thorough analysi...

We describe a protocol for distilling maximally entangled bipartite states between random pairs of parties from those sharing a tripartite W state |W=(1/sqrt[3])(|100+|010+|001)(ABC), and show that the total distillation rate E(t)(infinity) [the total number of Einstein-Podolsky-Rosen (EPR) pairs distilled per W, irrespective of who shares them] may be done at a higher rate than EPR distillatio...

We introduce distillation codes, a method for streaming and storing data. Like erasure codes, distillation codes allow information to be decoded from a sufficiently large quorum of symbols. In contrast to erasure codes, distillation codes are robust against pollution attacks, a powerful class of denial of service (DoS) attacks in which adversaries inject invalid symbols during the decoding proc...

We introduce two first-order graph-based dependency parsers achieving a new state of the art. The first is a consensus parser built from an ensemble of independently trained greedy LSTM transition-based parsers with different random initializations. We cast this approach as minimum Bayes risk decoding (under the Hamming cost) and argue that weaker consensus within the ensemble is a useful signa...

Previously, Tanskanen and Pohjola (2000) and Tanskanen and Malinen (2005) have presented a method of rigorous minimum energy calculation for non-ideal multicomponent distillation. The method is based on column simulation with a large number of equilibrium stages to mimic infinitely high columns, and it has been successfully tested with simple distillation column systems. This paper describes a ...

The teleportation channel associated with an arbitrary bipartite state denotes the map that represents the change suffered by a teleported state when the bipartite state is used instead of the ideal maximally entangled state for teleportation. This work presents and proves an explicit expression of the teleportation channel for the teleportation using Weyl’s projective unitary representation of...

Juniperus horizontalis Moench (Family Cupressaceae), commonly called creeping juniper, is a widely distributed species in the United States and much of Canada. It is potentially a source for two important chemical products, the anticancer drug synthetic precursor, podophyllotoxin and essential oils. The objectives of this study were to ascertain the likelihood of utilizing J. horizontalis needl...