[{"abstract":[{"lang":"eng","text":"In order to standardize spray flame synthesis (SFS) studies, intensive work has been done in recent years on the design of burner types. Thus, in 2019, the so-called SpraySyn1 burner was introduced (SS1), which was subsequently characterized in numerical and experimental studies. Based on this research, a modification of the nozzle design was proposed, which has now been considered in the successor model, SpraySyn2 (SS2). As little is known about the effect of the nozzle adaptation on the particle formation, we operated both burners under identical operating conditions to produce maghemite. The final powder comparison showed that SS2 yielded considerable higher specific surface areas (associated with smaller primary particle sizes), lower polydispersity, and higher phase purity. To obtain further information on the size distributions of aggregates and agglomerates generated by SS2, aerosol samples were extracted by hole in a tube (HIAT) sampling and characterized by scanning mobility particle sizing (SMPS). Samples were extracted along the centerline at different heights above the burner (HAB) above the visible flame tip (>7 cm), and quenching experiments were performed to extract the aerosol samples at different dilution rates. Thereby, it was demonstrated that performing detailed quenching experiments is crucial for obtaining representative HIAT-SMPS data. In particular, agglomerates/aggregate sizes were overestimated by up to ~70 % if samples were not sufficiently diluted. If sufficient dilution was applied, distribution widths and mean particle mobility diameters were determined with high accuracy (sample standard derivation <5 %). Our data suggested the evolution of primary particle sizes was mostly completed <7 cm HAB and it was shown aggregates/agglomerates present above the visible flame were compact in structure (non- fractal). The mean diameter of the particle ensemble grew along the centerline from 6.9 nm (7 cm) to 11.4 nm (15 cm), while distribution widths grew from 1.42 to 1.52."}],"publication":"Applications in Energy and Combustion Science","keyword":["Flame Spray Pyrolysis","SpraySyn2","Spray flame synthesis","Maghemite nanoparticles","Gas to particle-conversion","Hole in a tube sampling"],"ddc":["660"],"language":[{"iso":"eng"}],"year":"2024","title":"Maghemite nanoparticles synthesis via spray flame synthesis and particle characterization by hole in a tube sampling and scanning mobility particle sizing (HIAT-SMPS)","publisher":"Elsevier","date_created":"2024-02-05T12:02:57Z","editor":[{"last_name":"Tischendorf","id":"67002","full_name":"Tischendorf, Ricardo","first_name":"Ricardo"},{"last_name":"Massopo","id":"98419","full_name":"Massopo, Orlando","first_name":"Orlando"},{"first_name":"Hans-Joachim","id":"464","full_name":"Schmid, Hans-Joachim","orcid":"000-0001-8590-1921","last_name":"Schmid"},{"first_name":"Olek","last_name":"Pyrmak","full_name":"Pyrmak, Olek"},{"last_name":"Dupont","full_name":"Dupont, Sophie","first_name":"Sophie"},{"last_name":"Fröde","full_name":"Fröde, Fabian","first_name":"Fabian"},{"first_name":"Heinz","last_name":"Pitsch","full_name":"Pitsch, Heinz"},{"first_name":"Reinhold","full_name":"Kneer, Reinhold","last_name":"Kneer"}],"status":"public","type":"journal_editor","_id":"51133","department":[{"_id":"150"}],"user_id":"98419","citation":{"ieee":"R. Tischendorf <i>et al.</i>, Eds., <i>Maghemite nanoparticles synthesis via spray flame synthesis and particle characterization by hole in a tube sampling and scanning mobility particle sizing (HIAT-SMPS)</i>. Elsevier, 2024.","chicago":"Tischendorf, Ricardo, Orlando Massopo, Hans-Joachim Schmid, Olek Pyrmak, Sophie Dupont, Fabian Fröde, Heinz Pitsch, and Reinhold Kneer, eds. <i>Maghemite Nanoparticles Synthesis via Spray Flame Synthesis and Particle Characterization by Hole in a Tube Sampling and Scanning Mobility Particle Sizing (HIAT-SMPS)</i>. <i>Applications in Energy and Combustion Science</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.jaecs.2023.100235\">https://doi.org/10.1016/j.jaecs.2023.100235</a>.","ama":"Tischendorf R, Massopo O, Schmid H-J, et al., eds. <i>Maghemite Nanoparticles Synthesis via Spray Flame Synthesis and Particle Characterization by Hole in a Tube Sampling and Scanning Mobility Particle Sizing (HIAT-SMPS)</i>. Elsevier; 2024. doi:<a href=\"https://doi.org/10.1016/j.jaecs.2023.100235\">https://doi.org/10.1016/j.jaecs.2023.100235</a>","mla":"Tischendorf, Ricardo, et al., editors. “Maghemite Nanoparticles Synthesis via Spray Flame Synthesis and Particle Characterization by Hole in a Tube Sampling and Scanning Mobility Particle Sizing (HIAT-SMPS).” <i>Applications in Energy and Combustion Science</i>, Elsevier, 2024, doi:<a href=\"https://doi.org/10.1016/j.jaecs.2023.100235\">https://doi.org/10.1016/j.jaecs.2023.100235</a>.","short":"R. Tischendorf, O. Massopo, H.-J. Schmid, O. Pyrmak, S. Dupont, F. Fröde, H. Pitsch, R. Kneer, eds., Maghemite Nanoparticles Synthesis via Spray Flame Synthesis and Particle Characterization by Hole in a Tube Sampling and Scanning Mobility Particle Sizing (HIAT-SMPS), Elsevier, 2024.","bibtex":"@book{Tischendorf_Massopo_Schmid_Pyrmak_Dupont_Fröde_Pitsch_Kneer_2024, title={Maghemite nanoparticles synthesis via spray flame synthesis and particle characterization by hole in a tube sampling and scanning mobility particle sizing (HIAT-SMPS)}, DOI={<a href=\"https://doi.org/10.1016/j.jaecs.2023.100235\">https://doi.org/10.1016/j.jaecs.2023.100235</a>}, journal={Applications in Energy and Combustion Science}, publisher={Elsevier}, year={2024} }","apa":"Maghemite nanoparticles synthesis via spray flame synthesis and particle characterization by hole in a tube sampling and scanning mobility particle sizing (HIAT-SMPS). (2024). In R. Tischendorf, O. Massopo, H.-J. Schmid, O. Pyrmak, S. Dupont, F. Fröde, H. Pitsch, &#38; R. Kneer (Eds.), <i>Applications in Energy and Combustion Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jaecs.2023.100235\">https://doi.org/10.1016/j.jaecs.2023.100235</a>"},"has_accepted_license":"1","publication_status":"published","doi":"https://doi.org/10.1016/j.jaecs.2023.100235","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/S2666352X23001243?ref=cra_js_challenge&fr=RR-1"}],"date_updated":"2024-02-05T12:25:00Z"},{"doi":"10.1007/978-3-030-92121-7_4","date_updated":"2023-12-13T10:45:14Z","author":[{"full_name":"Bossek, Jakob","id":"102979","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob"},{"full_name":"Neumann, Aneta","last_name":"Neumann","first_name":"Aneta"},{"full_name":"Neumann, Frank","last_name":"Neumann","first_name":"Frank"}],"place":"Berlin, Heidelberg","citation":{"apa":"Bossek, J., Neumann, A., &#38; Neumann, F. (2021). Exact Counting and~Sampling of Optima for the Knapsack Problem. <i>Learning and Intelligent Optimization</i>, 40–54. <a href=\"https://doi.org/10.1007/978-3-030-92121-7_4\">https://doi.org/10.1007/978-3-030-92121-7_4</a>","mla":"Bossek, Jakob, et al. “Exact Counting And~Sampling of Optima for the Knapsack Problem.” <i>Learning and Intelligent Optimization</i>, Springer-Verlag, 2021, pp. 40–54, doi:<a href=\"https://doi.org/10.1007/978-3-030-92121-7_4\">10.1007/978-3-030-92121-7_4</a>.","short":"J. Bossek, A. Neumann, F. Neumann, in: Learning and Intelligent Optimization, Springer-Verlag, Berlin, Heidelberg, 2021, pp. 40–54.","bibtex":"@inproceedings{Bossek_Neumann_Neumann_2021, place={Berlin, Heidelberg}, title={Exact Counting and~Sampling of Optima for the Knapsack Problem}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-92121-7_4\">10.1007/978-3-030-92121-7_4</a>}, booktitle={Learning and Intelligent Optimization}, publisher={Springer-Verlag}, author={Bossek, Jakob and Neumann, Aneta and Neumann, Frank}, year={2021}, pages={40–54} }","ama":"Bossek J, Neumann A, Neumann F. Exact Counting and~Sampling of Optima for the Knapsack Problem. In: <i>Learning and Intelligent Optimization</i>. Springer-Verlag; 2021:40–54. doi:<a href=\"https://doi.org/10.1007/978-3-030-92121-7_4\">10.1007/978-3-030-92121-7_4</a>","chicago":"Bossek, Jakob, Aneta Neumann, and Frank Neumann. “Exact Counting And~Sampling of Optima for the Knapsack Problem.” In <i>Learning and Intelligent Optimization</i>, 40–54. Berlin, Heidelberg: Springer-Verlag, 2021. <a href=\"https://doi.org/10.1007/978-3-030-92121-7_4\">https://doi.org/10.1007/978-3-030-92121-7_4</a>.","ieee":"J. Bossek, A. Neumann, and F. Neumann, “Exact Counting and~Sampling of Optima for the Knapsack Problem,” in <i>Learning and Intelligent Optimization</i>, 2021, pp. 40–54, doi: <a href=\"https://doi.org/10.1007/978-3-030-92121-7_4\">10.1007/978-3-030-92121-7_4</a>."},"page":"40–54","publication_status":"published","publication_identifier":{"isbn":["978-3-030-92120-0"]},"extern":"1","_id":"48855","user_id":"102979","department":[{"_id":"819"}],"status":"public","type":"conference","title":"Exact Counting and~Sampling of Optima for the Knapsack Problem","publisher":"Springer-Verlag","date_created":"2023-11-14T15:58:54Z","year":"2021","keyword":["Dynamic programming","Exact counting","Sampling","Zero-one knapsack problem"],"language":[{"iso":"eng"}],"abstract":[{"text":"Computing sets of high quality solutions has gained increasing interest in recent years. In this paper, we investigate how to obtain sets of optimal solutions for the classical knapsack problem. We present an algorithm to count exactly the number of optima to a zero-one knapsack problem instance. In addition, we show how to efficiently sample uniformly at random from the set of all global optima. In our experimental study, we investigate how the number of optima develops for classical random benchmark instances dependent on their generator parameters. We find that the number of global optima can increase exponentially for practically relevant classes of instances with correlated weights and profits which poses a justification for the considered exact counting problem.","lang":"eng"}],"publication":"Learning and Intelligent Optimization"},{"title":"Clustering for Metric and Nonmetric Distance Measures","doi":"10.1145/1824777.1824779","date_updated":"2022-01-06T06:58:50Z","date_created":"2018-06-05T07:52:41Z","author":[{"first_name":"Marcel R.","last_name":"Ackermann","full_name":"Ackermann, Marcel R."},{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"},{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"}],"year":"2010","page":"59:1--59:26","citation":{"ama":"Ackermann MR, Blömer J, Sohler C. Clustering for Metric and Nonmetric Distance Measures. <i>ACM Trans Algorithms</i>. 2010;(4):59:1--59:26. doi:<a href=\"https://doi.org/10.1145/1824777.1824779\">10.1145/1824777.1824779</a>","ieee":"M. R. Ackermann, J. Blömer, and C. Sohler, “Clustering for Metric and Nonmetric Distance Measures,” <i>ACM Trans. Algorithms</i>, no. 4, pp. 59:1--59:26, 2010.","chicago":"Ackermann, Marcel R., Johannes Blömer, and Christian Sohler. “Clustering for Metric and Nonmetric Distance Measures.” <i>ACM Trans. Algorithms</i>, no. 4 (2010): 59:1--59:26. <a href=\"https://doi.org/10.1145/1824777.1824779\">https://doi.org/10.1145/1824777.1824779</a>.","apa":"Ackermann, M. R., Blömer, J., &#38; Sohler, C. (2010). Clustering for Metric and Nonmetric Distance Measures. <i>ACM Trans. Algorithms</i>, (4), 59:1--59:26. <a href=\"https://doi.org/10.1145/1824777.1824779\">https://doi.org/10.1145/1824777.1824779</a>","short":"M.R. Ackermann, J. Blömer, C. Sohler, ACM Trans. Algorithms (2010) 59:1--59:26.","mla":"Ackermann, Marcel R., et al. “Clustering for Metric and Nonmetric Distance Measures.” <i>ACM Trans. Algorithms</i>, no. 4, 2010, pp. 59:1--59:26, doi:<a href=\"https://doi.org/10.1145/1824777.1824779\">10.1145/1824777.1824779</a>.","bibtex":"@article{Ackermann_Blömer_Sohler_2010, title={Clustering for Metric and Nonmetric Distance Measures}, DOI={<a href=\"https://doi.org/10.1145/1824777.1824779\">10.1145/1824777.1824779</a>}, number={4}, journal={ACM Trans. Algorithms}, author={Ackermann, Marcel R. and Blömer, Johannes and Sohler, Christian}, year={2010}, pages={59:1--59:26} }"},"publication_identifier":{"issn":["1549-6325"]},"publication_status":"published","issue":"4","keyword":["k-means clustering","k-median clustering","Approximation algorithm","Bregman divergences","Itakura-Saito divergence","Kullback-Leibler divergence","Mahalanobis distance","random sampling"],"_id":"2990","department":[{"_id":"64"}],"user_id":"25078","status":"public","publication":"ACM Trans. Algorithms","type":"journal_article"},{"language":[{"iso":"eng"}],"keyword":["Hardware","Microprogramming","Application software","Timing","Protocols","Virtual prototyping","Real time systems","Sampling methods","Operating systems","Emulation"],"user_id":"5786","department":[{"_id":"672"}],"_id":"37053","status":"public","abstract":[{"text":"Seamless HW/SW codesign flows support early verification of hardware and Hardware-dependent Software (HdS) like drivers, operating systems, and firmware. For early estimation and verification, the application of SystemC in combination with Instruction Set Simulators and Software Emulators like QEMU is widely accepted. In this article, we present an advanced design flow for HW, (RT)OS and HdS refinement and verification with focus on the transition from abstract RTOS verification to full system RTOS/HdS emulation. In the context of assertion-based verification, we introduce a set of generic real-time properties which can be reused and verified at different abstraction levels and discuss their application. The properties are presented by the means of IEEE standard PSL assertions which are applied for mixed SystemC/HdS models.","lang":"eng"}],"type":"conference","publication":"Proceedings of HLDVT2010","conference":{"location":"Anaheim, FL, USA","name":"IEEE International High Level Design Validation and Test Workshop (HLDVT)"},"title":"Verification of Real-Time Properties for Hardware-Dependant Software","date_created":"2023-01-17T11:28:26Z","author":[{"last_name":"Müller","id":"16243","full_name":"Müller, Wolfgang","first_name":"Wolfgang"},{"first_name":"Marcio F.","full_name":"da S. Oliveira, Marcio F.","last_name":"da S. Oliveira"},{"first_name":"Henning","last_name":"Zabel","full_name":"Zabel, Henning"},{"last_name":"Becker","full_name":"Becker, Markus","first_name":"Markus"}],"date_updated":"2023-01-17T11:28:30Z","publisher":"IEEE","citation":{"apa":"Müller, W., da S. Oliveira, M. F., Zabel, H., &#38; Becker, M. (2010). Verification of Real-Time Properties for Hardware-Dependant Software. <i>Proceedings of HLDVT2010</i>. IEEE International High Level Design Validation and Test Workshop (HLDVT), Anaheim, FL, USA.","mla":"Müller, Wolfgang, et al. “Verification of Real-Time Properties for Hardware-Dependant Software.” <i>Proceedings of HLDVT2010</i>, IEEE, 2010.","bibtex":"@inproceedings{Müller_da S. Oliveira_Zabel_Becker_2010, title={Verification of Real-Time Properties for Hardware-Dependant Software}, booktitle={Proceedings of HLDVT2010}, publisher={IEEE}, author={Müller, Wolfgang and da S. Oliveira, Marcio F. and Zabel, Henning and Becker, Markus}, year={2010} }","short":"W. Müller, M.F. da S. Oliveira, H. Zabel, M. Becker, in: Proceedings of HLDVT2010, IEEE, 2010.","ieee":"W. Müller, M. F. da S. Oliveira, H. Zabel, and M. Becker, “Verification of Real-Time Properties for Hardware-Dependant Software,” presented at the IEEE International High Level Design Validation and Test Workshop (HLDVT), Anaheim, FL, USA, 2010.","chicago":"Müller, Wolfgang, Marcio F. da S. Oliveira, Henning Zabel, and Markus Becker. “Verification of Real-Time Properties for Hardware-Dependant Software.” In <i>Proceedings of HLDVT2010</i>. IEEE, 2010.","ama":"Müller W, da S. Oliveira MF, Zabel H, Becker M. Verification of Real-Time Properties for Hardware-Dependant Software. In: <i>Proceedings of HLDVT2010</i>. IEEE; 2010."},"year":"2010","publication_identifier":{"eisbn":["978-1-4244-7806-4"]}}]