@inbook{2265,
  abstract     = {Coordinated migration of newly-born neurons to their target territories is essential for correct neuronal circuit assembly in the developing brain. Although a cohort of signaling pathways has been implicated in the regulation of cortical projection neuron migration, the precise molecular mechanisms and how a balanced interplay of cell-autonomous and non-autonomous functions of candidate signaling molecules controls the discrete steps in the migration process, are just being revealed. In this chapter, I will focally review recent advances that improved our understanding of the cell-autonomous and possible cell-nonautonomous functions of the evolutionarily conserved LIS1/NDEL1-complex in regulating the sequential steps of cortical projection neuron migration. I will then elaborate on the emerging concept that the Reelin signaling pathway, acts exactly at precise stages in the course of cortical projection neuron migration. Lastly, I will discuss how finely tuned transcriptional programs and downstream effectors govern particular aspects in driving radial migration at discrete stages and how they regulate the precise positioning of cortical projection neurons in the developing cerebral cortex.},
  author       = {Hippenmeyer, Simon},
  booktitle    = { Cellular and Molecular Control of Neuronal Migration},
  editor       = {Nguyen, Laurent},
  pages        = {1 -- 24},
  publisher    = {Springer},
  title        = {{Molecular pathways controlling the sequential steps of cortical projection neuron migration}},
  doi          = {10.1007/978-94-007-7687-6_1},
  volume       = {800},
  year         = {2014},
}

@inproceedings{2275,
  abstract     = {Energies with high-order non-submodular interactions have been shown to be very useful in vision due to their high modeling power. Optimization of such energies, however, is generally NP-hard. A naive approach that works for small problem instances is exhaustive search, that is, enumeration of all possible labelings of the underlying graph. We propose a general minimization approach for large graphs based on enumeration of labelings of certain small patches. 
This partial enumeration technique reduces complex high-order energy formulations to pairwise Constraint Satisfaction Problems with unary costs (uCSP), which can be efficiently solved using standard methods like TRW-S. Our approach outperforms a number of existing state-of-the-art algorithms on well known difficult problems (e.g. curvature regularization, stereo, deconvolution); it gives near global minimum and better speed. 
Our main application of interest is curvature regularization. In the context of segmentation, our partial enumeration technique allows to evaluate curvature directly on small patches using a novel integral geometry approach.
},
  author       = {Olsson, Carl and Ulen, Johannes and Boykov, Yuri and Kolmogorov, Vladimir},
  location     = {Sydney, Australia},
  pages        = {2936 -- 2943},
  publisher    = {IEEE},
  title        = {{Partial enumeration and curvature regularization}},
  doi          = {10.1109/ICCV.2013.365},
  year         = {2014},
}

@article{2281,
  abstract     = {We consider two-dimensional Bose-Einstein condensates with attractive interaction, described by the Gross-Pitaevskii functional. Minimizers of this functional exist only if the interaction strength a satisfies {Mathematical expression}, where Q is the unique positive radial solution of {Mathematical expression} in {Mathematical expression}. We present a detailed analysis of the behavior of minimizers as a approaches a*, where all the mass concentrates at a global minimum of the trapping potential.},
  author       = {Guo, Yujin and Seiringer, Robert},
  journal      = {Letters in Mathematical Physics},
  number       = {2},
  pages        = {141 -- 156},
  publisher    = {Springer},
  title        = {{On the mass concentration for Bose-Einstein condensates with attractive interactions}},
  doi          = {10.1007/s11005-013-0667-9},
  volume       = {104},
  year         = {2014},
}

