Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Utrecht UniversityNL210 papers
- Delft University of TechnologyNL196 papers
- Centre National de la Recherche ScientifiqueFR195 papers
- Centrum Wiskunde & InformaticaNL163 papers
- University of TwenteNL158 papers
- University of AmsterdamNL113 papers
- Radboud University NijmegenNL89 papers
- University of Rome Tor VergataIT84 papers
- Vrije Universiteit AmsterdamNL79 papers
- Leiden UniversityNL72 papers
- University of GroningenNL58 papers
- Philips (Netherlands)NL56 papers
225 papers · 1 filter
Space Expansion of Feature Selection for Designing more Accurate Error Predictors
Shayan Tabatabaei Nikkhah, Mehdi Kamal, Ali Afzali-Kusha +1
Approximate computing is being considered as a promising design paradigm to overcome the energy and performance challenges in computationally demanding applications. If the case wh…
Task Elimination may Actually Increase Throughput Time
D. M. M. Schunselaar, H. M. W. Verbeek
The well-known Task Elimination redesign principle suggests to remove unnecessary tasks from a process to improve on time and cost. Although there seems to be a general consensus t…
Creep of Chiral Domain Walls
Dion M. F. Hartmann, Rembert A. Duine, Mariëlle J. Meijer +2
Recent experimental studies of magnetic domain expansion under easy-axis drive fields in materials with a perpendicular magnetic anisotropy have shown that the domain wall velocity…
Fourier Transform on the Homogeneous Space of 3D Positions and Orientations for Exact Solutions to Linear Parabolic and (Hypo-)Elliptic PDEs
Remco Duits, Erik J. Bekkers, Alexey Mashtakov
Fokker-Planck PDEs (incl. diffusions) for stable Lévy processes (incl. Wiener processes) on the joint space of positions and orientations play a major role in mechanics, robotics,…
Counting cliques and cycles in scale-free inhomogeneous random graphs
A. J. E. M. Janssen, Johan S. H. van Leeuwaarden, Seva Shneer
Scale-free networks contain many small cliques and cycles. We model such networks as inhomogeneous random graphs with regularly varying infinite-variance weights. For these models,…
Scale-free network clustering in hyperbolic and other random graphs
Clara Stegehuis, Remco van der Hofstad, Johan S. H. van Leeuwaarden
Random graphs with power-law degrees can model scale-free networks as sparse topologies with strong degree heterogeneity. Mathematical analysis of such random graphs proved success…
A bouncing oil droplet in a stratified liquid and its sudden death
Yanshen Li, Christian Diddens, Andrea Prosperetti +3
Droplets can self-propel when immersed in another liquid in which a concentration gradient is present. Here we report the experimental and numerical study of a self-propelling oil…
On the competition between dislocation transmission and crack nucleation at phase boundaries
F. Bormann, R. H. J. Peerlings, M. G. D. Geers
The interaction of dislocations with phase boundaries is a complex phenomenon, that is far from being fully understood. A 2D Peierls-Nabarro finite element (PN-FE) model for studyi…
Self-stresses control stiffness and stability in overconstrained disordered networks
Anwesha Bose, Mathijs F. J. Vermeulen, Cornelis Storm +1
We investigate the interplay between pre-stress and mechanical properties in random elastic networks. To do this in a controlled fashion, we introduce an algorithm for creating ran…
Convex Polygons in Cartesian Products
Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans +4
We study several problems concerning convex polygons whose vertices lie in a Cartesian product of two sets of real numbers (for short, \emph{grid}). First, we prove that every…
Enhancing Discrete Choice Models with Representation Learning
Brian Sifringer, Virginie Lurkin, Alexandre Alahi
In discrete choice modeling (DCM), model misspecifications may lead to limited predictability and biased parameter estimates. In this paper, we propose a new approach for estimatin…
Quantum Equivalence of the DLP and CDHP for Group Actions
Steven Galbraith, Lorenz Panny, Benjamin Smith +1
In this short note we give a polynomial-time quantum reduction from the vectorization problem (DLP) to the parallelization problem (CDHP) for group actions. Combined with the trivi…
Matroids over one-dimensional groups
Guus P. Bollen, Dustin Cartwright, Jan Draisma
We develop the theory of matroids over one-dimensional algebraic groups, with special emphasis on positive characteristic. In particular, we compute the Lindström valuations and Fr…
The dimension of an amoeba
Jan Draisma, Johannes Rau, Chi Ho Yuen
Answering a question by Nisse and Sottile, we derive a formula for the dimension of the amoeba of an irreducible algebraic variety.
Multivalent "Attacker & Guard" Strategy for Targeting Surfaces with Low Receptor Density
Nicholas B. Tito
Multivalent particles, i.e. microscopic constructs having multiple ligands, can be used to target surfaces selectively depending on their receptor density. Typically, there is a sh…
The effect of the liquid layer thickness on the dissolution of immersed surface droplets
Qingguang Xie, Jens Harting
Droplets on a liquid-immersed solid surface are key elements in many applications, such as high-throughput chemical analysis and droplet-templated porous materials. Such surface dr…
Microwave-to-optics conversion using a mechanical oscillator in its quantum groundstate
Moritz Forsch, Robert Stockill, Andreas Wallucks +7
Conversion between signals in the microwave and optical domains is of great interest both for classical telecommunication, as well as for connecting future superconducting quantum…
How antagonistic salts cause nematic ordering and behave like diblock copolymers
David Jung, Nicolas Rivas, Jens Harting
We present simulation results and an explanatory theory on how antagonistic salts affect the spinodal decomposition of binary fluid mixtures. We find that spinodal decomposition is…
Better Trees: An empirical study on hyperparameter tuning of classification decision tree induction algorithms
Rafael Gomes Mantovani, Tomáš Horváth, André L. D. Rossi +4
Machine learning algorithms often contain many hyperparameters (HPs) whose values affect the predictive performance of the induced models in intricate ways. Due to the high number…
Grammar-based Representation and Identification of Dynamical Systems
Dhruv Khandelwal, Maarten Schoukens, Roland Tóth
In this paper we propose a novel approach to identify dynamical systems. The method estimates the model structure and the parameters of the model simultaneously, automating the cri…
Spin current cross-correlations as a probe of magnon coherence
Scott A. Bender, Akashdeep Kamra, Wolfgang Belzig +1
Motivated by the important role of the normalized second order coherence function, often called , in the field of quantum optics, we propose a method to determine magnon c…
Decoding Staircase Codes with Marked Bits
Yi Lei, Alex Alvarado, Bin Chen +4
Staircase codes (SCCs) are typically decoded using iterative bounded-distance decoding (BDD) and hard decisions. In this paper, a novel decoding algorithm is proposed, which partia…
MATMPC - A MATLAB Based Toolbox for Real-time Nonlinear Model Predictive Control
Yutao Chen, Mattia Bruschetta, Enrico Picotti +1
In this paper we introduce MATMPC, an open source software built in MATLAB for nonlinear model predictive control (NMPC). It is designed to facilitate modelling, controller design…
Nearly ETH-Tight Algorithms for Planar Steiner Tree with Terminals on Few Faces
Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
The Planar Steiner Tree problem is one of the most fundamental NP-complete problems as it models many network design problems. Recall that an instance of this problem consists of a…