@article{2965,
  abstract     = {Dieser Artikel soll die sechs verschiedenen Creative Commons Lizenzen erläutern und ihre Bedeutung im Rahmen des wissenschaftlichen Publizierens und des Open Access erklären (CC-BY, CC-BY-SA, CC-BY-NC, CC-BY-ND, CC-BYNC-SA, CC-BY-NC-ND).},
  author       = {Danowski, Patrick},
  journal      = {Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare},
  number       = {2},
  pages        = {200 -- 212},
  publisher    = {VÖB},
  title        = {{Kontext Open Access: Creative Commons}},
  volume       = {65},
  year         = {2012},
}

@article{2966,
  abstract     = {Background: The outcome of male-male competition can be predicted from the relative fighting qualities of the opponents, which often depend on their age. In insects, freshly emerged and still sexually inactive males are morphologically indistinct from older, sexually active males. These young inactive males may thus be easy targets for older males if they cannot conceal themselves from their attacks. The ant Cardiocondyla obscurior is characterised by lethal fighting between wingless (" ergatoid" ) males. Here, we analyse for how long young males are defenceless after eclosion, and how early adult males can detect the presence of rival males.Results: We found that old ergatoid males consistently won fights against ergatoid males younger than two days. Old males did not differentiate between different types of unpigmented pupae several days before emergence, but had more frequent contact to ready-to-eclose pupae of female sexuals and winged males than of workers and ergatoid males. In rare cases, old ergatoid males displayed alleviated biting of pigmented ergatoid male pupae shortly before adult eclosion, as well as copulation attempts to dark pupae of female sexuals and winged males. Ergatoid male behaviour may be promoted by a closer similarity of the chemical profile of ready-to-eclose pupae to the profile of adults than that of young pupae several days prior to emergence.Conclusion: Young ergatoid males of C. obscurior would benefit greatly by hiding their identity from older, resident males, as they are highly vulnerable during the first two days of their adult lives. In contrast to the winged males of the same species, which are able to prevent ergatoid male attacks by chemical female mimicry, young ergatoids do not seem to be able to produce a protective chemical profile. Conflicts in male-male competition between ergatoid males of different age thus seem to be resolved in favour of the older males. This might represent selection at the colony level rather than the individual level. © 2012 Cremer et al.; licensee BioMed Central Ltd.},
  author       = {Cremer, Sylvia and Suefuji, Masaki and Schrempf, Alexandra and Heinze, Jürgen},
  journal      = {BMC Ecology},
  publisher    = {BioMed Central},
  title        = {{The dynamics of male-male competition in Cardiocondyla obscurior ants}},
  doi          = {10.1186/1472-6785-12-7},
  volume       = {12},
  year         = {2012},
}

@article{2967,
  abstract     = {For programs whose data variables range over Boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. In this article, we consider algorithmic verification of programs that use Boolean variables, and in addition, access a single read-only array whose length is potentially unbounded, and whose elements range over an unbounded data domain. We show that the reachability problem, while undecidable in general, is (1) PSPACE-complete for programs in which the array-accessing for-loops are not nested, (2) decidable for a restricted class of programs with doubly nested loops. The second result establishes connections to automata and logics defining languages over data words.},
  author       = {Alur, Rajeev and Cerny, Pavol and Weinstein, Scott},
  journal      = {ACM Transactions on Computational Logic (TOCL)},
  number       = {3},
  publisher    = {ACM},
  title        = {{Algorithmic analysis of array-accessing programs}},
  doi          = {10.1145/2287718.2287727},
  volume       = {13},
  year         = {2012},
}

