Sorting under partial information (without the ellipsoid algorithm)

We revisit the well-known problem of sorting under partial information: sort a finite set given the outcomes of comparisons between some pairs of elements. The input is a partially ordered set P, and solving the problem amounts to discovering an unknown linear extension of P, using pairwise comparisons. The information-theoretic lower bound on the number of comparisons needed in the worst case is log e(P), the binary logarithm of the number of linear extensions of P. In a breakthrough paper, Jeff Kahn and Jeong Han Kim (STOC 1992) showed that there exists a polynomial-time algorithm for the problem achieving this bound up to a constant factor. Their algorithm invokes the ellipsoid algorithm at each iteration for determining the next comparison, making it impractical. We develop efficient algorithms for sorting under partial information. Like Kahn and Kim, our approach relies on graph entropy. However, our algorithms differ in essential ways from theirs. Rather than resorting to convex programming for computing the entropy, we approximate the entropy, or make sure it is computed only once in a restricted class of graphs, permitting the use of a simpler algorithm. Specifically, we present: an O(n2) algorithm performing O(log n·log e(P)) comparisons; an O(n2.5) algorithm performing at most (1+ε) log e(P) + Oε(n) comparisons; an O(n2.5) algorithm performing O(log e(P)) comparisons. All our algorithms are simple to implement. © 2010 ACM.

Robust test method for time-course microarray experiments.

BACKGROUND: In a time-course microarray experiment, the expression level for each gene is observed across a number of time-points in order to characterize the temporal trajectories of the gene-expression profiles. For many of these experiments, the scientific aim is the identification of genes for which the trajectories depend on an experimental or phenotypic factor. There is an extensive recent body of literature on statistical methodology for addressing this analytical problem. Most of the existing methods are based on estimating the time-course trajectories using parametric or non-parametric mean regression methods. The sensitivity of these regression methods to outliers, an issue that is well documented in the statistical literature, should be of concern when analyzing microarray data. RESULTS: In this paper, we propose a robust testing method for identifying genes whose expression time profiles depend on a factor. Furthermore, we propose a multiple testing procedure to adjust for multiplicity. CONCLUSIONS: Through an extensive simulation study, we will illustrate the performance of our method. Finally, we will report the results from applying our method to a case study and discussing potential extensions.

Economic return of clinical trials performed under the pediatric exclusivity program.

CONTEXT: In 1997, Congress authorized the US Food and Drug Administration (FDA) to grant 6-month extensions of marketing rights through the Pediatric Exclusivity Program if industry sponsors complete FDA-requested pediatric trials. The program has been praised for creating incentives for studies in children and has been criticized as a "windfall" to the innovator drug industry. This critique has been a substantial part of congressional debate on the program, which is due to expire in 2007. OBJECTIVE: To quantify the economic return to industry for completing pediatric exclusivity trials. DESIGN AND SETTING: A cohort study of programs conducted for pediatric exclusivity. Nine drugs that were granted pediatric exclusivity were selected. From the final study reports submitted to the FDA (2002-2004), key elements of the clinical trial design and study operations were obtained, and the cost of performing each study was estimated and converted into estimates of after-tax cash outflows. Three-year market sales were obtained and converted into estimates of after-tax cash inflows based on 6 months of additional market protection. Net economic return (cash inflows minus outflows) and net return-to-costs ratio (net economic return divided by cash outflows) for each product were then calculated. MAIN OUTCOME MEASURES: Net economic return and net return-to-cost ratio. RESULTS: The indications studied reflect a broad representation of the program: asthma, tumors, attention-deficit/hyperactivity disorder, hypertension, depression/generalized anxiety disorder, diabetes mellitus, gastroesophageal reflux, bacterial infection, and bone mineralization. The distribution of net economic return for 6 months of exclusivity varied substantially among products (net economic return ranged from -$8.9 million to $507.9 million and net return-to-cost ratio ranged from -0.68 to 73.63). CONCLUSIONS: The economic return for pediatric exclusivity is variable. As an incentive to complete much-needed clinical trials in children, pediatric exclusivity can generate lucrative returns or produce more modest returns on investment.

An enteroendocrine cell-enteric glia connection revealed by 3D electron microscopy.

The enteroendocrine cell is the cornerstone of gastrointestinal chemosensation. In the intestine and colon, this cell is stimulated by nutrients, tastants that elicit the perception of flavor, and bacterial by-products; and in response, the cell secretes hormones like cholecystokinin and peptide YY--both potent regulators of appetite. The development of transgenic mice with enteroendocrine cells expressing green fluorescent protein has allowed for the elucidation of the apical nutrient sensing mechanisms of the cell. However, the basal secretory aspects of the enteroendocrine cell remain largely unexplored, particularly because a complete account of the enteroendocrine cell ultrastructure does not exist. Today, the fine ultrastructure of a specific cell can be revealed in the third dimension thanks to the invention of serial block face scanning electron microscopy (SBEM). Here, we bridged confocal microscopy with SBEM to identify the enteroendocrine cell of the mouse and study its ultrastructure in the third dimension. The results demonstrated that 73.5% of the peptide-secreting vesicles in the enteroendocrine cell are contained within an axon-like basal process. We called this process a neuropod. This neuropod contains neurofilaments, which are typical structural proteins of axons. Surprisingly, the SBEM data also demonstrated that the enteroendocrine cell neuropod is escorted by enteric glia--the cells that nurture enteric neurons. We extended these structural findings into an in vitro intestinal organoid system, in which the addition of glial derived neurotrophic factors enhanced the development of neuropods in enteroendocrine cells. These findings open a new avenue of exploration in gastrointestinal chemosensation by unveiling an unforeseen physical relationship between enteric glia and enteroendocrine cells.

