Refine
Year of publication
- 2020 (235) (remove)
Institute
- Fachbereich Medizintechnik und Technomathematik (59)
- Fachbereich Energietechnik (35)
- Fachbereich Wirtschaftswissenschaften (34)
- IfB - Institut für Bioengineering (32)
- Fachbereich Luft- und Raumfahrttechnik (31)
- Fachbereich Elektrotechnik und Informationstechnik (29)
- ECSM European Center for Sustainable Mobility (18)
- Fachbereich Maschinenbau und Mechatronik (17)
- Fachbereich Bauingenieurwesen (14)
- Solar-Institut Jülich (14)
Has Fulltext
- no (235) (remove)
Language
- English (169)
- German (64)
- Multiple languages (1)
- Dutch (1)
Document Type
- Article (130)
- Conference Proceeding (55)
- Part of a Book (19)
- Book (9)
- Review (7)
- Other (4)
- Doctoral Thesis (3)
- Patent (3)
- Conference Poster (2)
- Conference: Meeting Abstract (1)
Keywords
- MINLP (3)
- Additive manufacturing (2)
- Adjacent buildings (2)
- Experimental validation (2)
- Historical centres (2)
- INODIS (2)
- Shake table test (2)
- Stone masonry (2)
- rebound-effect (2)
- sustainability (2)
Three-dimensional (3D) full-field measurements provide a comprehensive and accurate validation of finite element (FE) models. For the validation, the result of the model and measurements are compared based on two respective point-sets and this requires the point-sets to be registered in one coordinate system. Point-set registration is a non-convex optimization problem that has widely been solved by the ordinary iterative closest point algorithm. However, this approach necessitates a good initialization without which it easily returns a local optimum, i.e. an erroneous registration. The globally optimal iterative closest point (Go-ICP) algorithm has overcome this drawback and forms the basis for the presented open-source tool that can be used for the validation of FE models using 3D full-field measurements. The capability of the tool is demonstrated using an application example from the field of biomechanics. Methodological problems that arise in real-world data and the respective implemented solution approaches are discussed.
Die Energiewirtschaft befindet sich in einem starken Wandel, der v. a. durch die Energiewende und Digitalisierung Druck auf sämtliche Marktteilnehmer ausübt. Das klassische Geschäftsmodell des Energieversorgungsunternehmens verändert sich dabei grundlegend. Der kontinuierlich ansteigende Einsatz dezentraler und volatiler Erzeugungsanlagen macht die Identifikation von Flexibilitätspotenzialen notwendig, um weiterhin eine hohe Versorgungssicherheit zu gewährleisten. Dieser Schritt ist nur mit einem hohen Digitalisierungsgrad möglich. Eine funktionale Plattform mit Microservices, die zu Geschäftsprozessen verbunden werden können, wird als Möglichkeit zur Aktivierung der Flexibilität und Digitalisierung der Energieversorgungsunternehmen im Folgenden vorgestellt.
Experience has shown that a priori created static resource allocation plans are vulnerable to runtime deviations and hence often become uneconomic or highly exceed a predefined soft deadline. The assumption of constant task execution times during allocation planning is even more unlikely in a cloud environment where virtualized resources vary in performance. Revising the initially created resource allocation plan at runtime allows the scheduler to react on deviations between planning and execution. Such an adaptive rescheduling of a many-task application workflow is only feasible, when the planning time can be handled efficiently at runtime. In this paper, we present the static low-complexity resource allocation planning algorithm (LCP) applicable to efficiently schedule many-task scientific application workflows on cloud resources of different capabilities. The benefits of the presented algorithm are benchmarked against alternative approaches. The benchmark results show that LCP is not only able to compete against higher complexity algorithms in terms of planned costs and planned makespan but also outperforms them significantly by magnitudes of 2 to 160 in terms of required planning time. Hence, LCP is superior in terms of practical usability where low planning time is essential such as in our targeted online rescheduling scenario.
We propose the so-called chance constrained programming model of stochastic programming theory to analyze limit and shakedown loads of structures under random strength with a lognormal distribution. A dual chance constrained programming algorithm is developed to calculate simultaneously both the upper and lower bounds of the plastic collapse limit and the shakedown limit. The edge-based smoothed finite element method (ES-FEM) is used with three-node linear triangular elements.