@article{2968,
  abstract     = {Little is known about the stability of trophic relationships in complex natural communities over evolutionary timescales. Here, we use sequence data from 18 nuclear loci to reconstruct and compare the intraspecific histories of major Pleistocene refugial populations in the Middle East, the Balkans and Iberia in a guild of four Chalcid parasitoids (Cecidostiba fungosa, Cecidostiba semifascia, Hobbya stenonota and Mesopolobus amaenus) all attacking Cynipid oak galls. We develop a likelihood method to numerically estimate models of divergence between three populations from multilocus data. We investigate the power of this framework on simulated data, and-using triplet alignments of intronic loci-quantify the support for all possible divergence relationships between refugial populations in the four parasitoids. Although an East to West order of population divergence has highest support in all but one species, we cannot rule out alternative population tree topologies. Comparing the estimated times of population splits between species, we find that one species, M. amaenus, has a significantly older history than the rest of the guild and must have arrived in central Europe at least one glacial cycle prior to other guild members. This suggests that although all four species may share a common origin in the East, they expanded westwards into Europe at different times. © 2012 Blackwell Publishing Ltd.},
  author       = {Lohse, Konrad and Barton, Nicholas H and Melika, George and Stone, Graham},
  journal      = {Molecular Ecology},
  number       = {18},
  pages        = {4605 -- 4617},
  publisher    = {Wiley-Blackwell},
  title        = {{A likelihood based comparison of population histories in a parasitoid guild}},
  doi          = {10.1111/j.1365-294X.2012.05700.x},
  volume       = {21},
  year         = {2012},
}

@article{2969,
  abstract     = {The coupling between presynaptic Ca^(2+) channels and Ca^(2+) sensors of exocytosis is a key determinant of synaptic transmission. Evoked release from parvalbumin (PV)-expressing interneurons is triggered by nanodomain coupling of P/Q-type Ca^(2+) channels, whereas release from cholecystokinin (CCK)-containing interneurons is generated by microdomain coupling of N-type channels. Nanodomain coupling has several functional advantages, including speed and efficacy of transmission. One potential disadvantage is that stochastic
opening of presynaptic Ca^(2+) channels may trigger spontaneous transmitter release. We addressed this possibility in rat hippocampal
granule cells, which receive converging inputs from different inhibitory sources. Both reduction of extracellular Ca^(2+) concentration and the unselective Ca^(2+) channel blocker Cd^(2+) reduced the frequency of miniature IPSCs (mIPSCs) in granule cells by ~50%, suggesting that the opening of presynaptic Ca^(2+) channels contributes to spontaneous release. Application of the selective P/Q-type Ca^(2+) channel blocker
ω-agatoxin IVa had no detectable effects, whereas both the N-type blocker ω-conotoxin GVIa and the L-type blocker nimodipine reduced
mIPSC frequency. Furthermore, both the fast Ca^(2+) chelator BAPTA-AM and the slow chelator EGTA-AM reduced the mIPSC frequency,
suggesting that Ca^(2+)-dependent spontaneous release is triggered by microdomain rather than nanodomain coupling. The CB_(1) receptor
agonist WIN 55212-2 also decreased spontaneous release; this effect was occluded by prior application of ω-conotoxin GVIa, suggesting that a major fraction of Ca^(2+)-dependent spontaneous release was generated at the terminals of CCK-expressing interneurons. Tonic inhibition generated by spontaneous opening of presynaptic N- and L-type Ca^(2+) channels may be important for hippocampal information processing.
},
  author       = {Goswami, Sarit and Bucurenciu, Iancu and Jonas, Peter M},
  journal      = {Journal of Neuroscience},
  number       = {41},
  pages        = {14294 -- 14304},
  publisher    = {Society for Neuroscience},
  title        = {{Miniature IPSCs in hippocampal granule cells are triggered by voltage-gated Ca^(2+) channels via microdomain coupling}},
  doi          = {10.1523/JNEUROSCI.6104-11.2012},
  volume       = {32},
  year         = {2012},
}

@article{2970,
  abstract     = {Morphogen gradients regulate the patterning and growth of many tissues, hence a key question is how they are established and maintained during development. Theoretical descriptions have helped to explain how gradient shape is controlled by the rates of morphogen production, spreading and degradation. These effective rates have been measured using fluorescence recovery after photobleaching (FRAP) and photoactivation. To unravel which molecular events determine the effective rates, such tissue-level assays have been combined with genetic analysis, high-resolution assays, and models that take into account interactions with receptors, extracellular components and trafficking. Nevertheless, because of the natural and experimental data variability, and the underlying assumptions of transport models, it remains challenging to conclusively distinguish between cellular mechanisms.},
  author       = {Kicheva, Anna and Bollenbach, Mark Tobias and Wartlick, Ortrud and Julicher, Frank and Gonzalez Gaitan, Marcos},
  journal      = {Current Opinion in Genetics & Development},
  number       = {6},
  pages        = {527 -- 532},
  publisher    = {Elsevier},
  title        = {{Investigating the principles of morphogen gradient formation: from tissues to cells}},
  doi          = {10.1016/j.gde.2012.08.004},
  volume       = {22},
  year         = {2012},
}

