Review of river fisheries valuation in Central and South America

Unlike Africa and Asia, where a large part of the population are heavily dependent upon fishing for their livelihoods, fishing for a living in the interior of Central and South America (CSA) remains a marginal occupation for all but the most isolated of families. As such, the economics and management of fisheries on the continent have received little attention from within the continent and the rest of the world. This study shows that while a number of studies have been carried out on fishing in the region, they tend to be limited in their geographical focus and time scale. Although fishing of freshwater species may appear to be comparatively insignificant in the region, the rivers of CSA are very important. This report attempts to analyze the literature available on CSA river fisheries and attempts to draw out an economic value of these fisheries. It is divided into a number of sections. First, the authors describe the major river basins on the continent, characterize their fisheries, and place freshwater fisheries in CSA into a global context. Second, the authors provide a review of valuation techniques for fisheries and use this analytical framework to review the principal literature on freshwater fisheries in the region. Then they turn their attention to the economic impact of dams and water abstraction schemes, reviewing the available literature to ascertain how/if economic values are computed for the impact on fisheries. Finally, they offer some conclusions and recommendations on the direction for future studies of freshwater fisheries in CSA

Quantum cryptography protocols robust against photon number splitting attacks for weak laser pulses implementations

We introduce a new class of quantum quantum key distribution protocols, tailored to be robust against photon number splitting (PNS) attacks. We study one of these protocols, which differs from the BB84 only in the classical sifting procedure. This protocol is provably better than BB84 against PNS attacks at zero error.Comment: 4 pages, 2 figure

Scaling Laws for Non-Intercommuting Cosmic String Networks

We study the evolution of non-interacting and entangled cosmic string networks in the context of the velocity-dependent one-scale model. Such networks may be formed in several contexts, including brane inflation. We show that the frozen network solution $L\propto a$, although generic, is only a transient one, and that the asymptotic solution is still $L\propto t$ as in the case of ordinary (intercommuting) strings, although in the present context the universe will usually be string-dominated. Thus the behaviour of two strings when they cross does not seem to affect their scaling laws, but only their densities relative to the background.Comment: Phys. Rev. D (in press); v2: final published version (references added, typos corrected

Structural Optimization in automotive design

Although mathematical structural optimization has been an active research area for twenty years, there has been relatively little penetration into the design process. Experience indicates that often this is due to the traditional layout-analysis design process. In many cases, optimization efforts have been outgrowths of analysis groups which are themselves appendages to the traditional design process. As a result, optimization is often introduced into the design process too late to have a significant effect because many potential design variables have already been fixed. A series of examples are given to indicate how structural optimization has been effectively integrated into the design process

A Measure of Stregth of an Unextendible Product Basis

A notion of strength of an unextendible product basis is introduced and a quantitative measure for it is suggested with a view to providing an indirect measure for the bound entanglement of formation of the bound entangled mixed state associated with an unextendible product basis.Comment: 4 pages, Latex, 1 figure, remarks, criticisms welcom

The Parity Bit in Quantum Cryptography

An $n$-bit string is encoded as a sequence of non-orthogonal quantum states. The parity bit of that $n$-bit string is described by one of two density matrices, $\rho_0^{(n)}$ and $\rho_1^{(n)}$, both in a Hilbert space of dimension $2^n$. In order to derive the parity bit the receiver must distinguish between the two density matrices, e.g., in terms of optimal mutual information. In this paper we find the measurement which provides the optimal mutual information about the parity bit and calculate that information. We prove that this information decreases exponentially with the length of the string in the case where the single bit states are almost fully overlapping. We believe this result will be useful in proving the ultimate security of quantum crytography in the presence of noise.Comment: 19 pages, RevTe

Simple Proof of Security of the BB84 Quantum Key Distribution Protocol

We prove the security of the 1984 protocol of Bennett and Brassard (BB84) for quantum key distribution. We first give a key distribution protocol based on entanglement purification, which can be proven secure using methods from Lo and Chau's proof of security for a similar protocol. We then show that the security of this protocol implies the security of BB84. The entanglement-purification based protocol uses Calderbank-Shor-Steane (CSS) codes, and properties of these codes are used to remove the use of quantum computation from the Lo-Chau protocol.Comment: 5 pages, Latex, minor changes to improve clarity and fix typo

Quantum key distribution with 2-bit quantum codes

We propose a prepare-and-measure scheme for quantum key distribution with 2-bit quantum codes. The protocol is unconditionally secure under whatever type of intercept-and-resend attack. Given the symmetric and independent errors to the transmitted qubits, our scheme can tolerate a bit error rate up to 26% in 4-state protocol and 30% in 6-state protocol, respectively. These values are higher than all currently known threshold values for prepare-and-measure protocols. A specific realization with linear optics is given.Comment: Approved for publication in Physical Review Letter

Teleportation and Secret Sharing with Pure Entangled States

We present two optimal methods of teleporting an unknown qubit using any pure entangled state. We also discuss how such methods can also have succesful application in quantum secret sharing with pure multipartite entangled states.Comment: Latex, 13 pages, submitted to PRA. One sub section already appeared in the archive: quant-ph /990701

Irreversibility in asymptotic manipulations of entanglement

We show that the process of entanglement distillation is irreversible by showing that the entanglement cost of a bound entangled state is finite. Such irreversibility remains even if extra pure entanglement is loaned to assist the distillation process.Comment: RevTex, 3 pages, no figures Result on indistillability of PPT states under pure entanglement catalytic LOCC adde