Institution
Johannes Kepler University of Linz
Education•Linz, Oberösterreich, Austria•
About: Johannes Kepler University of Linz is a education organization based out in Linz, Oberösterreich, Austria. It is known for research contribution in the topics: Thin film & Quantum dot. The organization has 6605 authors who have published 19243 publications receiving 385667 citations.
Papers published on a yearly basis
Papers
More filters
02 Mar 2011
TL;DR: The proposed approach is tested on real-world data from the province of Manabí in Ecuador and the results associated with the different risk measures are analyzed to illustrate the value of the proposed approach for the design of disaster relief networks.
Abstract: We consider the problem of designing the logistic system to assure adequate distribution of relief aid in a post-natural-disaster situation, when damages to infrastructure may disrupt the delivery of relief aid. The problem is formulated as a multi-objective optimization problem, encompassing three objective functions of central interest in such problems. The first objective function is a measure of risk (various forms of such risk are analyzed). The second objective function measures the coverage provided by the logistic system in the distribution of relief aid to disaster victims. The third objective function represents total travel time. We focus on the risk of delivery tours for relief supplies, where risk here captures the threat that potential tours become impassable after the natural hazard event. In order to cope with a range of different natural disasters and policy objectives, we develop five approaches emphasizing different measures of tour-dependent risk. To cover both earthquake and flood risks, we consider correlated as well as uncorrelated risk measures. We develop a two-phase solution approach to reflect the dictates of real-world disaster relief motivating this analysis. The first phase generates potentially Pareto-optimal solutions to the overall multi-objective logistic design problem with respect to three objectives. For any given risk measure, the first-phase design problem is formulated as a multi-objective integer program and a memetic algorithm is proposed as the solution approach. The second phase is an enrichment procedure to generate a broader range of potentially Pareto-optimal alternatives. The suggested approach is tested on real-world data from the province of Manabi in Ecuador and the results associated with the different risk measures are analyzed to illustrate the value of the proposed approach for the design of disaster relief networks.
91 citations
••
TL;DR: In this article, the authors review the basic principles of magnetometry and present a representative discussion of artifacts which can occur in studying samples like soft magnetic materials as well as low moment samples.
Abstract: In the field of nanomagnetism and spintronics, integral magnetometry is nowadays challenged by samples with low magnetic moments and/or low coercive fields. Commercial superconducting quantum interference device magnetometers are versatile experimental tools to magnetically characterize samples with ultimate sensitivity as well as with a high degree of automation. For realistic experimental conditions, the as-recorded magnetic signal contains several artifacts, especially if small signals are measured on top of a large magnetic background or low magnetic fields are required. In this Tutorial, we will briefly review the basic principles of magnetometry and present a representative discussion of artifacts which can occur in studying samples like soft magnetic materials as well as low moment samples. It turns out that special attention is needed to quantify and correct the residual fields of the superconducting magnet to derive useful information from integral magnetometry while pushing the limits of detection and to avoid erroneous conclusions.
90 citations
••
TL;DR: An upper bound is proved on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.
Abstract: We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights. We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules. We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.
90 citations
••
01 Jan 2016TL;DR: This research work analyzes and clarifies the term ontology and points out its difference from taxonomy, and proposes guidelines for selecting an appropriate model, methodology, and tool set to meet customer requirements while making most efficient use of resources.
Abstract: Ontologies have been less successful than they could be in large-scale business applications due to a wide variety of interpretations. This leads to confusion, and consequently, people from various research communities use the term with different – sometimes incompatible – meanings. This research work analyzes and clarifies the term ontology and points out its difference from taxonomy. By way of two business case studies, both their potential in ontological engineering and the perceived requirements for ontologies are highlighted, and their misuse in research and business is discussed. In order to examine the case for applying ontologies in a specific domain or use case, the main benefits of using ontologies are defined and categorized as technical-centered or user-centered. Key factors that influence the use of ontologies in business applications are derived and discussed. Finally, the paper offers a recommendation for efficiently applying ontologies, including adequate representation languages and an ontological engineering process supported by reference ontologies. To answer the questions of when ontologies should be used, how they can be used efficiently, and when they should not be used, we propose guidelines for selecting an appropriate model, methodology, and tool set to meet customer requirements while making most efficient use of resources.
90 citations
••
TL;DR: ThinkLets, i.e., collaborative practices from the area of collaboration engineering, are the building blocks of the presented approach as they codify agile principles such as stakeholder involvement, rapid feedback, or value-based prioritization.
90 citations
Authors
Showing all 6718 results
Name | H-index | Papers | Citations |
---|---|---|---|
Wolfgang Wagner | 156 | 2342 | 123391 |
A. Paul Alivisatos | 146 | 470 | 101741 |
Klaus-Robert Müller | 129 | 764 | 79391 |
Christoph J. Brabec | 120 | 896 | 68188 |
Andreas Heinz | 108 | 1078 | 45002 |
Niyazi Serdar Sariciftci | 99 | 591 | 54055 |
Lars Samuelson | 96 | 850 | 36931 |
Peter J. Oefner | 90 | 348 | 30729 |
Dmitri V. Talapin | 90 | 303 | 39572 |
Tomás Torres | 88 | 625 | 28223 |
Ramesh Raskar | 86 | 670 | 30675 |
Siegfried Bauer | 84 | 422 | 26759 |
Alexander Eychmüller | 82 | 444 | 23688 |
Friedrich Schneider | 82 | 554 | 27383 |
Maksym V. Kovalenko | 81 | 360 | 34805 |