@inproceedings{2971,
  abstract     = {We study the task of interactive semantic labeling of a segmentation hierarchy. To this end we propose a framework interleaving two components: an automatic labeling step, based on a Conditional Random Field whose dependencies are defined by the inclusion tree of the segmentation hierarchy, and an interaction step that integrates incremental input from a human user. Evaluated on two distinct datasets, the proposed interactive approach efficiently integrates human interventions and illustrates the advantages of structured prediction in an interactive framework. },
  author       = {Zankl, Georg and Haxhimusa, Yll and Ion, Adrian},
  location     = {Graz, Austria},
  pages        = {11 -- 20},
  publisher    = {Springer},
  title        = {{Interactive labeling of image segmentation hierarchies}},
  doi          = {10.1007/978-3-642-32717-9_2},
  volume       = {7476},
  year         = {2012},
}

@article{2972,
  abstract     = {Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of energy in the game) must remain positive. Beside their own interest in the design and synthesis of resource-constrained omega-regular specifications, energy parity games provide one of the simplest model of games with combined qualitative and quantitative objectives. Our main results are as follows: (a) exponential memory is sufficient and may be necessary for winning strategies in energy parity games; (b) the problem of deciding the winner in energy parity games can be solved in NP ∩ coNP; and (c) we give an algorithm to solve energy parity by reduction to energy games. We also show that the problem of deciding the winner in energy parity games is logspace-equivalent to the problem of deciding the winner in mean-payoff parity games, which can thus be solved in NP ∩ coNP. As a consequence we also obtain a conceptually simple algorithm to solve mean-payoff parity games.},
  author       = {Chatterjee, Krishnendu and Doyen, Laurent},
  journal      = {Theoretical Computer Science},
  pages        = {49 -- 60},
  publisher    = {Elsevier},
  title        = {{Energy parity games}},
  doi          = {10.1016/j.tcs.2012.07.038},
  volume       = {458},
  year         = {2012},
}

@inproceedings{2974,
  abstract     = {We construct a perfectly binding string commitment scheme whose security is based on the learning parity with noise (LPN) assumption, or equivalently, the hardness of decoding random linear codes. Our scheme not only allows for a simple and efficient zero-knowledge proof of knowledge for committed values (essentially a Σ-protocol), but also for such proofs showing any kind of relation amongst committed values, i.e. proving that messages m_0,...,m_u, are such that m_0=C(m_1,...,m_u) for any circuit C.

To get soundness which is exponentially small in a security parameter t, and when the zero-knowledge property relies on the LPN problem with secrets of length l, our 3 round protocol has communication complexity O(t|C|l log(l)) and computational complexity of O(t|C|l) bit operations. The hidden constants are small, and the computation consists mostly of computing inner products of bit-vectors.},
  author       = {Jain, Abhishek and Krenn, Stephan and Pietrzak, Krzysztof Z and Tentes, Aris},
  editor       = {Wang, Xiaoyun and Sako, Kazue},
  location     = {Beijing, China},
  pages        = {663 -- 680},
  publisher    = {Springer},
  title        = {{Commitments and efficient zero knowledge proofs from learning parity with noise}},
  doi          = {10.1007/978-3-642-34961-4_40},
  volume       = {7658},
  year         = {2012},
}

