@inproceedings{19917,
abstract = {Juni 2010},
author = {Büker, Petra},
title = {{Hilf mir, es selbst zu tun! Rede anlässlich der Gründungsveranstaltung der Montessori-Schule Salzkotten}},
year = {2010},
}
@inproceedings{21772,
author = {Arens, Stephan and Domik, Gitta},
booktitle = {IEEE/ EG Symposium on Volume Graphics},
editor = {Westermann, Ruediger and Kindlmann, Gordon},
isbn = {978-3-905674-23-1},
issn = {1727-8376},
pages = {77–83},
publisher = {The Eurographics Association},
title = {{A Survey of Transfer Functions Suitable for Volume Rendering}},
doi = {10.2312/VG/VG10/077-083},
year = {2010},
}
@phdthesis{22357,
author = {Möller, Jens},
isbn = {978-3- 89959-966-4},
publisher = {Der Andere Verlag},
title = {{Rechnerische und experimentelle Bestimmung der Lagerkräfte eines stufenlosen Umschlingungsgetriebes}},
year = {2010},
}
@inproceedings{15035,
author = {Wette, Philip and Arens, Stephan and Elsner, Andreas and Domik, Gitta},
booktitle = {Computer Graphics and Imaging},
title = {{Extending the corkscrew algorithm to find bifurcations of vessels}},
doi = {10.2316/P.2010.679-081},
volume = {679},
year = {2010},
}
@inproceedings{3467,
author = {Becker, Jörg and Beverungen, Daniel and Matzner, Martin and Müller, Oliver},
booktitle = {Proceedings of the IADIS Internatioal Conference e-Society 2010},
editor = {Kommers, Piet and Isaías, Pedro},
isbn = {978-972-8939-07-6},
location = {Porto, Portugal},
pages = {322----329},
title = {{Total Cost of Service Life --- Decision Support for Selecting and Orchestrating Services}},
year = {2010},
}
@article{18558,
abstract = {We present an implementation of the GW approximation for the electronic self-energy within the full-potential linearized augmented-plane-wave (FLAPW) method. The algorithm uses an all-electron mixed product basis for the representation of response matrices and related quantities. This basis is derived from the FLAPW basis and is exact for wave-function products. The correlation part of the self-energy is calculated on the imaginary-frequency axis with a subsequent analytic continuation to the real axis. As an alternative we can perform the frequency convolution of the Green function G and the dynamically screened Coulomb interaction W explicitly by a contour integration. The singularity of the bare and screened interaction potentials gives rise to a numerically important self-energy contribution, which we treat analytically to achieve good convergence with respect to the k-point sampling. As numerical realizations of the GW approximation typically suffer from the high computational expense required for the evaluation of the nonlocal and frequency-dependent self-energy, we demonstrate how the algorithm can be made very efficient by exploiting spatial and time-reversal symmetry as well as by applying an optimization of the mixed product basis that retains only the numerically important contributions of the electron-electron interaction. This optimization step reduces the basis size without compromising the accuracy and accelerates the code considerably. Furthermore, we demonstrate that one can employ an extrapolar approximation for high-lying states to reduce the number of empty states that must be taken into account explicitly in the construction of the polarization function and the self-energy. We show convergence tests, CPU timings, and results for prototype semiconductors and insulators as well as ferromagnetic nickel.},
author = {Friedrich, Christoph and Blügel, Stefan and Schindlmayr, Arno},
issn = {1550-235X},
journal = {Physical Review B},
number = {12},
publisher = {American Physical Society},
title = {{Efficient implementation of the GW approximation within the all-electron FLAPW method}},
doi = {10.1103/PhysRevB.81.125102},
volume = {81},
year = {2010},
}
@unpublished{10202,
abstract = {An $r$-graph is an $r$-regular graph where every odd set of vertices is
connected by at least $r$ edges to the rest of the graph. Seymour conjectured
that any $r$-graph is $r+1$-edge-colorable, and also that any $r$-graph
contains $2r$ perfect matchings such that each edge belongs to two of them. We
show that the minimum counter-example to either of these conjectures is a
brick. Furthermore we disprove a variant of a conjecture of Fan, Raspaud.},
author = {Mkrtchyan, Vahan and Steffen, Eckhard},
booktitle = {arXiv:1003.5782},
title = {{Bricks and conjectures of Berge, Fulkerson and Seymour}},
year = {2010},
}
@inproceedings{10776,
author = {Khatir, Mehrdad and Ghasemzadeh Mohammadi, Hassan and Ejlali, Alireza},
booktitle = {Computer Design (ICCD), 2010 IEEE International Conference on},
pages = {138--144},
publisher = {IEEE},
title = {{Sub-threshold charge recovery circuits}},
doi = {10.1109/ICCD.2010.5647815},
year = {2010},
}
@misc{10649,
author = {Dridger, Denis},
publisher = {Paderborn University},
title = {{Soft Microprocessors with tightly coupled Application-Specific Coprocessors}},
year = {2010},
}
@misc{10670,
author = {Fröse, Viktor and Ibers, Rüdiger and Hellebrand, Sybille},
keyword = {WORKSHOP},
title = {{Testdatenkompression mit Hilfe der Netzwerkinfrastruktur}},
year = {2010},
}