@article{4345, abstract = {Der Artikel beschäftigt sich mit dem Konzept der Bibliothek 2.0 (bzw. Library 2.0). Er skizziert anhand einiger Beispiele die Entwicklung zum Web 2.0 und beschreibt, wie Web 2.0-Technologien und -Anwendungen in Bibliotheken eingesetzt werden. Im Mittelpunkt stehen Social-Tagging-Systeme, benutzerorientierte Erweiterungen von Bibliothekskatalogen und Dokumentenservern sowie der Einsatz von Weblogs an Bibliotheken. Ferner werden neue Anforderungen an Bibliothekare diskutiert.}, author = {Danowski, Patrick and Heller, Lambert}, journal = {Bibliotheksdienst}, number = {11}, pages = {1250 -- 1271}, publisher = {De Gruyter}, title = {{Bibliothek 2.0 - Die Bibliothek der Zukunft?}}, doi = {10.1515/bd.2006.40.11.1259}, volume = {40}, year = {2006}, } @inproceedings{4359, abstract = {We introduce field constraint analysis, a new technique for verifying data structure invariants. A field constraint for a field is a formula specifying a set of objects to which the field can point. Field constraints enable the application of decidable logics to data structures which were originally beyond the scope of these logics, by verifying the backbone of the data structure and then verifying constraints on fields that cross-cut the backbone in arbitrary ways. Previously, such cross-cutting fields could only be verified when they were uniquely determined by the backbone, which significantly limits the range of analyzable data structures. Field constraint analysis permits non-deterministic field constraints on cross-cutting fields, which allows the verificiation of invariants for data structures such as skip lists. Non-deterministic field constraints also enable the verification of invariants between data structures, yielding an expressive generalization of static type declarations. The generality of our field constraints requires new techniques. We present one such technique and prove its soundness. We have implemented this technique as part of a symbolic shape analysis deployed in the context of the Hob system for verifying data structure consistency. Using this implementation we were able to verify data structures that were previously beyond the reach of similar techniques.}, author = {Wies, Thomas and Kuncak, Viktor and Lam, Patrick and Podelski, Andreas and Rinard, Martin}, booktitle = {7th International Conference on Verification, Model Checking, and Abstract Interpretation}, location = {Charleston, SC, United States}, pages = {157 -- 173}, publisher = {Springer}, title = {{Field constraint analysis}}, doi = {10.1007/11609773_11}, volume = {3855}, year = {2006}, } @inproceedings{4373, abstract = {This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that timed languages specified by the past fragment of mitl, can be accepted by deterministic timed automata. On the other hand we provide a proof that certain languages expressed in the future fragment of mitl are not deterministic, and analyze the reason for this asymmetry.}, author = {Maler, Oded and Nickovic, Dejan and Pnueli, Amir}, booktitle = {Third International Conference on Formal Modeling and Analysis of Timed Systems}, location = {Uppsala, Sweden}, pages = {2 -- 16}, publisher = {Springer}, title = {{Real time temporal logic: Past, present, future}}, doi = {10.1007/11603009_2}, volume = {3829}, year = {2006}, } @inproceedings{4374, abstract = {We show how to transform formulae written in the real-time temporal logic MITL into timed automata that recognize their satisfying models. This compositional construction is much simpler than previously known and can be easily implemented.}, author = {Maler, Oded and Nickovic, Dejan and Pnueli, Amir}, booktitle = {4th International Conference on Formal Modeling and Analysis of Timed Systems}, location = {Paris, France}, pages = {274 -- 289}, publisher = {Springer}, title = {{From MITL to timed automata}}, doi = {10.1007/11867340_20}, volume = {4202}, year = {2006}, } @inproceedings{4401, abstract = {We propose a general framework of secrecy and preservation of secrecy for labeled transition systems. Our definition of secrecy is parameterized by the distinguishing power of the observer, the properties to be kept secret, and the executions of interest, and captures a multitude of definitions in the literature. We define a notion of secrecy preserving refinement between systems by strengthening the classical trace-based refinement so that the implementation leaks a secret only when the specification also leaks it. We show that secrecy is in general not definable in μ-calculus, and thus not expressible in specification logics supported by standard model-checkers. However, we develop a simulation-based proof technique for establishing secrecy preserving refinement. This result shows how existing refinement checkers can be used to show correctness of an implementation with respect to a specification.}, author = {Alur, Rajeev and Cerny, Pavol and Zdancewic, Steve}, booktitle = {33rd International Colloquium on Automata, Languages and Programming}, pages = {107 -- 118}, publisher = {Springer}, title = {{Preserving secrecy under refinement}}, doi = {10.1007/11787006_10}, volume = {4052}, year = {2006}, } @unpublished{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 = {Hosten, Onur and Rakher, Matthew and Barreiro, Julio and Peters, Nicholas and Kwiat, Paul}, pages = {12}, publisher = {ArXiv}, title = {{Counterfactual computation revisited}}, doi = {10.48550/arXiv.quant-ph/0607101}, year = {2006}, } @unpublished{574, abstract = {Vaidman, in a recent article adopts the method of 'quantum weak measurements in pre- and postselected ensembles' to ascertain whether or not the chained-Zeno counterfactual computation scheme proposed by Hosten et al. is counterfactual; which has been the topic of a debate on the definition of counterfactuality. We disagree with his conclusion, which brings up some interesting aspects of quantum weak measurements and some concerns about the way they are interpreted. }, author = {Hosten, Onur and Kwiat, Paul}, pages = {2}, publisher = {ArXiv}, title = {{Weak measurements and counterfactual computation}}, doi = {10.48550/arXiv.quant-ph/0612159}, year = {2006}, } @inproceedings{577, abstract = {Visible light photon counters (VLPCs) and solid-state photomultipliers (SSPMs) are high-efficiency single-photon detectors which have multi-photon counting capability. While both the VLPCs and the SSPMs have inferred internal quantum efficiencies above 93%, the actual measured values for both the detectors were in fact limited to less than 88%, attributed to in-coupling losses. We are currently improving this overall detection efficiency via a) custom anti-reflection coating the detectors and the in-coupling fibers, b) implementing a novel cryogenic design to reduce transmission losses and, c) using low-noise electronics to obtain a better signal-to-noise ratio.}, author = {Rangarajan, Radhika and Altepeter, Joseph and Jeffrey, Evan and Stoutimore, Micah and Peters, Nicholas and Hosten, Onur and Kwiat, Paul}, booktitle = {Optics East}, issn = {0277-786X}, location = {Boston, Massachusetts, United States}, publisher = {SPIE}, title = {{High-efficiency single-photon detectors}}, doi = {10.1117/12.686117}, 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 and Arnold, Keith and Vandevender, Aaron and Jeffrey, Evan and Rangarajan, Radhika and Hosten, Onur and Barreiro, Julio and Altepeter, Joseph and Kwiat, Paul}, booktitle = {Quantum Communications and Quantum Imaging IV}, location = {San DIego, CA, United States}, publisher = {SPIE}, title = {{Towards a quasi-deterministic single-photon source}}, doi = {10.1117/12.684702}, volume = {6305}, year = {2006}, } @article{579, abstract = {The logic underlying the coherent nature of quantum information processing often deviates from intuitive reasoning, leading to surprising effects. Counterfactual computation constitutes a striking example: the potential outcome of a quantum computation can be inferred, even if the computer is not run 1. Relying on similar arguments to interaction-free measurements 2 (or quantum interrogation3), counterfactual computation is accomplished by putting the computer in a superposition of 'running' and 'not running' states, and then interfering the two histories. Conditional on the as-yet-unknown outcome of the computation, it is sometimes possible to counterfactually infer information about the solution. Here we demonstrate counterfactual computation, implementing Grover's search algorithm with an all-optical approach4. It was believed that the overall probability of such counterfactual inference is intrinsically limited1,5, so that it could not perform better on average than random guesses. However, using a novel 'chained' version of the quantum Zeno effect6, we show how to boost the counterfactual inference probability to unity, thereby beating the random guessing limit. Our methods are general and apply to any physical system, as illustrated by a discussion of trapped-ion systems. Finally, we briefly show that, in certain circumstances, counterfactual computation can eliminate errors induced by decoherence. }, author = {Hosten, Onur and Rakher, Matthew and Barreiro, Julio and Peters, Nicholas and Kwiat, Paul}, issn = {1476-4687}, journal = {Nature}, number = {7079}, pages = {949 -- 952}, publisher = {Nature Publishing Group}, title = {{Counterfactual quantum computation through quantum interrogation}}, doi = {10.1038/nature04523}, volume = {439}, year = {2006}, } @inproceedings{583, abstract = {Visible light photon counters (VLPCs) and solid-state photomultipliers (SSPMs) facilitate efficient single-photon detection. We are attempting to improve their efficiency, previously limited to < 88% by coupling losses, via anti-reflection coatings, better electronics and cryogenics.}, author = {Rangarajan, Radhika and Peters, Nicholas and Hosten, Onur and Altepeter, Joseph and Jeffrey, Evan and Kwiat, Paul}, booktitle = {Conference on Lasers and Electro-Optics}, issn = {2160-9004}, location = {Long Beach, CA, United States}, publisher = {IEEE}, title = {{Improved single-photon detection}}, doi = {10.1109/CLEO.2006.4628641}, year = {2006}, } @article{6151, author = {Salecker, Iris and Häusser, Michael and de Bono, Mario}, issn = {1469-221X}, journal = {EMBO reports}, number = {6}, pages = {585--589}, publisher = {Wiley}, title = {{On the axonal road to circuit function and behaviour: Workshop on the assembly and function of neuronal circuits}}, doi = {10.1038/sj.embor.7400713}, volume = {7}, year = {2006}, } @article{6152, author = {Rogers, Candida and Persson, Annelie and Cheung, Benny and de Bono, Mario}, issn = {0960-9822}, journal = {Current Biology}, number = {7}, pages = {649--659}, publisher = {Elsevier}, title = {{Behavioral motifs and neural pathways coordinating O2 responses and aggregation in C. elegans}}, doi = {10.1016/j.cub.2006.03.023}, volume = {16}, year = {2006}, } @article{2066, abstract = {Although the X chromosome is usually similar to the autosomes in size and cytogenetic appearance, theoretical models predict that its hemizygosity in males may cause unusual patterns of evolution. The sequencing of several genomes has indeed revealed differences between the X chromosome and the autosomes in the rates of gene divergence, patterns of gene expression and rates of gene movement between chromosomes. A better understanding of these patterns should provide valuable information on the evolution of genes located on the X chromosome. It could also suggest solutions to more general problems in molecular evolution, such as detecting selection and estimating mutational effects on fitness}, author = {Beatriz Vicoso and Charlesworth, Brian}, journal = {Nature Reviews Genetics}, number = {8}, pages = {645 -- 653}, publisher = {Nature Publishing Group}, title = {{Evolution on the X chromosome: Unusual patterns and processes}}, doi = {10.1038/nrg1914}, volume = {7}, year = {2006}, } @inproceedings{2077, abstract = {We present an adaptive animation method for electrical discharges. Electrical discharges can be simulated using the dielectric breakdown model. Regular discretization of the governing Laplace equation leads to huge equation systems, and the computational cost of solving the equations quickly becomes prohibitive at high resolutions, especially for simulations in 3D. In contrast, our method discretizes the Laplace equation on an adaptive octree, reducing the size of the problem significantly, and making simulations of high resolution 3D datasets and even 3D animations feasible. In order to enhance realism for lightning animations, we propose a particle simulation that animates the residual positive charge. Thus, interaction of electrical discharges with their surroundings can be simulated.}, author = {Bernd Bickel and Wicke, Martin and Gross, Markus}, publisher = {IOS Press}, title = {{Adaptive simulation of electrical discharges}}, year = {2006}, } @article{1033, abstract = {Systems of three interacting particles are notorious for their complex physical behaviour. A landmark theoretical result in few-body quantum physics is Efimov\'s prediction1,2 of a universal set of bound trimer states appearing for three identical bosons with a resonant two-body interaction. Counterintuitively, these states even exist in the absence of a corresponding two-body bound state. Since the formulation of Efimov\'s problem in the context of nuclear physics 35 years ago, it has attracted great interest in many areas of physics3-8. However, the observation of Efimov quantum states has remained an elusive goal3,5. Here we report the observation of an Efimov resonance in an ultracold gas of caesium atoms. The resonance occurs in the range of large negative two-body scattering lengths, arising from the coupling of three free atoms to an Efimov trimer. Experimentally, we observe its signature as a giant three-body recombination loss9,10 when the strength of the two-body interaction is varied. We also detect a minimum 9,11,12 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 with which to explore the universal properties of resonantly interacting few-body systems7. While Feshbach resonances13,14 have provided the key to control quantum-mechanical interactions on the two-body level, Efimov resonances connect ultracold matter15 to the world of few-body quantum phenomena.}, author = {Kraemer, Tobias and Mark, Michael and Waldburger, Philipp and Danzl, Johann G and Chin, Cheng and Engeser, Bastian and Lange, Adam and Pilch, Karl and Jaakkola, Antti and Nägerl, Hanns and Grimm, Rudolf}, journal = {Nature}, number = {7082}, pages = {315 -- 318}, publisher = {Nature Publishing Group}, title = {{Evidence for Efimov quantum states in an ultracold gas of caesium atoms}}, doi = {10.1038/nature04626}, volume = {440}, year = {2006}, } @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 and Kraemer, Tobias and Mark, Michael and Waldburger, Philipp and Danzl, Johann G and Engeser, Bastian and Lange, Adam 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{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}, } @article{8489, abstract = {Structure elucidation of proteins by either NMR or X‐ray crystallography often requires the screening of a large number of samples for promising protein constructs and optimum solution conditions. For large‐scale screening of protein samples in solution, robust methods are needed that allow a rapid assessment of the folding of a polypeptide under diverse sample conditions. Here we present HET‐SOFAST NMR, a highly sensitive new method for semi‐quantitative characterization of the structural compactness and heterogeneity of polypeptide chains in solution. On the basis of one‐dimensional 1H HET‐SOFAST NMR data, obtained on well‐folded, molten globular, partially‐ and completely unfolded proteins, we define empirical thresholds that can be used as quantitative benchmarks for protein compactness. For 15N‐enriched protein samples, two‐dimensional 1H‐15N HET‐SOFAST correlation spectra provide site‐specific information about the structural heterogeneity along the polypeptide chain.}, author = {Schanda, Paul and Forge, Vincent and Brutscher, Bernhard}, issn = {0749-1581}, journal = {Magnetic Resonance in Chemistry}, number = {S1}, pages = {S177--S184}, publisher = {Wiley}, title = {{HET-SOFAST NMR for fast detection of structural compactness and heterogeneity along polypeptide chains}}, doi = {10.1002/mrc.1825}, volume = {44}, year = {2006}, } @article{8490, abstract = {We demonstrate the feasibility of recording 1H–15N correlation spectra of proteins in only one second of acquisition time. The experiment combines recently proposed SOFAST-HMQC with Hadamard-type 15N frequency encoding. This allows site-resolved real-time NMR studies of kinetic processes in proteins with an increased time resolution. The sensitivity of the experiment is sufficient to be applicable to a wide range of molecular systems available at millimolar concentration on a high magnetic field spectrometer.}, author = {Schanda, Paul and Brutscher, Bernhard}, issn = {1090-7807}, journal = {Journal of Magnetic Resonance}, keywords = {Nuclear and High Energy Physics, Biophysics, Biochemistry, Condensed Matter Physics}, number = {2}, pages = {334--339}, publisher = {Elsevier}, title = {{Hadamard frequency-encoded SOFAST-HMQC for ultrafast two-dimensional protein NMR}}, doi = {10.1016/j.jmr.2005.10.007}, volume = {178}, year = {2006}, }