Institution
Technische Universität Darmstadt
Education•Darmstadt, Germany•
About: Technische Universität Darmstadt is a education organization based out in Darmstadt, Germany. It is known for research contribution in the topics: Computer science & Context (language use). The organization has 17316 authors who have published 40619 publications receiving 937916 citations. The organization is also known as: Darmstadt University of Technology & University of Darmstadt.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: In this paper, a method for extracting dislocation lines from atomistic simulation data in a fully automated way is described, which is called dislocation extraction algorithm (DXA), which generates a geometric description of dislocations lines contained in an arbitrary crystalline model structure.
Abstract: We describe a novel method for extracting dislocation lines from atomistic simulation data in a fully automated way. The dislocation extraction algorithm (DXA) generates a geometric description of dislocation lines contained in an arbitrary crystalline model structure. Burgers vectors are determined reliably, and the extracted dislocation network fulfills the Burgers vector conservation rule at each node. All remaining crystal defects (grain boundaries, surfaces, etc), which cannot be represented by one-dimensional dislocation lines, are output as triangulated surfaces. This geometric representation is ideal for visualization of complex defect structures, even if they are not related to dislocation activity. In contrast to the recently proposed on-the-fly dislocation detection algorithm (ODDA) Stukowski (2010 Modelling Simul. Mater. Sci. Eng. 18 015012) the new method is extremely robust. While the ODDA was designed for a computationally efficient on-the-fly analysis, the DXA method enables a detailed analysis of dislocation lines even in highly distorted crystal regions, as they occur, for instance, close to grain boundaries or in dense dislocation networks.
849 citations
••
[...]
TL;DR: The approach provides a practical method for learning high-order Markov random field models with potential functions that extend over large pixel neighborhoods with non-linear functions of many linear filter responses.
Abstract: We develop a framework for learning generic, expressive image priors that capture the statistics of natural scenes and can be used for a variety of machine vision tasks. The approach provides a practical method for learning high-order Markov random field (MRF) models with potential functions that extend over large pixel neighborhoods. These clique potentials are modeled using the Product-of-Experts framework that uses non-linear functions of many linear filter responses. In contrast to previous MRF approaches all parameters, including the linear filters themselves, are learned from training data. We demonstrate the capabilities of this Field-of-Experts model with two example applications, image denoising and image inpainting, which are implemented using a simple, approximate inference scheme. While the model is trained on a generic image database and is not tuned toward a specific application, we obtain results that compete with specialized techniques.
848 citations
••
TL;DR: It is shown that < or =25% of DSBs require ATM signaling for repair, and this percentage correlates with increased chromatin but not damage complexity, which suggests that the importance of ATM signalling for DSB repair increases as the heterochromatic component of a genome expands.
845 citations
••
TL;DR: This work proposes a suitable extension of label ranking that incorporates the calibrated scenario and substantially extends the expressive power of existing approaches and suggests a conceptually novel technique for extending the common learning by pairwise comparison approach to the multilabel scenario, a setting previously not being amenable to the pairwise decomposition technique.
Abstract: Label ranking studies the problem of learning a mapping from instances to rankings over a predefined set of labels. Hitherto existing approaches to label ranking implicitly operate on an underlying (utility) scale which is not calibrated in the sense that it lacks a natural zero point. We propose a suitable extension of label ranking that incorporates the calibrated scenario and substantially extends the expressive power of these approaches. In particular, our extension suggests a conceptually novel technique for extending the common learning by pairwise comparison approach to the multilabel scenario, a setting previously not being amenable to the pairwise decomposition technique. The key idea of the approach is to introduce an artificial calibration label that, in each example, separates the relevant from the irrelevant labels. We show that this technique can be viewed as a combination of pairwise preference learning and the conventional relevance classification technique, where a separate classifier is trained to predict whether a label is relevant or not. Empirical results in the area of text categorization, image classification and gene analysis underscore the merits of the calibrated model in comparison to state-of-the-art multilabel learning methods.
825 citations
••
TL;DR: In this article, the authors derived explicit expressions for quantum discord for a larger class of two-qubit states, namely, a seven-parameter family of so called X states that have been of interest in a variety of contexts in the field.
Abstract: Quantum discord, a kind of quantum correlation, is defined as the difference between quantum mutual information and classical correlation in a bipartite system. In general, this correlation is different from entanglement, and quantum discord may be nonzero even for certain separable states. Even in the simple case of bipartite quantum systems, this different kind of quantum correlation has interesting and significant applications in quantum information processing. So far, quantum discord has been calculated explicitly only for a rather limited set of two-qubit quantum states and expressions for more general quantum states are not known. In this article, we derive explicit expressions for quantum discord for a larger class of two-qubit states, namely, a seven-parameter family of so called X states that have been of interest in a variety of contexts in the field. We also study the relation between quantum discord, classical correlation, and entanglement for a number of two-qubit states to demonstrate that they are independent measures of correlation with no simple relative ordering between them.
822 citations
Authors
Showing all 17627 results
Name | H-index | Papers | Citations |
---|---|---|---|
Yang Gao | 168 | 2047 | 146301 |
Herbert A. Simon | 157 | 745 | 194597 |
Stephen Boyd | 138 | 822 | 151205 |
Jun Chen | 136 | 1856 | 77368 |
Harold A. Mooney | 135 | 450 | 100404 |
Bernt Schiele | 130 | 568 | 70032 |
Sascha Mehlhase | 126 | 858 | 70601 |
Yuri S. Kivshar | 126 | 1845 | 79415 |
Michael Wagner | 124 | 351 | 54251 |
Wolf Singer | 124 | 580 | 72591 |
Tasawar Hayat | 116 | 2364 | 84041 |
Edouard Boos | 116 | 757 | 64488 |
Martin Knapp | 106 | 1067 | 48518 |
T. Kuhl | 101 | 761 | 40812 |
Peter Braun-Munzinger | 100 | 527 | 34108 |