@book{addisonFractalsChaosIllustrated1997, title = {Fractals and Chaos: An Illustrated Course}, author = {Addison, Paul S}, year = {1997}, publisher = {CRC Press} } @inproceedings{alfonsecaRepresentationFractalCurves1996, title = {Representation of Fractal Curves by Means of {{L}} Systems}, booktitle = {Proceedings of the Conference on {{Designing}} the Future}, author = {Alfonseca, Manuel and Ortega, Alfonso}, year = {1996}, month = jun, pages = {13--21}, publisher = {ACM}, address = {Lancaster United Kingdom}, doi = {10.1145/253341.253348}, urldate = {2024-06-15}, isbn = {978-0-89791-806-0}, langid = {english}, file = {C:\Users\Home\Zotero\storage\6TV36I8X\Alfonseca und Ortega - 1996 - Representation of fractal curves by means of L sys.pdf} } @misc{alJuliaMicroBenchmarks, title = {Julia {{Micro-Benchmarks}}}, author = {{al}, Stefan Karpinski, Viral Shah, Alan Edelman, et, Jeff Bezanson}, urldate = {2024-06-16}, abstract = {The official website for the Julia Language. Julia is a language that is fast, dynamic, easy to use, and open source. Click here to learn more.}, howpublished = {https://julialang.org/benchmarks/}, langid = {english}, file = {C:\Users\Home\Zotero\storage\DXSTVQMX\benchmarks.html} } @article{atellaRenderingHypercomplexFractals, title = {Rendering {{Hypercomplex Fractals}}}, author = {Atella, Anthony}, langid = {english} } @phdthesis{bezansonAbstractionTechnicalComputing2015, title = {Abstraction in {{Technical Computing}}}, author = {Bezanson, Jeffrey Werner}, year = {2015}, school = {MASSACHUSETTS INSTITUTE OF TECHNOLOGY} } @article{bezansonJuliaLanguageDocumentation, title = {Julia {{Language Documentation}}}, author = {Bezanson, Jeff and Karpinski, Stefan and Shah, Viral and Edelman, Alan}, langid = {english} } @inproceedings{cabuttoOverviewJuliaProgramming2018, title = {An {{Overview}} of the {{Julia Programming Language}}}, booktitle = {Proceedings of the 2018 {{International Conference}} on {{Computing}} and {{Big Data}}}, author = {Cabutto, Tyler A. and Heeney, Sean P. and Ault, Shaun V. and Mao, Guifen and Wang, Jin}, year = {2018}, month = sep, pages = {87--91}, publisher = {ACM}, address = {Charleston SC USA}, doi = {10.1145/3277104.3277119}, urldate = {2024-06-09}, isbn = {978-1-4503-6540-6}, langid = {english} } @article{caiStudyMandelbrotSets2013, title = {A {{Study}} on {{Mandelbrot Sets}} to {{Generate Visual Aesthetic Fractal Patterns}}}, author = {Cai, Zong Wen and Lam, Artde D. Kin Tak}, year = {2013}, month = feb, journal = {Applied Mechanics and Materials}, volume = {311}, pages = {111--116}, issn = {1662-7482}, doi = {10.4028/www.scientific.net/AMM.311.111}, urldate = {2024-06-15}, abstract = {The fractal pattern is a highly visual aesthetic image. This article describes the generation method of Mandelbrot set to generate fractal art patterns. Based on the escape time algorithm on complex plane, the visual aesthetic fractal patterns are generated from Mandelbrot sets. The generated program development, a pictorial information system, is integrated through the application of Visual Basic programming language and development integration environment. Application of the development program, this article analyzes the shape of the fractal patterns generated by the different power orders of the Mandelbrot sets. Finally, the escape time algorithm has been proposed as the generation tools of highly visual aesthetic fractal patterns.}, langid = {english}, file = {C:\Users\Home\Zotero\storage\WKRIEMXV\Cai und Lam - 2013 - A Study on Mandelbrot Sets to Generate Visual Aest.pdf} } @misc{carbonellePYPLPopularityProgramming2023, title = {{{PYPL}} ({{Popularity}} of {{Programming Language}}) {{Index}}}, author = {Carbonelle, Pierre}, year = {2023}, urldate = {2024-07-12}, annotation = {Programmers: \_:n92} } @misc{christPlotsJlUser2022, title = {Plots.Jl -- a User Extendable Plotting {{API}} for the Julia Programming Language}, author = {Christ, Simon and Schwabeneder, Daniel and Rackauckas, Christopher and Borregaard, Michael Krabbe and Breloff, Thomas}, year = {2022}, month = jun, number = {arXiv:2204.08775}, eprint = {2204.08775}, primaryclass = {cs}, publisher = {arXiv}, urldate = {2024-06-10}, abstract = {There are plenty of excellent plotting libraries. Each excels at a different use case: one is good for printed 2D publication figures, the other at interactive 3D graphics, a third has excellent LATEX integration or is good for creating dashboards on the web.}, archiveprefix = {arXiv}, langid = {english}, keywords = {Computer Science - Graphics,I.3.3}, note = {Comment: 22 pages, 6 figures, 6 code listings} } @misc{cormullionLuxorJlDokumentation, title = {Luxor.Jl {{Dokumentation}}}, author = {{cormullion}} } @misc{CRANContributedPackages2024, title = {{{CRAN}} Contributed Packages}, year = {2024}, month = jun, urldate = {2024-06-12} } @article{dagostinoHardwareSoftwareSolutions2021, title = {Hardware and {{Software Solutions}} for {{Energy-Efficient Computing}} in {{Scientific Programming}}}, author = {D'Agostino, Daniele and Merelli, Ivan and Aldinucci, Marco and Cesini, Daniele}, year = {2021}, journal = {Scientific Programming}, volume = {2021}, number = {1}, pages = {5514284}, issn = {1875-919X}, doi = {10.1155/2021/5514284}, urldate = {2024-06-16}, abstract = {Energy consumption is one of the major issues in today's computer science, and an increasing number of scientific communities are interested in evaluating the tradeoff between time-to-solution and energy-to-solution. Despite, in the last two decades, computing which revolved around centralized computing infrastructures, such as supercomputing and data centers, the wide adoption of the Internet of Things (IoT) paradigm is currently inverting this trend due to the huge amount of data it generates, pushing computing power back to places where the data are generated---the so-called fog/edge computing. This shift towards a decentralized model requires an equivalent change in the software engineering paradigms, development environments, hardware tools, languages, and computation models for scientific programming because the local computational capabilities are typically limited and require a careful evaluation of power consumption. This paper aims to present how these concepts can be actually implemented in scientific software by presenting the state of the art of powerful, less power-hungry processors from one side and energy-aware tools and techniques from the other one.}, langid = {english}, file = {C\:\\Users\\Home\\Zotero\\storage\\BTZJL6BY\\D’Agostino et al. - 2021 - Hardware and Software Solutions for Energy-Efficie.pdf;C\:\\Users\\Home\\Zotero\\storage\\2XTBXHRV\\5514284.html} } @article{danischMakieJlFlexible2021, title = {Makie.Jl: {{Flexible}} High-Performance Data Visualization for {{Julia}}}, shorttitle = {Makie.Jl}, author = {Danisch, Simon and Krumbiegel, Julius}, year = {2021}, month = sep, journal = {Journal of Open Source Software}, volume = {6}, number = {65}, pages = {3349}, issn = {2475-9066}, doi = {10.21105/joss.03349}, urldate = {2024-06-09}, abstract = {Makie.jl is a cross-platform plotting ecosystem for the Julia programming language (Bezanson et al., 2012), which enables researchers to create high-performance, GPU-powered, interactive visualizations, as well as publication-quality vector graphics with one unified interface. The infrastructure based on Observables.jl allows users to express how a visualization depends on multiple parameters and data sources, which can then be updated live, either programmatically, or through sliders, buttons and other GUI elements. A sophisticated layout system makes it easy to assemble complex figures. It is designed to avoid common difficulties when aligning nested subplots of different sizes, or placing colorbars or legends freely without spacing issues. Makie.jl leverages the Julia type system to automatically convert many kinds of input arguments which results in a very flexible API that reduces the need to manually prepare data. Finally, users can extend every step of this pipeline for their custom types through Julia's powerful multiple dispatch mechanism, making Makie a highly productive and generic visualization system.}, copyright = {http://creativecommons.org/licenses/by/4.0/}, langid = {english} } @inproceedings{decanTopologyPackageDependency2016, title = {On the Topology of Package Dependency Networks: A Comparison of Three Programming Language Ecosystems}, shorttitle = {On the Topology of Package Dependency Networks}, booktitle = {Proccedings of the 10th {{European Conference}} on {{Software Architecture Workshops}}}, author = {Decan, Alexandre and Mens, Tom and Claes, Maelick}, year = {2016}, month = nov, pages = {1--4}, publisher = {ACM}, address = {Copenhagen Denmark}, doi = {10.1145/2993412.3003382}, urldate = {2024-06-13}, isbn = {978-1-4503-4781-5}, langid = {english} } @article{drakopoulosOverviewParallelVisualisation2003, title = {An Overview of Parallel Visualisation Methods for {{Mandelbrot}} and {{Julia}} Sets}, author = {Drakopoulos, V. and Mimikou, N. and Theoharis, T.}, year = {2003}, journal = {Computers \& Graphics}, volume = {27}, number = {4}, pages = {635--646}, issn = {0097-8493}, doi = {10.1016/S0097-8493(03)00106-7}, abstract = {We present a comparative study of simple parallelisation schemes for the most widely used methods for the graphical representation of Mandelbrot and Julia sets. The compared methods render the actual attractor or its complement.}, keywords = {Fractals,Mandelbrot and Julia sets,Parallel implementation comparison,Parallelism} } @book{flakeComputationalBeautyNature2000, title = {The Computational Beauty of Nature: {{Computer}} Explorations of Fractals, Chaos, Complex Systems, and Adaptation}, author = {Flake, Gary William}, year = {2000}, publisher = {MIT press} } @article{gaddisFractalGeometryNature, title = {The {{Fractal Geometry}} of {{Nature}}; {{Its Mathematical Basis}} and {{Application}} to {{Computer Graphics}}}, author = {Gaddis, Michael E and Zyda, Michael J}, abstract = {Fractal Geometry is a recent synthesis of old mathematical constructs. It was first popularized by complex renderings of terrain on a computer graphics medium. Fractal geometry has since spawned research in many diverse scientific disciplines. Its rapid acceptance has been achieved due to its ability to model phenomena that defy discrete computation due to roughneas and discontinuities. With its quick acceptance has come problems. Fractal geometry is a misunderstood idea that is quickly becoming buried under grandiose terminology that serves no purpose. Its essence is induction using simple geometric constructs to transform initiating objects. The fractal objects that we create with this process often resemble natural phenomenon. The purpose of this work is to present fractal geometry to the graphics programmer as a simple workable technique. We hope to demystify the concepts of fractal geometry and make it available to all who are interested.}, langid = {english} } @inproceedings{heiland2023patterns, title = {Patterns in Deep {{Mandelbrot}} Zooms}, booktitle = {Algorithmic Pattern Salon}, author = {{Heiland-Allen}, Claude}, year = {2023}, publisher = {Then Try This} } @article{januszekComparativeAnalysisEfficiency2018, title = {Comparative Analysis of the Efficiency of {{Julia}} Language against the Other Classic Programming Languages}, author = {Januszek, Tomasz and Pleszczy{\'n}ski, Mariusz}, year = {2018}, journal = {Silesian Journal of Pure and Applied Mathematics}, volume = {8} } @misc{JuliaRegistries2024, title = {Julia {{Registries}}}, year = {2024}, month = apr } @book{kennethFractalGeometryMathematical2007, title = {Fractal Geometry: Mathematical Foundations and Applications}, author = {Kenneth, Falconer}, year = {2007}, publisher = {John Wiley \& Sons} } @article{krantzFractalGeometry, title = {Fractal Geometry}, author = {Krantz, Steven G}, langid = {english} } @misc{MATLABFileexchange2024, title = {{{MATLAB Fileexchange}}}, year = {2024}, month = jun, urldate = {2024-06-12} } @article{mcandrewLindenmayerSystemsFractals, title = {Lindenmayer Systems, Fractals, and Their Mathematics}, author = {McAndrew, Alasdair}, abstract = {Students are always asking for applications of mathematics. But more often than not, textbooks are filled with ``applications'' which are unimaginative, contrived, unrealistic, and uninteresting. However, there are of course numerous areas in which mathematics can be, and is, deployed to great effect. The purpose of this article is to introduce one such area: Lindenmayer systems, which beautifully joins mathematics and graphics, and investigate some of the mathematics---in particular their fractal dimension---and also the beauty of some of the graphics. We claim that the simplicity of the systems, and the complexity of their outputs, make for a simple way to introduce complexity---and modelling of the natural world---into a mathematics course, especially a course on finite mathematics, geometry, or computational mathematics.}, langid = {english}, file = {C:\Users\Home\Zotero\storage\RCRTNNL4\McAndrew - Lindenmayer systems, fractals, and their mathemati.pdf} } @article{mollickEstablishingMooreLaw2006, title = {Establishing {{Moore}}'s {{Law}}}, author = {Mollick, Ethan}, year = {2006}, journal = {IEEE Annals of the History of Computing}, number = {28}, urldate = {2024-06-16}, file = {C:\Users\Home\Zotero\storage\H5QQ7CV9\stamp.html} } @article{monroRenderingAlgorithmsDeterministic1995, title = {Rendering Algorithms for Deterministic Fractals}, author = {Monro, D.M. and Dudbridge, F.}, year = {1995}, journal = {IEEE Computer Graphics and Applications}, volume = {15}, number = {1}, pages = {32--41}, doi = {10.1109/38.364961}, keywords = {Approximation algorithms,Data structures,Displays,Fractals,Graphics,Particle measurements,Rendering (computer graphics),Software algorithms,Software performance,Spirals} } @inproceedings{pereiraEnergyEfficiencyProgramming2017, title = {Energy Efficiency across Programming Languages: How Do Energy, Time, and Memory Relate?}, shorttitle = {Energy Efficiency across Programming Languages}, booktitle = {Proceedings of the 10th {{ACM SIGPLAN International Conference}} on {{Software Language Engineering}}}, author = {Pereira, Rui and Couto, Marco and Ribeiro, Francisco and Rua, Rui and Cunha, J{\'a}come and Fernandes, Jo{\~a}o Paulo and Saraiva, Jo{\~a}o}, year = {2017}, month = oct, pages = {256--267}, publisher = {ACM}, address = {Vancouver BC Canada}, doi = {10.1145/3136014.3136031}, urldate = {2024-06-16}, isbn = {978-1-4503-5525-4}, langid = {english}, file = {C:\Users\Home\Zotero\storage\G93UJZXJ\Pereira et al. - 2017 - Energy efficiency across programming languages ho.pdf} } @misc{pereiraOriginalWorkSLE, title = {{Original work in SLE'17}}, author = {Pereira, Rui and Couto, Marco and Ribeiro, Francisco and Rua, Rui and Cunha, J{\'a}come and Fernandes, Jo{\~a}o Paulo and Saraiva, Jo{\~a}o}, urldate = {2024-06-16}, abstract = {The tools and graphical data pointed by this page are included in the research paper "Energy Efficiency across Programming Languages: How does Energy, Time and Memory Relate?", accepted at the International Conference on Software Language Engineering (SLE) - Rui Pereira, Marco Couto, Francisco Ribeiro}, howpublished = {https://sites.google.com/view/energy-efficiency-languages/home}, langid = {ngerman}, file = {C:\Users\Home\Zotero\storage\7XFB6PKR\home.html} } @article{perkelJuliaComeSyntax2019, title = {Julia: Come for the Syntax, Stay for the Speed}, shorttitle = {Julia}, author = {Perkel, Jeffrey M.}, year = {2019}, month = aug, journal = {Nature}, volume = {572}, number = {7767}, pages = {141--142}, issn = {0028-0836, 1476-4687}, doi = {10.1038/d41586-019-02310-3}, urldate = {2024-06-14}, copyright = {http://www.springer.com/tdm}, langid = {english} } @book{prusinkiewiczAlgorithmicBeautyPlants, title = {The Algorithmic Beauty of Plants}, author = {Prusinkiewicz, Przemyslaw and Lindenmayer, Aristid} } @misc{PyPi2024, title = {{{PyPi}} ({{Python Package Index}})}, year = {2024}, month = jun, urldate = {2024-04-17} } @article{saupeEfficientComputationJulia1987, title = {Efficient Computation of {{Julia}} Sets and Their Fractal Dimension}, author = {Saupe, Dietmar}, year = {1987}, journal = {Physica D: Nonlinear Phenomena}, volume = {28}, number = {3}, pages = {358--370}, issn = {0167-2789}, doi = {10.1016/0167-2789(87)90024-8}, abstract = {The computation of the fractal dimension is straightforward using the box-counting method. However, this approach may require very long computation times. If the Julia set is the connected common boundary of two or more basins of attraction, then a recursive version of the box-counting method can be made storage- and time-efficient. The method is also suitable for the computation of the Julia sets. We apply the method to verify a result of D. Ruelle regarding the dimension of Julia sets of R(z)= z2+c for small c{$\in$}C, to Newton's method for complex polynomials of degree 3 and to a sequence of Julia sets from the renormalization transformation for hierarchical lattices. We also discuss the computation of Julia sets and their information dimension by the inverse iteration method. In all examples tested we find that the information dimension is less than the fractal dimension.} } @incollection{saupeFractals2003, title = {Fractals}, booktitle = {Encyclopedia of {{Computer Science}}}, author = {Saupe, Dietmar}, year = {2003}, pages = {725--732}, publisher = {{John Wiley and Sons Ltd.}}, address = {GBR}, abstract = {Much scientific research of the past has analyzed human-made machines and the physical laws that govern their operation. The success of science relies on the predictability of the underlying experiments. Euclidean geometry-based on lines, circles, etc.--is the tool to describe spatial relations, where differential equations are essential in the study of motion and growth. However, natural shapes such as mountains, clouds or trees do not fit well into this framework. The understanding of these phenomena has undergone a fundamental change in the last two decades. Fractal geometry, as conceived by Mandelbrot, provides a mathematical model for many of the seemingly complex forms found in nature. One of Mandelbrot's key observations has been that these forms possess a remarkable statistical invariance under magnification. This may be quantified by a fractal dimension, a number that agrees with our intuitive understanding of dimension but need not be an integer. These ideas may also be applied to time-variant processes.}, isbn = {0-470-86412-5} } @article{smithFractalGeometryHistory2011, title = {Fractal {{Geometry}}: {{History}} and {{Theory}}}, author = {Smith, Geri}, year = {2011}, month = apr } @article{sternemannPlatonischeFraktaleIm, title = {{Platonische Fraktale im Unterricht}}, author = {Sternemann, Wilhelm and Canisianum, Gymnasium}, langid = {ngerman}, file = {C:\Users\Home\Zotero\storage\EMF9UT6A\Sternemann und Canisianum - Platonische Fraktale im Unterricht.pdf} } @book{vanrossumPythonReferenceManual1995, title = {Python Reference Manual}, author = {Van Rossum, Guido and Drake Jr, Fred L}, year = {1995}, publisher = {Centrum voor Wiskunde en Informatica Amsterdam} } @phdthesis{walterFraktaleGeometrischenElemente2018, type = {{Diplomarbeit}}, title = {{Fraktale: Die geometrischen Elemente der Natur}}, author = {Walter, Victoria}, year = {2018}, address = {Graz}, abstract = {Die fraktale Geometrie gilt als relativ junge Disziplin der Mathematik. Deshalb ist es umso interessanter,diesen neuen Zugang zur Geometrie zu beleuchten. Die vorliegende Diplomarbeit soll,anhand von Beispielen verschiedener Errungenschaften und Entdeckungen der letzten Jahrzehnte,eine generelle Einf{\"u}hrung in die Welt der Fraktale liefern. Viele davon beziehen sich auf Arbeitenvon Benoit B. Mandelbrot, der in den 1970er die fundamentalen Grundz{\"u}ge der fraktalen Geometriegestaltete.Im zentralen Fokus dieser Arbeit stehen einige klassische Fraktale wie zum Beispiel die Cantor-Menge, das Sierpinski-Dreieck, diverse fraktale Kurven sowie die Mandelbrot-Menge und die Julia-Mengen. Diese fraktalen Objekte weisen eine Reihe von ungew{\"o}hnlichen und zugleich faszinierendenEigenschaften auf, die bis dato noch nicht vollst{\"a}ndig gekl{\"a}rt werden konnten. Eine wesentlicheRolle spielt hier der Begriff der Selbst{\"a}hnlichkeit, mit denen sich die Strukturen der Fraktale beschreibenlassen. Au{\ss}erdem treten in vielen Bereichen der Natur und diversen Wissenschaftenbestimmte Zusammenh{\"a}nge mit der fraktalen Geometrie auf, von denen einige am Ende dieser Arbeitn{\"a}her betrachtet werden. Fraktale Muster lassen sich im menschlichen K{\"o}rper, in der Geologie,in der Chaostheorie und in vielen weiteren Wissenschaftszweigen finden. Ein gro{\ss}er Nutzen liegtdarin, dass mittels neuer Methoden aus der fraktalen Geometrie die Komplexit{\"a}t der Natur sehrgut modelliert werden kann und somit das Verst{\"a}ndnis {\"u}ber deren Eigenschaften und Funktionenw{\"a}chst.}, langid = {ngerman}, lccn = {Universit{\"a}tsbibliothek Graz Hauptbibliothek, Signatur: II 807295}, school = {Karl-Franzens-Universit{\"a}t Graz}, keywords = {Fraktalgeometrie} } @book{weitzKonkreteMathematikNicht2021, title = {Konkrete {{Mathematik}} (Nicht Nur) F{\"u}r {{Informatiker}}}, author = {Weitz, Edmund}, year = {2021}, edition = {2} } @inproceedings{wuB2BridgingCode2020, title = {B2: {{Bridging Code}} and {{Interactive Visualization}} in {{Computational Notebooks}}}, shorttitle = {B2}, booktitle = {Proceedings of the 33rd {{Annual ACM Symposium}} on {{User Interface Software}} and {{Technology}}}, author = {Wu, Yifan and Hellerstein, Joseph M. and Satyanarayan, Arvind}, year = {2020}, month = oct, pages = {152--165}, publisher = {ACM}, address = {Virtual Event USA}, doi = {10.1145/3379337.3415851}, urldate = {2024-06-16}, isbn = {978-1-4503-7514-6}, langid = {english}, file = {C:\Users\Home\Zotero\storage\24JV4AF8\Wu et al. - 2020 - B2 Bridging Code and Interactive Visualization in.pdf} }