Publication Server of Zuse Institute Berlin (ZIB)
Not a member yet
6648 research outputs found
Sort by
Clustering scientific publications: lessons learned through experiments with a real citation network
No full textClustering scientific publications helps uncover research structures within bibliographic databases. Graph-based methods such as spectral, Louvain, and Leiden clustering are commonly used due to their ability to model citation networks. However, their effectiveness can diminish when applied to real-world data. This study evaluates these clustering algorithms on a citation graph of about 700,000 articles and 4.6 million citations from the Web of Science. The results show that while scalable methods like Louvain and Leiden perform efficiently, their default settings often yield poor partitioning. Meaningful outcomes require careful parameter tuning, especially for large networks with uneven structures, including a dense core and loosely connected papers. These findings highlight practical lessons about the challenges of large-scale data, method selection and tuning based on specific structures of bibliometric clustering tasks
S-DAT: a multilingual, GenAI-driven framework for automated divergent thinking assessment
No full text
High Purcell enhancement in all-TMDC nanobeam resonator designs with active monolayers for nanolasers
No full textUnfolding the geometric structure and multiple timescales of the urea-urease pH oscillator
No full textWe study a two-variable dynamical system modeling pH oscillations in the urea–urease reaction within giant lipid vesicles – a problem that intrinsically contains multiple, well-separated timescales. Building on an existing, deterministic formulation via ordinary differential equations, we resolve different orders of magnitude within a small parameter and analyze the system's limit cycle behavior using geometric singular perturbation theory (GSPT). By introducing two different coordinate scalings – each valid in a distinct region of the phase space – we resolve the local dynamics near critical fold points, using the extension of GSPT through such singular points due to Krupa and Szmolyan. This framework enables a geometric decomposition of the periodic orbits into slow and fast segments and yields closed-form estimates for the period of oscillation. In particular, we link the existence of such oscillations to an underlying biochemical asymmetry, namely, the differential transport across the vesicle membrane
Prototypical warm-starts for demand-robust LP-based energy system optimization
No full textThe expressiveness of energy system optimization models (ESOMs) depends on a multitude of exogenous parameters. For example, sound estimates of the future energy demand are essential to enable qualified decisions on long-term investments. However, the enormous demand fluctuations even on a fine-grained scale diminish the computational performance of large-scale ESOMs. We therefore propose a clustering-and-decomposition method for linear programming based ESOMs that first identifies and solves prototypical demand scenarios with the dual simplex algorithm, and then composes dual optimal prototype bases to a warm-start basis for the full model. We evaluate the feasibility and computational efficiency our approach on a real-world case study, using a sector-coupled ESOM with hourly resolution for the Berlin-Brandenburg area in Germany, based on the oemof framework
Comparing Branching Rules for the Quota Steiner Tree Problem with Interference
No full textBranching decisions play a crucial role in branch-and-bound algorithms for solving combinatorial optimization problems. In this paper, we investigate several branching rules applied to the Quota Steiner Tree Problem with Interference (QSTPI). The Quota Steiner Tree Problem (QSTP) generalizes the classical Steiner Tree Problem (STP) in graphs by seeking a minimum-cost tree that connects a subset of profit-associated vertices to meet a given quota. The extended version, QSTPI, introduces interference among vertices: Selecting certain vertices simultaneously reduces their individual contributions to the overall profit. This problem arises, for example, in positioning and connecting wind turbines, where turbines possibly shadow other turbines, reducing their energy yield. While exact solvers for standard STP-related problems often rely heavily on reduction techniques and cutting-plane methods – rarely generating large branch-and-bound trees – experiments reveal that large instances of QSTPI require significantly more branching to compute provably optimal solutions. In contrast to branching on variables, we utilize the combinatorial structure of the QSTPI by branching on the graph’s vertices. We adapt classical and problem-specific branching rules and present a comprehensive computational study comparing the effectiveness of these branching strategies
