Results 81 to 90 of about 150,456 (276)
We present a fully automated Bayesian optimization (BO) protocol for the parameterization of nonbonded interactions in coarse‐grain CG force fields (BACH). Using experimental thermophysical data, we apply the protocol to a broad range of liquids, spanning linear, branched, and unsaturated hydrocarbons, esters, triglycerides, and water.
Janak Prabhu +3 more
wiley +1 more source
In recent years, ambient intelligence (AmI) has gained significant attention from both academia and industry. AmI seeks to create environments that automatically adapt to individuals’ needs, improving comfort and efficiency.
Alessandro Aloisio +3 more
doaj +1 more source
Introduction: As a research focus in the construction industry in recent years, prefabricated structures have advantages such as environmentally friendly and economical and so on, but it also increases the complexity of design and construction and the ...
Qinghan Bai +3 more
doaj +1 more source
Closed Sets and Operators thereon: Representations, Computability and Complexity [PDF]
The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce.
Carsten Rösnick-Neugebauer
doaj +1 more source
ABSTRACT Materials that can deform, sense, and autonomously generate power in response to wireless magnetic fields, through both magnetic‐actuated shape transformation and charge generation, are an emerging focus in advanced functional materials research.
Zhi Zhao, Xiaojia Shelly Zhang
wiley +1 more source
Exploiting bounded signal flow for graph orientation based on cause-effect pairs
Background We consider the following problem: Given an undirected network and a set of sender-receiver pairs, direct all edges such that the maximum number of "signal flows" defined by the pairs can be routed respecting edge directions.
Niedermeier Rolf +4 more
doaj +1 more source
Parameterized Complexity and Kernel Bounds for Hard Planning Problems
The propositional planning problem is a notoriously difficult computational problem. Downey et al. (1999) initiated the parameterized analysis of planning (with plan length as the parameter) and B\"ackstr\"om et al. (2012) picked up this line of research
Bäckström, Christer +3 more
core +2 more sources
Computational Modeling Meets 3D Bioprinting: Emerging Synergies in Cardiovascular Disease Modeling
Emerging advances in three‐dimensional bioprinting and computational modeling are reshaping cardiovascular (CV) research by enabling more realistic, patient‐specific tissue platforms. This review surveys cutting‐edge approaches that merge biomimetic CV constructs with computational simulations to overcome the limitations of traditional models, improve ...
Tanmay Mukherjee +7 more
wiley +1 more source
A two‐phase workflow (OFAT screening followed by central composite design) maps how processing variables tune PFCE‐PLGA nanoparticle size, dispersity, surface charge, loading, and 19F‐MRI signal. In situ, time‐resolved synchrotron SAXS tracks albumin‐corona growth on intact dispersions and reveals PFCE‐dependent adsorption pathways.
Joice Maria Joseph +11 more
wiley +1 more source
Parameterized Model-checking of Discrete-Timed Networks and Symmetric-Broadcast Systems [PDF]
We study the complexity of the model-checking problem for parameterized discrete-timed systems with arbitrarily many anonymous and identical processes, with and without a distinguished "controller", and communicating via synchronous rendezvous.
Benjamin Aminof +3 more
doaj +1 more source

