Refine
Year of publication
Document Type
- Article (3149)
- Conference Proceeding (1016)
- Part of a Book (184)
- Book (144)
- Doctoral Thesis (30)
- Patent (25)
- Other (9)
- Report (9)
- Preprint (4)
- Poster (3)
- Talk (3)
- Master's Thesis (2)
- Working Paper (2)
- Bachelor Thesis (1)
- Contribution to a Periodical (1)
- Habilitation (1)
Language
- English (4583) (remove)
Has Fulltext
- no (4583) (remove)
Keywords
- Gamification (6)
- avalanche (6)
- Earthquake (5)
- Enterprise Architecture (5)
- MINLP (5)
- solar sail (5)
- Diversity Management (4)
- Energy storage (4)
- Engineering optimization (4)
- LAPS (4)
- Natural language processing (4)
- Papierkunst (4)
- Power plants (4)
- Seismic design (4)
- field-effect sensor (4)
- frequency mixing magnetic detection (4)
- hydrogen (4)
- metal structure (4)
- snow (4)
- steel (4)
Institute
- Fachbereich Medizintechnik und Technomathematik (1545)
- Fachbereich Elektrotechnik und Informationstechnik (686)
- IfB - Institut für Bioengineering (560)
- Fachbereich Energietechnik (552)
- INB - Institut für Nano- und Biotechnologien (532)
- Fachbereich Chemie und Biotechnologie (522)
- Fachbereich Luft- und Raumfahrttechnik (463)
- Fachbereich Maschinenbau und Mechatronik (261)
- Fachbereich Wirtschaftswissenschaften (196)
- Solar-Institut Jülich (160)
- Fachbereich Bauingenieurwesen (146)
- ECSM European Center for Sustainable Mobility (75)
- MASKOR Institut für Mobile Autonome Systeme und Kognitive Robotik (62)
- Fachbereich Gestaltung (24)
- Nowum-Energy (24)
- Institut fuer Angewandte Polymerchemie (23)
- Sonstiges (21)
- Fachbereich Architektur (20)
- Freshman Institute (18)
- Kommission für Forschung und Entwicklung (18)
Digital Image Correlation (DIC) is a powerful tool used to evaluate displacements and deformations in a non-intrusive manner. By comparing two images, one of the undeformed reference state of a specimen and another of the deformed target state, the relative displacement between those two states is determined. DIC is well known and often used for post-processing analysis of in-plane displacements and deformation of specimen. Increasing the analysis speed to enable real-time DIC analysis will be beneficial and extend the field of use of this technique.
Here we tested several combinations of the most common DIC methods in combination with different parallelization approaches in MATLAB and evaluated their performance to determine whether real-time analysis is possible with these methods. To reflect improvements in computing technology different hardware settings were also analysed. We found that implementation problems can reduce the efficiency of a theoretically superior algorithm such that it becomes practically slower than a suboptimal algorithm. The Newton-Raphson algorithm in combination with a modified Particle Swarm algorithm in parallel image computation was found to be most effective. This is contrary to theory, suggesting that the inverse-compositional Gauss-Newton algorithm is superior. As expected, the Brute Force Search algorithm is the least effective method. We also found that the correct choice of parallelization tasks is crucial to achieve improvements in computing speed. A poorly chosen parallelisation approach with high parallel overhead leads to inferior performance. Finally, irrespective of the computing mode the correct choice of combinations of integerpixel and sub-pixel search algorithms is decisive for an efficient analysis. Using currently available hardware realtime analysis at high framerates remains an aspiration.
Tribological performance of biodegradable lubricants under different surface roughness of tools
(2019)
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.