@article{2285,
  abstract     = {GABAergic inhibitory interneurons control fundamental aspects of neuronal network function. Their functional roles are assumed to be defined by the identity of their input synapses, the architecture of their dendritic tree, the passive and active membrane properties and finally the nature of their postsynaptic targets. Indeed, interneurons display a high degree of morphological and physiological heterogeneity. However, whether their morphological and physiological characteristics are correlated and whether interneuron diversity can be described by a continuum of GABAergic cell types or by distinct classes has remained unclear. Here we perform a detailed morphological and physiological characterization of GABAergic cells in the dentate gyrus, the input region of the hippocampus. To achieve an unbiased and efficient sampling and classification we used knock-in mice expressing the enhanced green fluorescent protein (eGFP) in glutamate decarboxylase 67 (GAD67)-positive neurons and performed cluster analysis. We identified five interneuron classes, each of them characterized by a distinct set of anatomical and physiological parameters. Cross-correlation analysis further revealed a direct relation between morphological and physiological properties indicating that dentate gyrus interneurons fall into functionally distinct classes which may differentially control neuronal network activity.},
  author       = {Hosp, Jonas and Strüber, Michael and Yanagawa, Yuchio and Obata, Kunihiko and Vida, Imre and Jonas, Peter M and Bartos, Marlene},
  journal      = {Hippocampus},
  number       = {2},
  pages        = {189 -- 203},
  publisher    = {Wiley-Blackwell},
  title        = {{Morpho-physiological criteria divide dentate gyrus interneurons into classes}},
  doi          = {10.1002/hipo.22214},
  volume       = {23},
  year         = {2014},
}

@article{2699,
  abstract     = {We prove the universality of the β-ensembles with convex analytic potentials and for any β >
0, i.e. we show that the spacing distributions of log-gases at any inverse temperature β coincide with those of the Gaussian β-ensembles.},
  author       = {Erdös, László and Bourgade, Paul and Yau, Horng},
  journal      = {Duke Mathematical Journal},
  number       = {6},
  pages        = {1127 -- 1190},
  publisher    = {Duke University Press},
  title        = {{Universality of general β-ensembles}},
  doi          = {10.1215/00127094-2649752},
  volume       = {163},
  year         = {2014},
}

@article{2716,
  abstract     = {Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express ω ω -regular conditions. While in general, the winning strategies in such games may require infinite memory, for synthesis the most relevant problem is the construction of a finite-memory winning strategy (if one exists). Our main contributions are as follows. First, we show a tight exponential bound (matching upper and lower bounds) on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives. This significantly improves the triple exponential upper bound for multi energy games (without parity) that could be derived from results in literature for games on vector addition systems with states. Second, we present an optimal symbolic and incremental algorithm to compute a finite-memory winning strategy (if one exists) in such games. Finally, we give a complete characterization of when finite memory of strategies can be traded off for randomness. In particular, we show that for one-dimension mean-payoff parity games, randomized memoryless strategies are as powerful as their pure finite-memory counterparts.},
  author       = {Chatterjee, Krishnendu and Randour, Mickael and Raskin, Jean},
  journal      = {Acta Informatica},
  number       = {3-4},
  pages        = {129 -- 163},
  publisher    = {Springer},
  title        = {{Strategy synthesis for multi-dimensional quantitative objectives}},
  doi          = {10.1007/s00236-013-0182-6},
  volume       = {51},
  year         = {2014},
}

@article{2852,
  abstract     = {A robust combiner for hash functions takes two candidate implementations and constructs a hash function which is secure as long as at least one of the candidates is secure. So far, hash function combiners only aim at preserving a single property such as collision-resistance or pseudorandomness. However, when hash functions are used in protocols like TLS they are often required to provide several properties simultaneously. We therefore put forward the notion of robust multi-property combiners and elaborate on different definitions for such combiners. We then propose a combiner that provably preserves (target) collision-resistance, pseudorandomness, and being a secure message authentication code. This combiner satisfies the strongest notion we propose, which requires that the combined function satisfies every security property which is satisfied by at least one of the underlying hash function. If the underlying hash functions have output length n, the combiner has output length 2 n. This basically matches a known lower bound for black-box combiners for collision-resistance only, thus the other properties can be achieved without penalizing the length of the hash values. We then propose a combiner which also preserves the property of being indifferentiable from a random oracle, slightly increasing the output length to 2 n+ω(log n). Moreover, we show how to augment our constructions in order to make them also robust for the one-wayness property, but in this case require an a priory upper bound on the input length.},
  author       = {Fischlin, Marc and Lehmann, Anja and Pietrzak, Krzysztof Z},
  journal      = {Journal of Cryptology},
  number       = {3},
  pages        = {397 -- 428},
  publisher    = {Springer},
  title        = {{Robust multi-property combiners for hash functions}},
  doi          = {10.1007/s00145-013-9148-7},
  volume       = {27},
  year         = {2014},
}

