@article{AvalosOvandoSantiagoMovsesyanetal.2022, author = {Avalos-Ovando, Oscar and Santiago, Eva Yazmin and Movsesyan, Artur and Kong, Xiang-Tian and Yu, Peng and Besteiro, Lucas V. and Khosravi Khorashad, Larousse and Okamoto, Hiromi and Slocik, Joseph M. and Correa-Duarte, Miguel and Comesana-Hermo, Miguel and Liedl, Tim and Markovich, Gil and Burger, Sven and Govorov, Alexander O.}, title = {Chiral Bioinspired Plasmonics: A Paradigm Shift for Optical Activity and Photochemistry}, volume = {9}, journal = {ACS Photon.}, doi = {10.1021/acsphotonics.2c00445}, pages = {2219}, year = {2022}, language = {en} } @article{PlockAndrleBurgeretal.2022, author = {Plock, Matthias and Andrle, Kas and Burger, Sven and Schneider, Philipp-Immanuel}, title = {Bayesian Target-Vector Optimization for Efficient Parameter Reconstruction}, volume = {5}, journal = {Adv. Theory Simul.}, arxiv = {http://arxiv.org/abs/2202.11559}, doi = {10.1002/adts.202200112}, pages = {2200112}, year = {2022}, language = {en} } @inproceedings{AmiranashviliLuedkeLietal.2022, author = {Amiranashvili, Tamaz and L{\"u}dke, David and Li, Hongwei and Menze, Bjoern and Zachow, Stefan}, title = {Learning Shape Reconstruction from Sparse Measurements with Neural Implicit Functions}, booktitle = {Medical Imaging with Deep Learning}, year = {2022}, abstract = {Reconstructing anatomical shapes from sparse or partial measurements relies on prior knowledge of shape variations that occur within a given population. Such shape priors are learned from example shapes, obtained by segmenting volumetric medical images. For existing models, the resolution of a learned shape prior is limited to the resolution of the training data. However, in clinical practice, volumetric images are often acquired with highly anisotropic voxel sizes, e.g. to reduce image acquisition time in MRI or radiation exposure in CT imaging. The missing shape information between the slices prohibits existing methods to learn a high-resolution shape prior. We introduce a method for high-resolution shape reconstruction from sparse measurements without relying on high-resolution ground truth for training. Our method is based on neural implicit shape representations and learns a continuous shape prior only from highly anisotropic segmentations. Furthermore, it is able to learn from shapes with a varying field of view and can reconstruct from various sparse input configurations. We demonstrate its effectiveness on two anatomical structures: vertebra and femur, and successfully reconstruct high-resolution shapes from sparse segmentations, using as few as three orthogonal slices.}, language = {en} } @article{ObermeierHeimBiereetal.2022, author = {Obermeier, Patrick E and Heim, Albert and Biere, Barbara and Hage, Elias and Alchikh, Maren and Conrad, Tim and Schweiger, Brunhilde and Rath, Barbara A}, title = {Linking digital surveillance and in-depth virology to study clinical patterns of viral respiratory infections in vulnerable patient populations}, volume = {25}, journal = {iScience}, number = {5}, publisher = {Cell Press}, doi = {10.1016/j.isci.2022.104276}, year = {2022}, abstract = {To improve the identification and management of viral respiratory infections, we established a clinical and virologic surveillance program for pediatric patients fulfilling pre-defined case criteria of influenza-like illness and viral respiratory infections. The program resulted in a cohort comprising 6,073 patients (56\% male, median age 1.6 years, range 0-18.8 years), where every patient was assessed with a validated disease severity score at the point-of-care using the ViVI ScoreApp. We used machine learning and agnostic feature selection to identify characteristic clinical patterns. We tested all patients for human adenoviruses, 571 (9\%) were positive. Adenovirus infections were particularly common and mild in children ≥1 month of age but rare and potentially severe in neonates: with lower airway involvement, disseminated disease, and a 50\% mortality rate (n = 2/4). In one fatal case, we discovered a novel virus …}, language = {en} } @article{HajarolasvadiSunkaraKhavnekaretal.2022, author = {Hajarolasvadi, Noushin and Sunkara, Vikram and Khavnekar, Sagar and Beck, Florian and Brandt, Robert and Baum, Daniel}, title = {Volumetric macromolecule identification in cryo-electron tomograms using capsule networks}, volume = {23}, journal = {BMC Bioinformatics}, number = {360}, doi = {10.1186/s12859-022-04901-w}, year = {2022}, abstract = {Background: Despite recent advances in cellular cryo-electron tomography (CET), developing automated tools for macromolecule identification in submolecular resolution remains challenging due to the lack of annotated data and high structural complexities. To date, the extent of the deep learning methods constructed for this problem is limited to conventional Convolutional Neural Networks (CNNs). Identifying macromolecules of different types and sizes is a tedious and time-consuming task. In this paper, we employ a capsule-based architecture to automate the task of macro- molecule identification, that we refer to as 3D-UCaps. In particular, the architecture is composed of three components: feature extractor, capsule encoder, and CNN decoder. The feature extractor converts voxel intensities of input sub-tomograms to activities of local features. The encoder is a 3D Capsule Network (CapsNet) that takes local features to generate a low-dimensional representation of the input. Then, a 3D CNN decoder reconstructs the sub-tomograms from the given representation by upsampling. Results: We performed binary and multi-class localization and identification tasks on synthetic and experimental data. We observed that the 3D-UNet and the 3D-UCaps had an F1-score mostly above 60\% and 70\%, respectively, on the test data. In both network architectures, we observed degradation of at least 40\% in the F1-score when identifying very small particles (PDB entry 3GL1) compared to a large particle (PDB entry 4D8Q). In the multi-class identification task of experimental data, 3D-UCaps had an F1-score of 91\% on the test data in contrast to 64\% of the 3D-UNet. The better F1-score of 3D-UCaps compared to 3D-UNet is obtained by a higher precision score. We speculate this to be due to the capsule network employed in the encoder. To study the effect of the CapsNet-based encoder architecture further, we performed an ablation study and perceived that the F1-score is boosted as network depth is increased which is in contrast to the previously reported results for the 3D-UNet. To present a reproducible work, source code, trained models, data as well as visualization results are made publicly available. Conclusion: Quantitative and qualitative results show that 3D-UCaps successfully perform various downstream tasks including identification and localization of macro- molecules and can at least compete with CNN architectures for this task. Given that the capsule layers extract both the existence probability and the orientation of the molecules, this architecture has the potential to lead to representations of the data that are better interpretable than those of 3D-UNet.}, language = {en} } @article{BonamiGleixnerLinderothetal.2018, author = {Bonami, Pierre and Gleixner, Ambros and Linderoth, Jeff and Misener, Ruth}, title = {Designing and Implementing Algorithms for Mixed-Integer Nonlinear Optimization (Dagstuhl Seminar 18081)}, volume = {8}, journal = {Dagstuhl Reports}, number = {2}, doi = {10.4230/DagRep.8.2.64}, pages = {64 -- 87}, year = {2018}, abstract = {Mathematical models for optimal decisions often require both nonlinear and discrete components. These mixed-integer nonlinear programs (MINLP) may be used to optimize the energy use of large industrial plants, integrate renewable sources into energy networks, design biological and biomedical systems, and address numerous other applications of societal importance. The first MINLP algorithms and software were designed by application engineers. While these efforts initially proved useful, scientists, engineers, and practitioners have realized that a transformational shift in technology will be required for MINLP to achieve its full potential. MINLP has transitioned to a forefront position in computer science, with researchers actively developing MINLP theory, algorithms, and implementations. Even with their concerted effort, algorithms and available software are often unable to solve practically-sized instances of these important models. Current obstacles include characterizing the computability boundary, effectively exploiting known optimization technologies for specialized classes of MINLP, and effectively using logical formulas holistically throughout algorithms.}, language = {en} } @article{MuellerMunozGasseetal.2022, author = {M{\"u}ller, Benjamin and Mu{\~n}oz, Gonzalo and Gasse, Maxime and Gleixner, Ambros and Lodi, Andrea and Serrano, Felipe}, title = {On generalized surrogate duality in mixed-integer nonlinear programming}, volume = {192}, journal = {Mathematical Programming}, number = {1}, doi = {10.1007/s10107-021-01691-6}, pages = {89 -- 118}, year = {2022}, abstract = {The most important ingredient for solving mixed-integer nonlinear programs (MINLPs) to global ϵ-optimality with spatial branch and bound is a tight, computationally tractable relaxation. Due to both theoretical and practical considerations, relaxations of MINLPs are usually required to be convex. Nonetheless, current optimization solvers can often successfully handle a moderate presence of nonconvexities, which opens the door for the use of potentially tighter nonconvex relaxations. In this work, we exploit this fact and make use of a nonconvex relaxation obtained via aggregation of constraints: a surrogate relaxation. These relaxations were actively studied for linear integer programs in the 70s and 80s, but they have been scarcely considered since. We revisit these relaxations in an MINLP setting and show the computational benefits and challenges they can have. Additionally, we study a generalization of such relaxation that allows for multiple aggregations simultaneously and present the first algorithm that is capable of computing the best set of aggregations. We propose a multitude of computational enhancements for improving its practical performance and evaluate the algorithm's ability to generate strong dual bounds through extensive computational experiments.}, language = {en} } @article{BinkowskiBetzHammerschmidtetal.2022, author = {Binkowski, Felix and Betz, Fridtjof and Hammerschmidt, Martin and Schneider, Philipp-Immanuel and Zschiedrich, Lin and Burger, Sven}, title = {Computation of eigenfrequency sensitivities using Riesz projections for efficient optimization of nanophotonic resonators}, volume = {5}, journal = {Commun. Phys.}, arxiv = {http://arxiv.org/abs/2203.11101}, doi = {10.1038/s42005-022-00977-1}, pages = {202}, year = {2022}, language = {en} } @article{MovsesyanSantiagoBurgeretal.2022, author = {Movsesyan, Artur and Santiago, Eva Yazmin and Burger, Sven and Correa-Duarte, Miguel and Besteiro, Lucas V. and Wang, Zhiming and Govorov, Alexander O.}, title = {Plasmonic nanocrystals with complex shapes for photocatalysis and growth: Contrasting anisotropic hot-electron generation with the photothermal effect}, volume = {10}, journal = {Adv. Opt. Mater.}, arxiv = {http://arxiv.org/abs/2203.00930}, doi = {10.1002/adom.202102663}, pages = {2102663}, year = {2022}, language = {en} } @misc{ColomBinkowskiBetzetal.2022, author = {Colom, Remi and Binkowski, Felix and Betz, Fridtjof and Kivshar, Yuri and Burger, Sven}, title = {Source code and simulation results for nanoantennas supporting an enhanced Purcell factor due to interfering resonances}, journal = {Zenodo}, doi = {10.5281/zenodo.6565850}, year = {2022}, language = {en} }