@inproceedings{1098, abstract = {Better understanding of the potential benefits of information transfer and representation learning is an important step towards the goal of building intelligent systems that are able to persist in the world and learn over time. In this work, we consider a setting where the learner encounters a stream of tasks but is able to retain only limited information from each encountered task, such as a learned predictor. In contrast to most previous works analyzing this scenario, we do not make any distributional assumptions on the task generating process. Instead, we formulate a complexity measure that captures the diversity of the observed tasks. We provide a lifelong learning algorithm with error guarantees for every observed task (rather than on average). We show sample complexity reductions in comparison to solving every task in isolation in terms of our task complexity measure. Further, our algorithmic framework can naturally be viewed as learning a representation from encountered tasks with a neural network.}, author = {Pentina, Anastasia and Urner, Ruth}, location = {Barcelona, Spain}, pages = {3619--3627}, publisher = {Neural Information Processing Systems Foundation}, title = {{Lifelong learning with weighted majority votes}}, volume = {29}, year = {2016}, } @inproceedings{1099, abstract = {We present FlexMolds, a novel computational approach to automatically design flexible, reusable molds that, once 3D printed, allow us to physically fabricate, by means of liquid casting, multiple copies of complex shapes with rich surface details and complex topology. The approach to design such flexible molds is based on a greedy bottom-up search of possible cuts over an object, evaluating for each possible cut the feasibility of the resulting mold. We use a dynamic simulation approach to evaluate candidate molds, providing a heuristic to generate forces that are able to open, detach, and remove a complex mold from the object it surrounds. We have tested the approach with a number of objects with nontrivial shapes and topologies.}, author = {Malomo, Luigi and Pietroni, Nico and Bickel, Bernd and Cignoni, Paolo}, location = {Macao, China}, number = {6}, publisher = {ACM}, title = {{FlexMolds: Automatic design of flexible shells for molding}}, doi = {10.1145/2980179.2982397}, volume = {35}, year = {2016}, } @article{1101, abstract = {Optical sensors based on the phenomenon of Förster resonance energy transfer (FRET) are powerful tools that have advanced the study of small molecules in biological systems. However, sensor construction is not trivial and often requires multiple rounds of engineering or an ability to screen large numbers of variants. A method that would allow the accurate rational design of FRET sensors would expedite the production of biologically useful sensors. Here, we present Rangefinder, a computational algorithm that allows rapid in silico screening of dye attachment sites in a ligand-binding protein for the conjugation of a dye molecule to act as a Förster acceptor for a fused fluorescent protein. We present three ratiometric fluorescent sensors designed with Rangefinder, including a maltose sensor with a dynamic range of >300% and the first sensors for the most abundant sialic acid in human cells, N-acetylneuraminic acid. Provided a ligand-binding protein exists, it is our expectation that this model will facilitate the design of an optical sensor for any small molecule of interest.}, author = {Mitchell, Joshua and Whitfield, Jason and Zhang, William and Henneberger, Christian and Janovjak, Harald L and O'Mara, Megan and Jackson, Colin}, journal = {ACS SENSORS}, number = {11}, pages = {1286 -- 1290}, publisher = {American Chemical Society}, title = {{Rangefinder: A semisynthetic FRET sensor design algorithm}}, doi = {10.1021/acssensors.6b00576}, volume = {1}, year = {2016}, } @inproceedings{1102, abstract = {Weakly-supervised object localization methods tend to fail for object classes that consistently co-occur with the same background elements, e.g. trains on tracks. We propose a method to overcome these failures by adding a very small amount of model-specific additional annotation. The main idea is to cluster a deep network\'s mid-level representations and assign object or distractor labels to each cluster. Experiments show substantially improved localization results on the challenging ILSVC2014 dataset for bounding box detection and the PASCAL VOC2012 dataset for semantic segmentation.}, author = {Kolesnikov, Alexander and Lampert, Christoph}, booktitle = {Proceedings of the British Machine Vision Conference 2016}, location = {York, United Kingdom}, pages = {92.1--92.12}, publisher = {BMVA Press}, title = {{Improving weakly-supervised object localization by micro-annotation}}, doi = {10.5244/C.30.92}, volume = {2016-September}, year = {2016}, } @inproceedings{1103, abstract = {We propose two parallel state-space-exploration algorithms for hybrid automaton (HA), with the goal of enhancing performance on multi-core shared-memory systems. The first uses the parallel, breadth-first-search algorithm (PBFS) of the SPIN model checker, when traversing the discrete modes of the HA, and enhances it with a parallel exploration of the continuous states within each mode. We show that this simple-minded extension of PBFS does not provide the desired load balancing in many HA benchmarks. The second algorithm is a task-parallel BFS algorithm (TP-BFS), which uses a cheap precomputation of the cost associated with the post operations (both continuous and discrete) in order to improve load balancing. We illustrate the TP-BFS and the cost precomputation of the post operators on a support-function-based algorithm for state-space exploration. The performance comparison of the two algorithms shows that, in general, TP-BFS provides a better utilization/load-balancing of the CPU. Both algorithms are implemented in the model checker XSpeed. Our experiments show a maximum speed-up of more than 2000 χ on a navigation benchmark, with respect to SpaceEx LGG scenario. In order to make the comparison fair, we employed an equal number of post operations in both tools. To the best of our knowledge, this paper represents the first attempt to provide parallel, reachability-analysis algorithms for HA.}, author = {Gurung, Amit and Deka, Arup and Bartocci, Ezio and Bogomolov, Sergiy and Grosu, Radu and Ray, Rajarshi}, location = {Kanpur, India }, publisher = {IEEE}, title = {{Parallel reachability analysis for hybrid systems}}, doi = {10.1109/MEMCOD.2016.7797741}, year = {2016}, } @inproceedings{1105, abstract = {Jointly characterizing neural responses in terms of several external variables promises novel insights into circuit function, but remains computationally prohibitive in practice. Here we use gaussian process (GP) priors and exploit recent advances in fast GP inference and learning based on Kronecker methods, to efficiently estimate multidimensional nonlinear tuning functions. Our estimator require considerably less data than traditional methods and further provides principled uncertainty estimates. We apply these tools to hippocampal recordings during open field exploration and use them to characterize the joint dependence of CA1 responses on the position of the animal and several other variables, including the animal\'s speed, direction of motion, and network oscillations.Our results provide an unprecedentedly detailed quantification of the tuning of hippocampal neurons. The model\'s generality suggests that our approach can be used to estimate neural response properties in other brain regions.}, author = {Savin, Cristina and Tkacik, Gasper}, location = {Barcelona; Spain}, pages = {3610--3618}, publisher = {Neural Information Processing Systems Foundation}, title = {{Estimating nonlinear neural response functions using GP priors and Kronecker methods}}, volume = {29}, year = {2016}, } @inproceedings{1115, abstract = {We present a coherent microwave to telecom signal converter based on the electro-optical effect using a crystalline WGM-resonator coupled to a 3D microwave cavity, achieving high photon conversion efficiency of 0.1% with MHz bandwidth.}, author = {Rueda, Alfredo and Sedlmeir, Florian and Collodo, Michele and Vogl, Ulrich and Stiller, Birgit and Schunk, Georg and Strekalov, Dimitry and Marquardt, Christoph and Fink, Johannes M and Painter, Oskar and Leuchs, Gerd and Schwefel, Harald}, location = {San Jose, CA, USA}, publisher = {IEEE}, title = {{Efficient single sideband microwave to optical conversion using a LiNbO₃ WGM-resonator}}, doi = {10.1364/CLEO_SI.2016.SF2G.3}, year = {2016}, } @inproceedings{1134, abstract = {Hybrid systems have both continuous and discrete dynamics and are useful for modeling a variety of control systems, from air traffic control protocols to robotic maneuvers and beyond. Recently, numerous powerful and scalable tools for analyzing hybrid systems have emerged. Several of these tools implement automated formal methods for mathematically proving a system meets a specification. This tutorial session will present three recent hybrid systems tools: C2E2, HyST, and TuLiP. C2E2 is a simulated-based verification tool for hybrid systems, and uses validated numerical solvers and bloating of simulation traces to verify systems meet specifications. HyST is a hybrid systems model transformation and translation tool, and uses a canonical intermediate representation to support most of the recent verification tools, as well as automated sound abstractions that simplify verification of a given hybrid system. TuLiP is a controller synthesis tool for hybrid systems, where given a temporal logic specification to be satisfied for a system (plant) model, TuLiP will find a controller that meets a given specification. © 2016 IEEE.}, author = {Duggirala, Parasara and Fan, Chuchu and Potok, Matthew and Qi, Bolun and Mitra, Sayan and Viswanathan, Mahesh and Bak, Stanley and Bogomolov, Sergiy and Johnson, Taylor and Nguyen, Luan and Schilling, Christian and Sogokon, Andrew and Tran, Hoang and Xiang, Weiming}, booktitle = {2016 IEEE Conference on Control Applications}, location = {Buenos Aires, Argentina }, publisher = {IEEE}, title = {{Tutorial: Software tools for hybrid systems verification transformation and synthesis C2E2 HyST and TuLiP}}, doi = {10.1109/CCA.2016.7587948}, year = {2016}, } @inproceedings{1135, abstract = {Time-triggered (TT) switched networks are a deterministic communication infrastructure used by real-time distributed embedded systems. These networks rely on the notion of globally discretized time (i.e. time slots) and a static TT schedule that prescribes which message is sent through which link at every time slot, such that all messages reach their destination before a global timeout. These schedules are generated offline, assuming a static network with fault-free links, and entrusting all error-handling functions to the end user. Assuming the network is static is an over-optimistic view, and indeed links tend to fail in practice. We study synthesis of TT schedules on a network in which links fail over time and we assume the switches run a very simple error-recovery protocol once they detect a crashed link. We address the problem of finding a pk; qresistant schedule; namely, one that, assuming the switches run a fixed error-recovery protocol, guarantees that the number of messages that arrive at their destination by the timeout is at least no matter what sequence of at most k links fail. Thus, we maintain the simplicity of the switches while giving a guarantee on the number of messages that meet the timeout. We show how a pk; q-resistant schedule can be obtained using a CEGAR-like approach: find a schedule, decide whether it is pk; q-resistant, and if it is not, use the witnessing fault sequence to generate a constraint that is added to the program. The newly added constraint disallows the schedule to be regenerated in a future iteration while also eliminating several other schedules that are not pk; q-resistant. We illustrate the applicability of our approach using an SMT-based implementation. © 2016 ACM.}, author = {Avni, Guy and Guha, Shibashis and Rodríguez Navas, Guillermo}, booktitle = {Proceedings of the 13th International Conference on Embedded Software }, location = {Pittsburgh, PA, USA}, publisher = {ACM}, title = {{Synthesizing time triggered schedules for switched networks with faulty links}}, doi = {10.1145/2968478.2968499}, year = {2016}, } @inproceedings{1136, abstract = {We propose an interactive sculpting system for seamlessly editing pre-computed animations of liquid, without the need for any resimulation. The input is a sequence of meshes without correspondences representing the liquid surface over time. Our method enables the efficient selection of consistent space-time parts of this animation, such as moving waves or droplets, which we call space-time features. Once selected, a feature can be copied, edited, or duplicated and then pasted back anywhere in space and time in the same or in another liquid animation sequence. Our method circumvents tedious user interactions by automatically computing the spatial and temporal ranges of the selected feature. We also provide space-time shape editing tools for non-uniform scaling, rotation, trajectory changes, and temporal editing to locally speed up or slow down motion. Using our tools, the user can edit and progressively refine any input simulation result, possibly using a library of precomputed space-time features extracted from other animations. In contrast to the trial-and-error loop usually required to edit animation results through the tuning of indirect simulation parameters, our method gives the user full control over the edited space-time behaviors. © 2016 Copyright held by the owner/author(s).}, author = {Manteaux, Pierre and Vimont, Ulysse and Wojtan, Christopher J and Rohmer, Damien and Cani, Marie}, booktitle = {Proceedings of the 9th International Conference on Motion in Games }, location = {San Francisco, CA, USA}, publisher = {ACM}, title = {{Space-time sculpting of liquid animation}}, doi = {10.1145/2994258.2994261}, year = {2016}, } @article{1137, abstract = {RASGRP1 is an important guanine nucleotide exchange factor and activator of the RAS-MAPK pathway following T cell antigen receptor (TCR) signaling. The consequences of RASGRP1 mutations in humans are unknown. In a patient with recurrent bacterial and viral infections, born to healthy consanguineous parents, we used homozygosity mapping and exome sequencing to identify a biallelic stop-gain variant in RASGRP1. This variant segregated perfectly with the disease and has not been reported in genetic databases. RASGRP1 deficiency was associated in T cells and B cells with decreased phosphorylation of the extracellular-signal-regulated serine kinase ERK, which was restored following expression of wild-type RASGRP1. RASGRP1 deficiency also resulted in defective proliferation, activation and motility of T cells and B cells. RASGRP1-deficient natural killer (NK) cells exhibited impaired cytotoxicity with defective granule convergence and actin accumulation. Interaction proteomics identified the dynein light chain DYNLL1 as interacting with RASGRP1, which links RASGRP1 to cytoskeletal dynamics. RASGRP1-deficient cells showed decreased activation of the GTPase RhoA. Treatment with lenalidomide increased RhoA activity and reversed the migration and activation defects of RASGRP1-deficient lymphocytes.}, author = {Salzer, Elisabeth and Çaǧdaş, Deniz and Hons, Miroslav and Mace, Emily and Garncarz, Wojciech and Petronczki, Oezlem and Platzer, René and Pfajfer, Laurène and Bilic, Ivan and Ban, Sol and Willmann, Katharina and Mukherjee, Malini and Supper, Verena and Hsu, Hsiangting and Banerjee, Pinaki and Sinha, Papiya and Mcclanahan, Fabienne and Zlabinger, Gerhard and Pickl, Winfried and Gribben, John and Stockinger, Hannes and Bennett, Keiryn and Huppa, Johannes and Dupré, Loï̈C and Sanal, Özden and Jäger, Ulrich and Sixt, Michael K and Tezcan, Ilhan and Orange, Jordan and Boztug, Kaan}, journal = {Nature Immunology}, number = {12}, pages = {1352 -- 1360}, publisher = {Nature Publishing Group}, title = {{RASGRP1 deficiency causes immunodeficiency with impaired cytoskeletal dynamics}}, doi = {10.1038/ni.3575}, volume = {17}, year = {2016}, } @inproceedings{1138, abstract = {Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of quantitative functions, we establish that automata with monitor counters and nested weighted automata are equivalent. We study for the first time such quantitative automata under probabilistic semantics. We show that several problems that are undecidable for the classical questions of emptiness and universality become decidable under the probabilistic semantics. We present a complete picture of decidability for such automata, and even an almost-complete picture of computational complexity, for the probabilistic questions we consider. © 2016 ACM.}, author = {Chatterjee, Krishnendu and Henzinger, Thomas A and Otop, Jan}, booktitle = {Proceedings of the 31st Annual ACM/IEEE Symposium}, location = {New York, NY, USA}, pages = {76 -- 85}, publisher = {IEEE}, title = {{Quantitative automata under probabilistic semantics}}, doi = {10.1145/2933575.2933588}, year = {2016}, } @inproceedings{1140, abstract = {Given a model of a system and an objective, the model-checking question asks whether the model satisfies the objective. We study polynomial-time problems in two classical models, graphs and Markov Decision Processes (MDPs), with respect to several fundamental -regular objectives, e.g., Rabin and Streett objectives. For many of these problems the best-known upper bounds are quadratic or cubic, yet no super-linear lower bounds are known. In this work our contributions are two-fold: First, we present several improved algorithms, and second, we present the first conditional super-linear lower bounds based on widely believed assumptions about the complexity of CNF-SAT and combinatorial Boolean matrix multiplication. A separation result for two models with respect to an objective means a conditional lower bound for one model that is strictly higher than the existing upper bound for the other model, and similarly for two objectives with respect to a model. Our results establish the following separation results: (1) A separation of models (graphs and MDPs) for disjunctive queries of reachability and Büchi objectives. (2) Two kinds of separations of objectives, both for graphs and MDPs, namely, (2a) the separation of dual objectives such as Streett/Rabin objectives, and (2b) the separation of conjunction and disjunction of multiple objectives of the same type such as safety, Büchi, and coBüchi. In summary, our results establish the first model and objective separation results for graphs and MDPs for various classical -regular objectives. Quite strikingly, we establish conditional lower bounds for the disjunction of objectives that are strictly higher than the existing upper bounds for the conjunction of the same objectives. © 2016 ACM.}, author = {Chatterjee, Krishnendu and Dvoák, Wolfgang and Henzinger, Monika H and Loitzenbauer, Veronika}, booktitle = {Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science}, location = {New York, NY, USA}, pages = {197 -- 206}, publisher = {IEEE}, title = {{Model and objective separation with conditional lower bounds: disjunction is harder than conjunction}}, doi = {10.1145/2933575.2935304}, year = {2016}, } @article{1141, abstract = {In this paper we introduce the Multiobjective Optimization Hierarchic Genetic Strategy with maturing (MO-mHGS), a meta-algorithm that performs evolutionary optimization in a hierarchy of populations. The maturing mechanism improves growth and reduces redundancy. The performance of MO-mHGS with selected state-of-the-art multiobjective evolutionary algorithms as internal algorithms is analysed on benchmark problems and their modifications for which single fitness evaluation time depends on the solution accuracy. We compare the proposed algorithm with the Island Model Genetic Algorithm as well as with single-deme methods, and discuss the impact of internal algorithms on the MO-mHGS meta-algorithm. © 2016 Elsevier B.V.}, author = {Łazarz, Radosław and Idzik, Michał and Gądek, Konrad and Gajda-Zagorska, Ewa P}, journal = {Journal of Computational Science}, number = {1}, pages = {249 -- 260}, publisher = {Elsevier}, title = {{Hierarchic genetic strategy with maturing as a generic tool for multiobjective optimization}}, doi = {10.1016/j.jocs.2016.03.004}, volume = {17}, year = {2016}, } @article{1142, abstract = {Hemolysis drives susceptibility to bacterial infections and predicts poor outcome from sepsis. These detrimental effects are commonly considered to be a consequence of heme-iron serving as a nutrient for bacteria. We employed a Gram-negative sepsis model and found that elevated heme levels impaired the control of bacterial proliferation independently of heme-iron acquisition by pathogens. Heme strongly inhibited phagocytosis and the migration of human and mouse phagocytes by disrupting actin cytoskeletal dynamics via activation of the GTP-binding Rho family protein Cdc42 by the guanine nucleotide exchange factor DOCK8. A chemical screening approach revealed that quinine effectively prevented heme effects on the cytoskeleton, restored phagocytosis and improved survival in sepsis. These mechanistic insights provide potential therapeutic targets for patients with sepsis or hemolytic disorders.}, author = {Martins, Rui and Maier, Julia and Gorki, Anna and Huber, Kilian and Sharif, Omar and Starkl, Philipp and Saluzzo, Simona and Quattrone, Federica and Gawish, Riem and Lakovits, Karin and Aichinger, Michael and Radic Sarikas, Branka and Lardeau, Charles and Hladik, Anastasiya and Korosec, Ana and Brown, Markus and Vaahtomeri, Kari and Duggan, Michelle and Kerjaschki, Dontscho and Esterbauer, Harald and Colinge, Jacques and Eisenbarth, Stephanie and Decker, Thomas and Bennett, Keiryn and Kubicek, Stefan and Sixt, Michael K and Superti Furga, Giulio and Knapp, Sylvia}, journal = {Nature Immunology}, number = {12}, pages = {1361 -- 1372}, publisher = {Nature Publishing Group}, title = {{Heme drives hemolysis-induced susceptibility to infection via disruption of phagocyte functions}}, doi = {10.1038/ni.3590}, volume = {17}, year = {2016}, } @article{1143, abstract = {We study the ground state of a dilute Bose gas in a scaling limit where the Gross-Pitaevskii functional emerges. This is a repulsive nonlinear Schrödinger functional whose quartic term is proportional to the scattering length of the interparticle interaction potential. We propose a new derivation of this limit problem, with a method that bypasses some of the technical difficulties that previous derivations had to face. The new method is based on a combination of Dyson\'s lemma, the quantum de Finetti theorem and a second moment estimate for ground states of the effective Dyson Hamiltonian. It applies equally well to the case where magnetic fields or rotation are present.}, author = {Nam, Phan and Rougerie, Nicolas and Seiringer, Robert}, journal = {Analysis and PDE}, number = {2}, pages = {459 -- 485}, publisher = {Mathematical Sciences Publishers}, title = {{Ground states of large bosonic systems: The gross Pitaevskii limit revisited}}, doi = {10.2140/apde.2016.9.459}, volume = {9}, year = {2016}, } @article{1008, abstract = {Feedback loops in biological networks, among others, enable differentiation and cell cycle progression, and increase robustness in signal transduction. In natural networks, feedback loops are often complex and intertwined, making it challenging to identify which loops are mainly responsible for an observed behavior. However, minimal synthetic replicas could allow for such identification. Here, we engineered a synthetic permease-inducer-repressor system in Saccharomyces cerevisiae to analyze if a transport-mediated positive feedback loop could be a core mechanism for the switch-like behavior in the regulation of metabolic gene networks such as the S. cerevisiae GAL system or the Escherichia coli lac operon. We characterized the synthetic circuit using deterministic and stochastic mathematical models. Similar to its natural counterparts, our synthetic system shows bistable and hysteretic behavior, and the inducer concentration range for bistability as well as the switching rates between the two stable states depend on the repressor concentration. Our results indicate that a generic permease–inducer–repressor circuit with a single feedback loop is sufficient to explain the experimentally observed bistable behavior of the natural systems. We anticipate that the approach of reimplementing natural systems with orthogonal parts to identify crucial network components is applicable to other natural systems such as signaling pathways.}, author = {Gnügge, Robert and Dharmarajan, Lekshmi and Lang, Moritz and Stelling, Jörg}, journal = {ACS Synthetic Biology}, number = {10}, pages = {1098 -- 1107}, publisher = {American Chemical Society}, title = {{An orthogonal permease–inducer–repressor feedback loop shows bistability}}, doi = {10.1021/acssynbio.6b00013}, volume = {5}, year = {2016}, } @article{1552, abstract = {Antibiotic resistance carries a fitness cost that must be overcome in order for resistance to persist over the long term. Compensatory mutations that recover the functional defects associated with resistance mutations have been argued to play a key role in overcoming the cost of resistance, but compensatory mutations are expected to be rare relative to generally beneficial mutations that increase fitness, irrespective of antibiotic resistance. Given this asymmetry, population genetics theory predicts that populations should adapt by compensatory mutations when the cost of resistance is large, whereas generally beneficial mutations should drive adaptation when the cost of resistance is small. We tested this prediction by determining the genomic mechanisms underpinning adaptation to antibiotic-free conditions in populations of the pathogenic bacterium Pseudomonas aeruginosa that carry costly antibiotic resistance mutations. Whole-genome sequencing revealed that populations founded by high-cost rifampicin-resistant mutants adapted via compensatory mutations in three genes of the RNA polymerase core enzyme, whereas populations founded by low-cost mutants adapted by generally beneficial mutations, predominantly in the quorum-sensing transcriptional regulator gene lasR. Even though the importance of compensatory evolution in maintaining resistance has been widely recognized, our study shows that the roles of general adaptation in maintaining resistance should not be underestimated and highlights the need to understand how selection at other sites in the genome influences the dynamics of resistance alleles in clinical settings.}, author = {Qi, Qin and Toll Riera, Macarena and Heilbron, Karl and Preston, Gail and Maclean, R Craig}, journal = {Proceedings of the Royal Society of London Series B Biological Sciences}, number = {1822}, publisher = {Royal Society, The}, title = {{The genomic basis of adaptation to the fitness cost of rifampicin resistance in Pseudomonas aeruginosa}}, doi = {10.1098/rspb.2015.2452}, volume = {283}, year = {2016}, } @article{1592, abstract = {A modular approach to constructing cryptographic protocols leads to simple designs but often inefficient instantiations. On the other hand, ad hoc constructions may yield efficient protocols at the cost of losing conceptual simplicity. We suggest a new design paradigm, structure-preserving cryptography, that provides a way to construct modular protocols with reasonable efficiency while retaining conceptual simplicity. A cryptographic scheme over a bilinear group is called structure-preserving if its public inputs and outputs consist of elements from the bilinear groups and their consistency can be verified by evaluating pairing-product equations. As structure-preserving schemes smoothly interoperate with each other, they are useful as building blocks in modular design of cryptographic applications. This paper introduces structure-preserving commitment and signature schemes over bilinear groups with several desirable properties. The commitment schemes include homomorphic, trapdoor and length-reducing commitments to group elements, and the structure-preserving signature schemes are the first ones that yield constant-size signatures on multiple group elements. A structure-preserving signature scheme is called automorphic if the public keys lie in the message space, which cannot be achieved by compressing inputs via a cryptographic hash function, as this would destroy the mathematical structure we are trying to preserve. Automorphic signatures can be used for building certification chains underlying privacy-preserving protocols. Among a vast number of applications of structure-preserving protocols, we present an efficient round-optimal blind-signature scheme and a group signature scheme with an efficient and concurrently secure protocol for enrolling new members.}, author = {Abe, Masayuki and Fuchsbauer, Georg and Groth, Jens and Haralambiev, Kristiyan and Ohkubo, Miyako}, journal = {Journal of Cryptology}, number = {2}, pages = {363 -- 421}, publisher = {Springer}, title = {{Structure preserving signatures and commitments to group elements}}, doi = {10.1007/s00145-014-9196-7}, volume = {29}, year = {2016}, } @article{1597, abstract = {Chemokines are the main guidance cues directing leukocyte migration. Opposed to early assumptions, chemokines do not necessarily act as soluble cues but are often immobilized within tissues, e.g., dendritic cell migration toward lymphatic vessels is guided by a haptotactic gradient of the chemokine CCL21. Controlled assay systems to quantitatively study haptotaxis in vitro are still missing. In this chapter, we describe an in vitro haptotaxis assay optimized for the unique properties of dendritic cells. The chemokine CCL21 is immobilized in a bioactive state, using laser-assisted protein adsorption by photobleaching. The cells follow this immobilized CCL21 gradient in a haptotaxis chamber, which provides three dimensionally confined migration conditions.}, author = {Schwarz, Jan and Sixt, Michael K}, journal = {Methods in Enzymology}, pages = {567 -- 581}, publisher = {Elsevier}, title = {{Quantitative analysis of dendritic cell haptotaxis}}, doi = {10.1016/bs.mie.2015.11.004}, volume = {570}, year = {2016}, }