@inproceedings{3191,
abstract = {The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linearly on parameter lambda. In this paper we study vision applications for which it is important to solve the maxflow problem for different lambda's. An example is a weighting between data and regularization terms in image segmentation or stereo: it is desirable to vary it both during training (to learn lambda from ground truth data) and testing (to select best lambda using high-knowledge constraints, e.g. user input). We review algorithmic aspects of this parametric maximum flow problem previously unknown in vision, such as the ability to compute all breakpoints of lambda and corresponding optimal configurations infinite time. These results allow, in particular, to minimize the ratio of some geometric functional, such as flux of a vector field over length (or area). Previously, such functional were tackled with shortest path techniques applicable only in 2D. We give theoretical improvements for "PDE cuts" [5]. We present experimental results for image segmentation, 3D reconstruction, and the cosegmentation problem.},
author = {Vladimir Kolmogorov and Boykov, Yuri and Rother, Carsten},
publisher = {IEEE},
title = {{Applications of parametric maxflow in computer vision}},
doi = {10.1109/ICCV.2007.4408910},
year = {2007},
}
@inproceedings{3192,
abstract = {Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optimizing such MRFs known as "roof duality" was recently introduced into computer vision. We study two methods which extend this approach. First, we discuss an efficient implementation of the "probing" technique introduced recently by Boros et al. [5]. It simplifies the MRF while preserving the global optimum. Our code is 400-700 faster on some graphs than the implementation of [5]. Second, we present a new technique which takes an arbitrary input labeling and tries to improve its energy. We give theoretical characterizations of local minima of this procedure. We applied both techniques to many applications, including image segmentation, new view synthesis, superresolution, diagram recognition, parameter learning, texture restoration, and image deconvolution. For several applications we see that we are able to find the global minimum very efficiently, and considerably outperform the original roof duality approach. In comparison to existing techniques, such as graph cut, TRW, BP, ICM, and simulated annealing, we nearly always find a lower energy.},
author = {Rother, Carsten and Vladimir Kolmogorov and Lempitsky, Victor and Szummer, Martin},
publisher = {IEEE},
title = {{Optimizing binary MRFs via extended roof duality}},
doi = {10.1109/CVPR.2007.383203},
year = {2007},
}
@article{3193,
abstract = {Optimization techniques based on graph cuts have become a standard tool for many vision applications. These techniques allow to minimize efficiently certain energy functions corresponding to pairwise Markov Random Fields (MRFs). Currently, there is an accepted view within the computer vision community that graph cuts can only be used for optimizing a limited class of MRF energies (e.g., submodular functions). In this survey, we review some results that show that graph cuts can be applied to a much larger class of energy functions (in particular, nonsubmodular functions). While these results are well-known in the optimization community, to our knowledge they were not used in the context of computer vision and MRF optimization. We demonstrate the relevance of these results to vision on the problem of binary texture restoration. },
author = {Vladimir Kolmogorov and Rother, Carsten},
journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
number = {7},
pages = {1274 -- 1279},
publisher = {IEEE},
title = {{Minimizing nonsubmodular functions with graph cuts - A review}},
doi = {10.1109/TPAMI.2007.1031},
volume = {29},
year = {2007},
}
@inproceedings{3218,
abstract = {A (k, ℓ)-robust combiner for collision-resistant hash-functions is a construction which from ℓ hash-functions constructs a hash-function which is collision-resistant if at least k of the components are collision-resistant. One trivially gets a (k, ℓ)-robust combiner by concatenating the output of any ℓ - k + 1 of the components, unfortunately this is not very practical as the length of the output of the combiner is quite large. We show that this is unavoidable as no black-box (k, ℓ)-robust combiner whose output is significantly shorter than what can be achieved by concatenation exists. This answers a question of Boneh and Boyen (Crypto'06). },
author = {Krzysztof Pietrzak},
pages = {23 -- 33},
publisher = {Springer},
title = {{Non-trivial black-box combiners for collision-resistant hash-functions don't exist}},
doi = {10.1007/978-3-540-72540-4_2},
volume = {4515},
year = {2007},
}
@inproceedings{3219,
abstract = {Many aspects of cryptographic security proofs can be seen as the proof that a certain system (e.g. a block cipher) is indistinguishable from an ideal system (e.g. a random permutation), for different types of distinguishers. This paper presents a new generic approach to proving upper bounds on the information-theoretic distinguishing advantage (from an ideal system) for a combined system, assuming upper bounds of certain types for the component systems. For a general type of combination operation of systems, including the XOR of functions or the cascade of permutations, we prove two amplification theorems. The first is a product theorem, in the spirit of XOR-lemmas: The distinguishing advantage of the combination of two systems is at most twice the product of the individual distinguishing advantages. This bound is optimal. The second theorem states that the combination of systems is secure against some strong class of distinguishers, assuming only that the components are secure against some weaker class of distinguishers. A key technical tool of the paper is the proof of a tight two-way correspondence, previously only known to hold in one direction, between the distinguishing advantage of two systems and the probability of winning an appropriately defined game. © International Association for Cryptologic Research 2007.},
author = {Maurer, Ueli M and Krzysztof Pietrzak and Renner, Renato},
pages = {130 -- 149},
publisher = {Springer},
title = {{Indistinguishability amplification}},
doi = {10.1007/978-3-540-74143-5_8},
volume = {4622},
year = {2007},
}
@inproceedings{3220,
abstract = {We introduce a new primitive called intrusion-resilient secret sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed interactively using low communication complexity in k, but not in k-1 rounds. IRSS is a means of sharing a secret message amongst a set of players which comes with a very strong security guarantee. The shares in an IRSS are made artificially large so that it is hard to retrieve them completely, and the reconstruction procedure is interactive requiring the players to exchange k short messages. The adversaries considered can attack the scheme in rounds, where in each round the adversary chooses some player to corrupt and some function, and retrieves the output of that function applied to the share of the corrupted player. This model captures for example computers connected to a network which can occasionally he infected by malicious software like viruses, which can compute any function on the infected machine, but cannot sent out a huge amount of data. Using methods from the bounded-retrieval model, we construct an IRSS scheme which is secure against any computationally unbounded adversary as long as the total amount of information retrieved by the adversary is somewhat less than the length of the shares, and the adversary makes at most k-1 corruption rounds (as described above, where k rounds are necessary for reconstruction). We extend our basic scheme in several ways in order to allow the shares sent by the dealer to be short (the players then blow them up locally) and to handle even stronger adversaries who can learn some of the shares completely. As mentioned, there is an obvious connection between IRSS schemes and the fact that there exist functions with an exponential gap in their communication complexity for k and k-1 rounds. Our scheme implies such a separation which is in several aspects stronger than the previously known ones.},
author = {Dziembowski, Stefan and Krzysztof Pietrzak},
pages = {227 -- 237},
publisher = {IEEE},
title = {{Intrusion resilient secret sharing}},
doi = {10.1109/FOCS.2007.63},
year = {2007},
}
@inproceedings{3221,
abstract = {We investigate a general class of (black-box) constructions for range extension of weak pseudorandom functions: a construction based on m independent functions F 1,...,F m is given by a set of strings over {1,...,m}*, where for example {〈2〉, 〈1,2〉} corresponds to the function X ↦[F 2(X),F 2(F 1(X))]. All efficient constructions for range expansion of weak pseudorandom functions that we are aware of are of this form.
We completely classify such constructions as good, bad or ugly, where the good constructions are those whose security can be proven via a black-box reduction, the bad constructions are those whose insecurity can be proven via a black-box reduction, and the ugly constructions are those which are neither good nor bad.
Our classification shows that the range expansion from [10] is optimal, in the sense that it achieves the best possible expansion (2 m − 1 when using m keys).
Along the way we show that for weak quasirandom functions (i.e. in the information theoretic setting), all constructions which are not bad – in particular all the ugly ones – are secure.},
author = {Krzysztof Pietrzak and Sjödin, Johan},
pages = {517 -- 533},
publisher = {Springer},
title = {{Range extension for weak PRFs the good the bad and the ugly}},
doi = {10.1007/978-3-540-72540-4_30},
volume = {4515},
year = {2007},
}
@inproceedings{3222,
abstract = {Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs.
Bellare, Impagliazzo and Naor (1997) show that this is also true for protocols where the soundness only holds against computationally bounded provers (e.g. interactive arguments) if the protocol has at most three rounds.
On the other hand, for four rounds they give a protocol where this is no longer the case: the error probability does not decrease below some constant even if the protocol is repeated a polynomial number of times. Unfortunately, this protocol is not very convincing as the communication complexity of each instance of the protocol grows linearly with the number of repetitions, and for such protocols the error does not even decrease for some types of interactive proofs. Noticing this, Bellare et al. construct (a quite artificial) oracle relative to which a four round protocol exists whose communication complexity does not depend on the number of parallel repetitions. This shows that there is no “black-box” error reduction theorem for four round protocols.
In this paper we give the first computationally sound protocol where k-fold parallel repetition does not decrease the error probability below some constant for any polynomial k (and where the communication complexity does not depend on k). The protocol has eight rounds and uses the universal arguments of Barak and Goldreich (2001). We also give another four round protocol relative to an oracle, unlike the artificial oracle of Bellare et al., we just need a generic group. This group can then potentially be instantiated with some real group satisfying some well defined hardness assumptions (we do not know of any candidate for such a group at the moment).},
author = {Krzysztof Pietrzak and Wikström, Douglas},
pages = {86 -- 102},
publisher = {Springer},
title = {{Parallel repetition of computationally sound protocols revisited}},
doi = {10.1007/978-3-540-70936-7_5},
volume = {4392},
year = {2007},
}
@inproceedings{3223,
abstract = {“Hash then encrypt” is an approach to message authentication, where first the message is hashed down using an ε-universal hash function, and then the resulting k-bit value is encrypted, say with a block-cipher. The security of this scheme is proportional to εq2, where q is the number of MACs the adversary can request. As ε is at least 2−k, the best one can hope for is O(q2/2k) security. Unfortunately, such small ε is not achieved by simple hash functions used in practice, such as the polynomial evaluation or the Merkle-Damg ̊ard construction, where ε grows with the message length L.
The main insight of this work comes from the fact that, by using ran- domized message preprocessing via a short random salt p (which must then be sent as part of the authentication tag), we can use the “hash then encrypt” paradigm with suboptimal “practical” ε-universal hash func- tions, and still improve its exact security to optimal O(q2/2k). Specif- ically, by using at most an O(logL)-bit salt p, one can always regain the optimal exact security O(q2/2k), even in situations where ε grows polynomially with L. We also give very simple preprocessing maps for popular “suboptimal” hash functions, namely polynomial evaluation and the Merkle-Damg ̊ard construction.
Our results come from a general extension of the classical Carter- Wegman paradigm, which we believe is of independent interest. On a high level, it shows that public randomization allows one to use the potentially much smaller “average-case” collision probability in place of the “worst-case” collision probability ε.},
author = {Dodis, Yevgeniy and Krzysztof Pietrzak},
pages = {414 -- 433},
publisher = {Springer},
title = {{Improving the security of MACs via randomized message preprocessing}},
doi = {10.1007/978-3-540-74619-5_26},
volume = {4593},
year = {2007},
}
@article{3305,
abstract = {The accumulation of deleterious mutations plays a major role in evolution, and key to this are the interactions between their fitness effects, known as epistasis. Whether mutations tend to interact synergistically (with multiple mutations being more deleterious than would be expected from their individual fitness effects) or antagonistically is important for a variety of evolutionary questions, particularly the evolution of sex. Unfortunately, the experimental evidence on the prevalence and strength of epistasis is mixed and inconclusive. Here we study theoretically whether synergistic or antagonistic epistasis is likely to be favored by evolution and by how much. We find that in the presence of recombination, evolution favors less synergistic or more antagonistic epistasis whenever mutations that change the epistasis in this direction are possible. This is because evolution favors increased buffering against the effects of deleterious mutations. This suggests that we should not expect synergistic epistasis to be widespread in nature and hence that the mutational deterministic hypothesis for the advantage of sex may not apply widely.},
author = {Desai, Michael M and Daniel Weissman and Feldman, Marcus W},
journal = {Genetics},
number = {2},
pages = {1001 -- 10},
publisher = {Genetics Society of America},
title = {{Evolution can favor antagonistic epistasis}},
doi = {10.1534/genetics.107.075812},
volume = {177},
year = {2007},
}
@article{3411,
abstract = {Mechanical single-molecule techniques offer exciting possibilities to investigate protein folding and stability in native environments at submolecular resolution. By applying a free-energy reconstruction procedure developed by Hummer and Szabo, which is based on a statistical theorem introduced by Jarzynski, we determined the unfolding free energy of the membrane proteins bacteriorhodopsin (BR), halorhodopsin, and the sodium-proton antiporter NhaA. The calculated energies ranged from 290.5kcal/mol for BR to 485.5kcal/mol for NhaA. For the remarkably stable BR, the equilibrium unfolding free energy was independent of pulling rate and temperature ranging between 18 and 42°C. Our experiments also revealed heterogeneous energetic properties in individual transmembrane helices. In halorhodopsin, the stabilization of a short helical segment yielded a characteristic signature in the energy profile. In NhaA, a pronounced peak was observed at a functionally important site in the protein. Since a large variety of single- and multispan membrane proteins can be tackled in mechanical unfolding experiments, our approach provides a basis for systematically elucidating energetic properties of membrane proteins with the resolution of individual secondary-structure elements.},
author = {Preiner, Johannes and Harald Janovjak and Rankl, Christian and Knaus, Helene and Cisneros, David A and Kedrov, Alexej and Kienberger, Ferry and Mueller, Daniel J and Hinterdorfer, Peter},
journal = {Biophysical Journal},
number = {3},
pages = {930 -- 937},
publisher = {Biophysical Society},
title = {{Free energy of membrane protein unfolding derived from single-molecule force measurements}},
doi = {10.1529/biophysj.106.096982},
volume = {93},
year = {2007},
}
@misc{3412,
abstract = {Molecular interactions are the basic language of biological processes.
They establish the forces interacting between the building blocks of
proteins and other macromolecules, thus determining their functional
roles. Because molecular interactions trigger virtually every
biological process, approaches to decipher their language are needed.
Single-molecule force spectroscopy (SMFS) has been used to detect
and characterize different types of molecular interactions that occur
between and within native membrane proteins. The first experiments
detected and localized molecular interactions that stabilized
membrane proteins, including how these interactions were established
during folding of α-helical secondary structure elements into
the native protein and how they changed with oligomerization, temperature,
and mutations. SMFS also enables investigators to detect
and locate molecular interactions established during ligand and inhibitor
binding. These exciting applications provide opportunities
for studying the molecular forces of life. Further developments will
elucidate the origins of molecular interactions encoded in their lifetimes,
interaction ranges, interplay, and dynamics characteristic of biological systems.},
author = {Kedrov, Alexej and Harald Janovjak and Sapra, Tanuj K and Mueller, Daniel J},
booktitle = {Annual Review of Biophysics},
pages = {233 -- 260},
publisher = {Annual Reviews},
title = {{Deciphering molecular interactions of native membrane proteins by single-molecule force spectroscopy}},
doi = {10.1146/annurev.biophys.36.040306.132640},
volume = {36},
year = {2007},
}
@article{3427,
abstract = {We present a general theoretical framework to discuss mechanisms of morphogen transport and gradient formation in a cell layer. Trafficking events on the cellular scale lead to transport on larger scales. We discuss in particular the case of transcytosis where morphogens undergo repeated rounds of internalization into cells and recycling. Based on a description on the cellular scale, we derive effective nonlinear transport equations in one and two dimensions which are valid on larger scales. We derive analytic expressions for the concentration dependence of the effective diffusion coefficient and the effective degradation rate. We discuss the effects of a directional bias on morphogen transport and those of the coupling of the morphogen and receptor kinetics. Furthermore, we discuss general properties of cellular transport processes such as the robustness of gradients and relate our results to recent experiments on the morphogen Decapentaplegic (Dpp) that acts in the wing disk of the fruit fly Drosophila.
© 2007 The American Physical Society},
author = {Bollenbach, Mark Tobias and Kruse, Karsten and Pantazis, Periklis and Gonzalez Gaitan, Marcos and Julicher, Frank},
journal = {Physical Review E Statistical Nonlinear and Soft Matter Physics},
number = {1},
publisher = {American Institute of Physics},
title = {{Morphogen transport in epithelia}},
doi = {10.1103/PhysRevE.75.011901},
volume = {75},
year = {2007},
}
@inbook{3432,
abstract = {Evolution has left its signature on the molecules and morphology of living organisms. Ancestral reconstruction offers an excellent tool for understanding the process of evolution using comparative information. Methods for ancestral reconstruction have generally focused on reconstructing the ancestral states at the internal nodes of a phylogeny. Often, we are not interested in particular nodes of the phylogeny but the whole history of a character. This chapter focuses on a Bayesian method for estimating these histories, or mutational paths, on phylogenies. Mutational path methods differ most notably from other approaches in their ability to estimate not only the ancestral states at the internal nodes of a phylogeny, but also the order and timing of mutational changes across the phylogeny. The chapter provides a concise introduction to the statistical tools needed for sampling mutational paths on a phylogeny.},
author = {Jonathan Bollback and Gardner, Paul P and Nielsen, Rasmus},
booktitle = {Ancestral Sequence Reconstruction},
editor = {Liberles, David A},
pages = {69 -- 79},
publisher = {Oxford University Press},
title = {{Estimating the history of mutations on a phylogeny}},
doi = {10.1093/acprof:oso/9780199299188.003.0006},
year = {2007},
}
@article{3436,
abstract = {he potential for di? erences between genetic paternity and paternity inferred from behavioral observation has long been recognized. These di? erences are associated with the challenge for females of seeking both genetic and material bene? ts; this challenge is less severe in species with polygynous, non-resource-based mating systems (such as leks) than in those with resource-based systems. We pres- ent the ? rst study of paternity patt erns in a non-resource-based species that does not form true leks. We compared paternity inferred from observed mating behavior to genetically assigned paternity in the Satin Bowerbird (Ptilonorhynchus violaceus) using eight microsatellite markers. Mating behavior was observed and recorded via automated video-cameras positioned at all bowers (29?34 bowers each year) in the study site throughout each mating season. We obtained blood samples and identi- ? ed mothers for 11 chicks in 9 nests. For all chicks, the most likely genetic father had been observed to mate with the mother in the year the chick was sampled. All most likely genetic fathers were assigned with high con? dence and all were bower- holding males. These results demonstrate that genetic paternity can be inferred from observed mating behavior with reasonable con? dence in Satin Bowerbirds. Observed male mating-success is therefore a reliable predictor of reproductive success, and this suggests that high skew in observed male mating-success translates directly to high skew in reproductive success. },
author = {Reynolds, Sheila M and Dryer, Katie and Jonathan Bollback and Uy, J Albert and Patricelli, Gail L and Robson, Timothy and Borgia, Gerald and Braun, Michael J},
journal = {The Auk},
number = {3},
pages = {857 -- 867},
publisher = {University of California Press},
title = {{Behavioral paternity predicts genetic paternity in satin bowerbirds, a species with a non-resource-based mating system}},
doi = {10.1642/0004-8038(2007)124[857:BPPGPI]2.0.CO;2},
volume = {124},
year = {2007},
}
@article{3450,
author = {Peter Jonas and Buzsáki, György},
journal = {Scholarpedia},
publisher = {Scholarpedia},
title = {{Neural inhibition}},
doi = {10.4249/scholarpedia.3286},
volume = {2},
year = {2007},
}
@article{3523,
abstract = {On the linear track, the recent firing sequences of CA1 place cells recur during sharp wave/ripple patterns (SWRs) in a reverse temporal order [Foster & Wilson (2006) Nature, 440, 680-683]. We have found similar reverse-order reactivation during SWRs in open-field exploration where the firing sequence of cells varied before each SWR. Both the onset times and the firing patterns of cells showed a tendency for reversed sequences during SWRs. These effects were observed for SWRs that occurred during exploration, but not for those during longer immobility periods. Additionally, reverse reactivation was stronger when it was preceded by higher speed (> 5 cm/s) run periods. The trend for reverse-order SWR reactivation was not significantly different in familiar and novel environments, even though SWR-associated firing rates of both pyramidal cells and interneurons were reduced in novel environments as compared with familiar. During exploration-associated SWRs (eSWR) place cells retain place-selective firing [O'Neill et al. (2006) Neuron, 49, 143-155]. Here, we have shown that each cell's firing onset was more delayed and firing probability more reduced during eSWRs the further the rat was from the middle of the cell's place field; that is, cells receiving less momentary place-related excitatory drive fired later during SWR events. However, even controlling for place field distance, the recent firing of cells was still significantly correlated with SWR reactivation sequences. We therefore propose that both place-related drive and the firing history of cells contribute to reverse reactivation during eSWRs.},
author = {Jozsef Csicsvari and Joseph O'Neill and Allen, Kevin and Senior,Timothy},
journal = {European Journal of Neuroscience},
number = {3},
pages = {704 -- 716},
publisher = {Wiley-Blackwell},
title = {{Place-selective firing contributes to the reverse-order reactivation of CA1 pyramidal cells during sharp waves in open-field exploration}},
doi = {10.1111/j.1460-9568.2007.05684.x},
volume = {26},
year = {2007},
}
@inproceedings{3561,
abstract = {The main result of this paper is an extension of de Silva's Weak Delaunay Theorem to smoothly embedded curves and surfaces in Euclidean space. Assuming a sufficiently fine sampling, we prove that i + 1 points in the sample span an i-simplex in the restricted Delaunay triangulation iff every subset of the i + 1 points has a weak witness.},
author = {Attali, Dominique and Herbert Edelsbrunner and Mileyko, Yuriy},
pages = {143 -- 150},
publisher = {ACM},
title = {{Weak witnesses for Delaunay triangulations of submanifolds}},
doi = {10.1145/1236246.1236267},
year = {2007},
}
@inproceedings{3601,
abstract = {In this paper, the multiobjective optimal design of space-based reconfigurable sensor networks with novel adaptive MEMS antennas is investigated by using multiobjective evolutionary algorithms. The non-dominated sorting genetic algorithm II (NSGA-II) is employed to obtain multi-criteria Pareto-optimal solutions, which allows system designers to easily make a reasonable trade-off choice from the set of non-dominated solutions according to their preferences and system requirements. As a case study, a cluster-based satellite sensing network is simulated under multiple objectives. Most importantly, this paper also presents the application of our newly designed adaptive MEMS antennas together with the NSGA-II to the multiobjective optimal design of space-based reconfigurable sensor networks.},
author = {Yang, Erfu and Haridas, Nakul and El-Rayis, Ahmed O and Erdogan, Ahmet T and Arslan, Tughrul and Nicholas Barton},
pages = {27 -- 34},
publisher = {IEEE},
title = {{Multiobjective optimal design of MEMS-based reconfigurable and evolvable sensor networks for space applications}},
doi = {10.1109/AHS.2007.76},
year = {2007},
}
@book{3674,
abstract = {Evolution permeates all of biology. But researchers in molecular and cellular biology, genetics, developmental biology, microbiology, and neuroscience have only recently begun to think seriously in terms of evolution. The chief reasons for this shift are the growing list of organisms with sequenced genomes; the increasingly sophisticated ways of interpreting those sequences; and the ever more powerful experimental techniques (and wider range of model organisms) with which to ask questions about evolution as well as mechanism.
Evolution serves as a primary text for undergraduate and graduate courses in evolution. It is also a text working scientists can use to educate themselves on how evolution affects their fields. It differs from currently available alternatives in containing more molecular biology than is traditionally the case. But this is not at the expense of traditional evolutionary theory. Indeed, a glance at the Table of Contents and the authors' interests reveals the range of material covered in this book. The authors are world-renowned in population genetics, bacterial genomics, paleontology, human genetics, and developmental biology. The integration of molecular biology and evolutionary biology reflects the current direction of much research among evolutionary scientists.},
author = {Barton, Nicholas H and Briggs, Derek and Eisen, Jonathan and Goldstein, David and Patel, Nipam},
publisher = {Wiley-Blackwell},
title = {{Evolution}},
year = {2007},
}
@inproceedings{3681,
abstract = {The extraction of a parametric global motion from a motion field is a task with several applications in video processing. We present two probabilistic formulations of the problem and carry out optimization using the RAST algorithm, a geometric matching method novel to motion estimation in video. RAST uses an exhaustive and adaptive search of transformation space and thus gives – in contrast to local sampling optimization techniques used in the past – a globally optimal solution. Among other applications, our framework can thus be used as a source of ground truth for benchmarking motion estimation algorithms.
Our main contributions are: first, the novel combination of a state-of-the-art MAP criterion for dominant motion estimation with a search procedure that guarantees global optimality. Second, experimental results that illustrate the superior performance of our approach on synthetic flow fields as well as real-world video streams. Third, a significant speedup of the search achieved by extending the model with an additional smoothness prior.},
author = {Ulges, Adrian and Christoph Lampert and Keysers,Daniel and Breuel,Thomas M},
pages = {204 -- 213},
publisher = {Springer},
title = {{Optimal dominant motion estimation using adaptive search of transformation space}},
doi = {10.1007/978-3-540-74936-3_21},
volume = {4713},
year = {2007},
}
@techreport{3687,
abstract = {Recent years have seen huge advances in object recognition from images. Recognition rates beyond 95% are the rule rather than the exception on many datasets. However, most state-of-the-art methods can only decide if an object is present or not. They are not able to provide information on the object location or extent within in the image.
We report on a simple yet powerful scheme that extends many existing recognition methods to also perform localization of object bounding boxes. This is achieved by maximizing the classification score over all possible subrectangles in the image. Despite the impression that this would be computationally intractable, we show that in many situations efficient algorithms exist which solve a generalized maximum subrectangle problem.
We show how our method is applicable to a variety object detection frameworks and demonstrate its performance by applying it to the popular bag of visual words model, achieving competitive results on the PASCAL VOC 2006 dataset.},
author = {Blaschko,Matthew B and Hofmann,Thomas and Christoph Lampert},
booktitle = {Unknown},
number = {164},
publisher = {Max-Planck-Institute for Biological Cybernetics},
title = {{Efficient subwindow search for object localization}},
year = {2007},
}
@inproceedings{3701,
abstract = {The extraction of a parametric global motion from a motion field is a task with several applications in video processing. We present two probabilistic formulations of the problem and carry out optimization using the RAST algorithm, a geometric matching method novel to motion estimation in video. RAST uses an exhaustive and adaptive search of transformation space and thus gives – in contrast to local sampling optimization techniques used in the past – a globally optimal solution. Among other applications, our framework can thus be used as a source of ground truth for benchmarking motion estimation algorithms.
Our main contributions are: first, the novel combination of a state-of-the-art MAP criterion for dominant motion estimation with a search procedure that guarantees global optimality. Second, experimental results that illustrate the superior performance of our approach on synthetic flow fields as well as real-world video streams. Third, a significant speedup of the search achieved by extending the model with an additional smoothness prior.},
author = {Ulges, Adrian and Christoph Lampert and Keysers,Daniel and Breuel,Thomas M},
pages = {204 -- 213},
publisher = {Springer},
title = {{Optimal dominant motion estimation using adaptive search of transformation space}},
doi = {10.1007/978-3-540-74936-3_21},
volume = {4713},
year = {2007},
}
@inproceedings{2333,
author = {Lieb, Élliott H and Robert Seiringer and Solovej, Jan P},
pages = {239 -- 248},
publisher = {American Mathematical Society},
title = {{Ground-state energy of a dilute Fermi gas}},
doi = {10.1090/conm/412},
volume = {412},
year = {2006},
}
@inproceedings{2334,
author = {Robert Seiringer and Lieb, Élliott H and Yngvason, Jakob},
editor = {Zambrini, Jean-Claude},
publisher = {World Scientific Publishing},
title = {{One-dimensional behavior of dilute, trapped Bose gases in traps}},
doi = {10.1007/s00220-003-0993-3},
year = {2006},
}
@misc{2363,
abstract = { We prove that the Gross-Pitaevskii equation correctly describes the ground state energy and corresponding one-particle density matrix of rotating, dilute, trapped Bose gases with repulsive two-body interactions. We also show that there is 100% Bose-Einstein condensation. While a proof that the GP equation correctly describes non-rotating or slowly rotating gases was known for some time, the rapidly rotating case was unclear because the Bose (i.e., symmetric) ground state is not the lowest eigenstate of the Hamiltonian in this case. We have been able to overcome this difficulty with the aid of coherent states. Our proof also conceptually simplifies the previous proof for the slowly rotating case. In the case of axially symmetric traps, our results show that the appearance of quantized vortices causes spontaneous symmetry breaking in the ground state. },
author = {Lieb, Élliott H and Robert Seiringer},
booktitle = {Communications in Mathematical Physics},
number = {2},
pages = {505 -- 537},
publisher = {Springer},
title = {{Derivation of the Gross-Pitaevskii equation for rotating Bose gases}},
doi = {10.1007/s00220-006-1524-9},
volume = {264},
year = {2006},
}
@article{2364,
abstract = {We present an inequality that gives a lower bound on the expectation value of certain two-body interaction potentials in a general state on Fock space in terms of the corresponding expectation value for thermal equilibrium states of non-interacting systems and the difference in the free energy. This bound can be viewed as a rigorous version of first-order perturbation theory for many-body systems at positive temperature. As an application, we give a proof of the first two terms in a high density (and high temperature) expansion of the free energy of jellium with Coulomb interactions, both in the fermionic and bosonic case. For bosons, our method works above the transition temperature (for the non-interacting gas) for Bose-Einstein condensation.},
author = {Robert Seiringer},
journal = {Reviews in Mathematical Physics},
number = {3},
pages = {233 -- 253},
publisher = {World Scientific Publishing},
title = {{A correlation estimate for quantum many-body systems at positive temperature}},
doi = {10.1142/S0129055X06002632},
volume = {18},
year = {2006},
}
@article{2365,
abstract = {We consider a gas of fermions with non-zero spin at temperature T and chemical potential μ. We show that if the range of the interparticle interaction is small compared to the mean particle distance, the thermodynamic pressure differs to leading order from the corresponding expression for non-interacting particles by a term proportional to the scattering length of the interparticle interaction. This is true for any repulsive interaction, including hard cores. The result is uniform in the temperature as long as T is of the same order as the Fermi temperature, or smaller.},
author = {Robert Seiringer},
journal = {Communications in Mathematical Physics},
number = {3},
pages = {729 -- 757},
publisher = {Springer},
title = {{The thermodynamic pressure of a dilute fermi gas}},
doi = {10.1007/s00220-005-1433-3},
volume = {261},
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},
}
@inbook{2368,
abstract = {The recent experimental success in creating Bose-Einstein condensates of alkali atoms, honored by the Nobel prize awards in 2001 [1,5], led to renewed interest in the mathematical description of interacting Bose gases.},
author = {Robert Seiringer},
booktitle = {Large Coulomb Systems},
editor = {Dereziński, Jan and Siedentop, Heinz},
pages = {249 -- 274},
publisher = {Springer},
title = {{Dilute, trapped Bose gases and Bose-Einstein condensation}},
doi = {10.1007/3-540-32579-4_6},
volume = {695},
year = {2006},
}
@inbook{2369,
abstract = {One of the most remarkable recent developments in the study of ultracold Bose gases is the observation of a reversible transition from a Bose Einstein condensate to a state composed of localized atoms as the strength of a periodic, optical trapping potential is varied. In [1] a model of this phenomenon has been analyzed rigorously. The gas is a hard core lattice gas and the optical lattice is modeled by a periodic potential of strength λ. For small λ and temperature Bose- Einstein condensation (BEC) is proved to occur, while at large λ BEC disappears, even in the ground state, which is a Mott-insulator state with a characteristic gap. The inter-particle interaction is essential for this effect. This contribution gives a pedagogical survey of these results.},
author = {Aizenman, Michael and Lieb, Élliott H and Robert Seiringer and Solovej, Jan P and Yngvason, Jakob},
booktitle = {Mathematical Physics of Quantum Mechanics},
editor = {Asch, Joachim and Joye, Alain},
pages = {199 -- 215},
publisher = {Springer},
title = {{Bose-Einstein condensation as a quantum phase transition in an optical lattice}},
doi = {10.1007/b11573432},
volume = {690},
year = {2006},
}
@inbook{2416,
author = {Bang-Jensen, Jørgen and Reed, Bruce and Schacht, Bruce and Šámal, Robert and Toft, Bjarne and Uli Wagner},
booktitle = {Topics in Discrete Mathematics},
pages = {613 -- 627},
publisher = {Springer},
title = {{On six problems posed by Jarik Nešetřil}},
doi = {10.1007/3-540-33700-8_30},
volume = {26},
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},
}
@article{2430,
abstract = {We consider an online version of the conflict-free coloring of a set of points on the line, where each newly inserted point must be assigned a color upon insertion, and at all times the coloring has to be conflict-free, in the sense that in every interval I there is a color that appears exactly once in I. We present deterministic and randomized algorithms for achieving this goal, and analyze their performance, that is, the maximum number of colors that they need to use, as a function of the number n of inserted points. We first show that a natural and simple (deterministic) approach may perform rather poorly, requiring Ω(√̃) colors in the worst case. We then derive two efficient variants of this simple algorithm. The first is deterministic and uses O(log 2 n) colors, and the second is randomized and uses O(log n) colors with high probability. We also show that the O(log 2 n) bound on the number of colors used by our deterministic algorithm is tight on the worst case. We also analyze the performance of the simplest proposed algorithm when the points are inserted in a random order and present an incomplete analysis that indicates that, with high probability, it uses only O(log n) colors. Finally, we show that in the extension of this problem to two dimensions, where the relevant ranges are disks, n colors may be required in the worst case.},
author = {Chent, Ke and Fiat, Amos and Kaplan, Haim and Levy, Meital B and Matoušek, Jiří and Mossel, Elchanan and Pach, János and Sharir, Micha and Smorodinsky, Shakhar and Uli Wagner and Welzl, Emo},
journal = {SIAM Journal on Computing},
number = {5},
pages = {1342 -- 1359},
publisher = {SIAM},
title = {{Online conflict-free coloring for intervals}},
doi = {10.1137/S0097539704446682},
volume = {36},
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{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},
}
@article{2659,
abstract = {Transmembrane AMPA receptor regulatory proteins (TARPs), including stargazin/γ-2, are associated with AMPA receptors and participate in their surface delivery and anchoring at the postsynaptic membrane. TARPs may also act as a positive modulator of the AMPA receptor ion channel function; however, little is known about other TARP members except for stargazin/γ-2. We examined the synaptic localization of stargazin/γ-2 and γ-8 by immunoelectron microscopy and biochemical analysis. The analysis of sodium dodecyl sulfate-digested freeze-fracture replica labeling revealed that stargazin/γ-2 was concentrated in the postsynaptic area, whereas γ-8 was distributed both in synaptic and extra-synaptic plasma membranes of the hippocampal neuron. When a synaptic plasma membrane-enriched brain fraction was treated with Triton X-100 and separated by sucrose density gradient ultracentrifugation, a large proportion of NMDA receptor and stargazin/γ-2 was accumulated in raft-enriched fractions, whereas AMPA receptor and γ-8 were distributed in both the raft-enriched fractions and other Triton-insoluble fractions. Phosphorylation of stargazin/γ-2 and γ-8 was regulated by different sets of kinases and phosphatases in cultured cortical neurons. These results suggested that stargazin/γ-2 and γ-8 have distinct roles in postsynaptic membranes under the regulation of different intracellular signaling pathways.},
author = {Inamura, Mihoko and Itakura, Makoto and Okamoto, Hirotsugu and Hoka, Sumio and Mizoguchi, Akira and Fukazawa, Yugo and Ryuichi Shigemoto and Yamamori, Saori and Takahashi, Masami},
journal = {Neuroscience Research},
number = {1},
pages = {45 -- 53},
publisher = {Elsevier},
title = {{ Differential localization and regulation of stargazin-like protein, γ-8 and stargazin in the plasma membrane of hippocampal and cortical neurons}},
doi = {10.1016/j.neures.2006.01.004},
volume = {55},
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{2661,
abstract = {GABAB receptors are the G protein-coupled receptors for the main inhibitory neurotransmitter in the brain, γ-aminobutyric acid (GABA). Molecular diversity in the GABAB system arises from the GABAB1a and GABAB1b subunit isoforms that solely differ in their ectodomains by a pair of sushi repeats that is unique to GABAB1a. Using a combined genetic, physiological, and morphological approach, we now demonstrate that GABAB1 isoforms localize to distinct synaptic sites and convey separate functions in vivo. At hippocampal CA3-to-CA1 synapses, GABAB1a assembles heteroreceptors inhibiting glutamate release, while predominantly GABAB1b mediates postsynaptic inhibition. Electron microscopy reveals a synaptic distribution of GABAB1 isoforms that agrees with the observed functional differences. Transfected CA3 neurons selectively express GABAB1a in distal axons, suggesting that the sushi repeats, a conserved protein interaction motif, specify heteroreceptor localization. The constitutive absence of GABAB1a but not GABAB1b results in impaired synaptic plasticity and hippocampus-dependent memory, emphasizing molecular differences in synaptic GABAB functions.},
author = {Vigot, Réjan and Barbieri, Samuel and Bräuner-Osborne, Hans and Tureček, Rostislav and Ryuichi Shigemoto and Zhang, Yan Ping and Luján, Rafael and Jacobson, Laura H and Biermann, Barbara and Fritschy, Jean-Marc and Vacher, Claire-Marie and Müller, Matthias P and Sansig, Gilles and Guetg, Nicole and Cryan, John F and Kaupmann, Klemens and Gassmann, Martin and Oertner, Thomas G and Bettler, Bernhard},
journal = {Neuron},
number = {4},
pages = {589 -- 601},
publisher = {Elsevier},
title = {{Differential Compartmentalization and Distinct Functions of GABAB Receptor Variants}},
doi = {10.1016/j.neuron.2006.04.014},
volume = {50},
year = {2006},
}
@article{2662,
abstract = {G-protein-coupled inwardly rectifying K+ channels (Kir3 channels) coupled to metabotropic GABAB receptors are essential for the control of neuronal excitation. To determine the distribution of Kir3 channels and their spatial relationship to GABAB receptors on hippocampal pyramidal cells, we used a high-resolution immunocytochemical approach. Immunoreactivity for the Kir3.2 subunit was most abundant postsynaptically and localized to the extrasynaptic plasma membrane of dendritic shafts and spines of principal cells. Quantitative analysis of immunogold particles for Kir3.2 revealed an enrichment of the protein around putative glutamatergic synapses on dendritic spines, similar to that of GABA B1. Consistent with this observation, a high degree of coclustering of Kir3.2 and GABAB1 was revealed around excitatory synapses by the highly sensitive SDS-digested freeze-fracture replica immunolabeling. In contrast, in dendritic shafts receptors and channels were found to be mainly segregated. These results suggest that Kir3.2-containing K+ channels on dendritic spines preferentially mediate the effect of GABA, whereas channels on dendritic shafts are likely to be activated by other neurotransmitters as well. Thus, Kir3 channels, localized to different subcellular compartments of hippocampal principal cells, appear to be differentially involved in synaptic integration in pyramidal cell dendrites.},
author = {Kulik, Ákos and Vida, Imre and Fukazawa, Yugo and Guetg, Nicole and Kasugai, Yu and Marker, Cheryl L and Rigato, Franck and Bettler, Bernhard and Wickman, Kevin D and Frotscher, Michael and Ryuichi Shigemoto},
journal = {Journal of Neuroscience},
number = {16},
pages = {4289 -- 4297},
publisher = {Society for Neuroscience},
title = {{Compartment-dependent colocalization of Kir3.2-containing K+ channels and GABAB receptors in hippocampal pyramidal cells}},
doi = {10.1523/JNEUROSCI.4178-05.2006},
volume = {26},
year = {2006},
}
@article{2663,
abstract = {The rocker mice are hereditary ataxic mutants that carry a point mutation in the gene encoding the CaV2.1 (P/Q-type) Ca2+ channel α1 subunit, and show the mildest symptoms among the reported CaV2.1 mutant mice. We studied the basic characteristics of the rocker mutant Ca2+ channel and their impacts on excitatory synaptic transmission in cerebellar Purkinje cells (PCs). In acutely dissociated PC somas, the rocker mutant channel showed a moderate reduction in Ca2+ channel current density, whereas its kinetics and voltage dependency of gating remained nearly normal. Despite the small changes in channel function, synaptic transmission in the parallel fiber (PF)-PC synapses was severely impaired. The climbing fiber inputs onto PCs showed a moderate impairment but could elicit normal complex spikes. Presynaptic function of the PF-PC synapses, however, was unexpectedly almost normal in terms of paired-pulse facilitation, sensitivity to extracellular Ca2+ concentration and glutamate concentration in synaptic clefts. Electron microscopic analyses including freeze-fracture replica labeling revealed that both the number and density of postsynaptic α-amino-3-hydroxy-5-methyl-4-isoxazolepropionic acid (AMPA) receptors substantially decreased without gross structural changes of the PF-PC synapses. We also observed an abnormal arborization of PC dendrites in young adult rocker mice (∼ 1 month old). These lines of evidence suggest that even a moderate dysfunction of CaV2.1 Ca2+ channel can cause substantial changes in postsynaptic molecular composition of the PF-PC synapses and dendritic structure of PCs.},
author = {Kodama, Takashi and Itsukaichi-Nishida, Yuko and Fukazawa, Yugo and Wakamori, Minoru and Miyata, Mariko and Molnár, Elek and Mori, Yasuo and Ryuichi Shigemoto and Imoto, Keiji},
journal = {European Journal of Neuroscience},
number = {11},
pages = {2993 -- 3007},
publisher = {Wiley-Blackwell},
title = {{A CaV2.1 calcium channel mutation rocker reduces the number of postsynaptic AMPA receptors in parallel fiber-Purkinje cell synapses}},
doi = {10.1111/j.1460-9568.2006.05191.x},
volume = {24},
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},
}
@article{2745,
abstract = {We consider the dynamics of N boson systems interacting through a pair potential N -1 V a (x i -x j ) where V a (x)=a -3 V(x/a). We denote the solution to the N-particle Schrödinger equation by Ψ N, t . Recall that the Gross-Pitaevskii (GP) equation is a nonlinear Schrödinger equation and 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 [InlineMediaObject not available: see fulltext.] solves the GP hierarchy. Under the assumption that a = Nε for 0 < ε < 3/5, we prove that as N→∞ the limit points of the k-particle density matrices of Ψ N, t are solutions of the GP hierarchy with the coupling constant in the nonlinear term of the GP equation given by ∫ V (x)dx. The uniqueness of the solutions of this hierarchy remains an open question.},
author = {Elgart, Alexander and László Erdös and Schlein, Benjamin and Yau, Horng-Tzer},
journal = {Archive for Rational Mechanics and Analysis},
number = {2},
pages = {265 -- 283},
publisher = {Springer},
title = {{Gross-Pitaevskii equation as the mean field limit of weakly coupled bosons}},
doi = {10.1007/s00205-005-0388-z},
volume = {179},
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{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{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{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{2894,
abstract = {IL-10 is a potent anti-inflammatory and immunomodulatory cytokine, exerting major effects in the degree and quality of the immune response. Using a newly generated IL-10 reporter mouse model, which easily allows the study of IL-10 expression from each allele in a single cell, we report here for the first time that IL-10 is predominantly monoallelic expressed in CD4+ T cells. Furthermore, we have compelling evidence that this expression pattern is not due to parental imprinting, allelic exclusion, or strong allelic bias. Instead, our results support a stochastic regulation mechanism, in which the probability to initiate allelic transcription depends on the strength of TCR signaling and subsequent capacity to overcome restrictions imposed by chromatin hypoacetylation. In vivo Ag-experienced T cells show a higher basal probability to transcribe IL-10 when compared with naive cells, yet still show mostly monoallelic IL-10 expression. Finally, statistical analysis on allelic expression data shows transcriptional independence between both alleles. We conclude that CD4+ T cells have a low probability for IL-10 allelic activation resulting in a predominantly monoallelic expression pattern, and that IL-10 expression appears to be stochastically regulated by controlling the frequency of expressing cells, rather than absolute protein levels per cell.},
author = {Calado, Dinis P and Tiago Paixao and Holmberg, Dan and Haury, Matthias},
journal = {Journal of Immunology},
number = {8},
pages = {5358 -- 5364},
publisher = {American Association of Immunologists},
title = {{Stochastic Monoallelic Expression of IL 10 in T Cells}},
doi = {10.4049/jimmunol.177.8.5358 },
volume = {177},
year = {2006},
}
@inbook{2921,
abstract = {Most binocular stereo algorithms assume that all scene elements are visible from both cameras. Scene elements that are visible from only one camera, known as occlusions, pose an important challenge for stereo. Occlusions are important for segmentation, because they appear near discontinuities. However, stereo algorithms tend to ignore occlusions because of their difficulty. One reason is that occlusions require the input images to be treated symmetrically, which complicates the problem formulation. Worse, certain depth maps imply physically impossible scene configurations, and must be excluded from the output. In this chapter we approach the problem of binocular stereo with occlusions from an energy minimization viewpoint. We begin by reviewing traditional stereo methods that do not handle occlusions. If occlusions are ignored, it is easy to formulate the stereo problem as a pixel labeling problem, which leads to an energy function that is common in early vision. This kind of energy function can he minimized using graph cuts, which is a combinatorial optimization technique that has proven to be very effective for low-level vision problems. Motivated by this, we have designed two graph cut stereo algorithms that are designed to handle occlusions. These algorithms produce promising experimental results on real data with ground truth.},
author = {Vladimir Kolmogorov and Zabih, Ramin},
booktitle = {Handbook of Mathematical Models in Computer Vision},
pages = {423 -- 427},
publisher = {Springer},
title = {{Graph cut algorithms for binocular stereo with occlusions}},
doi = {10.1007/0-387-28831-7_26},
year = {2006},
}
@article{8488,
abstract = {We demonstrate for different protein samples that three-dimensional HNCO and HNCA correlation spectra may be recorded in a few minutes acquisition time using the band-selective excitation short-transient sequences presented here. This opens new perspectives for the NMR structural investigation of unstable protein samples and real-time site-resolved studies of protein kinetics.},
author = {Schanda, Paul and Van Melckebeke, Hélène and Brutscher, Bernhard},
issn = {0002-7863},
journal = {Journal of the American Chemical Society},
keywords = {Colloid and Surface Chemistry, Biochemistry, General Chemistry, Catalysis},
number = {28},
pages = {9042--9043},
publisher = {American Chemical Society},
title = {{Speeding up three-dimensional protein NMR experiments to a few minutes}},
doi = {10.1021/ja062025p},
volume = {128},
year = {2006},
}