PUMA publications for /tag/programming%20ProgrammingMon Jan 13 13:44:04 CET 2025https://ecaade2023.tugraz.at/Proceedings of the 41st International Conference on Education and Research in Computer Aided Architectural Design in Europe ({eCAADe}) [Volume 1]September4141-50Democratizing the Designer's Toolbox: Adopting free, open-source, and platform-agnostic tools into computational design teaching12023ICD IntCDC myown peer programming This paper proposes a computational design education approach where students learn to develop their own geometric and logical workflows beyond specific software and platforms. The course’s objectives are to familiarize architecture students with computational geometry, foster computational thinking that stays relevant over time, and promote democratized design tools through computation. Over a semester, we taught students to work directly on coordinates or numerical representations by utilizing 3- Dimensional (3D) computer graphics programming rather than learning 3D modeling software that rapidly goes out of style. This paper outlines our teaching methods to introduce the technology stack, design algorithm development, open-source or free tools implementation, and user experience – interface design. This paper also reviews the students’ final projects to deliver interactive web-browser applications for architectural design of varied scales and compares them according to four evaluation parameters. The paper culminates with the project's critical assessment and students' feedback to evaluate our approach and suggest an outlook for future development. Thu Sep 12 16:35:30 CEST 2024Large Language Models to Generate System-Level Test Programs Targeting Non-functional Properties2024Artificial Intelligence Emerging Programming sciences, Languages Technologies (cs.SE), FOS: Engineering sciences (cs.PL), and (cs.ET), Computer Software (cs.AI), information Mon May 27 08:58:38 CEST 2024StuttgartLeitfäden und {Monographien} der {Informatik}Grundlagen der systemnahen {Programmierung}1988(Computer 2. MODULA Systemprogrammierung. Systems importzotero programming science) Mon May 27 08:58:38 CEST 2024Stuttgart{MikroComputer}-{Praxis}Programmiersprachen für {Mikrocomputer}: ein Überblick1990(Electronic Mikrocomputer. Programmiersprache. Programming computers) importzotero languages Mon May 27 08:58:38 CEST 2024StuttgartData abstraction and object-oriented programming in {C}++1990(Computer Abstract Abstrakter C++ C++. Datentyp. Object-oriented Objektorientierte Programmierung. data importzotero language). program programming science) science). types Mon May 27 08:58:38 CEST 2024StuttgartÜberarb. Fassg. e. Vorlesungsausarb.Teubner-{Skripten} zur mathematischen {Stochastik}Markoffsche {Entscheidungsprozesse}1990Markov Markov-Entscheidungsprozess. Markov-Kette. Optimales Optimierung. Stochastic Stochastische Stoppen. dynamische importzotero processes. programming Wed Sep 27 13:31:24 CEST 2023https://ecaade2023.tugraz.at/Proceedings of the 41st International Conference on Education and Research in Computer Aided Architectural Design in Europe ({eCAADe}) [Volume 1]September4141-50Democratizing the Designer's Toolbox: Adopting free, open-source, and platform-agnostic tools into computational design teaching12023from:zuardinakbar myown peer programming This paper proposes a computational design education approach where students learn to develop their own geometric and logical workflows beyond specific software and platforms. The course’s objectives are to familiarize architecture students with computational geometry, foster computational thinking that stays relevant over time, and promote democratized design tools through computation. Over a semester, we taught students to work directly on coordinates or numerical representations by utilizing 3- Dimensional (3D) computer graphics programming rather than learning 3D modeling software that rapidly goes out of style. This paper outlines our teaching methods to introduce the technology stack, design algorithm development, open-source or free tools implementation, and user experience – interface design. This paper also reviews the students’ final projects to deliver interactive web-browser applications for architectural design of varied scales and compares them according to four evaluation parameters. The paper culminates with the project's critical assessment and students' feedback to evaluate our approach and suggest an outlook for future development. Wed Feb 16 16:57:26 CET 2022New York1 Online-Ressource (IX, 139 Seiten)Springer eBooks. Professional and Applied ComputingIntroducing Markdown and Pandoc: using Markup Language and Document Converter2019Compilers Computer Interpreters Languages Open Programming markdown pandoc programming science scientific software source writing 1: The Beginner's Guide to Markdown and Pandoc -- 2: Why Use Markdown and Pandoc -- 3: Writing Markdown -- 4: Pandoc Markdown Extensions -- 5: Translating Documents -- 6: Math and Computer Programming Languages -- 7: Cross-referencing -- 8: Metadata -- 9: Using Templates -- 10: Preprocessing -- 11: Filters -- 12: ConclusionsWed Sep 29 14:35:10 CEST 2021IFAC-PapersOnLine9th Vienna International Conference on Mathematical Modelling2307--312Data-driven surrogates of value functions and applications to feedback control for dynamical systems512018Kernel anm approximation, control, dynamic feedback from:britsteiner greedy ians optimal principle, programming techniques Dealing with high-dimensional feedback control problems is a difficult task when the classical dynamic programming principle is applied. Existing techniques restrict the application to relatively low dimensions since the discretizations typically suffer from the curse of dimensionality. In this paper we introduce a novel approximation technique for the value function of an infinite horizon optimal control. The method is based on solving optimal open loop control problems on a finite horizon with a sampling of the global value function along the generated trajectories. For the interpolation we choose a kernel orthogonal greedy strategy, because these methods are able to produce extreme sparse surrogates and enable rapid evaluations in high dimensions. Two numerical examples prove the performance of the approach and show that the method is able to deal with high-dimensional feedback control problems, where the dimensionality prevents the approximation by most existing methods.Wed Sep 29 14:33:27 CEST 2021IFAC-PapersOnLine9th Vienna International Conference on Mathematical Modelling2307--312Data-driven surrogates of value functions and applications to feedback control for dynamical systems512018Kernel anm approximation, control, dynamic feedback greedy ians optimal principle, programming techniques Dealing with high-dimensional feedback control problems is a difficult task when the classical dynamic programming principle is applied. Existing techniques restrict the application to relatively low dimensions since the discretizations typically suffer from the curse of dimensionality. In this paper we introduce a novel approximation technique for the value function of an infinite horizon optimal control. The method is based on solving optimal open loop control problems on a finite horizon with a sampling of the global value function along the generated trajectories. For the interpolation we choose a kernel orthogonal greedy strategy, because these methods are able to produce extreme sparse surrogates and enable rapid evaluations in high dimensions. Two numerical examples prove the performance of the approach and show that the method is able to deal with high-dimensional feedback control problems, where the dimensionality prevents the approximation by most existing methods.Tue Sep 28 11:26:33 CEST 2021New York, NY, USAProceedings of the 48th International Conference on Parallel Processing: Workshops18:1-18:10ICPP 2019MPI Collectives for Multi-core Clusters: Optimized Performance of the Hybrid MPI+ MPI Parallel Codes2019MPI collective communication hybrid memory model myown programming shared The advent of multi-/many-core processors in clusters advocates hybrid parallel programming, which combines Message Passing Interface (MPI) for inter-node parallelism with a shared memory model for on-node parallelism. Compared to the traditional hybrid approach of MPI plus OpenMP, a new, but promising hybrid approach of MPI plus MPI-3 shared-memory extensions (MPI+MPI) is gaining attraction. We describe an algorithmic approach for collective operations (with allgather and broadcast as concrete examples) in the context of hybrid MPI+MPI, so as to minimize memory consumption and memory copies. With this approach, only one memory copy is maintained and shared by on-node processes. This allows the removal of unnecessary on-node copies of replicated data that are required between MPI processes when the collectives are invoked in the context of pure MPI. We compare our approach of collectives for hybrid MPI+MPI and the traditional one for pure MPI, and also have a discussion on the synchronization that is required to guarantee data integrity. The performance of our approach has been validated on a Cray XC40 system (Cray MPI) and NEC cluster (Open MPI), showing that it achieves comparable or better performance for allgather operations. We have further validated our approach with a standard computational kernel, namely distributed matrix multiplication, and a Bayesian Probabilistic Matrix Factorization code.Tue Jul 28 11:45:45 CEST 2020Parallel Computing102669Collectives in hybrid MPI+ MPI code: Design, practice and performance2020MPI collective communications hybrid myown programming Mon Jul 27 16:03:19 CEST 2020Salt Lake City, UT, USA2016 Fourth International Workshop on Software Engineering for High Performance Computing in Computational Science and Engineering (SE-HPCCSE)November17--25{Computational Efficiency vs. Maintainability and Portability. Experiences with the Sparse Grid Code SG++}Konferenz-Beitrag2016Computational_modeling Hardware Programming Software_engineering Software_quality Usability computational_efficiency computational_maintainability computational_portability design_decisions from:leiterrl software_maintenance software_quality sparse_grid_code_SG++ Thu Jan 31 21:11:23 CET 2019sepTopology aware Cartesian grid mapping with MPI2018Cartesian MPI grid hlrs network parallel programming spmt topology Thu Mar 22 10:32:09 CET 2018Berlin, HeidelbergTagungsband des 2. Kongresses Montage Handhabung Industrieroboter175--186Behavior Trees for Task-Level Programming of Industrial Robots2017programming robotics The number of industrial robots used worldwide has been continuously increasing. In almost all cases the application program has the form of a text based source code, which has inherent drawbacks (in terms of complexity and ease of development) when compared to the graphical approaches seen in general purpose software engineering. These graphical programming approaches have not been developed, having industrial robots in mind. In this paper a behavior trees based approach for creating and representing source code for robotic applications is proposed. The software architecture and an experimental implementation of the developed programming method is presented and a validation using a common assembly task is shown.Tue Dec 12 10:44:52 CET 2017Tools for High Performance Computing 20152016debugging hlrs parallel performance programming spmt toosl Tue Dec 12 09:58:14 CET 2017Berlin, HeidelbergSupercomputing: 28th International Supercomputing Conference, ISC 2013, Leipzig, Germany, June 16-20, 2013. Proceedings1--12591 TFLOPS Multi-trillion Particles Simulation on SuperMUC2013dynamics highly molecular parallel programming scalable simulation simulations vectorization Anticipating large-scale molecular dynamics simulations (MD) in nano-fluidics, we conduct performance and scalability studies of an optimized version of the code ls1 mardyn. We present our implementation requiring only 32 Bytes per molecule, which allows us to run the, to our knowledge, largest MD simulation to date. Our optimizations tailored to the Intel Sandy Bridge processor are explained, including vectorization as well as shared-memory parallelization to make use of Hyperthreading. Finally we present results for weak and strong scaling experiments on up to 146016 Cores of SuperMUC at the Leibniz Supercomputing Centre, achieving a speed-up of 133k times which corresponds to an absolute performance of 591.2 TFLOPS.programming ProgrammingCommunity for tag(s) programming Programming