@article{3115,
  abstract     = {We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum of another polygonal shape P with a disk of fixed radius? If it does, we also seek a preferably simple-looking solution P; then, P's offset constitutes an accurate, vertex-reduced, and smoothened approximation of Q. We give an O(nlogn)-time exact decision algorithm that handles any polygonal shape, assuming the real-RAM model of computation. A variant of the algorithm, which we have implemented using the cgal library, is based on rational arithmetic and answers the same deconstruction problem up to an uncertainty parameter δ its running time additionally depends on δ. If the input shape is found to be approximable, this algorithm also computes an approximate solution for the problem. It also allows us to solve parameter-optimization problems induced by the offset-deconstruction problem. For convex shapes, the complexity of the exact decision algorithm drops to O(n), which is also the time required to compute a solution P with at most one more vertex than a vertex-minimal one.},
  author       = {Berberich, Eric and Halperin, Dan and Kerber, Michael and Pogalnikova, Roza},
  journal      = {Discrete & Computational Geometry},
  number       = {4},
  pages        = {964 -- 989},
  publisher    = {Springer},
  title        = {{Deconstructing approximate offsets}},
  doi          = {10.1007/s00454-012-9441-5},
  volume       = {48},
  year         = {2012},
}

@article{3117,
  abstract     = {We consider the problem of minimizing a function represented as a sum of submodular terms. We assume each term allows an efficient computation of exchange capacities. This holds, for example, for terms depending on a small number of variables, or for certain cardinality-dependent terms. A naive application of submodular minimization algorithms would not exploit the existence of specialized exchange capacity subroutines for individual terms. To overcome this, we cast the problem as a submodular flow (SF) problem in an auxiliary graph in such a way that applying most existing SF algorithms would rely only on these subroutines. We then explore in more detail Iwata's capacity scaling approach for submodular flows (Iwata 1997 [19]). In particular, we show how to improve its complexity in the case when the function contains cardinality-dependent terms.},
  author       = {Kolmogorov, Vladimir},
  journal      = {Discrete Applied Mathematics},
  number       = {15},
  pages        = {2246 -- 2258},
  publisher    = {Elsevier},
  title        = {{Minimizing a sum of submodular functions}},
  doi          = {10.1016/j.dam.2012.05.025},
  volume       = {160},
  year         = {2012},
}

@article{3118,
  abstract     = {We present a method for recovering a temporally coherent, deforming triangle mesh with arbitrarily changing topology from an incoherent sequence of static closed surfaces. We solve this problem using the surface geometry alone, without any prior information like surface templates or velocity fields. Our system combines a proven strategy for triangle mesh improvement, a robust multi-resolution non-rigid registration routine, and a reliable technique for changing surface mesh topology. We also introduce a novel topological constraint enforcement algorithm to ensure that the output and input always have similar topology. We apply our technique to a series of diverse input data from video reconstructions, physics simulations, and artistic morphs. The structured output of our algorithm allows us to efficiently track information like colors and displacement maps, recover velocity information, and solve PDEs on the mesh as a post process.},
  author       = {Bojsen-Hansen, Morten and Li, Hao and Wojtan, Christopher J},
  journal      = {ACM Transactions on Graphics},
  number       = {4},
  publisher    = {ACM},
  title        = {{Tracking surfaces with evolving topology}},
  doi          = {10.1145/2185520.2185549},
  volume       = {31},
  year         = {2012},
}

@inproceedings{3119,
  abstract     = {We present an approach for artist-directed animation of liquids using multiple levels of control over the simulation, ranging from the overall tracking of desired shapes to highly detailed secondary effects such as dripping streams, separating sheets of fluid, surface waves and ripples. The first portion of our technique is a volume preserving morph that allows the animator to produce a plausible fluid-like motion from a sparse set of control meshes. By rasterizing the resulting control meshes onto the simulation grid, the mesh velocities act as boundary conditions during the projection step of the fluid simulation. We can then blend this motion together with uncontrolled fluid velocities to achieve a more relaxed control over the fluid that captures natural inertial effects. Our method can produce highly detailed liquid surfaces with control over sub-grid details by using a mesh-based surface tracker on top of a coarse grid-based fluid simulation. We can create ripples and waves on the fluid surface attracting the surface mesh to the control mesh with spring-like forces and also by running a wave simulation over the surface mesh. Our video results demonstrate how our control scheme can be used to create animated characters and shapes that are made of water.
},
  author       = {Raveendran, Karthik and Thuerey, Nils and Wojtan, Christopher J and Turk, Greg},
  booktitle    = {Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation},
  location     = {Aire-la-Ville, Switzerland},
  pages        = {255 -- 264},
  publisher    = {ACM},
  title        = {{Controlling liquids using meshes}},
  year         = {2012},
}

@article{3120,
  abstract     = {We introduce a strategy based on Kustin-Miller unprojection that allows us to construct many hundreds of Gorenstein codimension 4 ideals with 9 × 16 resolutions (that is, nine equations and sixteen first syzygies). Our two basic games are called Tom and Jerry; the main application is the biregular construction of most of the anticanonically polarised Mori Fano 3-folds of Altinok's thesis. There are 115 cases whose numerical data (in effect, the Hilbert series) allow a Type I projection. In every case, at least one Tom and one Jerry construction works, providing at least two deformation families of quasismooth Fano 3-folds having the same numerics but different topology. © 2012 Copyright Foundation Compositio Mathematica.},
  author       = {Brown, Gavin and Kerber, Michael and Reid, Miles},
  journal      = {Compositio Mathematica},
  number       = {4},
  pages        = {1171 -- 1194},
  publisher    = {Cambridge University Press},
  title        = {{Fano 3 folds in codimension 4 Tom and Jerry Part I}},
  doi          = {10.1112/S0010437X11007226},
  volume       = {148},
  year         = {2012},
}

@article{3121,
  abstract     = {Voltage-activated Ca(2+) channels (VACCs) mediate Ca(2+) influx to trigger action potential-evoked neurotransmitter release, but the mechanism by which Ca(2+) regulates spontaneous transmission is unclear. We found that VACCs are the major physiological triggers for spontaneous release at mouse neocortical inhibitory synapses. Moreover, despite the absence of a synchronizing action potential, we found that spontaneous fusion of a GABA-containing vesicle required the activation of multiple tightly coupled VACCs of variable type.},
  author       = {Williams, Courtney and Chen, Wenyan and Lee, Chia and Yaeger, Daniel and Vyleta, Nicholas and Smith, Stephen},
  journal      = {Nature Neuroscience},
  number       = {9},
  pages        = {1195 -- 1197},
  publisher    = {Nature Publishing Group},
  title        = {{Coactivation of multiple tightly coupled calcium channels triggers spontaneous release of GABA}},
  doi          = {10.1038/nn.3162},
  volume       = {15},
  year         = {2012},
}

@article{3122,
  abstract     = {Since Darwin's pioneering research on plant reproductive biology (e.g. Darwin 1877), understanding the mechanisms maintaining the diverse sexual strategies of plants has remained an important challenge for evolutionary biologists. In some species, populations are sexually polymorphic and contain two or more mating morphs (sex phenotypes). Differences in morphology or phenology among the morphs influence patterns of non-random mating. In these populations, negative frequency-dependent selection arising from disassortative (intermorph) mating is usually required for the evolutionary maintenance of sexual polymorphism, but few studies have demonstrated the required patterns of non-random mating. In the current issue of Molecular Ecology, Shang (2012) make an important contribution to our understanding of how disassortative mating influences sex phenotype ratios in Acer pictum subsp. mono (painted maple), a heterodichogamous, deciduous tree of eastern China. They monitored sex expression in 97 adults and used paternity analysis of open-pollinated seed to examine disassortative mating among three sex phenotypes. Using a deterministic 'pollen transfer' model, Shang et al. present convincing evidence that differences in the degree of disassortative mating in progeny arrays of the sex phenotypes can explain their uneven frequencies in the adult population. This study provides a useful example of how the deployment of genetic markers, demographic monitoring and modelling can be integrated to investigate the maintenance of sexual diversity in plants. },
  author       = {Field, David and Barrett, Spencer},
  journal      = {Molecular Ecology},
  number       = {15},
  pages        = {3640 -- 3643},
  publisher    = {Wiley-Blackwell},
  title        = {{Disassortative mating and the maintenance of sexual polymorphism in painted maple}},
  doi          = {10.1111/j.1365-294X.2012.05643.x},
  volume       = {21},
  year         = {2012},
}

@inproceedings{3123,
  abstract     = {We introduce the idea of using an explicit triangle mesh to track the air/fluid interface in a smoothed particle hydrodynamics (SPH) simulator. Once an initial surface mesh is created, this mesh is carried forward in time using nearby particle velocities to advect the mesh vertices. The mesh connectivity remains mostly unchanged across time-steps; it is only modified locally for topology change events or for the improvement of triangle quality. In order to ensure that the surface mesh does not diverge from the underlying particle simulation, we periodically project the mesh surface onto an implicit surface defined by the physics simulation. The mesh surface gives us several advantages over previous SPH surface tracking techniques. We demonstrate a new method for surface tension calculations that clearly outperforms the state of the art in SPH surface tension for computer graphics. We also demonstrate a method for tracking detailed surface information (like colors) that is less susceptible to numerical diffusion than competing techniques. Finally, our temporally-coherent surface mesh allows us to simulate high-resolution surface wave dynamics without being limited by the particle resolution of the SPH simulation.},
  author       = {Yu, Jihun and Wojtan, Christopher J and Turk, Greg and Yap, Chee},
  booktitle    = {Computer Graphics Forum},
  issn         = {1467-8659},
  location     = {Cagliari, Sardinia, Italy},
  number       = {2},
  pages        = {815 -- 824},
  publisher    = {Wiley},
  title        = {{Explicit mesh surfaces for particle based fluids}},
  doi          = {10.1111/j.1467-8659.2012.03062.x},
  volume       = {31},
  year         = {2012},
}

@inproceedings{3124,
  abstract     = {We consider the problem of inference in a graphical model with binary variables. While in theory it is arguably preferable to compute marginal probabilities, in practice researchers often use MAP inference due to the availability of efficient discrete optimization algorithms. We bridge the gap between the two approaches by introducing the Discrete Marginals technique in which approximate marginals are obtained by minimizing an objective function with unary and pairwise terms over a discretized domain. This allows the use of techniques originally developed for MAP-MRF inference and learning. We explore two ways to set up the objective function - by discretizing the Bethe free energy and by learning it from training data. Experimental results show that for certain types of graphs a learned function can outperform the Bethe approximation. We also establish a link between the Bethe free energy and submodular functions.
},
  author       = {Korc, Filip and Kolmogorov, Vladimir and Lampert, Christoph},
  location     = {Edinburgh, Scotland},
  publisher    = {ICML},
  title        = {{Approximating marginals using discrete energy minimization}},
  year         = {2012},
}

@inproceedings{3125,
  abstract     = {We propose a new learning method to infer a mid-level feature representation that combines the advantage of semantic attribute representations with the higher expressive power of non-semantic features. The idea lies in augmenting an existing attribute-based representation with additional dimensions for which an autoencoder model is coupled with a large-margin principle. This construction allows a smooth transition between the zero-shot regime with no training example, the unsupervised regime with training examples but without class labels, and the supervised regime with training examples and with class labels. The resulting optimization problem can be solved efficiently, because several of the necessity steps have closed-form solutions. Through extensive experiments we show that the augmented representation achieves better results in terms of object categorization accuracy than the semantic representation alone.},
  author       = {Sharmanska, Viktoriia and Quadrianto, Novi and Lampert, Christoph},
  location     = {Florence, Italy},
  number       = {PART 5},
  pages        = {242 -- 255},
  publisher    = {Springer},
  title        = {{Augmented attribute representations}},
  doi          = {10.1007/978-3-642-33715-4_18},
  volume       = {7576},
  year         = {2012},
}

@inproceedings{3126,
  abstract     = {In this work we propose a new information-theoretic clustering algorithm that infers cluster memberships by direct optimization of a non-parametric mutual information estimate between data distribution and cluster assignment. Although the optimization objective has a solid theoretical foundation it is hard to optimize. We propose an approximate optimization formulation that leads to an efficient algorithm with low runtime complexity. The algorithm has a single free parameter, the number of clusters to find. We demonstrate superior performance on several synthetic and real datasets.
},
  author       = {Müller, Andreas and Nowozin, Sebastian and Lampert, Christoph},
  location     = {Graz, Austria},
  pages        = {205 -- 215},
  publisher    = {Springer},
  title        = {{Information theoretic clustering using minimal spanning trees}},
  doi          = {10.1007/978-3-642-32717-9_21},
  volume       = {7476},
  year         = {2012},
}