Long-duration animal tracking in difficult lighting conditions.

High-throughput analysis of animal behavior requires software to analyze videos. Such software typically depends on the experiments' being performed in good lighting conditions, but this ideal is difficult or impossible to achieve for certain classes of experiments. Here, we describe techniques that allow long-duration positional tracking in difficult lighting conditions with strong shadows or recurring "on"/"off" changes in lighting. The latter condition will likely become increasingly common, e.g., for Drosophila due to the advent of red-shifted channel rhodopsins. The techniques enabled tracking with good accuracy in three types of experiments with difficult lighting conditions in our lab. Our technique handling shadows relies on single-animal tracking and on shadows' and flies' being accurately distinguishable by distance to the center of the arena (or a similar geometric rule); the other techniques should be broadly applicable. We implemented the techniques as extensions of the widely-used tracking software Ctrax; however, they are relatively simple, not specific to Drosophila, and could be added to other trackers as well.

Consistent couplings between fields with a gauge freedom and deformations of the master equation

The antibracket in the antifield-BRST formalism is known to define a map Hp × Hq → Hp + q + 1 associating with two equivalence classes of BRST invariant observables of respective ghost number p and q an equivalence class of BRST invariant observables of ghost number p + q + 1. It is shown that this map is trivial in the space of all functionals, i.e. that its image contains only the zeroth class. However, it is generically non-trivial in the space of local functionals. Implications of this result for the problem of consistent interactions among fields with a gauge freedom are then drawn. It is shown that the obstructions to constructing non-trivial such interactions lie precisely in the image of the antibracket map and are accordingly non-existent if one does not insist on locality. However consistent local interactions are severely constrained. The example of the Chern-Simons theory is considered. It is proved that the only consistent, local, Lorentz covariant interactions for the abelian models are exhausted by the non-abelian Chern-Simons extensions. © 1993.

Exploitation of symbolic information in interprocedural dependence analysis

The requirement for a very accurate dependence analysis to underpin software tools to aid the generation of efficient parallel implementations of scalar code is argued. The current status of dependence analysis is shown to be inadequate for the generation of efficient parallel code, causing too many conservative assumptions to be made. This paper summarises the limitations of conventional dependence analysis techniques, and then describes a series of extensions which enable the production of a much more accurate dependence graph. The extensions include analysis of symbolic variables, the development of a symbolic inequality disproof algorithm and its exploitation in a symbolic Banerjee inequality test; the use of inference engine proofs; the exploitation of exact dependence and dependence pre-domination attributes; interprocedural array analysis; conditional variable definition tracing; integer array tracing and division calculations. Analysis case studies on typical numerical code is shown to reduce the total dependencies estimated from conventional analysis by up to 50%. The techniques described in this paper have been embedded within a suite of tools, CAPTools, which combines analysis with user knowledge to produce efficient parallel implementations of numerical mesh based codes.

Reified temporal logics: an overview

There are three main approaches to the representation of temporal information in AI literature: the so-called method of temporal arguments that simply extends functions and predicates of first-order language to include time as the additional argument; modal temporal logics which are extensions ofthe propositional or predicate calculus with modal temporal operators; and reified temporal logics which reify standard propositions of some initial language (e.g., the classical first-order or modal logic) as objects denoting propositional terms. The objective of this paper is to provide an overview onthe temporal reified approach by looking closely atsome representative existing systems featuring reified propositions, including those of Allen, McDermott, Shoham, Reichgelt, Galton, and Ma and Knight. We shall demonstrate that, although reified logics might be more complicated in expressing assertions about some given objects with respect to different times, they accord a special status to time and therefore have several distinct advantages in talking about some important issues which would be difficult (if not impossible) to express in other approaches.

Global experience with electricity liberalisation

This paper examines global experiences with electricity liberalisation relevant to the new legislation on electricity passed by the Indonesian parliament in September 2009. It covers experiences in the UK, EU, USA and ten major developing economies. Finally, the paper comments on a number of the issues emerging from this survey, in particular the reliance on public finance for extensions to electricity networks, the advantages of public finance for cheaper capital and for developing renewables, and the comparative evidence on efficiency.

Data rescue and re-use: Recycling old information to address new policy concerns