@inproceedings{2905,
  abstract     = {Persistent homology is a recent grandchild of homology that has found use in
science and engineering as well as in mathematics. This paper surveys the method as well
as the applications, neglecting completeness in favor of highlighting ideas and directions.},
  author       = {Edelsbrunner, Herbert and Morozovy, Dmitriy},
  location     = {Kraków, Poland},
  pages        = {31 -- 50},
  publisher    = {European Mathematical Society Publishing House},
  title        = {{Persistent homology: Theory and practice}},
  doi          = {10.4171/120-1/3},
  year         = {2014},
}

@article{3263,
  abstract     = {Adaptation in the retina is thought to optimize the encoding of natural light signals into sequences of spikes sent to the brain. While adaptive changes in retinal processing to the variations of the mean luminance level and second-order stimulus statistics have been documented before, no such measurements have been performed when higher-order moments of the light distribution change. We therefore measured the ganglion cell responses in the tiger salamander retina to controlled changes in the second (contrast), third (skew) and fourth (kurtosis) moments of the light intensity distribution of spatially uniform temporally independent stimuli. The skew and kurtosis of the stimuli were chosen to cover the range observed in natural scenes. We quantified adaptation in ganglion cells by studying linear-nonlinear models that capture well the retinal encoding properties across all stimuli. We found that the encoding properties of retinal ganglion cells change only marginally when higher-order statistics change, compared to the changes observed in response to the variation in contrast. By analyzing optimal coding in LN-type models, we showed that neurons can maintain a high information rate without large dynamic adaptation to changes in skew or kurtosis. This is because, for uncorrelated stimuli, spatio-temporal summation within the receptive field averages away non-gaussian aspects of the light intensity distribution.},
  author       = {Tkacik, Gasper and Ghosh, Anandamohan and Schneidman, Elad and Segev, Ronen},
  journal      = {PLoS One},
  number       = {1},
  publisher    = {Public Library of Science},
  title        = {{Adaptation to changes in higher-order stimulus statistics in the salamander retina}},
  doi          = {10.1371/journal.pone.0085841},
  volume       = {9},
  year         = {2014},
}

