Seasonal variability in ichthyoplankton abundance and assemblage composition in the northern Gulf of Mexico off Alabama

Multiyear ichthyoplankton surveys used to monitor larval fish seasonality, abundance, and assemblage structure can provide early indicators of regional ecosystem changes. Numerous ichthyoplankton surveys have been conducted in the northern Gulf of Mexico, but few have had high levels of temporal resolution and sample replication. In this study, ichthyoplankton samples were collected monthly (October 2004–October 2006) at a single station off the coast of Alabama as part of a long-term biological survey. Four seasonal periods were identified from observed and historic water temperatures, including a relatively long (June–October) “summer” period (water temperature >26°C). Fish egg abundance, total larval abundance, and larval taxonomic diversity were significantly related to water temperature (but not salinity), with peaks in the spring, spring–summer, and summer periods, respectively. Larvae collected during the survey represented 58 different families, of which engraulids, sciaenids, carangids, and clupeids were the most prominent. The most abundant taxa collected were unidentified engraulids (50%), sand seatrout (Cynoscion arenarius, 7.5%), Atlantic bumper (Chloroscombrus chrysurus, 5.4%), Atlantic croaker (Micropogonias undulatus, 4.4%), Gulf menhaden (Brevoortia patronus, 3.8%), and unidentified gobiids (3.6%). Larval concentrations for dominant taxa were highly variable between years, but the timing of seasonal occurrence for these taxa was relatively consistent. Documented increases in sea surface temperature on the Alabama shelf may have various implications for larval fish dynamics, as indicated by the presence of tropical larval forms (e.g., fistularids, labrids, scarids, and acanthurids) in our ichthyoplankton collections and in recent juvenile surveys of Alabama and northern Gulf of Mexico seagrass habitats

Aircraft and avionic related research required to develop an effective high-speed runway exit system

Research was conducted to increase airport capacity by studying the feasibility of the longitudinal separation between aircraft sequences on final approach. The multidisciplinary factors which include the utility of high speed exits for efficient runway operations were described along with recommendations and highlights of these studies

Seasonal Variability in Ichthyoplankton Abundance and Assemblage Composition in the Northern Gulf of Mexico off Alabama

Multiyear ichthyoplankton surveys used to monitor larval fish seasonality, abundance, and assemblage structure can provide early indicators of regional ecosystem changes. Numerous ichthyoplankton surveys have been conducted in the northern Gulf of Mexico, but few have had high levels of temporal resolution and sample replication. In this study, ichthyoplankton samples were collected monthly (October 2004–October 2006) at a single station off the coast of Alabama as part of a long-term biological survey. Four seasonal periods were identified from observed and historic water temperatures, including a relatively long (June–October) “summer” period (water temperature \u3e26°C). Fish egg abundance, total larval abundance, and larval taxonomic diversity were significantly related to water temperature (but not salinity), with peaks in the spring, spring–summer, and summer periods, respectively. Larvae collected during the survey represented 58 different families, of which engraulids, sciaenids, carangids, and clupeids were the most prominent. The most abundant taxa collected were unidentified engraulids (50%), sand seatrout (Cynoscion arenarius, 7.5%), Atlantic bumper (Chloroscombrus chrysurus, 5.4%), Atlantic croaker (Micropogonias undulatus, 4.4%), Gulf menhaden (Brevoortia patronus, 3.8%), and unidentified gobiids (3.6%). Larval concentrations for dominant taxa were highly variable between years, but the timing of seasonal occurrence for these taxa was relatively consistent. Documented increases in sea surface temperature on the Alabama shelf may have various implications for larval fish dynamics, as indicated by the presence of tropical larval forms (e.g., fistularids, labrids, scarids, and acanthurids) in our ichthyoplankton collections and in recent juvenile surveys of Alabama and northern Gulf of Mexico seagrass habitats

Scheduling MapReduce Jobs under Multi-Round Precedences

We consider non-preemptive scheduling of MapReduce jobs with multiple tasks in the practical scenario where each job requires several map-reduce rounds. We seek to minimize the average weighted completion time and consider scheduling on identical and unrelated parallel processors. For identical processors, we present LP-based O(1)-approximation algorithms. For unrelated processors, the approximation ratio naturally depends on the maximum number of rounds of any job. Since the number of rounds per job in typical MapReduce algorithms is a small constant, our scheduling algorithms achieve a small approximation ratio in practice. For the single-round case, we substantially improve on previously best known approximation guarantees for both identical and unrelated processors. Moreover, we conduct an experimental analysis and compare the performance of our algorithms against a fast heuristic and a lower bound on the optimal solution, thus demonstrating their promising practical performance

Supersymmetric minisuperspace with non-vanishing fermion number

