Impact of the commercial fishery on the population of bait shrimp (Penaeus spp.) in Biscayne Bay, 1986

Monthly population size of bait shrimp in the Bay was estimated from December 1984 to July 1985. Growth rates for male and female P. duorarum showed that pink shrimp exhibit a mean residence time in the nursery area (Biscayne Bay) of approximately 21 weeks. Monthly mortality rates were determined for each sex of pink shrimp. It was estimated that 23% and 26% of the male and female monthly population size, respectively, was absorbed by both the fishery and ecosystem monthly. Monthly proportion of the standing stock expected to die exclusively through fishing was 6.5% and 6.0% for males and females respectively. Estimates of emigration rates showed that approximately 4.0% of the population was lost from the Bay system each month. This surplus production was about 50% of the average monthly catch by the fleet. Fishing mortality represents only 8 - 9% of the losses to the shrimp population. The biggest source of loss is emigration, suggesting that most shrimp beyond the size at recruitment (to the fishery) are not utilized for food while in the Bay. Thus, it appears that the direct impact of the fishery on the bait shrimp population is relatively small. (PDF contains 46 pages

Searching for Bayesian Network Structures in the Space of Restricted Acyclic Partially Directed Graphs

Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on independence criteria, and those based on a scoring function and a search procedure (although some methods combine the two). Within the score+search paradigm, the dominant approach uses local search methods in the space of directed acyclic graphs (DAGs), where the usual choices for defining the elementary modifications (local changes) that can be applied are arc addition, arc deletion, and arc reversal. In this paper, we propose a new local search method that uses a different search space, and which takes account of the concept of equivalence between network structures: restricted acyclic partially directed graphs (RPDAGs). In this way, the number of different configurations of the search space is reduced, thus improving efficiency. Moreover, although the final result must necessarily be a local optimum given the nature of the search method, the topology of the new search space, which avoids making early decisions about the directions of the arcs, may help to find better local optima than those obtained by searching in the DAG space. Detailed results of the evaluation of the proposed search method on several test problems, including the well-known Alarm Monitoring System, are also presented

Long-distance entanglement and quantum teleportation in XX spin chains

Isotropic XX models of one-dimensional spin-1/2 chains are investigated with the aim to elucidate the formal structure and the physical properties that allow these systems to act as channels for long-distance, high-fidelity quantum teleportation. We introduce two types of models: I) open, dimerized XX chains, and II) open XX chains with small end bonds. For both models we obtain the exact expressions for the end-to-end correlations and the scaling of the energy gap with the length of the chain. We determine the end-to-end concurrence and show that model I) supports true long-distance entanglement at zero temperature, while model II) supports {\it ``quasi long-distance''} entanglement that slowly falls off with the size of the chain. Due to the different scalings of the gaps, respectively exponential for model I) and algebraic in model II), we demonstrate that the latter allows for efficient qubit teleportation with high fidelity in sufficiently long chains even at moderately low temperatures.Comment: 9 pages, 6 figure

On Higher Derivatives as Constraints in Field Theory: a Geometric Perspective

We formalize geometrically the idea that the (de Donder) Hamiltonian formulation of a higher derivative Lagrangian field theory can be constructed understanding the latter as a first derivative theory subjected to constraints.Comment: 7 page

Critical phenomena of thick branes in warped spacetimes

We have investigated the effects of a generic bulk first-order phase transition on thick Minkowski branes in warped geometries. As occurs in Euclidean space, when the system is brought near the phase transition an interface separating two ordered phases splits into two interfaces with a disordered phase in between. A remarkable and distinctive feature is that the critical temperature of the phase transition is lowered due to pure geometrical effects. We have studied a variety of critical exponents and the evolution of the transverse-traceless sector of the metric fluctuations.Comment: revtex4, 4 pages, 4 figures, some comments added, typos corrected, published in PR

Implementation of an orchestration language as a haskell domain specific language

Even though concurrent programming has been a hot topic of discussion in Computer Science for the past 30 years, the community has yet to settle on a, or a few standard approaches to implement concurrent programs. But as more and more cores inhabit our CPUs and more and more services are made available on the web the problem of coordinating different tasks becomes increasingly relevant. The present paper addresses this problem with an implementation of the orchestration language Orc as a domain specific language in Haskell. Orc was, therefore, realized as a combinator library using the lightweight threads and the communication and synchronization primitives of the Concurrent Haskell library. With this implementation it becomes possible to create orchestrations that re-use existing Haskell code and, conversely, re-use orchestrations inside other Haskell programs. The complexity inherent to distributed computation, entails the need for the classification of efficient, re-usable, concurrent programming patterns. The paper discusses how the calculus of recursive schemes used in the derivation of functional programs, scales up to a distributed setting. It is shown, in particular, how to parallelize the entire class of binary tree hylomorphisms.FCT -Fuel Cell Technologies Program(PTDC/EIA/73252/2006

Ultrahigh Transmission Optical Nanofibers

We present a procedure for reproducibly fabricating ultrahigh transmission optical nanofibers (530 nm diameter and 84 mm stretch) with single-mode transmissions of 99.95 $\pm$ 0.02%, which represents a loss from tapering of 2.6 $\,\times \,$ 10$^{-5}$ dB/mm when normalized to the entire stretch. When controllably launching the next family of higher-order modes on a fiber with 195 mm stretch, we achieve a transmission of 97.8 $\pm$ 2.8%, which has a loss from tapering of 5.0 $\,\times \,$ 10$^{-4}$ dB/mm when normalized to the entire stretch. Our pulling and transfer procedures allow us to fabricate optical nanofibers that transmit more than 400 mW in high vacuum conditions. These results, published as parameters in our previous work, present an improvement of two orders of magnitude less loss for the fundamental mode and an increase in transmission of more than 300% for higher-order modes, when following the protocols detailed in this paper. We extract from the transmission during the pull, the only reported spectrogram of a fundamental mode launch that does not include excitation to asymmetric modes; in stark contrast to a pull in which our cleaning protocol is not followed. These results depend critically on the pre-pull cleanliness and when properly following our pulling protocols are in excellent agreement with simulations.Comment: 32 pages, 10 figures, accepted to AIP Advance