@article{468,
  abstract     = {Invasive alien parasites and pathogens are a growing threat to biodiversity worldwide, which can contribute to the extinction of endemic species. On the Galápagos Islands, the invasive parasitic fly Philornis downsi poses a major threat to the endemic avifauna. Here, we investigated the influence of this parasite on the breeding success of two Darwin's finch species, the warbler finch (Certhidea olivacea) and the sympatric small tree finch (Camarhynchus parvulus), on Santa Cruz Island in 2010 and 2012. While the population of the small tree finch appeared to be stable, the warbler finch has experienced a dramatic decline in population size on Santa Cruz Island since 1997. We aimed to identify whether warbler finches are particularly vulnerable during different stages of the breeding cycle. Contrary to our prediction, breeding success was lower in the small tree finch than in the warbler finch. In both species P. downsi had a strong negative impact on breeding success and our data suggest that heavy rain events also lowered the fledging success. On the one hand parents might be less efficient in compensating their chicks' energy loss due to parasitism as they might be less efficient in foraging on days of heavy rain. On the other hand, intense rainfalls might lead to increased humidity and more rapid cooling of the nests. In the case of the warbler finch we found that the control of invasive plant species with herbicides had a significant additive negative impact on the breeding success. It is very likely that the availability of insects (i.e. food abundance) is lower in such controlled areas, as herbicide usage led to the removal of the entire understory. Predation seems to be a minor factor in brood loss.},
  author       = {Cimadom, Arno and Ulloa, Angel and Meidl, Patrick and Zöttl, Markus and Zöttl, Elisabet and Fessl, Birgit and Nemeth, Erwin and Dvorak, Michael and Cunninghame, Francesca and Tebbich, Sabine},
  journal      = {PLoS One},
  number       = {9},
  publisher    = {Public Library of Science},
  title        = {{Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin's finches}},
  doi          = {10.1371/journal.pone.0107518},
  volume       = {9},
  year         = {2014},
}

@inproceedings{475,
  abstract     = {First cycle games (FCG) are played on a finite graph by two players who push a token along the edges until a vertex is repeated, and a simple cycle is formed. The winner is determined by some fixed property Y of the sequence of labels of the edges (or nodes) forming this cycle. These games are traditionally of interest because of their connection with infinite-duration games such as parity and mean-payoff games. We study the memory requirements for winning strategies of FCGs and certain associated infinite duration games. We exhibit a simple FCG that is not memoryless determined (this corrects a mistake in Memoryless determinacy of parity and mean payoff games: a simple proof by Bj⋯orklund, Sandberg, Vorobyov (2004) that claims that FCGs for which Y is closed under cyclic permutations are memoryless determined). We show that θ (n)! memory (where n is the number of nodes in the graph), which is always sufficient, may be necessary to win some FCGs. On the other hand, we identify easy to check conditions on Y (i.e., Y is closed under cyclic permutations, and both Y and its complement are closed under concatenation) that are sufficient to ensure that the corresponding FCGs and their associated infinite duration games are memoryless determined. We demonstrate that many games considered in the literature, such as mean-payoff, parity, energy, etc., satisfy these conditions. On the complexity side, we show (for efficiently computable Y) that while solving FCGs is in PSPACE, solving some families of FCGs is PSPACE-hard. },
  author       = {Aminof, Benjamin and Rubin, Sasha},
  booktitle    = {Electronic Proceedings in Theoretical Computer Science, EPTCS},
  location     = {Grenoble, France},
  pages        = {83 -- 90},
  publisher    = {Open Publishing Association},
  title        = {{First cycle games}},
  doi          = {10.4204/EPTCS.146.11},
  volume       = {146},
  year         = {2014},
}

@article{535,
  abstract     = {Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP∩co-NP, but are not known to be in P. The existence of polynomial-time algorithms has been a major open problem for decades and apart from pseudopolynomial algorithms there is no algorithm that solves any non-trivial subclass in polynomial time. In this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and present a polynomial-time algorithm when the penalty is large. Our algorithm is the first polynomial-time algorithm on a large class of weighted graphs. It includes several worst-case instances on which previous algorithms, such as value iteration and random facet algorithms, require at least sub-exponential time. Our main technique is developing the first non-trivial approximation algorithm and showing how to convert it to an exact algorithm. Moreover, we show that in a practical case in verification where weights are clustered around a constant number of values, the energy game problem can be solved in polynomial time. We also show that the problem is still as hard as in general when the clique-width is bounded or the graph is strongly ergodic, suggesting that restricting the graph structure does not necessarily help.},
  author       = {Chatterjee, Krishnendu and Henzinger, Monika H and Krinninger, Sebastian and Nanongkai, Danupon},
  journal      = {Algorithmica},
  number       = {3},
  pages        = {457 -- 492},
  publisher    = {Springer},
  title        = {{Polynomial-time algorithms for energy games with special weight structures}},
  doi          = {10.1007/s00453-013-9843-7},
  volume       = {70},
  year         = {2014},
}

@article{537,
  abstract     = {Transgenerational effects are broader than only parental relationships. Despite mounting evidence that multigenerational effects alter phenotypic and life-history traits, our understanding of how they combine to determine fitness is not well developed because of the added complexity necessary to study them. Here, we derive a quantitative genetic model of adaptation to an extraordinary new environment by an additive genetic component, phenotypic plasticity, maternal and grandmaternal effects. We show how, at equilibrium, negative maternal and negative grandmaternal effects maximize expected population mean fitness. We define negative transgenerational effects as those that have a negative effect on trait expression in the subsequent generation, that is, they slow, or potentially reverse, the expected evolutionary dynamic. When maternal effects are positive, negative grandmaternal effects are preferred. As expected under Mendelian inheritance, the grandmaternal effects have a lower impact on fitness than the maternal effects, but this dual inheritance model predicts a more complex relationship between maternal and grandmaternal effects to constrain phenotypic variance and so maximize expected population mean fitness in the offspring.},
  author       = {Prizak, Roshan and Ezard, Thomas and Hoyle, Rebecca},
  journal      = {Ecology and Evolution},
  number       = {15},
  pages        = {3139 -- 3145},
  publisher    = {Wiley-Blackwell},
  title        = {{Fitness consequences of maternal and grandmaternal effects}},
  doi          = {10.1002/ece3.1150},
  volume       = {4},
  year         = {2014},
}

@article{827,
  abstract     = {As sessile organisms, plants have to be able to adapt to a continuously changing environment. Plants that perceive some of these changes as stress signals activate signaling pathways to modulate their development and to enable them to survive. The complex responses to environmental cues are to a large extent mediated by plant hormones that together orchestrate the final plant response. The phytohormone cytokinin is involved in many plant developmental processes. Recently, it has been established that cytokinin plays an important role in stress responses, but does not act alone. Indeed, the hormonal control of plant development and stress adaptation is the outcome of a complex network of multiple synergistic and antagonistic interactions between various hormones. Here, we review the recent findings on the cytokinin function as part of this hormonal network. We focus on the importance of the crosstalk between cytokinin and other hormones, such as abscisic acid, jasmonate, salicylic acid, ethylene, and auxin in the modulation of plant development and stress adaptation. Finally, the impact of the current research in the biotechnological industry will be discussed.},
  author       = {O'Brien, José and Benková, Eva},
  journal      = {Frontiers in Plant Science},
  publisher    = {Frontiers Research Foundation},
  title        = {{Cytokinin cross talking during biotic and abiotic stress responses}},
  doi          = {10.3389/fpls.2013.00451},
  volume       = {4},
  year         = {2013},
}

@article{828,
  abstract     = {The plant root system is essential for providing anchorage to the soil, supplying minerals and water, and synthesizing metabolites. It is a dynamic organ modulated by external cues such as environmental signals, water and nutrients availability, salinity and others. Lateral roots (LRs) are initiated from the primary root post-embryonically, after which they progress through discrete developmental stages which can be independently controlled, providing a high level of plasticity during root system formation. Within this review, main contributions are presented, from the classical forward genetic screens to the more recent high-throughput approaches, combined with computer model predictions, dissecting how LRs and thereby root system architecture is established and developed.},
  author       = {Cuesta, Candela and Wabnik, Krzysztof T and Benková, Eva},
  journal      = {Frontiers in Plant Science},
  publisher    = {Frontiers Research Foundation},
  title        = {{Systems approaches to study root architecture dynamics}},
  doi          = {10.3389/fpls.2013.00537},
  volume       = {4},
  year         = {2013},
}

@inproceedings{2000,
  abstract     = {In this work we present a flexible tool for tumor progression, which simulates the evolutionary dynamics of cancer. Tumor progression implements a multi-type branching process where the key parameters are the fitness landscape, the mutation rate, and the average time of cell division. The fitness of a cancer cell depends on the mutations it has accumulated. The input to our tool could be any fitness landscape, mutation rate, and cell division time, and the tool produces the growth dynamics and all relevant statistics.},
  author       = {Reiter, Johannes and Božić, Ivana and Chatterjee, Krishnendu and Nowak, Martin},
  booktitle    = {Proceedings of 25th Int. Conf. on Computer Aided Verification},
  location     = {St. Petersburg, Russia},
  pages        = {101 -- 106},
  publisher    = {Springer},
  title        = {{TTP: Tool for tumor progression}},
  doi          = {10.1007/978-3-642-39799-8_6},
  volume       = {8044},
  year         = {2013},
}

@article{2009,
  abstract     = {Traditional statistical methods for confidentiality protection of statistical databases do not scale well to deal with GWAS databases especially in terms of guarantees regarding protection from linkage to external information. The more recent concept of differential privacy, introduced by the cryptographic community, is an approach which provides a rigorous definition of privacy with meaningful privacy guarantees in the presence of arbitrary external information, although the guarantees may come at a serious price in terms of data utility. Building on such notions, we propose new methods to release aggregate GWAS data without compromising an individual’s privacy. We present methods for releasing differentially private minor allele frequencies, chi-square statistics and p-values. We compare these approaches on simulated data and on a GWAS study of canine hair length involving 685 dogs. We also propose a privacy-preserving method for finding genome-wide associations based on a differentially-private approach to penalized logistic regression.},
  author       = {Uhler, Caroline and Slavkovic, Aleksandra and Fienberg, Stephen},
  journal      = {Journal of Privacy and Confidentiality },
  number       = {1},
  pages        = {137 -- 166},
  publisher    = {Carnegie Mellon University},
  title        = {{Privacy-preserving data sharing for genome-wide association studies}},
  doi          = {10.29012/jpc.v5i1.629},
  volume       = {5},
  year         = {2013},
}

@article{2010,
  abstract     = {Many algorithms for inferring causality rely heavily on the faithfulness assumption. The main justification for imposing this assumption is that the set of unfaithful distributions has Lebesgue measure zero, since it can be seen as a collection of hypersurfaces in a hypercube. However, due to sampling error the faithfulness condition alone is not sufficient for statistical estimation, and strong-faithfulness has been proposed and assumed to achieve uniform or high-dimensional consistency. In contrast to the plain faithfulness assumption, the set of distributions that is not strong-faithful has nonzero Lebesgue measure and in fact, can be surprisingly large as we show in this paper. We study the strong-faithfulness condition from a geometric and combinatorial point of view and give upper and lower bounds on the Lebesgue measure of strong-faithful distributions for various classes of directed acyclic graphs. Our results imply fundamental limitations for the PC-algorithm and potentially also for other algorithms based on partial correlation testing in the Gaussian case.},
  author       = {Uhler, Caroline and Raskutti, Garvesh and Bühlmann, Peter and Yu, Bin},
  journal      = {The Annals of Statistics},
  number       = {2},
  pages        = {436 -- 463},
  publisher    = {Institute of Mathematical Statistics},
  title        = {{Geometry of the faithfulness assumption in causal inference}},
  doi          = {10.1214/12-AOS1080},
  volume       = {41},
  year         = {2013},
}

@inproceedings{1374,
  abstract     = {We study two-player zero-sum games over infinite-state graphs equipped with ωB and finitary conditions. Our first contribution is about the strategy complexity, i.e the memory required for winning strategies: we prove that over general infinite-state graphs, memoryless strategies are sufficient for finitary Büchi, and finite-memory suffices for finitary parity games. We then study pushdown games with boundedness conditions, with two contributions. First we prove a collapse result for pushdown games with ωB-conditions, implying the decidability of solving these games. Second we consider pushdown games with finitary parity along with stack boundedness conditions, and show that solving these games is EXPTIME-complete.},
  author       = {Chatterjee, Krishnendu and Fijalkow, Nathanaël},
  booktitle    = {22nd EACSL Annual Conference on Computer Science Logic},
  location     = {Torino, Italy},
  pages        = {181 -- 196},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Infinite-state games with finitary conditions}},
  doi          = {10.4230/LIPIcs.CSL.2013.181},
  volume       = {23},
  year         = {2013},
}

@inproceedings{1376,
  abstract     = {We consider the distributed synthesis problem for temporal logic specifications. Traditionally, the problem has been studied for LTL, and the previous results show that the problem is decidable iff there is no information fork in the architecture. We consider the problem for fragments of LTL and our main results are as follows: (1) We show that the problem is undecidable for architectures with information forks even for the fragment of LTL with temporal operators restricted to next and eventually. (2) For specifications restricted to globally along with non-nested next operators, we establish decidability (in EXPSPACE) for star architectures where the processes receive disjoint inputs, whereas we establish undecidability for architectures containing an information fork-meet structure. (3) Finally, we consider LTL without the next operator, and establish decidability (NEXPTIME-complete) for all architectures for a fragment that consists of a set of safety assumptions, and a set of guarantees where each guarantee is a safety, reachability, or liveness condition.},
  author       = {Chatterjee, Krishnendu and Henzinger, Thomas A and Otop, Jan and Pavlogiannis, Andreas},
  booktitle    = {13th International Conference on Formal Methods in Computer-Aided Design},
  location     = {Portland, OR, United States},
  pages        = {18 -- 25},
  publisher    = {IEEE},
  title        = {{Distributed synthesis for LTL fragments}},
  doi          = {10.1109/FMCAD.2013.6679386},
  year         = {2013},
}