Oblivious transfer and quantum channels as communication resources

We show that from a communication-complexity perspective, the primitive called oblivious transfer—which was introduced in a cryptographic context—can be seen as the classical analogue to a quantum channel in the same sense as non-local boxes are of maximally entangled qubits. More explicitly, one realization of non-cryptographic oblivious transfer allows for the perfect simulation of sending one qubit and measuring it in an orthogonal basis. On the other hand, a qubit channel allows for realizing non-cryptographic oblivious transfer with probability roughly 85 %, whereas 75 % is the classical limit.     

Interactive Volume Rendering with Dynamic Ambient Occlusion and Color Bleeding

We propose a method for rendering volumetric data sets at interactive frame rates while supporting dynamic ambient occlusion as well as an approximation to color bleeding. In contrast to ambient occlusion approaches for polygonal data, techniques for volumetric data sets have to face additional challenges, since by changing rendering parameters, such as the transfer function or the thresholding, the structure of the data set and thus the light interactions may vary drastically. Therefore, during a preprocessing step which is independent of the rendering parameters we capture light interactions for all combinations of structures extractable from a volumetric data set. In order to compute the light interactions between the different structures, we combine this preprocessed information during rendering based on the rendering parameters defined interactively by the user. Thus our method supports interactive exploration of a volumetric data set but still gives the user control over the most important rendering parameters. For instance, if the user alters the transfer function to extract different structures from a volumetric data set the light interactions between the extracted structures are captured in the rendering while still allowing interactive frame rates. Compared to known local illumination models for volume rendering our method does not introduce any substantial rendering overhead and can be integrated easily into existing volume rendering applications. In this paper we will explain our approach, discuss the implications for interactive volume rendering and present the achieved results.     

Fixed-Parameter Complexity of Minimum Profile Problems

The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supergraph. Since computing the profile of a graph is an NP-hard problem, we consider parameterized versions of the problem. Namely, we study the problem of deciding whether the profile of a connected graph of order n is at most n−1+k, considering k as the parameter; this is a parameterization above guaranteed value, since n−1 is a tight lower bound for the profile. We present two fixed-parameter algorithms for this problem. The first algorithm is based on a forbidden subgraph characterization of interval graphs. The second algorithm is based on two simple kernelization rules which allow us to produce a kernel with linear number of vertices and edges. For showing the correctness of the second algorithm we need to establish structural properties of graphs with small profile which are of independent interest. A preliminary version of the paper is published in Proc. IWPEC 2006, LNCS vol. 4169, 60–71.     

The high-conductance state of cortical networks

We studied the dynamics of large networks of spiking neurons with conductance-based (nonlinear) synapses and compared them to networks with current-based (linear) synapses. For systems with sparse and inhibition-dominated recurrent connectivity, weak external inputs induced asynchronous irregular firing at low rates. Membrane potentials fluctuated a few millivolts below threshold, and membrane conductances were increased by a factor 2 to 5 with respect to the resting state. This combination of parameters characterizes the ongoing spiking activity typically recorded in the cortex in vivo. Many aspects of the asynchronous irregular state in conductance-based networks could be sufficiently well characterized with a simple numerical mean field approach. In particular, it correctly predicted an intriguing property of conductance-based networks that does not appear to be shared by current-based models: they exhibit states of low-rate asynchronous irregular activity that persist for some period of time even in the absence of external inputs and without cortical pacemakers. Simulations of larger networks (up to 350,000 neurons) demonstrated that the survival time of self-sustained activity increases exponentially with network size.     

Zeolite based trace humidity sensor for high temperature applications in hydrogen atmosphere

We present a humidity sensor based on H-ZSM-5 type zeolite that is suitable to detect traces of humidity (10–110 ppm_V) under harsh conditions, e.g. reducing atmosphere (H₂) and high temperature (up to 600 °C). By means of complex impedance spectroscopy (IS) we show that the zeolite sensor responds linearly towards minimal changes in humidity. Therefore this result indicates that the zeolite sensor is capable to detect traces of humidity in processes where high temperatures in a hydrogen environment are required.     

Near optimum sampling design and an efficient algorithm for single tone frequency estimation