Information on past trends is essential to inform future predictions and underpin attribution needed to drive policy responses. It has long been recognised that sustained observations are essential for disentangling climate-driven change from other regional and local-scale anthropogenic impacts and environmental fluctuations or cycles in natural systems. This paper highlights how data rescue and re-use have contributed to the debate on climate change responses of marine biodiversity and ecosystems. It also illustrates via two case studies the re-use of old data to address new policy concerns. The case studies focus on (1) plankton, fish and benthos from the Western English Channel and (2) broad-scale and long-term studies of intertidal species around the British Isles. Case study 1 using the Marine Biological Association of the UK's English Channel data has shown the influence of climatic fluctuations on phenology (migration and breeding patterns) and has also helped to disentangle responses to fishing pressure from those driven by climate, and provided insights into ecosystem-level change in the English Channel. Case study 2 has shown recent range extensions, increases of abundance and changes in phenology (breeding patterns) of southern, warm-water intertidal species in relation to recent rapid climate change and fluctuations in northern and southern barnacle species, enabling modelling and prediction of future states. The case is made for continuing targeted sustained observations and their importance for marine management and policy development.

First report of "Cotoneaster pannosus" Franch. ("Rosaceae") in Tarragona Province, and updated distribution area in Spain

Cotoneaster pannosus (Rosaceae), an ornamental shrub native to China, is reported for the first time in Tarragona Province (Catalonia, Spain). Data on demography and accompanying species for the new locality are provided, in addition to a chrorological update at nation level.

Bacterial symbiosis in Syssitomya pourtalesiana Oliver, 2012 (Galeommatoidea: Montacutidae), a bivalve commensal with the deep-sea echinoid Pourtalesia.

For the first time, bacterial symbiosis is recognized in the bivalve family Montacutidae of the superfamily Galeommatoidea. The ctenidial filaments of Syssitomya pourtalesiana Oliver, 2012 are extended abfrontally and a dense layer of bacteriocyte cells cover the entire surface behind a narrow ciliated frontal zone. The bacteria are extracellular and held within a matrix of epithelial extensions and microvilli. There is no cuticular layer (glycocalyx) covering the bacteria as in many thyasirid symbioses. The bacteriocytes hold more than one morphotype of bacteria, but bacilli, 1–3 μm in length, dominate. Scanning electron microscopy observations show a surface mat of filamentous bacteria over the extreme abfrontal surfaces. Filter feeding was confirmed by the presence of food particles in the stomach and the bivalve is presumed to be mixotrophic. Syssitomya is commensal and lives attached to the anal spines of the deep-sea echinoid Pourtalesia. In this position, echinoid feeding currents and echinoid faecal material may supply the bacteria with a variety of nutrient materials including dissolved organic matter.

Modification of smooth muscle Ca2+-sparks by tetracaine: evidence for sequential RyR activation.

Spontaneous Ca(2+)-sparks were imaged using confocal line scans of fluo-4 loaded myocytes in retinal arterioles. Tetracaine produced concentration-dependent decreases in spark frequency, and modified the spatiotemporal characteristics of residual sparks. Tetracaine (10 microM) reduced the rate of rise but prolonged the average rise time so that average spark amplitude was unaltered. The mean half-time of spark decay was also unaffected, suggesting that spark termination, although delayed, remained well synchronized. Sparks spread transversely across the myocytes in these vessels, and the speed of spread within individual sparks was slowed by approximately 60% in 10 microM tetracaine, as expected if the spark was propagated across the cell but the average P(o) for RyRs was reduced. Staining of isolated vessels with BODIPY-ryanodine and di-4-ANEPPS showed that RyRs were located both peripherally, adjacent to the plasma membrane, and in transverse extensions of the SR from one side of the cell to the other. Immuno-labelling of retinal flat mounts demonstrated the presence RyR(2) in arteriole smooth muscle but not RyR(1). We conclude that Ca(2+)-sparks in smooth muscle can result from sequential activation of RyRs distributed over an area of several microm(2), rather than from tightly clustered channels as in striated muscle.

Positive dilations of piecewise monotonic Markov maps

We provide an explicit formula which gives natural extensions of piecewise monotonic Markov maps defined on an interval of the real line. These maps are exact endomorphisms and define chaotic discrete dynamical systems.

Computationally efficient sequential learning algorithms for direct link resource-allocating networks

Computionally efficient sequential learning algorithms are developed for direct-link resource-allocating networks (DRANs). These are achieved by decomposing existing recursive training algorithms on a layer by layer and neuron by neuron basis. This allows network weights to be updated in an efficient parallel manner and facilitates the implementation of minimal update extensions that yield a significant reduction in computation load per iteration compared to existing sequential learning methods employed in resource-allocation network (RAN) and minimal RAN (MRAN) approaches. The new algorithms, which also incorporate a pruning strategy to control network growth, are evaluated on three different system identification benchmark problems and shown to outperform existing methods both in terms of training error convergence and computational efficiency. (c) 2005 Elsevier B.V. All rights reserved.