Zobrazeno 1 - 10
of 33 781
pro vyhledávání: '"Grossmann A"'
Recently, researchers have extended the concept of matchings to the more general problem of finding $b$-matchings in hypergraphs broadening the scope of potential applications and challenges. The concept of $b$-matchings, where $b$ is a function that
Externí odkaz:
http://arxiv.org/abs/2408.06924
While bacterial swimming has been well characterized in uniform liquid environments, only little is known about how bacteria propagate through complex environments, such as gel-like matrices or porous media that are typically encountered in tissue or
Externí odkaz:
http://arxiv.org/abs/2408.02317
Autor:
Ashworth, Jacob, Grossmann, Luca, Navarro, Fausto, Almodovar, Leyda, Harsy, Amanda, Johnson, Cory, Sorrells, Jessica
Recent advancements in microbiology have motivated the study of the production of nanostructures with applications such as biomedical computing and molecular robotics. One way to construct these structures is to construct branched DNA molecules that
Externí odkaz:
http://arxiv.org/abs/2408.00192
Autor:
Peng, Zedong, Cao, Kaiyu, Furman, Kevin C., Li, Can, Grossmann, Ignacio E., Neira, David E. Bernal
The advancement of domain reduction techniques has significantly enhanced the performance of solvers in mathematical programming. This paper delves into the impact of integrating convexification and domain reduction techniques within the Outer- Appro
Externí odkaz:
http://arxiv.org/abs/2407.20973
Publikováno v:
Computer Aided Chemical Engineering 53 (2024) 2161-2166
Generalized disjunctive programming (GDP) models with bilinear and concave constraints, often seen in water network design, are challenging optimization problems. This work proposes quadratic and piecewise linear approximations for nonlinear terms to
Externí odkaz:
http://arxiv.org/abs/2407.19543
A (fully) dynamic graph algorithm is a data structure that supports edge insertions, edge deletions, and answers specific queries pertinent to the problem at hand. In this work, we address the fully dynamic edge orientation problem, also known as the
Externí odkaz:
http://arxiv.org/abs/2407.12595
A dynamic graph algorithm is a data structure that supports edge insertions, deletions, and specific problem queries. While extensive research exists on dynamic algorithms for graph problems solvable in polynomial time, most of these algorithms have
Externí odkaz:
http://arxiv.org/abs/2407.06912
Motivated by various recent experimental findings, we propose a dynamical model of intermittently self-propelled particles: active particles that recurrently switch between two modes of motion, namely an active run-state and a turn state, in which se
Externí odkaz:
http://arxiv.org/abs/2406.15277
Despite its potential, optical spectrum prediction for crystalline materials has been largely overlooked in machine learning for materials science. Here we present a proof of concept by creating a ab initio database of 9,915 dielectric tensors of sem
Externí odkaz:
http://arxiv.org/abs/2406.08191
Autor:
Shrestha, Abhishek, Großmann, Jürgen
Deep Neural Networks (DNNs) are known to be vulnerable to adversarial examples. Further, these adversarial examples are found to be transferable from the source network in which they are crafted to a black-box target network. As the trend of using de
Externí odkaz:
http://arxiv.org/abs/2405.09598