@article{3615,
abstract = {We investigate three alternative selection-based scenarios proposed to maintain polygenic variation: pleiotropic balancing selection, G x E interactions (with spatial or temporal variation in allelic effects), and sex-dependent allelic effects. Each analysis assumes an additive polygenic trait with n diallelic loci under stabilizing selection. We allow loci to have different effects and consider equilibria at which the population mean departs from the stabilizing-selection optimum. Under weak selection, each model produces essentially identical, approximate allele-frequency dynamics. Variation is maintained under pleiotropic balancing selection only at loci for which the strength of balancing selection exceeds the effective strength of stabilizing selection. In addition, for all models, polymorphism requires that the population mean be close enough to the optimum that directional selection does not overwhelm balancing selection. This balance allows many simultaneously stable equilibria, and we explore their properties numerically. Both spatial and temporal G x E can maintain variation at loci for which the coefficient of variation (across environments) of the effect of a substitution exceeds a critical value greater than one. The critical value depends on the correlation between substitution effects at different loci. For large positive correlations (e.g., ρ2ij > 3/4), even extreme fluctuations in allelic effects cannot maintain variation. Surprisingly, this constraint on correlations implies that sex-dependent allelic effects cannot maintain polygenic variation. We present numerical results that support our analytical approximations and discuss our results in connection to relevant data and alternative variance-maintaining mechanisms.},
author = {Turelli, Michael and Nicholas Barton},
journal = {Genetics},
number = {2},
pages = {1053 -- 1079},
publisher = {Genetics Society of America},
title = {{Polygenic variation maintained by balancing selection: pleiotropy, sex-dependent allelic effects and GxE interactions}},
doi = {10.1534/genetics.166.2.1053},
volume = {166},
year = {2004},
}
@misc{3616,
author = {Nicholas Barton},
booktitle = {Current Biology},
number = {15},
pages = {R603 -- R604},
publisher = {Cell Press},
title = {{Speciation: Why, how, where and when?}},
doi = {10.1016/j.cub.2004.07.037},
volume = {14},
year = {2004},
}
@article{3617,
abstract = {The coalescent process can describe the effects of selection at linked loci only if selection is so strong that genotype frequencies evolve deterministically. Here, we develop methods proposed by Kaplan, Darden, and Hudson to find the effects of weak selection. We show that the overall effect is given by an extension to Price's equation: the change in properties such as moments of coalescence times is equal to the covariance between those properties and the fitness of the sample of genes. The distribution of coalescence times differs substantially between allelic classes, even in the absence of selection. However, the average coalescence time between randomly chosen genes is insensitive to the current allele frequency and is affected significantly by purifying selection only if deleterious mutations are common and selection is strong (i.e., the product of population size and selection coefficient, Ns > 3). Balancing selection increases mean coalescence times, but the effect becomes large only when mutation rates between allelic classes are low and when selection is extremely strong. Our analysis supports previous simulations that show that selection has surprisingly little effect on genealogies. Moreover, small fluctuations in allele frequency due to random drift can greatly reduce any such effects. This will make it difficult to detect the action of selection from neutral variation alone.},
author = {Nicholas Barton and Etheridge, Alison M},
journal = {Genetics},
number = {2},
pages = {1115 -- 1131},
publisher = {Genetics Society of America},
title = {{The effect of selection on genealogies}},
doi = {10.1534/genetics.166.2.1115},
volume = {166},
year = {2004},
}
@inproceedings{3688,
abstract = {Capturing images of documents using handheld digital cameras has a variety of applications in academia, research, knowledge management, retail, and office settings. The ultimate goal of such systems is to achieve image quality comparable to that currently achieved with flatbed scanners even for curved, warped, or curled pages. This can be achieved by high-accuracy 3D modeling of the page surface, followed by a "flattening" of the surface. A number of previous systems have either assumed only perspective distortions, or used techniques like structured lighting, shading, or side-imaging for obtaining 3D shape. This paper describes a system for handheld camera-based document capture using general purpose stereo vision methods followed by a new document dewarping technique. Examples of shape modeling and dewarping of book images is shown.},
author = {Ulges, Adrian and Christoph Lampert and Breuel,Thomas M},
pages = {198 -- 200},
publisher = {ACM},
title = {{Document capture using stereo vision}},
doi = {10.1145/1030397.1030434},
year = {2004},
}
@article{3805,
abstract = {The operation of neuronal networks crucially depends on a fast time course of signaling in inhibitory interneurons. Synapses that excite interneurons generate fast currents, owing to the expression of glutamate receptors of specific subunit composition. Interneurons generate brief action potentials in response to transient synaptic activation and discharge repetitively at very high frequencies during sustained stimulation. The ability to generate short-duration action potentials at high frequencies depends on the expression of specific voltage-gated K+ channels. Factors facilitating fast action potential initiation following synaptic excitation include depolarized interneuron resting potential, subthreshold conductances and active dendrites. Finally, GABA release at interneuron output synapses is rapid and highly synchronized, leading to a faster inhibition in postsynaptic interneurons than in principal cells. Thus, the expression of distinct transmitter receptors and voltage-gated ion channels ensures that interneurons operate with high speed and temporal precision.},
author = {Peter Jonas and Bischofberger, Josef and Fricker, Desdemona and Miles, Richard},
journal = {Trends in Neurosciences},
number = {1},
pages = {30 -- 40},
publisher = {Elsevier},
title = {{Interneuron Diversity series: Fast in, fast out--temporal and spatial signal processing in hippocampal interneurons}},
doi = {doi:10.1016/j.tins.2003.10.010},
volume = {27},
year = {2004},
}
@article{3807,
abstract = {The time course of Mg(2+) block and unblock of NMDA receptors (NMDARs) determines the extent they are activated by depolarization. Here, we directly measure the rate of NMDAR channel opening in response to depolarizations at different times after brief (1 ms) and sustained (4.6 s) applications of glutamate to nucleated patches from neocortical pyramidal neurons. The kinetics of Mg(2+) unblock were found to be non-instantaneous and complex, consisting of a prominent fast component (time constant approximately 100 micros) and slower components (time constants 4 and approximately 300 ms), the relative amplitudes of which depended on the timing of the depolarizing pulse. Fitting a kinetic model to these data indicated that Mg(2+) not only blocks the NMDAR channel, but reduces both the open probability and affinity for glutamate, while enhancing desensitization. These effects slow the rate of NMDAR channel opening in response to depolarization in a time-dependent manner such that the slower components of Mg(2+) unblock are enhanced during depolarizations at later times after glutamate application. One physiological consequence of this is that brief depolarizations occurring earlier in time after glutamate application are better able to open NMDAR channels. This finding has important implications for spike-timing-dependent synaptic plasticity (STDP), where the precise (millisecond) timing of action potentials relative to synaptic inputs determines the magnitude and sign of changes in synaptic strength. Indeed, we find that STDP timing curves of NMDAR channel activation elicited by realistic dendritic action potential waveforms are narrower than expected assuming instantaneous Mg(2+) unblock, indicating that slow Mg(2+) unblock of NMDAR channels makes the STDP timing window more precise.},
author = {Kampa, Bjorn M and Clements, John and Peter Jonas and Stuart, Greg J},
journal = {Journal of Physiology},
number = {Pt 2},
pages = {337 -- 45},
publisher = {Wiley-Blackwell},
title = {{Kinetics of Mg(2+) unblock of NMDA receptors: implications for spike-timing dependent synaptic plasticity}},
doi = {10.1113/jphysiol.2003.058842 },
volume = {556},
year = {2004},
}
@article{3809,
abstract = {Neural stem cells in various regions of the vertebrate brain continuously generate neurons throughout life. In the mammalian hippocampus, a region important for spatial and episodic memory, thousands of new granule cells are produced per day, with the exact number depending on environmental conditions and physical exercise. The survival of these neurons is improved by learning and conversely learning may be promoted by neurogenesis. Although it has been suggested that newly generated neurons may have specific properties to facilitate learning, the cellular and synaptic mechanisms of plasticity in these neurons are largely unknown. Here we show that young granule cells in the adult hippocampus differ substantially from mature granule cells in both active and passive membrane properties. In young neurons, T-type Ca2+ channels can generate isolated Ca2+ spikes and boost fast Na+ action potentials, contributing to the induction of synaptic plasticity. Associative long-term potentiation can be induced more easily in young neurons than in mature neurons under identical conditions. Thus, newly generated neurons express unique mechanisms to facilitate synaptic plasticity, which may be important for the formation of new memories.},
author = {Schmidt-Hieber, Christoph and Peter Jonas and Bischofberger, Josef},
journal = {Nature},
number = {6988},
pages = {184 -- 7},
publisher = {Nature Publishing Group},
title = {{Enhanced synaptic plasticity in newly generated granule cells of the adult hippocampus}},
doi = {10.1038/nature02553},
volume = {429},
year = {2004},
}
@article{3810,
abstract = {Voltage-gated potassium (Kv) channels control action potential repolarization, interspike membrane potential, and action potential frequency in excitable cells. It is thought that the combinatorial association between distinct alpha and beta subunits determines whether Kv channels function as non-inactivating delayed rectifiers or as rapidly inactivating A-type channels. We show that membrane lipids can convert A-type channels into delayed rectifiers and vice versa. Phosphoinositides remove N-type inactivation from A-type channels by immobilizing the inactivation domains. Conversely, arachidonic acid and its amide anandamide endow delayed rectifiers with rapid voltage-dependent inactivation. The bidirectional control of Kv channel gating by lipids may provide a mechanism for the dynamic regulation of electrical signaling in the nervous system.},
author = {Oliver, Dominik and Lien, Cheng-Chang and Soom, Malle and Baukrowitz, Thomas and Peter Jonas and Fakler, Bernd},
journal = {Science},
number = {5668},
pages = {265 -- 70},
publisher = {American Association for the Advancement of Science},
title = {{Functional conversion between A-type and delayed rectifier K+ channels by membrane lipids}},
doi = {10.1126/science.1094113},
volume = {304},
year = {2004},
}
@inproceedings{3894,
abstract = {We study infinite stochastic games played by n-players on a finite graph with goals given by sets of infinite traces. The games are stochastic (each player simultaneously and independently chooses an action at each round, and the next state is determined by a probability distribution depending on the current state and the chosen actions), infinite (the game continues for an infinite number of rounds), nonzero sum (the players' goals are not necessarily conflicting), and undiscounted. We show that if each player has a reachability objective, that is, if the goal for each player i is to visit some subset R-i of the states, then there exists an epsilon-Nash equilibrium in memoryless strategies, for every epsilon > 0. However, exact Nash equilibria need not exist. We study the complexity of finding such Nash equilibria, and show that the payoff of some epsilon-Nash equilibrium in memoryless strategies can be epsilon-approximated in NP. We study the important subclass of n-player turn-based probabilistic games, where at each state at most one player has a nontrivial choice of moves. For turn-based probabilistic games, we show the existence of epsilon-Nash equilibria in pure strategies for games where the objective of player i is a Borel set B-i of infinite traces. However, exact Nash equilibria may not exist. For the special case of omega-regular objectives, we show exact Nash equilibria exist, and can be computed in NP when the omega-regular objectives are expressed as parity objectives.},
author = {Krishnendu Chatterjee and Majumdar, Ritankar S and Jurdziński, Marcin},
pages = {26 -- 40},
publisher = {Springer},
title = {{On Nash equilibria in stochastic games}},
doi = {10.1007/978-3-540-30124-0_6},
volume = {3210},
year = {2004},
}
@inproceedings{3895,
abstract = {In 2-player non-zero-sum games, Nash equilibria capture the options for rational behavior if each player attempts to maximize her payoff. In contrast to classical game theory, we consider lexicographic objectives: first, each player tries to maximize her own payoff, and then, the player tries to minimize the opponent's payoff. Such objectives arise naturally in the verification of systems with multiple components. There, instead of proving that each component satisfies its specification no matter how the other components behave, it often suffices to prove that each component satisfies its specification provided that the other components satisfy their specifications. We say that a Nash equilibrium is secure if it is an equilibrium with respect to the lexicographic objectives of both players. We prove that in graph games with Borel objectives, which include the games that arise in verification, there may be several Nash equilibria, but there is always a unique maximal payoff profile of secure equilibria. We show how this equilibrium can be computed in the case of omega-regular objectives, and we characterize the memory requirements of strategies that achieve the equilibrium.},
author = {Krishnendu Chatterjee and Thomas Henzinger and Jurdziński, Marcin},
pages = {160 -- 169},
publisher = {IEEE},
title = {{Games with secure equilibria}},
doi = {10.1109/LICS.2004.1319610},
year = {2004},
}
@inbook{3587,
author = {Ulrich, Florian and Heisenberg, Carl-Philipp J},
booktitle = {Fish development and genetics : the zebrafish and medaka models},
editor = {Korzh, Vladimir and Gong, Zhiyuan},
pages = {39 -- 86},
publisher = {World Scientific Publishing},
title = {{Gastrulation in zebrafish}},
volume = {2},
year = {2004},
}
@article{4172,
abstract = {During vertebrate gastrulation, a relatively limited number of blastodermal cells undergoes a stereotypical set of cellular movements that leads to formation of the three germ layers: ectoderm, mesoderm and endoderm. Gastrulation, therefore, provides a unique developmental system in which to study cell movements in vivo in a fairly simple cellular context. Recent advances have been made in elucidating the cellular and molecular mechanisms that underlie cell movements during zebrafish gastrulation. These findings can be compared with observations made in other model systems to identify potential general mechanisms of cell migration during development.},
author = {Montero, Juan and Heisenberg, Carl-Philipp J},
journal = {Trends in Cell Biology},
number = {11},
pages = {620 -- 627},
publisher = {Cell Press},
title = {{Gastrulation dynamics: cells move into focus}},
doi = {10.1016/j.tcb.2004.09.008},
volume = {14},
year = {2004},
}
@article{4238,
abstract = {The dynamical basis of tumoral growth has been controversial. Many models have been proposed to explain cancer development. The descriptions employ exponential, potential, logistic or Gompertzian growth laws. Some of these models are concerned with the interaction between cancer and the immunological, system. Among other properties, these models are concerned with the microscopic behavior of tumors and the emergence of cancer. We propose a modification of a previous model by Stepanova, which describes the specific immunological response against cancer. The modification consists of the substitution of a Gompertian law for the exponential rate used for tumoral growth. This modification is motivated by the numerous works confirming that Gompertz's equation correctly describes solid tumor growth. The modified model predicts that near zero, tumors always tend to grow. Immunological contraposition never suffices to induce a complete regression of the tumor. Instead, a stable microscopic equilibrium between cancer and immunological activity can be attained. In other words, our model predicts that the theory of immune surveillance is plausible. A macroscopic equilibrium in which the system develops cancer is also possible. In this case, immunological activity is depleted. This is consistent with the phenomena of cancer tolerance. Both equilibrium points can coexist or can exist without the other. In all cases the fixed point at zero tumor size is unstable. Since immunity cannot induce a complete tumor regression, a therapy is required. We include constant-dose therapies and show that they are insufficient. Final levels of immunocompetent cells and tumoral cells are finite, thus post-treatment regrowth of the tumor is certain. We also evaluate late-intensification therapies which are successful. They induce an asymptotic regression to zero tumor size. Immune response is also suppressed by the therapy, and thus plays a negligible role in the remission. We conclude that treatment evaluation should be successful without taking into account immunological effects. (C) 2003 Elsevier Ltd. All rights reserved.},
author = {de Vladar, Harold and González, J.},
journal = {Journal of Theoretical Biology},
number = {3},
pages = {335 -- 348},
publisher = {Elsevier},
title = {{Dynamic response of cancer under the influence of immunological activity and therapy}},
doi = {3801},
volume = {227},
year = {2004},
}
@article{4224,
abstract = {Developing cells acquire positional information by reading the graded distribution of morphogens. In Drosophila, the Dpp morphogen forms a long-range concentration gradient by spreading from a restricted source in the developing wing. It has been assumed that Dpp spreads by extracellular diffusion. Under this assumption, the main role of endocytosis in gradient formation is to downregulate receptors at the cell surface. These surface receptors bind to the ligand and thereby interfere with its long-range movement. Recent experiments indicate that Dpp spreading is mediated by Dynamin-dependent endocytosis in the target tissue, suggesting that extracellular diffusion alone cannot account for Dpp dispersal. Here, we perform a theoretical study of a model for morphogen spreading based on extracellular diffusion, which takes into account receptor binding and trafficking. We compare profiles of ligand and surface receptors obtained in this model with experimental data. To this end, we monitored directly the pool of surface receptors and extracellular Dpp with specific antibodies. We conclude that current models considering pure extracellular diffusion cannot explain the observed role of endocytosis during Dpp long-range movement.},
author = {Kruse, Karsten and Pantazis, Periklis and Bollenbach, Mark Tobias and Julicher, Frank and Gonzalez Gaitan, Marcos},
journal = {Development},
number = {19},
pages = {4843 -- 4856},
publisher = {Company of Biologists},
title = {{Dpp gradient formation by dynamin-dependent endocytosis: receptor trafficking and the diffusion model}},
doi = {10.1242/dev.01335},
volume = {131},
year = {2004},
}
@phdthesis{4236,
author = {de Vladar, Harold},
publisher = {Centro de estudios avazados, IVIC},
title = {{Métodos no lineales y sus aplicaciones en dinámicas aleatorias de poblaciones celulares}},
doi = {3810},
year = {2004},
}
@phdthesis{4424,
abstract = {The enormous cost and ubiquity of software errors necessitates the need for techniques and tools that can precisely analyze large systems and prove that they meet given specifications, or if they don't, return counterexample behaviors showing how the system fails. Recent advances in model checking, decision procedures, program analysis and type systems, and a shift of focus to partial specifications common to several systems (e.g., memory safety and race freedom) have resulted in several practical verification methods. However, these methods are either precise or they are scalable, depending on whether they track the values of variables or only a fixed small set of dataflow facts (e.g., types), and are usually insufficient for precisely verifying large programs.
We describe a new technique called Lazy Abstraction (LA) which achieves both precision and scalability by localizing the use of precise information. LA automatically builds, explores and refines a single abstract model of the program in a way that different parts of the model exhibit different degrees of precision, namely just enough to verify the desired property. The algorithm automatically mines the information required by partitioning mechanical proofs of unsatisfiability of spurious counterexamples into Craig Interpolants. For multithreaded systems, we give a new technique based on analyzing the behavior of a single thread executing in a context which is an abstraction of the other (arbitrarily many) threads. We define novel context models and show how to automatically infer them and analyze the full system (thread + context) using LA.
LA is implemented in BLAST. We have run BLAST on Windows and Linux Device Drivers to verify API conformance properties, and have used it to find (or guarantee the absence of) data races in multithreaded Networked Embedded Systems (NESC) applications. BLAST is able to prove the absence of races in several cases where earlier methods, which depend on lock-based synchronization, fail.},
author = {Jhala, Ranjit},
pages = {1 -- 165},
publisher = {University of California, Berkeley},
title = {{Program verification by lazy abstraction}},
year = {2004},
}
@article{8517,
abstract = {We consider the evolution of a connected set on the plane carried by a space periodic incompressible stochastic flow. While for almost every realization of the stochastic flow at time t most of the particles are at a distance of order equation image away from the origin, there is a measure zero set of points that escape to infinity at the linear rate. We study the set of points visited by the original set by time t and show that such a set, when scaled down by the factor of t, has a limiting nonrandom shape.},
author = {Dolgopyat, Dmitry and Kaloshin, Vadim and Koralov, Leonid},
issn = {0010-3640},
journal = {Communications on Pure and Applied Mathematics},
keywords = {Applied Mathematics, General Mathematics},
number = {9},
pages = {1127--1158},
publisher = {Wiley},
title = {{A limit shape theorem for periodic stochastic dispersion}},
doi = {10.1002/cpa.20032},
volume = {57},
year = {2004},
}
@article{8518,
author = {Koralov, Leonid and Kaloshin, Vadim and Dolgopyat, Dmitry},
issn = {0091-1798},
journal = {The Annals of Probability},
number = {1A},
pages = {1--27},
publisher = {Institute of Mathematical Statistics},
title = {{Sample path properties of the stochastic flows}},
doi = {10.1214/aop/1078415827},
volume = {32},
year = {2004},
}
@article{205,
author = {Timothy Browning},
journal = {Acta Arithmetica},
number = {3},
pages = {275 -- 295},
publisher = {Instytut Matematyczny},
title = {{Counting rational points on cubic and quartic surfaces}},
doi = {10.4064/aa108-3-7},
volume = {108},
year = {2003},
}
@article{206,
abstract = {Let T ⊂ ℙ 4 be a non-singular threefold of degree at least four. Then we show that the number of points in T(ℚ), with height at most B, is o(B 3) or B → ∞.},
author = {Timothy Browning},
journal = {Quarterly Journal of Mathematics},
number = {1},
pages = {33 -- 39},
publisher = {Unknown},
title = {{A note on the distribution of rational points on threefolds}},
doi = {10.1093/qjmath/54.1.33},
volume = {54},
year = {2003},
}
@article{207,
author = {Browning, Timothy D},
journal = {Mathematical Proceedings of the Cambridge Philosophical Society},
number = {3},
pages = {385 -- 395},
publisher = {Cambridge University Press},
title = {{Sums of four biquadrates}},
doi = {10.1017/S0305004102006382},
volume = {134},
year = {2003},
}
@article{208,
abstract = {For any ε > 0 and any diagonal quadratic form Q ∈ ℤ[x 1, x 2, x 3, x 4] with a square-free discriminant of modulus Δ Q ≠ 0, we establish the uniform estimate ≪ε B 3/2+ε + B 2+ε/Δ Q 1/6 for the number of rational points of height at most B lying in the projective surface Q = 0.},
author = {Timothy Browning},
journal = {Quarterly Journal of Mathematics},
number = {1},
pages = {11 -- 31},
publisher = {Oxford University Press},
title = {{Counting rational points on diagonal quadratic surfaces}},
doi = {10.1093/qjmath/54.1.11},
volume = {54},
year = {2003},
}
@inproceedings{2337,
author = {Lieb, Élliott H and Robert Seiringer},
editor = {Karpeshina, Yulia and Weikard, Rudi and Zeng, Yanni},
pages = {239 -- 250},
publisher = {American Mathematical Society},
title = {{Bose-Einstein condensation of dilute gases in traps }},
doi = {10.1090/conm/327/05818},
volume = {327},
year = {2003},
}
@article{2354,
abstract = {We investigate the ground state properties of a gas of interacting particles confined in an external potential in three dimensions and subject to rotation around an axis of symmetry. We consider the Gross-Pitaevskii (GP) limit of a dilute gas. Analysing both the absolute and the bosonic ground states of the system, we show, in particular, their different behaviour for a certain range of parameters. This parameter range is determined by the question whether the rotational symmetry in the minimizer of the GP functional is broken or not. For the absolute ground state, we prove that in the GP limit a modified GP functional depending on density matrices correctly describes the energy and reduced density matrices, independent of symmetry breaking. For the bosonic ground state this holds true if and only if the symmetry is unbroken.},
author = {Robert Seiringer},
journal = {Journal of Physics A: Mathematical and Theoretical},
number = {37},
pages = {9755 -- 9778},
publisher = {IOP Publishing Ltd.},
title = {{Ground state asymptotics of a dilute, rotating gas}},
doi = {10.1088/0305-4470/36/37/312},
volume = {36},
year = {2003},
}
@article{2357,
abstract = {The classic Poincaré inequality bounds the L q-norm of a function f in a bounded domain Ω ⊂ ℝ n in terms of some L p-norm of its gradient in Ω. We generalize this in two ways: In the first generalization we remove a set Τ from Ω and concentrate our attention on Λ = Ω \ Τ. This new domain might not even be connected and hence no Poincaré inequality can generally hold for it, or if it does hold it might have a very bad constant. This is so even if the volume of Τ is arbitrarily small. A Poincaré inequality does hold, however, if one makes the additional assumption that f has a finite L p gradient norm on the whole of Ω, not just on Λ. The important point is that the Poincaré inequality thus obtained bounds the L q-norm of f in terms of the L p gradient norm on Λ (not Ω) plus an additional term that goes to zero as the volume of Τ goes to zero. This error term depends on Τ only through its volume. Apart from this additive error term, the constant in the inequality remains that of the 'nice' domain Ω. In the second generalization we are given a vector field A and replace ∇ by ∇ + iA(x) (geometrically, a connection on a U(1) bundle). Unlike the A = 0 case, the infimum of ∥(∇ + iA)f∥ p over all f with a given ∥f∥ q is in general not zero. This permits an improvement of the inequality by the addition of a term whose sharp value we derive. We describe some open problems that arise from these generalizations.},
author = {Lieb, Élliott H and Robert Seiringer and Yngvason, Jakob},
journal = {Annals of Mathematics},
number = {3},
pages = {1067 -- 1080},
publisher = {Princeton University Press},
title = {{Poincaré inequalities in punctured domains}},
doi = {10.4007/annals.2003.158.1067 },
volume = {158},
year = {2003},
}
@article{2358,
abstract = {A study was conducted on the one-dimensional (1D) bosons in three-dimensional (3D) traps. A rigorous analysis was carried out on the parameter regions in which various types of 1D or 3D behavior occurred in the ground state. The four parameter regions include density, transverse, longitudinal dimensions and scattering length.},
author = {Lieb, Élliott H and Robert Seiringer and Yngvason, Jakob},
journal = {Physical Review Letters},
number = {15},
pages = {1504011 -- 1504014},
publisher = {American Physical Society},
title = {{One-dimensional Bosons in three-dimensional traps}},
doi = {10.1103/PhysRevLett.91.150401},
volume = {91},
year = {2003},
}
@phdthesis{2414,
author = {Uli Wagner},
publisher = {ETH Zurich},
title = {{On k-Sets and Their Applications}},
doi = {10.3929/ethz-a-004708408},
year = {2003},
}
@inproceedings{2422,
abstract = {We prove a lower bound of 0.3288(4 n) for the rectilinear crossing number cr̄(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadrilaterals in any set of n points in general position in the Euclidean plane. As we see it, the main contribution of this paper is not so much the concrete numerical improvement over earlier bounds, as the novel method of proof, which is not based on bounding cr̄(Kn) for some small n.},
author = {Uli Wagner},
pages = {583 -- 588},
publisher = {SIAM},
title = {{On the rectilinear crossing number of complete graphs}},
year = {2003},
}
@inproceedings{2423,
abstract = {A finite set N ⊃ Rd is a weak ε-net for an n-point set X ⊃ Rd (with respect to convex sets) if N intersects every convex set K with |K ∩ X| ≥ εn. We give an alternative, and arguably simpler, proof of the fact, first shown by Chazelle et al. [7], that every point set X in Rd admits a weak ε-net of cardinality O(ε-d polylog(1/ε)). Moreover, for a number of special point sets (e.g., for points on the moment curve), our method gives substantially better bounds. The construction yields an algorithm to construct such weak ε-nets in time O(n ln(1/ε)). We also prove, by a different method, a near-linear upper bound for points uniformly distributed on the (d - 1)-dimensional sphere.},
author = {Matoušek, Jiří and Uli Wagner},
pages = {129 -- 135},
publisher = {ACM},
title = {{New constructions of weak epsilon-nets}},
doi = {10.1145/777792.777813},
year = {2003},
}
@inproceedings{2424,
abstract = {We introduce the adaptive neighborhood graph as a data structure for modeling a smooth manifold M embedded in some (potentially very high-dimensional) Euclidean space ℝd. We assume that M is known to us only through a finite sample P ⊂ M, as it is often the case in applications. The adaptive neighborhood graph is a geometric graph on P. Its complexity is at most min{2O(k)(n, n2}, where n = |P| and k = dim M, as opposed to the n⌈d/2⌉ complexity of the Delaunay triangulation, which is often used to model manifolds. We show that we can provably correctly infer the connectivity of M and the dimension of M from the adaptive neighborhood graph provided a certain standard sampling condition is fulfilled. The running time of the dimension detection algorithm is d2O(k7 log k) for each connected component of M. If the dimension is considered constant, this is a constant-time operation, and the adaptive neighborhood graph is of linear size. Moreover, the exponential dependence of the constants is only on the intrinsic dimension k, not on the ambient dimension d. This is of particular interest if the co-dimension is high, i.e., if k is much smaller than d, as is the case in many applications. The adaptive neighborhood graph also allows us to approximate the geodesic distances between the points in P.},
author = {Giesen, Joachim and Uli Wagner},
pages = {329 -- 337},
publisher = {ACM},
title = {{Shape dimension and intrinsic metric from samples of manifolds with high co-dimension}},
doi = {10.1145/777792.777841},
year = {2003},
}
@article{3917,
abstract = {Male dimorphism is not genetically determined, but is induced by environmental conditions particularly decreasing temperature and density.},
author = {Cremer, Sylvia and Heinze, Jürgen},
journal = {Blick in die Wissenschaft},
number = {15},
pages = {32 -- 36},
publisher = {Schnell und Steiner},
title = {{Zwischen Hochzeitsflug und Brudermord: reproduktive Taktiken bei Ameisenmännchen}},
volume = {12},
year = {2003},
}
@article{3921,
abstract = {Unlike most social insects, many Cardiocondyla ant species have two male morphs: wingless (ergatoid) males, who remain in the natal nest, and winged males who disperse but, strangely, before leaving may also mate within the nest. Whereas ergatoid males are highly intolerant of each other and fight among themselves, they tend to tolerate their winged counterparts. This is despite the fact that these winged males, like ergatoid males, represent mating competition. Why should ergatoid males tolerate their winged rivals? We developed a mathematical model to address this question. Our model focuses on a number of factors likely toinfluence whether ergatoid males are tolerant of winged males: ergatoid male–winged male relatedness, number of virgin queens, number of winged males, and the number of ejaculates a winged male has (winged males are sperm limited, whereas ergatoid males have lifelong spermatogenesis). Surprisingly, we found that increasing the number of virgin queens favors a kill strategy, whereas an increase in the other factors favors a let-live strategy; these predictions appear true for C. obscurior and for a number of other Cardiocondyla species. Two further aspects, unequal insemination success and multiple mating in queens, were also incorporated into the model and predictions made about their effects on toleration of winged males. The model is applicable more generally in species that have dimorphic males, such as some other ants, bees, and fig wasps.},
author = {Anderson, Carl and Cremer, Sylvia and Heinze, Jürgen},
journal = {Behavioral Ecology},
number = {1},
pages = {54 -- 62},
publisher = {Oxford University Press},
title = {{Live and let die: Why fighter males of the ant Cardiocondyla kill each other but tolerate their winged rivals}},
doi = {10.1093/beheco/14.1.54},
volume = {14},
year = {2003},
}
@article{3922,
abstract = {Dispersal is advantageous, but, at the same time, it implies high costs and risks. Due to these counteracting selection pressures, many species evolved dispersal polymorphisms, which, in ants, are typically restricted to the female sex (queens). Male polymorphism is presently only known from a few genera, such as Cardiocondyla, in which winged dispersing males coexist with wingless fighter males that mate exclusively inside their maternal nests. We studied the developmental mechanisms underlying these alternative male morphs and found that, first, male dimorphism is not genetically determined, but is induced by environmental conditions (decreasing temperature and density). Second, male morph is not yet fixed at the egg stage, but it differentiates during larval development. This flexible developmental pattern of male morphs allows Cardiocondyla ant colonies to react quickly to changes in their environment. Under good conditions, they invest exclusively in philopatric wingless males. But, when environmental conditions turn bad, colonies start to produce winged dispersal males, even though these males require a many times higher investment by the colony than their much smaller wingless counterparts. Cardiocondyla ants share this potential of optimal resource allocation with other colonial animals and some seed dimorphic plants.},
author = {Cremer, Sylvia and Heinze, Jürgen},
journal = {Current Biology},
number = {3},
pages = {219 -- 223},
publisher = {Cell Press},
title = {{Stress grows wings: Environmental induction of winged dispersal males in Cardiocondyla ants}},
doi = {10.1016/S0960-9822(03)00012-5},
volume = {13},
year = {2003},
}
@inbook{3991,
abstract = {We give analytic inclusion-exclusion formulas for the area and perimeter derivatives of a union of finitely many disks in the plane.},
author = {Cheng, Ho-Lun and Herbert Edelsbrunner},
booktitle = {Computer Science in Perspective: Essays Dedicated to Thomas Ottmann},
pages = {88 -- 97},
publisher = {Springer},
title = {{Area and perimeter derivatives of a union of disks}},
doi = {10.1007/3-540-36477-3_7},
volume = {2598},
year = {2003},
}
@article{3992,
abstract = {Computing the volume occupied by individual atoms in macromolecular structures has been the subject of research for several decades. This interest has grown in the recent years, because weighted volumes are widely used in implicit solvent models. Applications of the latter in molecular mechanics simulations require that the derivatives of these weighted volumes be known. In this article, we give a formula for the volume derivative of a molecule modeled as a space-filling diagram made up of balls in motion. The formula is given in terms of the weights, radii, and distances between the centers as well as the sizes of the facets of the power diagram restricted to the space-filling diagram. Special attention is given to the detection and treatment of singularities as well as discontinuities of the derivative.},
author = {Herbert Edelsbrunner and Koehl, Patrice},
journal = {PNAS},
number = {5},
pages = {2203 -- 2208},
publisher = {National Academy of Sciences},
title = {{The weighted-volume derivative of a space-filling diagram}},
doi = {10.1073/pnas.0537830100},
volume = {100},
year = {2003},
}
@article{3993,
abstract = {We present algorithms for constructing a hierarchy of increasingly coarse Morse-Smale complexes that decompose a piecewise linear 2-manifold. While these complexes are defined only in the smooth category, we extend the construction to the piecewise linearcategory by ensuring structural integrity and simulating differentiability. We then simplify Morse-Smale complexes by canceling pairs of critical points in order of increasing persistence.},
author = {Herbert Edelsbrunner and Harer, John and Zomorodian, Afra},
journal = {Discrete & Computational Geometry},
number = {1},
pages = {87 -- 107},
publisher = {Springer},
title = {{Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds}},
doi = {10.1007/s00454-003-2926-5},
volume = {30},
year = {2003},
}
@article{3994,
abstract = {The body defined by a finite collection of disks is a subset of the plane bounded by a tangent continuous curve, which we call the skin. We give analytic formulas for the area, the perimeter, the area derivative, and the perimeter derivative of the body. Given the filtrations of the Delaunay triangulation and the Voronoi diagram of the disks, all formulas can be evaluated in time proportional to the number of disks.},
author = {Cheng, Ho-Lun and Herbert Edelsbrunner},
journal = {Computational Geometry: Theory and Applications},
number = {2},
pages = {173 -- 192},
publisher = {Elsevier},
title = {{Area, perimeter and derivatives of a skin curve}},
doi = {10.1016/S0925-7721(02)00124-4},
volume = {26},
year = {2003},
}
@inproceedings{3997,
abstract = {We combine topological and geometric methods to construct a multi-resolution data structure for functions over two-dimensional domains. Starting with the Morse-Smale complex, we construct a topological hierarchy by progressively canceling critical points in pairs. Concurrently, we create a geometric hierarchy by adapting the geometry to the changes in topology. The data structure supports mesh traversal operations similarly to traditional multi-resolution representations.},
author = {Bremer, Peer-Timo and Herbert Edelsbrunner and Hamann, Bernd and Pascucci, Valerio},
pages = {139 -- 146},
publisher = {IEEE},
title = {{A multi-resolution data structure for two-dimensional Morse-Smale functions}},
doi = {10.1109/VISUAL.2003.1250365},
year = {2003},
}
@inproceedings{3999,
abstract = {We introduce relaxed scheduling as a paradigm for mesh maintenance and demonstrate its applicability to triangulating a skin surface in R-3.},
author = {Herbert Edelsbrunner and Üngör, Alper},
pages = {135 -- 151},
publisher = {Springer},
title = {{Relaxed scheduling in dynamic skin triangulation}},
doi = {10.1007/978-3-540-44400-8_14},
volume = {2866},
year = {2003},
}
@article{4254,
abstract = {Chromosomal rearrangements can promote reproductive isolation by reducing recombination along a large section of the genome. We model the effects of the genetic barrier to gene flow caused by a chromosomal rearrangement on the rate of accumulation of postzygotic isolation genes in parapatry. We find that, if reproductive isolation is produced by the accumulation in parapatry of sets of alleles compatible within but incompatible across species, chromosomal rearrangements are far more likely to favor it than classical genetic barriers without chromosomal changes. New evidence of the role of chromosomal rearrangements in parapatric speciation suggests that postzygotic isolation is often due to the accumulation of such incompatibilities. The model makes testable qualitative predictions about the genetic signature of speciation.},
author = {Navarro, Arcadio and Nicholas Barton},
journal = {Evolution; International Journal of Organic Evolution},
number = {3},
pages = {447 -- 459},
publisher = {Wiley-Blackwell},
title = {{Accumulating postzygotic isolation genes in parapatry: a new twist on chromosomal speciation}},
doi = {10.1111/j.0014-3820.2003.tb01537.x},
volume = {57},
year = {2003},
}
@article{4255,
abstract = {Humans and their closest evolutionary relatives, the chimpanzees, differ in ∼1.24% of their genomic DNA sequences. The fraction of these changes accumulated during the speciation processes that have separated the two lineages may be of special relevance in understanding the basis of their differences. We analyzed human and chimpanzee sequence data to search for the patterns of divergence and polymorphism predicted by a theoretical model of speciation. According to the model, positively selected changes should accumulate in chromosomes that present fixed structural differences, such as inversions, between the two species. Protein evolution was more than 2.2 times faster in chromosomes that had undergone structural rearrangements compared with colinear chromosomes. Also, nucleotide variability is slightly lower in rearranged chromosomes. These patterns of divergence and polymorphism may be, at least in part, the molecular footprint of speciation events in the human and chimpanzee lineages. },
author = {Navarro, Arcadio and Nicholas Barton},
journal = {Science},
number = {5617},
pages = {321 -- 324},
publisher = {American Association for the Advancement of Science},
title = {{Chromosomal speciation and molecular divergence -- Accelerated evolution in rearranged chromosomes}},
doi = {10.1126/science.1080600 },
volume = {300},
year = {2003},
}
@misc{4256,
abstract = {Artificial Life models may shed new light on the long-standing challenge for evolutionary biology of explaining the origins of complex organs. Real progress on this issue, however, requires Artificial Life researchers to take seriously the tools and insights from population genetics.},
author = {Nicholas Barton and Zuidema, Willem H},
booktitle = {Current Biology},
number = {16},
pages = {R649 -- R651},
publisher = {Cell Press},
title = {{The erratic path towards complexity}},
doi = {10.1016/S0960-9822(03)00573-6},
volume = {13},
year = {2003},
}
@article{4257,
abstract = {Variation within a species may be structured both geographically and by genetic background. We review the effects of such structuring on neutral variants, using a framework based on the coalescent process. Short-term effects of sex differences and age structure can be averaged out using fast timescale approximations, allowing a simple general treatment of effective population size and migration. We consider the effects of geographic structure on variation within and between local populations, first in general terms, and then for specific migration models. We discuss the close parallels between geographic structure and stable types of genetic structure caused by selection, including balancing selection and background selection. The effects of departures from stability, such as selective sweeps and population bottlenecks, are also described. Methods for distinguishing population history from the effects of ongoing gene flow are discussed. We relate the theoretical results to observed patterns of variation in natural populations.},
author = {Charlesworth, Brian and Charlesworth, Deborah and Nicholas Barton},
journal = {Annual Review of Ecology and Systematics},
pages = {99 -- 125},
publisher = {Annual Reviews},
title = {{The effects of genetic and geographic structure on neutral variation}},
doi = {10.1146/annurev.ecolsys.34.011802.132359},
volume = {34},
year = {2003},
}
@article{4338,
abstract = {Mosaic hybrid zones arise when ecologically differentiated taxa hybridize across a network of habitat patches. Frequent interbreeding across a small-scale patchwork can erode species differences that might have been preserved in a clinal hybrid zone. In particular, the rapid breakdown of neutral divergence sets an upper limit to the time for which differences at marker loci can persist. We present here a case study of a mosaic hybrid zone between the fire-bellied toads Bombina bombina and B. variegata (Anura: Discoglossidae) near Apahida in Romania. In our 20 × 20 km study area, we detected no evidence of a clinal transition but found a strong association between aquatic habitat and mean allele frequencies at four molecular markers. In particular, pure populations of B. bombina in ponds appear to cause massive introgression into the surrounding B. variegata gene pool found in temporary aquatic sites. Nevertheless, the genetic structure of these hybrid populations was remarkably similar to those of a previously studied transect near Pescenica (Croatia), which had both clinal and mosaic features: estimates of heterozygote deficit and linkage disequilibrium in each country are similar. In Apahida, the observed strong linkage disequilibria should stem from an imperfect habitat preference that guides most (but not all) adults into the habitats to which they are adapted. In the absence of a clinal structure, the inferred migration rate between habitats implies that associations between selected loci and neutral markers should break down rapidly. Although plausible selection strengths can maintain differentiation at those loci adapting the toads to either permanent or temporary breeding sites, the divergence at neutral markers must be transient. The hybrid zone may be approaching a state in which the gene pools are homogenized at all but the selected loci, not dissimilar from an early stage of sympatric divergence.},
author = {Vines, Timothy H and Kohler, S C and Thiel, M and Ghira, Ioan and Sands, T R and MacCallum, Catriona J and Nicholas Barton and Nürnberger, Beate},
journal = {Evolution; International Journal of Organic Evolution},
number = {8},
pages = {1876 -- 1888},
publisher = {Wiley-Blackwell},
title = {{On the maintenance of reproductive isolation in a mosaic hybrid zone between the toads Bombina bombina and B. variegata}},
doi = {10.1111/j.0014-3820.2003.tb00595.x},
volume = {57},
year = {2003},
}
@article{4348,
abstract = {Many questions in evolutionary biology are best addressed by comparing traits in different species. Often such studies involve mapping characters on phylogenetic trees. Mapping characters on trees allows the nature, number, and timing of the transformations to be identified. The parsimony method is the only method available for mapping morphological characters on phylogenies. Although the parsimony method often makes reasonable reconstructions of the history of a character, it has a number of limitations. These limitations include the inability to consider more than a single change along a branch on a tree and the uncoupling of evolutionary time from amount of character change. We extended a method described by Nielsen (2002, Syst. Biol. 51:729-739) to the mapping of morphological characters under continuous-time Markov models and demonstrate here the utility of the method for mapping characters on trees and for identifying character correlation.},
author = {Huelsenbeck, John P and Nielsen, Rasmus and Jonathan Bollback},
journal = {Systematic Biology},
number = {2},
pages = {131 -- 58},
publisher = {Oxford University Press},
title = {{Stochastic mapping of morphological characters}},
doi = {10.1080/10635150390192780},
volume = {52},
year = {2003},
}
@article{4350,
abstract = {The phylogeny of Crocodylia offers an unusual twist on the usual molecules versus morphology story. The true gharial (Gavialis gangeticus) and the false gharial (Tomistoma schlegelii), as their common names imply, have appeared in all cladistic morphological analyses as distantly related species, convergent upon a similar morphology. In contrast, all previous molecular studies have shown them to be sister taxa. We present the first phylogenetic study of Crocodylia using a nuclear gene. We cloned and sequenced the c-myc proto-oncogene from Alligator mississippiensis to facilitate primer design and then sequenced an 1,100-base pair fragment that includes both coding and noncoding regions and informative indels for one species in each extant crocodylian genus and six avian outgroups. Phylogenetic analyses using parsimony, maximum likelihood, and Bayesian inference all strongly agreed on the same tree, which is identical to the tree found in previous molecular analyses: Gavialis and Tomistoma are sister taxa and together are the sister group of Crocodylidae. Kishino-Hasegawa tests rejected the morphological tree in favor of the molecular tree. We excluded long-branch attraction and variation in base composition among taxa as explanations for this topology. To explore the causes of discrepancy between molecular and morphological estimates of crocodylian phylogeny, we examined puzzling features of the morphological data using a priori partitions of the data based on anatomical regions and investigated the effects of different coding schemes for two obvious morphological similarities of the two gharials.},
author = {Harshman, John and Huddleston, Christopher J and Jonathan Bollback and Parsons, Thomas J and Braun, Michael J},
journal = {Systematic Biology},
number = {3},
pages = {386 -- 402},
publisher = {Oxford University Press},
title = {{True and false gharials: A nuclear gene phylogeny of crocodylia}},
doi = {10.1080/10635150390197028},
volume = {52},
year = {2003},
}
@article{4460,
abstract = {Symbolic model checking, which enables the automatic verification of large systems, proceeds by calculating expressions that represent state sets. Traditionally, symbolic model-checking tools are based on back- ward state traversal; their basic operation is the function pre, which, given a set of states, returns the set of all predecessor states. This is because specifiers usually employ formalisms with future-time modalities, which are naturally evaluated by iterating applications of pre. It has been shown experimentally that symbolic model checking can perform significantly better if it is based, instead, on forward state traversal; in this case, the basic operation is the function post, which, given a set of states, returns the set of all successor states. This is because forward state traversal can ensure that only parts of the state space that are reachable from an initial state and relevant for the satisfaction or violation of the specification are explored; that is, errors can be detected as soon as possible.
In this paper, we investigate which specifications can be checked by symbolic forward state traversal. We formulate the problems of symbolic backward and forward model checking by means of two μ-calculi. The pre-μ calculus is based on the pre operation, and the post-μ calculus is based on the post operation. These two μ-calculi induce query logics, which augment fixpoint expressions with a boolean emptiness query. Using query logics, we are able to relate and compare the symbolic backward and forward approaches. In particular, we prove that all ω-regular (linear-time) specifications can be expressed as post-μ queries, and therefore checked using symbolic forward state traversal. On the other hand, we show that there are simple branching-time specifications that cannot be checked in this way.},
author = {Thomas Henzinger and Kupferman, Orna and Qadeer,Shaz},
journal = {Formal Methods in System Design},
number = {3},
pages = {303 -- 327},
publisher = {Springer},
title = {{From pre-historic to post-modern symbolic model checking}},
doi = {10.1023/A:1026228213080},
volume = {23},
year = {2003},
}
@inproceedings{4462,
abstract = {A major hurdle in the algorithmic verification and control of systems is the need to find suitable abstract models, which omit enough details to overcome the state-explosion problem, but retain enough details to exhibit satisfaction or controllability with respect to the specification. The paradigm of counterexample-guided abstraction refinement suggests a fully automatic way of finding suitable abstract models: one starts with a coarse abstraction, attempts to verify or control the abstract model, and if this attempt fails and the abstract counterexample does not correspond to a concrete counterexample, then one uses the spurious counterexample to guide the refinement of the abstract model. We present a counterexample-guided refinement algorithm for solving ω-regular control objectives. The main difficulty is that in control, unlike in verification, counterexamples are strategies in a game between system and controller. In the case that the controller has no choices, our scheme subsumes known counterexample-guided refinement algorithms for the verification of ω-regular specifications. Our algorithm is useful in all situations where ω-regular games need to be solved, such as supervisory control, sequential and program synthesis, and modular verification. The algorithm is fully symbolic, and therefore applicable also to infinite-state systems.},
author = {Thomas Henzinger and Jhala, Ranjit and Majumdar, Ritankar S},
pages = {886 -- 902},
publisher = {Springer},
title = {{Counterexample-guided control}},
doi = {10.1007/3-540-45061-0_69},
volume = {2719},
year = {2003},
}
@inproceedings{4463,
abstract = {We present an algorithm called TAR (“Thread-modular Abstraction Refinement”) for model checking safety properties of concurrent software. The TAR algorithm uses thread-modular assume-guarantee reasoning to overcome the exponential complexity in the control state of multithreaded programs. Thread modularity means that TAR explores the state space of one thread at a time, making assumptions about how the environment can interfere. The TAR algorithm uses counterexample-guided predicate-abstraction refinement to overcome the usually infinite complexity in the data state of C programs. A successive approximation scheme automatically infers the necessary precision on data variables as well as suitable environment assumptions. The scheme is novel in that transition relations are approximated from above, while at the same time environment assumptions are approximated from below. In our software verification tool BLAST we have implemented a fully automatic race checker for multithreaded C programs which is based on the TAR algorithm. This tool has verified a wide variety of commonly used locking idioms, including locking schemes that are not amenable to existing dynamic and static race checkers such as ERASER or WARLOCK.},
author = {Thomas Henzinger and Jhala, Ranjit and Majumdar, Ritankar S and Qadeer,Shaz},
pages = {262 -- 274},
publisher = {Springer},
title = {{Thread-modular abstraction refinement}},
doi = {10.1007/978-3-540-45069-6_27},
volume = {2725},
year = {2003},
}
@inproceedings{4464,
abstract = {We introduce the paradigm of schedule-carrying code (SCC). A hard real-time program can be executed on a given platform only if there exists a feasible schedule for the real-time tasks of the program. Traditionally, a scheduler determines the existence of a feasible schedule according to some scheduling strategy. With SCC, a compiler proves the existence of a feasible schedule by generating executable code that is attached to the program and represents its schedule. An SCC executable is a real-time program that carries its schedule as code, which is produced once and can be revalidated and executed with each use. We evaluate SCC both in theory and practice. In theory, we give two scenarios, of nonpreemptive and distributed scheduling for Giotto programs, where the generation of a feasible schedule is hard, while the validation of scheduling instructions that are attached to the programs is easy. In practice, we implement SCC and show that explicit scheduling instructions can reduce the scheduling overhead up to 35% and can provide an efficient, flexible, and verifiable means for compiling Giotto programs on complex architectures, such as the TTA.},
author = {Thomas Henzinger and Kirsch, Christoph M and Matic, Slobodan},
pages = {241 -- 256},
publisher = {ACM},
title = {{Schedule-carrying code}},
doi = {10.1007/978-3-540-45212-6_16},
volume = {2855},
year = {2003},
}