@inproceedings{2940,
abstract = {A chain rule for an entropy notion H(.) states that the entropy H(X) of a variable X decreases by at most l if conditioned on an l-bit string A, i.e., H(X|A)>= H(X)-l. More generally, it satisfies a chain rule for conditional entropy if H(X|Y,A)>= H(X|Y)-l.
All natural information theoretic entropy notions we are aware of (like Shannon or min-entropy) satisfy some kind of chain rule for conditional entropy. Moreover, many computational entropy notions (like Yao entropy, unpredictability entropy and several variants of HILL entropy) satisfy the chain rule for conditional entropy, though here not only the quantity decreases by l, but also the quality of the entropy decreases exponentially in l. However, for
the standard notion of conditional HILL entropy (the computational equivalent of min-entropy) the existence of such a rule was unknown so far.
In this paper, we prove that for conditional HILL entropy no meaningful chain rule exists, assuming the existence of one-way permutations: there exist distributions X,Y,A, where A is a distribution over a single bit, but $H(X|Y)>>H(X|Y,A)$, even if we simultaneously allow for a massive degradation in the quality of the entropy.
The idea underlying our construction is based on a surprising connection between the chain rule for HILL entropy and deniable encryption. },
author = {Krenn, Stephan and Pietrzak, Krzysztof Z and Wadia, Akshay},
editor = {Sahai, Amit},
location = {Tokyo, Japan},
pages = {23 -- 39},
publisher = {Springer},
title = {{A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it}},
doi = {10.1007/978-3-642-36594-2_2},
volume = {7785},
year = {2013},
}
@article{2944,
abstract = {We propose a two-step procedure for estimating multiple migration rates in an approximate Bayesian computation (ABC) framework, accounting for global nuisance parameters. The approach is not limited to migration, but generally of interest for inference problems with multiple parameters and a modular structure (e.g. independent sets of demes or loci). We condition on a known, but complex demographic model of a spatially subdivided population, motivated by the reintroduction of Alpine ibex (Capra ibex) into Switzerland. In the first step, the global parameters ancestral mutation rate and male mating skew have been estimated for the whole population in Aeschbacher et al. (Genetics 2012; 192: 1027). In the second step, we estimate in this study the migration rates independently for clusters of demes putatively connected by migration. For large clusters (many migration rates), ABC faces the problem of too many summary statistics. We therefore assess by simulation if estimation per pair of demes is a valid alternative. We find that the trade-off between reduced dimensionality for the pairwise estimation on the one hand and lower accuracy due to the assumption of pairwise independence on the other depends on the number of migration rates to be inferred: the accuracy of the pairwise approach increases with the number of parameters, relative to the joint estimation approach. To distinguish between low and zero migration, we perform ABC-type model comparison between a model with migration and one without. Applying the approach to microsatellite data from Alpine ibex, we find no evidence for substantial gene flow via migration, except for one pair of demes in one direction.},
author = {Aeschbacher, Simon and Futschik, Andreas and Beaumont, Mark},
journal = {Molecular Ecology},
number = {4},
pages = {987 -- 1002},
publisher = {Wiley-Blackwell},
title = {{Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates. }},
doi = {10.1111/mec.12165},
volume = {22},
year = {2013},
}
@inproceedings{2948,
abstract = {Many visual datasets are traditionally used to analyze the performance of different learning techniques. The evaluation is usually done within each dataset, therefore it is questionable if such results are a reliable indicator of true generalization ability. We propose here an algorithm to exploit the existing data resources when learning on a new multiclass problem. Our main idea is to identify an image representation that decomposes orthogonally into two subspaces: a part specific to each dataset, and a part generic to, and therefore shared between, all the considered source sets. This allows us to use the generic representation as un-biased reference knowledge for a novel classification task. By casting the method in the multi-view setting, we also make it possible to use different features for different databases. We call the algorithm MUST, Multitask Unaligned Shared knowledge Transfer. Through extensive experiments on five public datasets, we show that MUST consistently improves the cross-datasets generalization performance.},
author = {Tommasi, Tatiana and Quadrianto, Novi and Caputo, Barbara and Lampert, Christoph},
location = {Daejeon, Korea},
pages = {1 -- 15},
publisher = {Springer},
title = {{Beyond dataset bias: Multi-task unaligned shared knowledge transfer}},
doi = {10.1007/978-3-642-37331-2_1},
volume = {7724},
year = {2013},
}
@article{8245,
abstract = {Background: Monoclonal antibodies (mAb), such as trastuzumab are a valuable addition to breast cancer therapy.
Data obtained from neoadjuvant settings revealed that antibody-dependent cell-mediated cytotoxicity (ADCC) is a
major mechanism of action for the mAb trastuzumab. Conflicting results still call into question whether disease
progression, prolonged treatment or concomitant chemotherapy influences ADCC and related immunological
phenomena.
Methods: We analyzed the activity of ADCC and antibody-dependent cell-mediated phagocytosis (ADCP) of
peripheral blood mononuclear cells (PBMCs) from human epidermal growth factor receptor 2 (HER2/neu) positive
breast cancer patients receiving trastuzumab therapy either in an adjuvant (n = 13) or metastatic (n = 15) setting as
well as from trastuzumab treatment-naive (t-naive) HER2/neu negative patients (n = 15). PBMCs from healthy volunteers
(n = 24) were used as controls. ADCC and ADCP activity was correlated with the expression of antibody binding
Fc-gamma receptor (FcγR)I (CD64), FcγRII (CD32) and FcγRIII (CD16) on CD14+ (monocytes) and CD56+ (NK) cells, as well as the expression of CD107a+ (LAMP-1) on CD56+ cells and the total amount of CD4+CD25+FOXP3+ (Treg) cells. In metastatic patients, markers were correlated with progression-free survival (PFS).
Results: ADCC activity was significantly down regulated in metastatic, adjuvant and t-naive patient cohorts as compared to healthy controls. Reduced ADCC activity was inversely correlated with the expression of CD107a on CD56+
cells in adjuvant patients. ADCC and ADCP activity of the patient cohorts were similar, regardless of treatment duration
or additional chemotherapy. PFS in metastatic patients inversely correlated with the number of peripheral Treg cells.
Conclusion: The reduction of ADCC in patients as compared to healthy controls calls for adjuvant strategies, such as
immune-enhancing agents, to improve the activity of trastuzumab. However, efficacy of trastuzumab-specific ADCC
and ADCP appears not to be affected by treatment duration, disease progression or concomitant chemotherapy. This
finding supports the application of trastuzumab at any stage of the disease.},
author = {Petricevic, Branka and Laengle, Johannes and Singer, Josef and Sachet, Monika and Fazekas, Judit and Steger, Guenther and Bartsch, Rupert and Jensen-Jarolim, Erika and Bergmann, Michael},
issn = {1479-5876},
journal = {Journal of Translational Medicine},
publisher = {Springer Nature},
title = {{Trastuzumab mediates antibody-dependent cell-mediated cytotoxicity and phagocytosis to the same extent in both adjuvant and metastatic HER2/neu breast cancer patients}},
doi = {10.1186/1479-5876-11-307},
volume = {11},
year = {2013},
}
@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},
}
@article{8462,
abstract = {The transition of proteins from their soluble functional state to amyloid fibrils and aggregates is associated with the onset of several human diseases. Protein aggregation often requires some structural reshaping and the subsequent formation of intermolecular contacts. Therefore, the study of the conformation of excited protein states and their ability to form oligomers is of primary importance for understanding the molecular basis of amyloid fibril formation. Here, we investigated the oligomerization processes that occur along the folding of the amyloidogenic human protein β2-microglobulin. The combination of real-time two-dimensional NMR data with real-time small-angle X-ray scattering measurements allowed us to derive thermodynamic and kinetic information on protein oligomerization of different conformational states populated along the folding pathways. In particular, we could demonstrate that a long-lived folding intermediate (I-state) has a higher propensity to oligomerize compared to the native state. Our data agree well with a simple five-state kinetic model that involves only monomeric and dimeric species. The dimers have an elongated shape with the dimerization interface located at the apical side of β2-microglobulin close to Pro32, the residue that has a trans conformation in the I-state and a cis conformation in the native (N) state. Our experimental data suggest that partial unfolding in the apical half of the protein close to Pro32 leads to an excited state conformation with enhanced propensity for oligomerization. This excited state becomes more populated in the transient I-state due to the destabilization of the native conformation by the trans-Pro32 configuration.},
author = {Rennella, E. and Cutuil, T. and Schanda, Paul and Ayala, I. and Gabel, F. and Forge, V. and Corazza, A. and Esposito, G. and Brutscher, B.},
issn = {0022-2836},
journal = {Journal of Molecular Biology},
keywords = {Molecular Biology},
number = {15},
pages = {2722--2736},
publisher = {Elsevier},
title = {{Oligomeric states along the folding pathways of β2-microglobulin: Kinetics, thermodynamics, and structure}},
doi = {10.1016/j.jmb.2013.04.028},
volume = {425},
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{2181,
abstract = {There is a trade-off between performance and correctness in implementing concurrent data structures. Better performance may be achieved at the expense of relaxing correctness, by redefining the semantics of data structures. We address such a redefinition of data structure semantics and present a systematic and formal framework for obtaining new data structures by quantitatively relaxing existing ones. We view a data structure as a sequential specification S containing all "legal" sequences over an alphabet of method calls. Relaxing the data structure corresponds to defining a distance from any sequence over the alphabet to the sequential specification: the k-relaxed sequential specification contains all sequences over the alphabet within distance k from the original specification. In contrast to other existing work, our relaxations are semantic (distance in terms of data structure states). As an instantiation of our framework, we present two simple yet generic relaxation schemes, called out-of-order and stuttering relaxation, along with several ways of computing distances. We show that the out-of-order relaxation, when further instantiated to stacks, queues, and priority queues, amounts to tolerating bounded out-of-order behavior, which cannot be captured by a purely syntactic relaxation (distance in terms of sequence manipulation, e.g. edit distance). We give concurrent implementations of relaxed data structures and demonstrate that bounded relaxations provide the means for trading correctness for performance in a controlled way. The relaxations are monotonic which further highlights the trade-off: increasing k increases the number of permitted sequences, which as we demonstrate can lead to better performance. Finally, since a relaxed stack or queue also implements a pool, we actually have new concurrent pool implementations that outperform the state-of-the-art ones.},
author = {Henzinger, Thomas A and Kirsch, Christoph and Payer, Hannes and Sezgin, Ali and Sokolova, Ana},
booktitle = {Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language},
isbn = {978-1-4503-1832-7},
location = {Rome, Italy},
pages = {317 -- 328},
publisher = {ACM},
title = {{Quantitative relaxation of concurrent data structures}},
doi = {10.1145/2429069.2429109},
year = {2013},
}
@inproceedings{2182,
abstract = {We propose a general framework for abstraction with respect to quantitative properties, such as worst-case execution time, or power consumption. Our framework provides a systematic way for counter-example guided abstraction refinement for quantitative properties. The salient aspect of the framework is that it allows anytime verification, that is, verification algorithms that can be stopped at any time (for example, due to exhaustion of memory), and report approximations that improve monotonically when the algorithms are given more time. We instantiate the framework with a number of quantitative abstractions and refinement schemes, which differ in terms of how much quantitative information they keep from the original system. We introduce both state-based and trace-based quantitative abstractions, and we describe conditions that define classes of quantitative properties for which the abstractions provide over-approximations. We give algorithms for evaluating the quantitative properties on the abstract systems. We present algorithms for counter-example based refinements for quantitative properties for both state-based and segment-based abstractions. We perform a case study on worst-case execution time of executables to evaluate the anytime verification aspect and the quantitative abstractions we proposed.},
author = {Cerny, Pavol and Henzinger, Thomas A and Radhakrishna, Arjun},
booktitle = {Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language},
location = {Rome, Italy},
pages = {115 -- 128},
publisher = {ACM},
title = {{Quantitative abstraction refinement}},
doi = {10.1145/2429069.2429085},
year = {2013},
}
@inproceedings{2209,
abstract = {A straight skeleton is a well-known geometric structure, and several algorithms exist to construct the straight skeleton for a given polygon or planar straight-line graph. In this paper, we ask the reverse question: Given the straight skeleton (in form of a planar straight-line graph, with some rays to infinity), can we reconstruct a planar straight-line graph for which this was the straight skeleton? We show how to reduce this problem to the problem of finding a line that intersects a set of convex polygons. We can find these convex polygons and all such lines in $O(nlog n)$ time in the Real RAM computer model, where $n$ denotes the number of edges of the input graph. We also explain how our approach can be used for recognizing Voronoi diagrams of points, thereby completing a partial solution provided by Ash and Bolker in 1985.
},
author = {Biedl, Therese and Held, Martin and Huber, Stefan},
location = {St. Petersburg, Russia},
pages = {37 -- 46},
publisher = {IEEE},
title = {{Recognizing straight skeletons and Voronoi diagrams and reconstructing their input}},
doi = {10.1109/ISVD.2013.11},
year = {2013},
}
@inproceedings{2210,
abstract = {A straight skeleton is a well-known geometric structure, and several algorithms exist to construct the straight skeleton for a given polygon. In this paper, we ask the reverse question: Given the straight skeleton (in form of a tree with a drawing in the plane, but with the exact position of the leaves unspecified), can we reconstruct the polygon? We show that in most cases there exists at most one polygon; in the remaining case there is an infinite number of polygons determined by one angle that can range in an interval. We can find this (set of) polygon(s) in linear time in the Real RAM computer model.},
author = {Biedl, Therese and Held, Martin and Huber, Stefan},
booktitle = {29th European Workshop on Computational Geometry},
location = {Braunschweig, Germany},
pages = {95 -- 98},
publisher = {TU Braunschweig},
title = {{Reconstructing polygons from embedded straight skeletons}},
year = {2013},
}
@inproceedings{2237,
abstract = {We describe new extensions of the Vampire theorem prover for computing tree interpolants. These extensions generalize Craig interpolation in Vampire, and can also be used to derive sequence interpolants. We evaluated our implementation on a large number of examples over the theory of linear integer arithmetic and integer-indexed arrays, with and without quantifiers. When compared to other methods, our experiments show that some examples could only be solved by our implementation.},
author = {Blanc, Régis and Gupta, Ashutosh and Kovács, Laura and Kragl, Bernhard},
location = {Stellenbosch, South Africa},
pages = {173 -- 181},
publisher = {Springer},
title = {{Tree interpolation in Vampire}},
doi = {10.1007/978-3-642-45221-5_13},
volume = {8312},
year = {2013},
}
@inproceedings{2238,
abstract = {We study the problem of achieving a given value in Markov decision processes (MDPs) with several independent discounted reward objectives. We consider a generalised version of discounted reward objectives, in which the amount of discounting depends on the states visited and on the objective. This definition extends the usual definition of discounted reward, and allows to capture the systems in which the value of different commodities diminish at different and variable rates.
We establish results for two prominent subclasses of the problem, namely state-discount models where the discount factors are only dependent on the state of the MDP (and independent of the objective), and reward-discount models where they are only dependent on the objective (but not on the state of the MDP). For the state-discount models we use a straightforward reduction to expected total reward and show that the problem whether a value is achievable can be solved in polynomial time. For the reward-discount model we show that memory and randomisation of the strategies are required, but nevertheless that the problem is decidable and it is sufficient to consider strategies which after a certain number of steps behave in a memoryless way.
For the general case, we show that when restricted to graphs (i.e. MDPs with no randomisation), pure strategies and discount factors of the form 1/n where n is an integer, the problem is in PSPACE and finite memory suffices for achieving a given value. We also show that when the discount factors are not of the form 1/n, the memory required by a strategy can be infinite.
},
author = {Chatterjee, Krishnendu and Forejt, Vojtěch and Wojtczak, Dominik},
location = {Stellenbosch, South Africa},
pages = {228 -- 242},
publisher = {Springer},
title = {{Multi-objective discounted reward verification in graphs and MDPs}},
doi = {10.1007/978-3-642-45221-5_17},
volume = {8312},
year = {2013},
}
@inproceedings{2243,
abstract = {We show that modal logic over universally first-order definable classes of transitive frames is decidable. More precisely, let K be an arbitrary class of transitive Kripke frames definable by a universal first-order sentence. We show that the global and finite global satisfiability problems of modal logic over K are decidable in NP, regardless of choice of K. We also show that the local satisfiability and the finite local satisfiability problems of modal logic over K are decidable in NEXPTIME.},
author = {Michaliszyn, Jakub and Otop, Jan},
location = {Torino, Italy},
pages = {563 -- 577},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
title = {{Elementary modal logics over transitive structures}},
doi = {10.4230/LIPIcs.CSL.2013.563},
volume = {23},
year = {2013},
}
@inproceedings{2244,
abstract = {We consider two systems (α1,...,αm) and (β1,...,βn) of curves drawn on a compact two-dimensional surface ℳ with boundary. Each αi and each βj is either an arc meeting the boundary of ℳ at its two endpoints, or a closed curve. The αi are pairwise disjoint except for possibly sharing endpoints, and similarly for the βj. We want to "untangle" the βj from the αi by a self-homeomorphism of ℳ; more precisely, we seek an homeomorphism φ: ℳ → ℳ fixing the boundary of ℳ pointwise such that the total number of crossings of the αi with the φ(βj) is as small as possible. This problem is motivated by an application in the algorithmic theory of embeddings and 3-manifolds. We prove that if ℳ is planar, i.e., a sphere with h ≥ 0 boundary components ("holes"), then O(mn) crossings can be achieved (independently of h), which is asymptotically tight, as an easy lower bound shows. In general, for an arbitrary (orientable or nonorientable) surface ℳ with h holes and of (orientable or nonorientable) genus g ≥ 0, we obtain an O((m + n)4) upper bound, again independent of h and g. },
author = {Matoušek, Jiří and Sedgwick, Eric and Tancer, Martin and Wagner, Uli},
location = {Bordeaux, France},
pages = {472 -- 483},
publisher = {Springer},
title = {{Untangling two systems of noncrossing curves}},
doi = {10.1007/978-3-319-03841-4_41},
volume = {8242},
year = {2013},
}
@article{2247,
abstract = {Cooperative behavior, where one individual incurs a cost to help another, is a wide spread phenomenon. Here we study direct reciprocity in the context of the alternating Prisoner's Dilemma. We consider all strategies that can be implemented by one and two-state automata. We calculate the payoff matrix of all pairwise encounters in the presence of noise. We explore deterministic selection dynamics with and without mutation. Using different error rates and payoff values, we observe convergence to a small number of distinct equilibria. Two of them are uncooperative strict Nash equilibria representing always-defect (ALLD) and Grim. The third equilibrium is mixed and represents a cooperative alliance of several strategies, dominated by a strategy which we call Forgiver. Forgiver cooperates whenever the opponent has cooperated; it defects once when the opponent has defected, but subsequently Forgiver attempts to re-establish cooperation even if the opponent has defected again. Forgiver is not an evolutionarily stable strategy, but the alliance, which it rules, is asymptotically stable. For a wide range of parameter values the most commonly observed outcome is convergence to the mixed equilibrium, dominated by Forgiver. Our results show that although forgiving might incur a short-term loss it can lead to a long-term gain. Forgiveness facilitates stable cooperation in the presence of exploitation and noise.},
author = {Zagorsky, Benjamin and Reiter, Johannes and Chatterjee, Krishnendu and Nowak, Martin},
journal = {PLoS One},
number = {12},
publisher = {Public Library of Science},
title = {{Forgiver triumphs in alternating prisoner's dilemma }},
doi = {10.1371/journal.pone.0080814},
volume = {8},
year = {2013},
}
@article{2256,
abstract = {Linked (Open) Data - bibliographic data on the Semantic Web. Report of the Working Group on Linked Data to the plenary assembly of the Austrian Library Network (translation of the title). Linked Data stands for a certain approach to publishing data on the Web. The underlying idea is to harmonise heterogeneous data sources of different origin in order to improve their accessibility and interoperability, effectively making them queryable as a big distributed database. This report summarises relevant developments in Europe as well as the Linked Data Working Group‘s strategic and technical considerations regarding the publishing of the Austrian Library Network’s (OBV’s) bibliographic datasets. It concludes with the mutual agreement that the implementation of Linked Data principles within the OBV can only be taken into consideration accompanied by a discussion about the provision of the datasets under a free license.},
author = {Danowski, Patrick and Goldfarb, Doron and Schaffner, Verena and Seidler, Wolfram},
journal = {VÖB Mitteilungen},
number = {3/4},
pages = {559 -- 587},
publisher = {Verein Österreichischer Bibliothekarinnen und Bibliothekare},
title = {{Linked (Open) Data - Bibliographische Daten im Semantic Web}},
volume = {66},
year = {2013},
}