The Lagrangean of $N=1$ supergravity is dimensionally reduced to one (time-like) dimension assuming spatial homogeneity of any Bianchi type within class A of the classification of Ellis and McCallum. The algebra of the supersymmetry generators, the Lorentz generators, the diffeomorphism generators and the Hamiltonian generator is determined and found to close. In contrast to earlier work, infinitely many physical states with non-vanishing even fermion number are found to exist in these models, indicating that minisuperspace models in supergravity may be just as useful as in pure gravity.Comment: 4 page

Casting Light on Dark Matter

The prospects for detecting a candidate supersymmetric dark matter particle at the LHC are reviewed, and compared with the prospects for direct and indirect searches for astrophysical dark matter. The discussion is based on a frequentist analysis of the preferred regions of the Minimal supersymmetric extension of the Standard Model with universal soft supersymmetry breaking (the CMSSM). LHC searches may have good chances to observe supersymmetry in the near future - and so may direct searches for astrophysical dark matter particles, whereas indirect searches may require greater sensitivity, at least within the CMSSM.Comment: 16 pages, 13 figures, contribution to the proceedings of the LEAP 2011 Conferenc

Comprehensive proteomic profiling of outer membrane vesicles from Campylobacter jejuni

Gram-negative bacteria constitutively release outer membrane vesicles (OMVs) during cell growth that play significant roles in bacterial survival, virulence and pathogenesis. In this study, comprehensive proteomic analysis of OMVs from a human gastrointestinal pathogen Campylobacter jejuni NCTC11168 was performed using high-resolution mass spectrometry. The OMVs of C. jejuni NCTC11168 were isolated from culture supernatants then characterized using electron microscopy and dynamic light scattering revealing spherical OMVs of an average diameter of 50 nm. We then identified 134 vesicular proteins using high-resolution LTQ-Orbitrap mass spectrometry. Subsequent functional analysis of the genes revealed the relationships of the vesicular proteins. Furthermore, known N-glycoproteins were identified from the list of the vesicular proteome, implying the potential role of the OMVs as a delivery means for biologically relevant bacterial glycoproteins. These results enabled us to elucidate the overall proteome profile of pathogenic bacterium C. jejuni and to speculate on the function of OMVs in bacterial infections and communication

On the String Consensus Problem and the Manhattan Sequence Consensus Problem

In the Manhattan Sequence Consensus problem (MSC problem) we are given $k$ integer sequences, each of length $l$, and we are to find an integer sequence $x$ of length $l$ (called a consensus sequence), such that the maximum Manhattan distance of $x$ from each of the input sequences is minimized. For binary sequences Manhattan distance coincides with Hamming distance, hence in this case the string consensus problem (also called string center problem or closest string problem) is a special case of MSC. Our main result is a practically efficient $O(l)$-time algorithm solving MSC for $k\le 5$ sequences. Practicality of our algorithms has been verified experimentally. It improves upon the quadratic algorithm by Amir et al.\ (SPIRE 2012) for string consensus problem for $k=5$ binary strings. Similarly as in Amir's algorithm we use a column-based framework. We replace the implied general integer linear programming by its easy special cases, due to combinatorial properties of the MSC for $k\le 5$. We also show that for a general parameter $k$ any instance can be reduced in linear time to a kernel of size $k!$, so the problem is fixed-parameter tractable. Nevertheless, for $k\ge 4$ this is still too large for any naive solution to be feasible in practice.Comment: accepted to SPIRE 201

J D Bernal: philosophy, politics and the science of science

This paper is an examination of the philosophical and political legacy of John Desmond Bernal. It addresses the evidence of an emerging consensus on Bernal based on the recent biography of Bernal by Andrew Brown and the reviews it has received. It takes issue with this view of Bernal, which tends to be admiring of his scientific contribution, bemused by his sexuality, condescending to his philosophy and hostile to his politics. This article is a critical defence of his philosophical and political position

Mirror-Descent Methods in Mixed-Integer Convex Optimization

In this paper, we address the problem of minimizing a convex function f over a convex set, with the extra constraint that some variables must be integer. This problem, even when f is a piecewise linear function, is NP-hard. We study an algorithmic approach to this problem, postponing its hardness to the realization of an oracle. If this oracle can be realized in polynomial time, then the problem can be solved in polynomial time as well. For problems with two integer variables, we show that the oracle can be implemented efficiently, that is, in O(ln(B)) approximate minimizations of f over the continuous variables, where B is a known bound on the absolute value of the integer variables.Our algorithm can be adapted to find the second best point of a purely integer convex optimization problem in two dimensions, and more generally its k-th best point. This observation allows us to formulate a finite-time algorithm for mixed-integer convex optimization