Work on single tone frequency estimation has focused on uniformly sampled data. However, it has been shown that, for a given number of samples, more information on the frequency of a signal can be gained by non-uniform sampling schemes [M. Wieler, S. Trittler, F.A. Hamprecht, Optimal design for single tone frequency estimation, Digital Signal Process., in press]. Unfortunately, an optimum sampling pattern (that, for example, minimizes the Cramér–Rao bound) does not automatically have a fast and simple algorithm for frequency estimation associated with it. For application in an interferometric measurement system, an algorithm is needed that gathers as much information as possible from a low number of samples, while at the same time keeping the computational effort sufficiently low to process millions of time series in a few seconds. This paper proposes a simple approximation to the optimum sampling pattern by using uniformly sampled blocks of data and further proposes to estimate phase and frequency in each of these blocks and to exploit these intermediate results in the final estimation. An approach to do so is investigated in detail. Results are compared to the Cramér–Rao bound (CRB), and it is shown that this algorithm almost reaches this limit on the variance of unbiased estimators, at a computational complexity lower than that of a typical FFT-based approach. For $M=32$ samples and a signal-to-noise ratio of 10, the standard deviation of the frequency estimate is lower by more than 50% compared to uniform sampling. In addition, the algorithm can easily be applied to poorly characterized systems, e.g. systems for which the noise is not known exactly. Finally, we demonstrate that the proposed strategy yields results that are within 3% of the theoretically achievable accuracy for the theoretically optimum sampling pattern.     

Resolution of singularities for multi-loop integrals

We report on a program for the numerical evaluation of divergent multi-loop integrals. The program is based on iterated sector decomposition. We improve the original algorithm of Binoth and Heinrich such that the program is guaranteed to terminate. The program can be used to compute numerically the Laurent expansion of divergent multi-loop integrals regulated by dimensional regularisation. The symbolic and the numerical steps of the algorithm are combined into one program.

Program summary

Program title: sector_decompositionCatalogue identifier: AEAG_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEAG_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 47 506No. of bytes in distributed program, including test data, etc.: 328 485Distribution format: tar.gzProgramming language: C++Computer: allOperating system: UnixRAM: Depending on the complexity of the problemClassification: 4.4External routines: GiNaC, available from http://www.ginac.de, GNU scientific library, available from http://www.gnu.org/software/gslNature of problem: Computation of divergent multi-loop integrals.Solution method: Sector decomposition.Restrictions: Only limited by the available memory and CPU time.Running time: Depending on the complexity of the problem.     

Functionally essential, invariant glutamate near the C-terminus of strand {beta}5 in various ({alpha}/{beta})8-barrel enzymes as a possible indicator of their evolutionary relatedness

Twelve different (/ß)₈-barrel enzymes belonging tothree structurally distinct families were found to contain,near the C-terminus of their strand ß5, a conservedinvariant glutamic acid residue that plays an important functionalrole in each of these enzymes. The search was based on the ideathat a conserved sequence region of an (/ß)₈-barrelenzyme should be more or less conserved also in the equivalentpart of the structure of the other enzymes with this foldingmotif owing to their mutual evolutionary relatedness. For thispurpose, the sequence region around the well conserved fifthß-strand of a-amylase containing catalytic glutamate(Glu230, Aspergillus oryzae -amylase numbering), was used asthe sequence-structural template. The isolated sequence stretchesof the 12 (/ß)₈-barrels are discussed from both thesequence-structural and the evolutionary point of view, theinvariant glutamate residue being proposed to be a joining featureof the studied group of enzymes remaining from their ancestral(/ß)₈-barrel     

Covalent Adaptable Microstructures via Combining Two-Photon Laser Printing and Alkoxyamine Chemistry: Toward Living 3D Microstructures

Manufacturing programmable materials, whose mechanical properties can be adapted on demand, is highly desired for their application in areas ranging from robotics, to biomedicine, or microfluidics. Herein, the inclusion of dynamic and living bonds, such as alkoxyamines, in a printable formulation suitable for two-photon 3D laser printing is exploited. On one hand, taking advantage of the dynamic covalent character of alkoxyamines, the nitroxide exchange reaction is investigated. As a consequence, a reduction of the Young´s Modulus by 50%, is measured by nanoindentation. On the other hand, due to its “living” characteristic, the chain extension becomes possible via nitroxide mediated polymerization. In particular, living nitroxide mediated polymerization of styrene results not only in a dramatic increase of the volume (≈8 times) of the 3D printed microstructure but also an increase of the Young's Modulus by two orders of magnitude (from 14 MPa to 2.7 GPa), while maintaining the shape including fine structural details. Thus, the approach introduces a new dimension by enabling to create microstructures with dynamically tunable size and mechanical properties.