@inproceedings{1034,
abstract = {Three interacting particles form a system which is well known for its complex physical behavior. A landmark theoretical result in few-body quantum physics is Efimov\'s prediction of a universal set of weakly bound trimer states appearing for three identical bosons with a resonant two-body interaction [1, 2]. Surprisingly, these states even exist in the absence of a corresponding two-body bound state and their precise nature is largely independent of the particular type of the two-body interaction potential. Efimov\'s scenario has attracted great interest in many areas of physics; an experimental test however has not been achieved. We report the observation of an Efimov resonance in an ultracold thermal gas of cesium atoms [3]. The resonance occurs in the range of large negative two-body scattering lengths and arises from the coupling of three free atoms to an Efimov trimer. We observe its signature as a giant three-body recombination loss when the strength of the two-body interaction is varied near a Feshbach resonance. This resonance develops into a continuum resonance at non-zero collision energies, and we observe a shift of the resonance position as a function of temperature. We also report on a minimum in the recombination loss for positive scattering lengths, indicating destructive interference of decay pathways. Our results confirm central theoretical predictions of Efimov physics and represent a starting point from which to explore the universal properties of resonantly interacting few-body systems.},
author = {Nägerl, Hanns C and Kraemer, Tobias and Mark, Michael J and Waldburger, Philipp and Danzl, Johannes G and Engeser, Bastian and Lange, Adam D and Pilch, Karl and Jaakkola, Antti and Chin, Cheng and Grimm, Rudolf},
pages = {269 -- 277},
publisher = {AIP},
title = {{Experimental evidence for Efimov quantum states}},
doi = {10.1063/1.2400657},
volume = {869},
year = {2006},
}
@article{1748,
abstract = {The authors apply selective wet chemical etching and atomic force microscopy to reveal the three-dimensional shape of SiGeSi (001) islands after capping with Si. Although the "self-assembled quantum dots" remain practically unaffected by capping in the temperature range of 300-450 °C, significant morphological changes take place on the Si surface. At 450 °C, the morphology of the capping layer (Si matrix) evolves toward an intriguing semifacetted structure, which we call a "ziggurat," giving the misleading impression of a stepped SiGe island shape.},
author = {Georgios Katsaros and Rastelli, Armando and Stoffel, Mathieu and Costantini, Giovanni and Schmidt, Oliver G and Kern, Klaus and Tersoff, Jerry and Müller, Elisabeth and Von Känel, Hans},
journal = {Applied Physics Letters},
number = {25},
publisher = {American Institute of Physics},
title = {{Evolution of buried semiconductor nanostructures and origin of stepped surface mounds during capping}},
doi = {10.1063/1.2405876},
volume = {89},
year = {2006},
}
@article{213,
abstract = {For any integers d,n ≥2, let X ⊂ Pn be a non‐singular hypersurface of degree d that is defined over the rational numbers. The main result in this paper is a proof that the number of rational points on X which have height at most B is O(Bn − 1 + ɛ), for any ɛ > 0. The implied constant in this estimate depends at most upon d, ɛ and n. 2000 Mathematics Subject Classification 11D45 (primary), 11G35, 14G05 (secondary).},
author = {Timothy Browning and Heath-Brown, Roger and Starr, Jason M},
journal = {Proceedings of the London Mathematical Society},
number = {2},
pages = {273 -- 303},
publisher = {John Wiley and Sons Ltd},
title = {{The density of rational points on non-singular hypersurfaces, II}},
doi = {https://doi.org/10.1112/S0024611506015784},
volume = {93},
year = {2006},
}
@article{218,
abstract = {This paper is concerned with the average order of certain arithmetic functions, as they range over the values taken by binary forms.},
author = {de la Bretèche, Régis and Timothy Browning},
journal = {Acta Arithmetica},
number = {3},
pages = {291 -- 304},
publisher = {Instytut Matematyczny},
title = {{Sums of arithmetic functions over values of binary forms}},
doi = {10.4064/aa125-3-6},
volume = {125},
year = {2006},
}
@article{2657,
abstract = {The highest densities of the two metabotropic GABA subunits, GABA B1 and GABAB2, have been reported as occurring around the glutamatergic synapses between Purkinje cell spines and parallel fibre varicosities. In order to determine how this distribution is achieved during development, we investigated the expression pattern and the cellular and subcellular localization of the GABAB1 and GABAB2 subunits in the rat cerebellum during postnatal development. At the light microscopic level, immunoreactivity for the GABAB1 and GABAB2 subunits was very prominent in the developing molecular layer, especially in Purkinje cells. Using double immunofluorescence, we demonstrated that GABAB1 was transiently expressed in glial cells. At the electron microscopic level, immunoreactivity for GABAB receptors was always detected both pre- and postsynaptically. Presynaptically, GABAB1 and GABAB2 were localized in the extrasynaptic membrane of parallel fibres at all ages, and only rarely in GABAergic axons. Postsynaptically, GABAB receptors were localized to the extrasynaptic and perisynaptic plasma membrane of Purkinje cell dendrites and spines throughout development. Quantitative analysis and three-dimensional reconstructions further revealed a progressive developmental movement of the GABAB1 subunit on the surface of Purkinje cells from dendritic shafts to its final destination, the dendritic spines. Together, these results indicate that GABAB receptors undergo dynamic regulation during cerebellar development in association with the establishment and maturation of glutamatergic synapses to Purkinje cells.},
author = {Luján, Rafael and Ryuichi Shigemoto},
journal = {European Journal of Neuroscience},
number = {6},
pages = {1479 -- 1490},
publisher = {Wiley-Blackwell},
title = {{Localization of metabotropic GABA receptor subunits GABAB1 and GABAB2 relative to synaptic sites in the rat developing cerebellum}},
doi = {10.1111/j.1460-9568.2006.04669.x},
volume = {23},
year = {2006},
}
@misc{2664,
abstract = {Metabotropic glutamate receptors (mGlus) are a family of G-protein-coupled receptors activated by the neurotransmitter glutamate. Molecular cloning has revealed eight different subtypes (mGlu1-8) with distinct molecular and pharmacological properties. Multiplicity in this receptor family is further generated through alternative splicing. mGlus activate a multitude of signalling pathways important for modulating neuronal excitability, synaptic plasticity and feedback regulation of neurotransmitter release. In this review, we summarize anatomical findings (from our work and that of other laboratories) describing their distribution in the central nervous system. Recent evidence regarding the localization of these receptors in peripheral tissues will also be examined. The distinct regional, cellular and subcellular distribution of mGlus in the brain will be discussed in view of their relationship to neurotransmitter release sites and of possible functional implications.},
author = {Ferraguti, Francesco and Ryuichi Shigemoto},
booktitle = {Cell and Tissue Research},
number = {2},
pages = {483 -- 504},
publisher = {Springer},
title = {{Metabotropic glutamate receptors}},
doi = {10.1007/s00441-006-0266-5},
volume = {326},
year = {2006},
}
@inproceedings{2746,
abstract = {We consider random Schrödinger equations on Rd or Zd for d ≥ 3 with uncorrelated, identically distributed random potential. Denote by λ the coupling constant and ψt the solution with initial data ψ0.},
author = {László Erdös and Salmhofer, Manfred and Yau, Horng-Tzer},
pages = {233 -- 257},
publisher = {World Scientific Publishing},
title = {{Towards the quantum Brownian motion}},
doi = {10.1007/3-540-34273-7_18},
volume = {690},
year = {2006},
}
@article{2366,
abstract = {Inequalities are derived for power sums of the real part and the modulus of the eigenvalues of a Schrödinger operator with a complex-valued potential.},
author = {Frank, Rupert L and Laptev, Ari and Lieb, Élliott H and Robert Seiringer},
journal = {Letters in Mathematical Physics},
number = {3},
pages = {309 -- 316},
publisher = {Springer},
title = {{Lieb-Thirring inequalities for Schrödinger operators with complex-valued potentials}},
doi = {10.1007/s11005-006-0095-1},
volume = {77},
year = {2006},
}
@article{2429,
abstract = {We show, with an elementary proof, that the number of halving simplices in a set of n points in 4 in general position is O(n4-2/45). This improves the previous bound of O(n4-1/134). Our main new ingredient is a bound on the maximum number of halving simplices intersecting a fixed 2-plane. },
author = {Matoušek, Jiří and Sharir, Micha and Smorodinsky, Shakhar and Uli Wagner},
journal = {Discrete & Computational Geometry},
number = {2},
pages = {177 -- 191},
publisher = {Springer},
title = {{K-sets in four dimensions}},
doi = {10.1007/s00454-005-1200-4},
volume = {35},
year = {2006},
}
@inproceedings{2431,
abstract = {We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most t in an arrangement of n halfspaces in R , for arbitrary n and d (in particular, the dimension d is not considered constant). This partially settles a conjecture of Eckhoff, Linhart, and Welzl. Up to the factor of 2, the result generalizes McMullen's Upper Bound Theorem for convex polytopes (the case ℓ = O) and extends a theorem of Linhart for the case d ≤ 4. Moreover, the bound sharpens asymptotic estimates obtained by Clarkson and Shor. The proof is based on the h-matrix of the arrangement (a generalization, introduced by Mulmuley, of the h-vector of a convex polytope). We show that bounding appropriate sums of entries of this matrix reduces to a lemma about quadrupels of sets with certain intersection properties, and we prove this lemma, up to a factor of 2, using tools from multilinear algebra. This extends an approach of Alon and Kalai, who used linear algebra methods for an alternative proof of the classical Upper Bound Theorem. The bounds for the entries of the h-matrix also imply bounds for the number of i-dimensional faces, i > 0, at level at most ℓ. Furthermore, we discuss a connection with crossing numbers of graphs that was one of the main motivations for investigating exact bounds that are valid for arbitrary dimensions.},
author = {Uli Wagner},
pages = {635 -- 645},
publisher = {IEEE},
title = {{On a geometric generalization of the Upper Bound Theorem}},
doi = {10.1109/FOCS.2006.53},
year = {2006},
}
@article{2791,
abstract = {Generally, the motion of fluids is smooth and laminar at low speeds but becomes highly disordered and turbulent as the velocity increases. The transition from laminar to turbulent flow can involve a sequence of instabilities in which the system realizes progressively more complicated states, or it can occur suddenly. Once the transition has taken place, it is generally assumed that, under steady conditions, the turbulent state will persist indefinitely. The flow of a fluid down a straight pipe provides a ubiquitous example of a shear flow undergoing a sudden transition from laminar to turbulent motion. Extensive calculations and experimental studies have shown that, at relatively low flow rates, turbulence in pipes is transient, and is characterized by an exponential distribution of lifetimes. They also suggest that for Reynolds numbers exceeding a critical value the lifetime diverges (that is, becomes infinitely large), marking a change from transient to persistent turbulence. Here we present experimental data and numerical calculations covering more than two decades of lifetimes, showing that the lifetime does not in fact diverge but rather increases exponentially with the Reynolds number. This implies that turbulence in pipes is only a transient event (contrary to the commonly accepted view), and that the turbulent and laminar states remain dynamically connected, suggesting avenues for turbulence control.},
author = {Björn Hof and Westerweel, Jerry and Schneider, Tobias M and Eckhardt, Bruno},
journal = {Nature},
number = {7107},
pages = {59 -- 62},
publisher = {Nature Publishing Group},
title = {{Finite lifetime of turbulence in shear flows}},
doi = {10.1038/nature05089},
volume = {443},
year = {2006},
}
@article{3009,
author = {Paciorek, Tomasz and Friml, Jirí},
journal = {Journal of Cell Science},
number = {7},
pages = {1199 -- 1202},
publisher = {Company of Biologists},
title = {{Auxin signaling}},
doi = {10.1242/jcs.02910},
volume = {119},
year = {2006},
}
@article{3011,
abstract = {Polar flow of the phytohormone auxin requires plasma membrane‐associated PIN proteins and underlies multiple developmental processes in plants. Here we address the importance of the polarity of subcellular PIN localization for the directionality of auxin transport in Arabidopsis thaliana. Expression of different PINs in the root epidermis revealed the importance of PIN polar positions for directional auxin flow and root gravitropic growth. Interfering with sequence-embedded polarity signals directly demonstrates that PIN polarity is a primary factor in determining the direction of auxin flow in meristematic tissues. This finding provides a crucial piece in the puzzle of how auxin flow can be redirected via rapid changes in PIN polarity.},
author = {Wiśniewska, Justyna and Xu, Jian and Seifertová, Daniela and Brewer, Philip B and Růžička, Kamil and Blilou, Ikram and Rouquié, David and Eva Benková and Scheres, Ben and Jirí Friml},
journal = {Science},
number = {5775},
publisher = {American Association for the Advancement of Science},
title = {{Polar PIN localization directs auxin flow in plants}},
doi = {10.1126/science.1121356},
volume = {312},
year = {2006},
}
@article{3016,
abstract = {Plant development is characterized by a profound ability to regenerate and form tissues with new axes of polarity. An unsolved question concerns how the position within a tissue and cues from neighboring cells are integrated to specify the polarity of individual cells. The canalization hypothesis proposes a feedback effect of the phytohormone auxin on the directionality of intercellular auxin flow as a means to polarize tissues. Here we identify a cellular and molecular mechanism for canalization. Local auxin application, wounding, or auxin accumulation during de novo organ formation lead to rearrangements in the subcellular polar localization of PIN auxin transport components. This auxin effect on PIN polarity is cell-specific, does not depend on PIN transcription, and involves the Aux/IAA-ARF (indole-3-acetic acid-auxin response factor) signaling pathway. Our data suggest that auxin acts as polarizing cue, which links individual cell polarity with tissue and organ polarity through control of PIN polar targeting. This feedback regulation provides a conceptual framework for polarization during multiple regenerative and patterning processes in plants.},
author = {Sauer, Michael and Balla, Jozef and Luschnig, Christian and Wiśniewska, Justyna and Reinöhl, Vilém and Jirí Friml and Eva Benková},
journal = {Genes and Development},
number = {20},
pages = {2902 -- 2911},
publisher = {Cold Spring Harbor Laboratory Press},
title = {{Canalization of auxin flow by Aux/IAA-ARF-dependent feedback regulation of PIN polarity}},
doi = {10.1101/gad.390806},
volume = {20},
year = {2006},
}
@inproceedings{3186,
abstract = {We introduce a new approach to modelling gradient flows of contours and surfaces. While standard variational methods (e.g. level sets) compute local interface motion in a differential fashion by estimating local contour velocity via energy derivatives, we propose to solve surface evolution PDEs by explicitly estimating integral motion of the whole surface. We formulate an optimization problem directly based on an integral characterization of gradient flow as an infinitesimal move of the (whole) surface giving the largest energy decrease among all moves of equal size. We show that this problem can be efficiently solved using recent advances in algorithms for global hypersurface optimization [4, 2, 11]. In particular, we employ the geo-cuts method [4] that uses ideas from integral geometry to represent continuous surfaces as cuts on discrete graphs. The resulting interface evolution algorithm is validated on some 2D and 3D examples similar to typical demonstrations of level-set methods. Our method can compute gradient flows of hypersurfaces with respect to a fairly general class of continuous functional and it is flexible with respect to distance metrics on the space of contours/surfaces. Preliminary tests for standard L2 distance metric demonstrate numerical stability, topological changes and an absence of any oscillatory motion.},
author = {Boykov, Yuri and Vladimir Kolmogorov and Cremers, Daniel and Delong, Andrew},
pages = {409 -- 422},
publisher = {Springer},
title = {{An integral solution to surface evolution PDEs via geo cuts}},
doi = {10.1007/11744078_32},
volume = {3953},
year = {2006},
}
@misc{3511,
abstract = {Methods, apparatus and computer program products provide efficient techniques for designing and printing shells of hearing-aid devices with a high degree of quality assurance and reliability and with a reduced number of manual and time consuming production steps and operations. These techniques also preferably provide hearing-aid shells having internal volumes that can approach a maximum allowable ratio of internal volume relative to external volume. These high internal volumes facilitate the inclusion of hearing-aid electrical components having higher degrees of functionality and/or the use of smaller and less conspicuous hearing-aid shells. A preferred method includes operations to generate a watertight digital model of a hearing-aid shell by thickening a three-dimensional digital model of a shell surface in a manner that eliminates self-intersections and results in a thickened model having an internal volume that is a high percentage of an external volume of the model. },
author = {Fu, Ping and Nekhayev, Dmitry V and Herbert Edelsbrunner},
publisher = {Elsevier},
title = {{Manufacturing methods and systems for rapid production of hearing-aid shells}},
doi = {US 7,050,876 B1},
year = {2006},
}
@inproceedings{3559,
abstract = {Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its per- tinent information is encapsulated by a pairing of the critical values of a function, visualized by points forming a diagram in the plane. The original algorithm in [10] computes the pairs from an ordering of the simplices in a triangulation and takes worst-case time cubic in the number of simplices. The main result of this paper is an algorithm that maintains the pairing in worst-case linear time per transposition in the ordering. A side-effect of the algorithm’s anal- ysis is an elementary proof of the stability of persistence diagrams [7] in the special case of piecewise-linear functions. We use the algorithm to compute 1-parameter families of diagrams which we apply to the study of protein folding trajectories.},
author = {Cohen-Steiner, David and Herbert Edelsbrunner and Morozov, Dmitriy},
pages = {119 -- 126},
publisher = {ACM},
title = {{Vines and vineyards by updating persistence in linear time}},
doi = {10.1145/1137856.1137877},
year = {2006},
}
@inproceedings{3679,
abstract = {This paper describes a new system for "Finding Satellite Tracks” in astronomical images based on the modern geometric approach. There is an increasing need of using methods with solid mathematical and statistical foundation in astronomical image processing. Where the computational methods are serving in all disciplines of science, they are becoming popular in the field of astronomy as well. Currently different computational systems are required to be numerically optimized before to get applied on astronomical images. So at present there is no single system which solves the problems of astronomers using computational methods based on modern approaches. The system "Finding Satellite Tracks” is based on geometric matching method "Recognition by Adaptive Subdivision of Transformation Space (RAST)".},
author = {Ali,Haider and Christoph Lampert and Breuel,Thomas M},
pages = {892 -- 901},
publisher = {Springer},
title = {{Satellite tracks removal in astronomical images}},
doi = {10.1007/11892755_92},
volume = {4225},
year = {2006},
}
@misc{3415,
author = {Harald Janovjak and Kedrov, Alexej and Cisneros, David and Sapra, Tanuj K and Struckmeier, Jens and Mueller, Daniel J},
booktitle = {Neurobiology of Aging},
pages = {546 -- 561},
publisher = {Elsevier},
title = {{Imaging and detecting molecular interactions of single membrane proteins}},
doi = {10.1016/j.neurobiolaging.2005.03.031},
volume = {27},
year = {2006},
}
@inproceedings{3693,
abstract = {Gaussian filtering in one, two or three dimensions is among the most commonly needed tasks in signal and image processing. Finite impulse response filters in the time domain with Gaussian masks are easy to implement in either floating or fixed point arithmetic, because Gaussian kernels are strictly positive and bounded. But these implementations are slow for large images or kernels. With the recursive IIR-filters and FFT-based methods, there are at least two alternative methods to perform Gaussian filtering in a faster way, but so far they are only applicable when floating-point hardware is available. In this paper, a fixed-point implementation of recursive Gaussian filtering is discussed and applied to isotropic and anisotropic image filtering by making use of a non-orthogonal separation scheme of the Gaussian filter.},
author = {Christoph Lampert and Wirjadi,Oliver},
pages = {1565 -- 1568},
publisher = {IEEE},
title = {{Anisotropic Gaussian filtering using fixed point arithmetic}},
doi = {10.1109/ICIP.2006.312606},
year = {2006},
}
@misc{3814,
abstract = {The axon terminals (mossy fibers) of hippocampal dentate granule cells form characteristic synaptic connections with large spines or excrescences of both hilar mossy cells and CA3 pyramidal neurons. Interneurons of the hilar region and area CA3 are also prominent targets of mossy fibers. The tracing of biocytin-filled mossy fibers and immunolabeling of target cells with interneuron markers has revealed that the majority of mossy fiber synapses project to gamma aminobutyric acid (GABA)-ergic inhibitory interneurons rather than to excitatory principal cells, although the functional implications of these quantitative differences are unclear. Following a brief description of the "classical" mossy fiber synapse on excrescences of CA3 pyramidal cells, the present review focuses on the contacts formed between granule cells and GABAergic interneurons, both normally and after synaptic reorganization. In response to deafferentation of mossy cell target cells, which include both granule cells and interneurons, mossy fibers "sprout" new axon collaterals that form a band of supragranular mossy fibers in the inner molecular layer of the dentate gyrus. Although most newly formed recurrent mossy fibers establish synapses with granule cells, there is an apparently convergent input of new mossy fibers onto GABA-immunoreactive interneuron dendrites that traverse the inner molecular layer. These mossy fiber-interneuron synapses in the dentate gyrus are observed in chronically epileptic rats and may be the structural correlate of the granule cell hyperinhibition observed in these animals in vivo. Together, the findings reviewed here establish mossy fiber synapses as an important component of inhibitory circuits in the hippocampus.},
author = {Frotscher, Michael and Peter Jonas and Sloviter, Robert S},
booktitle = {Cell and Tissue Research},
number = {2},
pages = {361 -- 7},
publisher = {Springer},
title = {{Synapses formed by normal and abnormal hippocampal mossy fibers (Review)}},
doi = {10.1007/s00441-006-0269-2},
volume = {326},
year = {2006},
}
@inproceedings{3888,
abstract = {A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with omega-regular winning conditions specified as Rabin or Streett objectives. These games are NP-complete and coNP-complete, respectively. The value of the game for a player at a state s given an objective Phi is the maximal probability with which the player can guarantee the satisfaction of Phi from s. We present a strategy-improvement algorithm to compute values in stochastic Rabin games, where an improvement step involves solving Markov decision processes (MDPs) and nonstochastic Rabin games. The algorithm also computes values for stochastic Streett games but does not directly yield an optimal strategy for Streett objectives. We then show how to obtain an optimal strategy for Streett objectives by solving certain nonstochastic Streett games.},
author = {Krishnendu Chatterjee and Thomas Henzinger},
pages = {375 -- 389},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
title = {{Strategy improvement for stochastic Rabin and Streett games}},
doi = {10.1007/11817949_25},
volume = {4137},
year = {2006},
}
@inproceedings{3890,
abstract = {We consider two-player infinite games played on graphs. The games are concurrent, in that at each state the players choose their moves simultaneously and independently, and stochastic, in that the moves determine a probability distribution for the successor state. The value of a game is the maximal probability with which a player can guarantee the satisfaction of her objective. We show that the values of concurrent games with w-regular objectives expressed as parity conditions can be decided in NP boolean AND coNP. This result substantially improves the best known previous bound of 3EXPTIME. It also shows that the full class of concurrent parity games is no harder than the special case of turn-based stochastic reachability games, for which NP boolean AND coNP is the best known bound. While the previous, more restricted NP boolean AND coNP results for graph games relied on the existence of particularly simple (pure memoryless) optimal strategies, in concurrent games with parity objectives optimal strategies may not exist, and epsilon-optimal strategies (which achieve the value of the game within a parameter epsilon > 0) require in general both randomization and infinite memory. Hence our proof must rely on a more detailed analysis of strategies and, in addition to the main result, yields two results that are interesting on their own. First, we show that there exist epsilon-optimal strategies that in the limit coincide with memoryless strategies; this parallels the celebrated result of Mertens-Neyman for concurrent games with limit-average objectives. Second, we complete the characterization of the memory requirements for epsilon-optimal strategies for concurrent games with parity conditions, by showing that memoryless strategies suffice for epsilon-optimality for coBachi conditions.},
author = {Krishnendu Chatterjee and de Alfaro, Luca and Thomas Henzinger},
pages = {678 -- 687},
publisher = {SIAM},
title = {{The complexity of quantitative concurrent parity games}},
doi = {10.1145/1109557.1109631},
year = {2006},
}
@article{3908,
abstract = {It is commonly believed that both the average length and the frequency of microsatellites correlate with genome size. We have estimated the frequency and the average length for 69 perfect dinucleotide microsatellites in an insect with an exceptionally large genome: Chorthippus biguttulus (Orthoptera, Acrididae). Dinucleotide microsatellites are not more frequent in C. biguttulus, but repeat arrays are 1.4 to 2 times longer than in other insect species. The average repeat number in C. biguttulus lies in the range of higher vertebrates. Natural populations are highly variable. At least 30 alleles per locus were found and the expected heterozygosity is above 0.95 at all three loci studied. In contrast, the observed heterozygosity is much lower (≤0.51), which could be caused by long null alleles.},
author = {Ustinova, Jana and Achmann, Roland and Cremer, Sylvia and Mayer, Frieder},
journal = {Journal of Molecular Evolution},
number = {2},
pages = {158 -- 167},
publisher = {Springer},
title = {{Long repeats in a huge gemome: microsatellite loci in the grasshopper Chorthippus biguttulus}},
doi = {10.1007/s00239-005-0022-6},
volume = {62},
year = {2006},
}
@article{3934,
abstract = {T cells develop in the thymus in a highly specialized cellular and extracellular microenvironment. The basement membrane molecule, laminin-5 (LN-5), is predominantly found in the medulla of the human thymic lobules. Using high-resolution light microscopy, we show here that LN-5 is localized in a bi-membranous conduit-like structure, together with other typical basement membrane components including collagen type IV, nidogen and perlecan. Other interstitial matrix components, such as fibrillin-1 or -2, tenascin-C or fibrillar collagen types, were also associated with these structures. Three-dimensional (3D) confocal microscopy suggested a tubular structure, whereas immunoelectron and transmission electron microscopy showed that the core of these tubes contained fibrillar collagens enwrapped by the LN-5-containing membrane. These medullary conduits are surrounded by thymic epithelial cells, which in vitro were found to bind LN-5, but also fibrillin and tenascin-C. Dendritic cells were also detected in close vicinity to the conduits. Both of these stromal cell types express major histocompatibility complex (MHC) class II molecules capable of antigen presentation. The conduits are connected to blood vessels but, with an average diameter of 2 mum, they are too small to transport cells. However, evidence is provided that smaller molecules such as a 10 kDa dextran, but not large molecules (>500 kDa), can be transported in the conduits. These results clearly demonstrate that a conduit system, which is also known from secondary lymphatic organs such as lymph nodes and spleen, is present in the medulla of the human thymus, and that it might serve to transport small blood-borne molecules or chemokines to defined locations within the medulla.},
author = {Drumea-Mirancea, Mihaela and Wessels, Johannes T and Müller, Claudia A and Essl, Mike and Eble, Johannes A and Tolosa, Eva and Koch, Manuel and Reinhardt, Dieter P and Michael Sixt and Sorokin, Lydia and Stierhof, York-Dieter and Schwarz, Heinz and Klein, Gerd},
journal = {Journal of Cell Science},
number = {Pt 7},
pages = {1396 -- 1405},
publisher = {Company of Biologists},
title = {{Characterization of a conduit system containing laminin-5 in the human thymus: a potential transport system for small molecules}},
doi = {10.1242/jcs.02840},
volume = {119},
year = {2006},
}
@article{4184,
abstract = {Epithelial morphogenesis depends on coordinated changes in cell shape, a process that is still poorly understood. During zebrafish epiboly and Drosophila dorsal closure, cell-shape changes at the epithelial margin are of critical importance. Here evidence is provided for a conserved mechanism of local actin and myosin 2 recruitment during theses events. It was found that during epiboly of the zebrafish embryo, the movement of the outer epithelium (enveloping layer) over the yolk cell surface involves the constriction of marginal cells. This process depends on the recruitment of actin and myosin 2 within the yolk cytoplasm along the margin of the enveloping layer. Actin and myosin 2 recruitment within the yolk cytoplasm requires the Ste20-like kinase Msn1, an orthologue of Drosophila Misshapen. Similarly, in Drosophila, actin and myosin 2 localization and cell constriction at the margin of the epidermis mediate dorsal closure and are controlled by Misshapen. Thus, this study has characterized a conserved mechanism underlying coordinated cell-shape changes during epithelial morphogenesis.},
author = {Köppen, Mathias and Fernández, Beatriz García and Carvalho,Lara and Jacinto, António and Heisenberg, Carl-Philipp},
journal = {Development},
number = {14},
pages = {2671 -- 2681},
publisher = {Company of Biologists},
title = {{Coordinated cell-shape changes control epithelial movement in zebrafish and Drosophila}},
doi = {doi: 10.1242/dev.02439},
volume = {133},
year = {2006},
}
@article{4235,
author = {Harold Vladar and González,J. A},
journal = {Journal of Theoretical Biology},
pages = {91 -- 109},
publisher = {Elsevier},
title = {{Dynamic response of cancer under the influence of immunological activity and therapy}},
year = {2006},
}
@inproceedings{4374,
author = {Maler, Oded and Dejan Nickovic and Pnueli,Amir},
pages = {274 -- 289},
publisher = {Springer},
title = {{From MITL to Timed Automata}},
doi = {1570},
year = {2006},
}
@inproceedings{4406,
abstract = {We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction to explicitly determinize the automaton, we keep the determinization step implicit. Our algorithm computes the least fixed point of a monotone function on the lattice of antichains of state sets. We evaluate the performance of our algorithm experimentally using the random automaton model recently proposed by Tabakov and Vardi. We show that on the difficult instances of this probabilistic model, the antichain algorithm outperforms the standard one by several orders of magnitude. We also show how variations of the antichain method can be used for solving the language-inclusion problem for nondeterministic finite automata, and the emptiness problem for alternating finite automata.},
author = {De Wulf, Martin and Doyen, Laurent and Thomas Henzinger and Raskin, Jean-François},
pages = {17 -- 30},
publisher = {Springer},
title = {{Antichains: A new algorithm for checking universality of finite automata}},
doi = {10.1007/11817963_5},
volume = {4144},
year = {2006},
}
@inproceedings{4432,
abstract = {We add freeze quantifiers to the game logic ATL in order to specify real-time objectives for games played on timed structures. We define the semantics of the resulting logic TATL by restricting the players to physically meaningful strategies, which do not prevent time from diverging. We show that TATL can be model checked over timed automaton games. We also specify timed optimization problems for physically meaningful strategies, and we show that for timed automaton games, the optimal answers can be approximated to within any degree of precision.},
author = {Thomas Henzinger and Prabhu, Vinayak S},
pages = {1 -- 17},
publisher = {Springer},
title = {{Timed alternating-time temporal logic}},
doi = {10.1007/11867340_1},
volume = {4202},
year = {2006},
}
@inproceedings{4437,
abstract = {The synthesis of reactive systems requires the solution of two-player games on graphs with ω-regular objectives. When the objective is specified by a linear temporal logic formula or nondeterministic Büchi automaton, then previous algorithms for solving the game require the construction of an equivalent deterministic automaton. However, determinization for automata on infinite words is extremely complicated, and current implementations fail to produce deterministic automata even for relatively small inputs. We show how to construct, from a given nondeterministic Büchi automaton, an equivalent nondeterministic parity automaton that is good for solving games with objective . The main insight is that a nondeterministic automaton is good for solving games if it fairly simulates the equivalent deterministic automaton. In this way, we omit the determinization step in game solving and reactive synthesis. The fact that our automata are nondeterministic makes them surprisingly simple, amenable to symbolic implementation, and allows an incremental search for winning strategies.},
author = {Thomas Henzinger and Piterman, Nir},
pages = {395 -- 410},
publisher = {Springer},
title = {{Solving games without determinization}},
doi = {10.1007/11874683_26},
volume = {4207},
year = {2006},
}
@article{4451,
abstract = {One source of complexity in the μ-calculus is its ability to specify an unbounded number of switches between universal (AX) and existential (EX) branching modes. We therefore study the problems of satisfiability, validity, model checking, and implication for the universal and existential fragments of the μ-calculus, in which only one branching mode is allowed. The universal fragment is rich enough to express most specifications of interest, and therefore improved algorithms are of practical importance. We show that while the satisfiability and validity problems become indeed simpler for the existential and universal fragments, this is, unfortunately, not the case for model checking and implication. We also show the corresponding results for the alternation-free fragment of the μ-calculus, where no alternations between least and greatest fixed points are allowed. Our results imply that efforts to find a polynomial-time model-checking algorithm for the μ-calculus can be replaced by efforts to find such an algorithm for the universal or existential fragment.},
author = {Thomas Henzinger and Kupferman, Orna and Majumdar, Ritankar S},
journal = {Theoretical Computer Science},
number = {2},
pages = {173 -- 186},
publisher = {Elsevier},
title = {{On the universal and existential fragments of the mu-calculus}},
doi = {10.1016/j.tcs.2005.11.015},
volume = {354},
year = {2006},
}
@inproceedings{4526,
abstract = {We designed and implemented a new programming language called Hierarchical Timing Language (HTL) for hard realtime systems. Critical timing constraints are specified within the language,and ensured by the compiler. Programs in HTL are extensible in two dimensions without changing their timing behavior: new program modules can be added, and individual program tasks can be refined. The mechanism supporting time invariance under parallel composition is that different program modules communicate at specified instances of time. Time invariance under refinement is achieved by conservative scheduling of the top level. HTL is a coordination language, in that individual tasks can be implemented in "foreign" languages. As a case study, we present a distributed HTL implementation of an automotive steer-by-wire controller.},
author = {Ghosal, Arkadeb and Thomas Henzinger and Iercan, Daniel and Kirsch, Christoph M and Sangiovanni-Vincentelli, Alberto},
pages = {132 -- 141},
publisher = {ACM},
title = {{A hierarchical coordination language for interacting real-time tasks}},
doi = {10.1145/1176887.1176907},
year = {2006},
}
@inproceedings{4552,
abstract = {A concurrent reachability game is a two-player game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a probability distribution over the successor states. The objective for player 1 consists in reaching a set of target states; the objective for player 2 is to prevent this, so that the game is zero-sum. Our contributions are two-fold. First, we present a simple proof of the fact that in concurrent reachability games, for all epsilon > 0, memoryless epsilon-optimal strategies exist. A memoryless strategy is independent of the history of plays, and an epsilon-optimal strategy achieves the objective with probability within epsilon of the value of the game. In contrast to previous proofs of this fact, which rely on the limit behavior of discounted games using advanced Puisieux series analysis, our proof is elementary and combinatorial. Second, we present a strategy-improvement (a.k.a. policy-iteration) algorithm for concurrent games with reachability objectives.},
author = {Krishnendu Chatterjee and de Alfaro, Luca and Thomas Henzinger},
pages = {291 -- 300},
publisher = {IEEE},
title = {{Strategy improvement for concurrent reachability games}},
doi = {10.1109/QEST.2006.48},
year = {2006},
}
@inproceedings{4401,
author = {Alur, Rajeev and Pavol Cerny and Zdancewic,Steve},
pages = {107 -- 118},
publisher = {Springer},
title = {{Preserving Secrecy Under Refinement}},
doi = {1543},
year = {2006},
}
@inproceedings{4538,
abstract = {A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with ω-regular winning conditions specified as parity objectives. These games lie in NP ∩ coNP. We present a strategy improvement algorithm for stochastic parity games; this is the first non-brute-force algorithm for solving these games. From the strategy improvement algorithm we obtain a randomized subexponential-time algorithm to solve such games.},
author = {Krishnendu Chatterjee and Thomas Henzinger},
pages = {512 -- 523},
publisher = {Springer},
title = {{Strategy improvement and randomized subexponential algorithms for stochastic parity games}},
doi = {10.1007/11672142_42},
volume = {3884},
year = {2006},
}
@inproceedings{578,
abstract = {A source of single photons allows secure quantum key distribution, in addition, to being a critical resource for linear optics quantum computing. We describe our progress on deterministically creating single photons from spontaneous parametric downconversion, an extension of the Pittman, Jacobs and Franson scheme [Phys. Rev A, v66, 042303 (2002)]. Their idea was to conditionally prepare single photons by measuring one member of a spontaneously emitted photon pair and storing the remaining conditionally prepared photon until a predetermined time, when it would be "deterministically" released from storage. Our approach attempts to improve upon this by recycling the pump pulse in order to decrease the possibility of multiple-pair generation, while maintaining a high probability of producing a single pair. Many of the challenges we discuss are central to other quantum information technologies, including the need for low-loss optical storage, switching and detection, and fast feed-forward control.},
author = {Peters, Nicholas A and Arnold, Keith J and VanDevender, Aaron P and Jeffrey, Evan R and Rangarajan, Radhika and Onur Hosten and Barreiro, Julio T and Altepeter, Joseph B and Kwiat, Paul G},
publisher = {SPIE},
title = {{Towards a quasi-deterministic single-photon source}},
doi = {10.1117/12.684702},
volume = {6305},
year = {2006},
}
@article{573,
abstract = {Mitchison and Jozsa recently suggested that the "chained-Zeno" counterfactual computation protocol recently proposed by Hosten et al. is counterfactual for only one output of the computer. This claim was based on the existing abstract algebraic definition of counterfactual computation, and indeed according to this definition, their argument is correct. However, a more general definition (physically adequate) for counterfactual computation is implicitly assumed by Hosten et. al. Here we explain in detail why the protocol is counterfactual and how the "history tracking" method of the existing description inadequately represents the physics underlying the protocol. Consequently, we propose a modified definition of counterfactual computation. Finally, we comment on one of the most interesting aspects of the error-correcting protocol. },
author = {Onur Hosten and Rakher, Matthew T and Barreiro, Julio T and Peters, Nicholas A and Kwiat, Paul G},
journal = {Quantum Physics},
publisher = {ArXiv},
title = {{Counterfactual computation revisited}},
year = {2006},
}
@article{903,
abstract = {Background: Carcinogenesis typically involves multiple somatic mutations in caretaker (DNA repair) and gatekeeper (tumor suppressors and oncogenes) genes. Analysis of mutation spectra of the tumor suppressor that is most commonly mutated in human cancers, p53, unexpectedly suggested that somatic evolution of the p53 gene during tumorigenesis is dominated by positive selection for gain of function. This conclusion is supported by accumulating experimental evidence of evolution of new functions of p53 in tumors. These findings prompted a genome-wide analysis of possible positive selection during tumor evolution. Methods: A comprehensive analysis of probable somatic mutations in the sequences of Expressed Sequence Tags (ESTs) from malignant tumors and normal tissues was performed in order to access the prevalence of positive selection in cancer evolution. For each EST, the numbers of synonymous and non-synonymous substitutions were calculated. In order to identify genes with a signature of positive selection in cancers, these numbers were compared to: i) expected numbers and ii) the numbers for the respective genes in the ESTs from normal tissues. Results: We identified 112 genes with a signature of positive selection in cancers, i.e., a significantly elevated ratio of non-synonymous to synonymous substitutions, in tumors as compared to 37 such genes in an approximately equal-sized EST collection from normal tissues. A substantial fraction of the tumor-specific positive-selection candidates have experimentally demonstrated or strongly predicted links to cancer. Conclusion: The results of EST analysis should be interpreted with extreme caution given the noise introduced by sequencing errors and undetected polymorphisms. Furthermore, an inherent limitation of EST analysis is that multiple mutations amenable to statistical analysis can be detected only in relatively highly expressed genes. Nevertheless, the present results suggest that positive selection might affect a substantial number of genes during tumorigenic somatic evolution.},
author = {Babenko, Vladimir N and Basu, Malay K and Fyodor Kondrashov and Rogozin, Igor B and Koonin, Eugene V},
journal = {BMC Cancer},
publisher = {BioMed Central},
title = {{Signs of positive selection of somatic mutations in human cancers detected by EST sequence analysis}},
doi = {10.1186/1471-2407-6-36},
volume = {6},
year = {2006},
}
@article{869,
abstract = {The impact of synonymous nucleotide substitutions on fitness in mammals remains controversial. Despite some indications of selective constraint, synonymous sites are often assumed to be neutral, and the rate of their evolution is used as a proxy for mutation rate. We subdivide all sites into four classes in terms of the mutable CpG context, nonCpG, postC, preG, and postCpreG, and compare four-fold synonymous sites and intron sites residing outside transposable elements. The distribution of the rate of evolution across all synonymous sites is trimodal. Rate of evolution at nonCpG synonymous sites, not preceded by C and not followed by G, is ∼10% below that at such intron sites. In contrast, rate of evolution at postCpreG synonymous sites is ∼30% above that at such intron sites. Finally, synonymous and intron postC and preG sites evolve at similar rates. The relationship between the levels of polymorphism at the corresponding synonymous and intron sites is very similar to that between their rates of evolution. Within every class, synonymous sites are occupied by G or C much more often than intron sites, whose nucleotide composition is consistent with neutral mutation-drift equilibrium. These patterns suggest that synonymous sites are under weak selection in favor of G and C, with the average coefficient s∼0.25/Ne∼10-5, where Ne is the effective population size. Such selection decelerates evolution and reduces variability at sites with symmetric mutation, but has the opposite effects at sites where the favored nucleotides are more mutable. The amino-acid composition of proteins dictates that many synonymous sites are CpGprone, which causes them, on average, to evolve faster and to be more polymorphic than intron sites. An average genotype carries ∼107 suboptimal nucleotides at synonymous sites, implying synergistic epistasis in selection against them.},
author = {Fyodor Kondrashov and Ogurtsov, Aleksey Yu and Kondrashov, Alexey S},
journal = {Journal of Theoretical Biology},
number = {4},
pages = {616 -- 626},
publisher = {Elsevier},
title = {{Selection in favor of nucleotides G and C diversifies evolution rates and levels of polymorphism at mammalian synonymous sites}},
doi = {10.1016/j.jtbi.2005.10.020},
volume = {240},
year = {2006},
}
@article{2134,
abstract = {Predissociation of the N+2 C 2Σ+u(v') vibrational levels with v' ≥ 3 was observed via dispersed C 2Σ+u → X 2Σ+g fluorescence in the spectral range of 165–208 nm after resonant 1s−1π*(vr) excitation of N2 and its subsequent autoionization into the N+2 C state. This range is dominated by lines in atomic nitrogen, by overlapped C 2Σ+u(v') → X 2Σ+g(v'') vibrational band sequences with Δv = const and broad unresolved band systems (D, (2))2Πg(v') → A2Πu(v'') in the N+2 molecular ion. With very high fluorescence resolution of about 0.1 nm FWHM individual C 2Σ+u(v') → X 2Σ+g(v'') vibrational bands have been resolved. Calculation of the observed fluorescence spectra by taking into account predissociation and molecular rotation describes well the shape of both individual vibrational bands C 2Σ+u(v') → X 2Σ+g(v'') and the whole band system.},
author = {Ehresmann, Arno and Werner, Lutz and Klumpp, Stefan and Demekhin, Ph V and Mikhail Lemeshko and Sukhorukov, V. L and Schartner, Karl H and Schmoranzer, Hans P},
journal = {Journal of Physics B: Atomic, Molecular and Optical Physics},
number = {6},
pages = {L119 -- L126},
publisher = {IOP Publishing Ltd.},
title = {{Predissociation of the N+2(C 2Σ+u) state observed via C 2Σ+u → X 2Σ+g fluorescence after resonant 1s−1π* excitation of N2 molecule}},
doi = {10.1088/0953-4075/39/6/L03},
volume = {39},
year = {2006},
}
@inproceedings{2088,
abstract = {We have measured 3D face geometry, skin reflectance, and subsurface scattering using custom-built devices for 149 subjects of varying age, gender, and race. We developed a novel skin reflectance model whose parameters can be estimated from measurements. The model decomposes the large amount of measured skin data into a spatially-varying analytic BRDF, a diffuse albedo map, and diffuse subsurface scattering. Our model is intuitive, physically plausible, and - since we do not use the original measured data - easy to edit as well. High-quality renderings come close to reproducing real photographs. The analysis of the model parameters for our sample population reveals variations according to subject age, gender, skin type, and external factors (e.g., sweat, cold, or makeup). Using our statistics, a user can edit the overall appearance of a face (e.g., changing skin type and age) or change small-scale features using texture synthesis (e.g., adding moles and freckles). We are making the collected statistics publicly available to the research community for applications in face synthesis and analysis. },
author = {Weyrich, Tim and Matusik, Wojciech and Pfister, Hanspeter and Bernd Bickel and Donner, Craig and Tu, Chien and McAndless, Janet M and Lee, Jinho and Ngan, Addy and Jensen, Henrik W and Groß, Markus S},
pages = {1013 -- 1024},
publisher = {ACM},
title = {{Analysis of human faces using a measurement-based skin reflectance model}},
doi = {10.1145/1179352.1141987},
year = {2006},
}
@inproceedings{2090,
author = {Bernd Bickel and Weyrich, Tim and Matusik, Wojciech and Pfister, Hanspeter and Donner, Craig and Tu, Chien and McAndless, Janet M and Lee, Jinho and Ngan, Addy and Jensen, Henrik W and Groß, Markus S},
publisher = {ACM},
title = {{Processing and editing of faces using a measurement-based skin reflectance model}},
doi = {10.1145/1179849.1180059},
year = {2006},
}
@article{2660,
abstract = {Pavlovian fear conditioning, a simple form of associative learning, is thought to involve the induction of associative, NMDA receptor-dependent long-term potentiation (LTP) in the lateral amygdala. Using a combined genetic and electrophysiological approach, we show here that lack of a specific GABAB receptor subtype, GABAB(1a,2), unmasks a nonassociative, NMDA receptor-independent form of presynaptic LTP at cortico-amygdala afferents. Moreover, the level of presynaptic GABA B(1a,2) receptor activation, and hence the balance between associative and nonassociative forms of LTP, can be dynamically modulated by local inhibitory activity. At the behavioral level, genetic loss of GABA B(1a) results in a generalization of conditioned fear to nonconditioned stimuli. Our findings indicate that presynaptic inhibition through GABAB(1a,2) receptors serves as an activity-dependent constraint on the induction of homosynaptic plasticity, which may be important to prevent the generalization of conditioned fear.},
author = {Shaban, Hamdy and Humeau, Yann and Herry, Cyril and Cassasus, Guillaume and Ryuichi Shigemoto and Ciocchi, Stéphane and Barbieri, Samuel and Van Der Putten, Herman V and Kaupmann, Klemens and Bettler, Bernhard and Lüthi, Andreas},
journal = {Nature Neuroscience},
number = {8},
pages = {1028 -- 1035},
publisher = {Nature Publishing Group},
title = {{Generalization of amygdala LTP and conditioned fear in the absence of presynaptic inhibition}},
doi = {10.1038/nn1732},
volume = {9},
year = {2006},
}
@article{2747,
abstract = {Consider a system of N bosons on the three-dimensional unit torus interacting via a pair potential N 2V(N(x i - x j)) where x = (x i, . . ., x N) denotes the positions of the particles. Suppose that the initial data ψ N,0 satisfies the condition 〈ψ N,0, H 2 Nψ N,0) ≤ C N 2 where H N is the Hamiltonian of the Bose system. This condition is satisfied if ψ N,0 = W Nφ N,t where W N is an approximate ground state to H N and φ N,0 is regular. Let ψ N,t denote the solution to the Schrödinger equation with Hamiltonian H N. Gross and Pitaevskii proposed to model the dynamics of such a system by a nonlinear Schrödinger equation, the Gross-Pitaevskii (GP) equation. The GP hierarchy is an infinite BBGKY hierarchy of equations so that if u t solves the GP equation, then the family of k-particle density matrices ⊗ k |u t?〉 〈 t | solves the GP hierarchy. We prove that as N → ∞ the limit points of the k-particle density matrices of ψ N,t are solutions of the GP hierarchy. Our analysis requires that the N-boson dynamics be described by a modified Hamiltonian that cuts off the pair interactions whenever at least three particles come into a region with diameter much smaller than the typical interparticle distance. Our proof can be extended to a modified Hamiltonian that only forbids at least n particles from coming close together for any fixed n.},
author = {László Erdös and Schlein, Benjamin and Yau, Horng-Tzer},
journal = {Communications on Pure and Applied Mathematics},
number = {12},
pages = {1659 -- 1741},
publisher = {Wiley-Blackwell},
title = {{Derivation of the Gross-Pitaevskii hierarchy for the dynamics of Bose-Einstein condensate}},
doi = {10.1002/cpa.20123},
volume = {59},
year = {2006},
}
@article{2792,
abstract = {Transition to turbulence in pipe flow has posed a riddle in fluid dynamics since the pioneering experiments of Reynolds[1]. Although the laminar flow is linearly stable for all flow rates, practical pipe flows become turbulent at large enough flow speeds. Turbulence arises suddenly and fully without distinct steps and without a clear critical point. The complexity of this problem has puzzled mathematicians, physicists and engineers for more than a century and no satisfactory explanation of this problem has been given. In a very recent theoretical approach it has been suggested that unstable solutions of the Navier Stokes equations may hold the key to understanding this problem. In numerical studies such unstable states have been identified as exact solutions for the idealized case of a pipe with periodic boundary conditions[2, 3]. These solutions have the form of waves extending through the entire pipe and travelling in the streamwise direction at a phase speed close to the bulk velocity of the fluid. With the aid of a recently developed high-speed stereoscopic Particle Image Velocimetry (PIV) system, we were able to observe transients of such unstable solutions in turbulent pipe flow[4].},
author = {Björn Hof and van Doorne, Casimir W and Westerweel, Jerry and Nieuwstadt, Frans T},
journal = {Fluid Mechanics and its Applications},
pages = {109 -- 114},
publisher = {Springer},
title = {{Observation of nonlinear travelling waves in turbulent pipe flow}},
doi = {10.1007/1-4020-4159-4_11},
volume = {78},
year = {2006},
}
@article{3005,
author = {Friml, Jirí and Benfey, Philip and Benková, Eva and Bennett, Malcolm and Berleth, Thomas and Geldner, Niko and Grebe, Markus and Heisler, Marcus and Hejátko, Jan and Jürgens, Gerd and Laux, Thomas and Lindsey, Keith and Lukowitz, Wolfgang and Luschnig, Christian and Offringa, Remko and Scheres, Ben and Swarup, Ranjan and Torres Ruiz, Ramón and Weijers, Dolf and Zažímalová, Eva},
journal = {Trends in Plant Science},
number = {1},
pages = {12 -- 14},
publisher = {Cell Press},
title = {{Apical-basal polarity: Why plant cells don't stand on their heads}},
doi = {10.1016/j.tplants.2005.11.010},
volume = {11},
year = {2006},
}
@article{3012,
abstract = {Intercellular flow of the phytohormone auxin underpins multiple developmental processes in plants. Plant-specific pin-formed (PIN) proteins and several phosphoglycoprotein (PGP) transporters are crucial factors in auxin transport-related development, yet the molecular function of PINs remains unknown. Here, we show that PINs mediate auxin efflux from mammalian and yeast cells without needing additional plant-specific factors. Conditional gain-of-function alleles and quantitative measurements of auxin accumulation in Arabidopsis and tobacco cultured cells revealed that the action of PINs in auxin efflux is distinct from PGP, rate-limiting, specific to auxins, and sensitive to auxin transport inhibitors. This suggests a direct involvement of PINs in catalyzing cellular auxin efflux.},
author = {Petrášek, Jan and Mravec, Jozef and Bouchard, Rodolphe and Blakeslee, Joshua and Melinda Abas and Seifertová, Daniela and Wiśniewska, Justyna and Tadele, Zerihun and Kubeš, Martin and Čovanová, Milada and Dhonukshe, Pankaj and Skůpa, Petr and Eva Benková and Perry, Lucie and Křeček, Pavel and Lee, Ok Ran and Fink, Gerald R and Geisler, Markus and Murphy, Angus S and Luschnig, Christian and Zažímalová, Eva and Jirí Friml},
journal = {Science},
number = {5775},
pages = {914 -- 918},
publisher = {American Association for the Advancement of Science},
title = {{PIN proteins perform a rate-limiting function in cellular auxin efflux}},
doi = {10.1126/science.1123542},
volume = {312},
year = {2006},
}
@article{3017,
abstract = {The plant hormone auxin plays crucial roles in regulating plant growth development, including embryo and root patterning, organ formation, vascular tissue differentiation and growth responses to environmental stimuli. Asymmetric auxin distribution patterns have been observed within tissues, and these so-called auxin gradients change dynamically during different developmental processes. Most auxin is synthesized in the shoot and distributed directionally throughout the plant. This polar auxin transport is mediated by auxin influx and efflux facilitators, whose subcellular polar localizations guide the direction of auxin flow. The polar localization of PIN auxin efflux carriers changes in response to developmental and external cues in order to channel auxin flow in a regulated manner for organized growth. Auxin itself modulates the expression and subcellular localization of PIN proteins, contributing to a complex pattern of feedback regulation. Here we review the available information mainly from studies of a model plant, Arabidopsis thaliana, on the generation of auxin gradients, the regulation of polar auxin transport and further downstream cellular events.},
author = {Tanaka, Hirokazu and Dhonukshe, Pankaj and Brewer, Philip and Friml, Jirí},
journal = {Cellular and Molecular Life Sciences},
number = {23},
pages = {2738 -- 2754},
publisher = {Birkhäuser},
title = {{Spatiotemporal asymmetric auxin distribution: A means to coordinate plant development}},
doi = {10.1007/s00018-006-6116-5},
volume = {63},
year = {2006},
}
@inproceedings{3214,
abstract = {The Feistel-network is a popular structure underlying many block-ciphers where the cipher is constructed from many simpler rounds, each defined by some function which is derived from the secret key.
Luby and Rackoff showed that the three-round Feistel-network – each round instantiated with a pseudorandom function secure against adaptive chosen plaintext attacks (CPA) – is a CPA secure pseudorandom permutation, thus giving some confidence in the soundness of using a Feistel-network to design block-ciphers.
But the round functions used in actual block-ciphers are – for efficiency reasons – far from being pseudorandom. We investigate the security of the Feistel-network against CPA distinguishers when the only security guarantee we have for the round functions is that they are secure against non-adaptive chosen plaintext attacks (nCPA). We show that in the information-theoretic setting, four rounds with nCPA secure round functions are sufficient (and necessary) to get a CPA secure permutation. Unfortunately, this result does not translate into the more interesting pseudorandom setting. In fact, under the so-called Inverse Decisional Diffie-Hellman assumption the Feistel-network with four rounds, each instantiated with a nCPA secure pseudorandom function, is in general not a CPA secure pseudorandom permutation.},
author = {Maurer, Ueli M and Oswald, Yvonne A and Krzysztof Pietrzak and Sjödin, Johan},
pages = {391 -- 408},
publisher = {Springer},
title = {{Luby Rackoff ciphers from weak round functions }},
doi = {10.1007/11761679_24},
volume = {4004},
year = {2006},
}