Results 171 to 180 of about 324,475 (219)

Molecular Dynamics Studies of Shape Memory Polymers: From Bead–Spring Models to Atomistic Simulations

Advanced Engineering Materials, EarlyView.
Coarse‐grained (left) and atomistic (right) models of the shape memory polymer ESTANE ETE 75DT3 are shown schematically. The two representations bridge molecular detail and mesoscopic description. Both models capture shape memory behavior, linking segmental mobility and conformational relaxation of anisotropic chains to macroscopic recovery, and ...
Fathollah Varnik
wiley   +1 more source

Enhancing Bubble Removal in Geometry‐Optimized Electrodes

Advanced Engineering Materials, EarlyView.
3D‐printed lattice electrodes outperform stochastic foams in alkaline water electrolysis despite 20%–25% lower surface area. Straight flow channels generate Venturi‐like bubble entrainment, suppressing gas accumulation that renders foam interiors electrochemically inactive.
Florian Wiesner, Peter Förster, Alexander Limper, Anselm Brodersen, Matthias Wessling, John Linkhorst   +5 more
wiley   +1 more source

Microstructure Reconstruction in Battery Electrodes Using Machine Learning Based on Low‐Voltage Focused Ion Beam–Scanning Electron Microscopy Tomography Images

Advanced Engineering Materials, EarlyView.
Low‐voltage FIB‐SEM tomography combined with a image preprocessing pipeline improves phase contrast and enables reliable machine‐learning segmentation of conductive networks in lithium‐ion battery electrodes. Structural descriptors are extracted from segmented images, done semimanually and automated, and compared.
Lisa Beran, Vincent Nebel, Dominik Perius, Kshitij Kumar, Yannis Heim, Laura Bies, Tobias Kraus   +6 more
wiley   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Algorithms

ACM SIGPLAN Lisp Pointers, 1991
It is my intention to publish two different kinds of algorithms articles: articles that present utilities built on top of Common Lisp and articles that discuss and explain interesting parts of Common Lisp. The following article is an example of the latter type.
openaire   +1 more source

Algorithmic Fairness for Networked Algorithms

International Joint Conference on Autonomous Agents and Multiagent Systems, 2020
Recent evidence points to the detrimental effects of algorithmic deployment on human datasets, as often times such algorithms mirror and exacerbate existing inequalities in the input data. This work focuses on understanding the disparate effects of algorithms on social inequality and building theory and applications for graph algorithms with ...
openaire   +2 more sources

Algorithms Creating Algorithms

2010
The spontaneous synthesis of algorithms in artificial neural networks is experimented and analyzed on three hierarchical levels and there are three basic problems: How the engram of memory connects the neuron state and the combination of messages from other neurons. How the cortical column decodes the parallel series of impulses from other columns. How
openaire   +1 more source

Randomized algorithms

ACM Computing Surveys, 1995
For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of randomized algorithms. The first part of the text presents basic tools such as probability theory and probabilistic analysis that are frequently used in ...
Rajeev Motwani 0001, Prabhakar Raghavan
openaire   +1 more source

Algorithm library based on algorithmic cyberFilms

Knowledge-Based Systems, 2009
A library of algorithms developed as algorithmic cyberFilms is presented. Algorithmic cyberFilms are a new type of software components for presentation, specification/programming and automatic code generation of computational algorithms. The algorithmic cyberFilm format is implemented as a set of multimedia frames (and scenes), and each component is ...
Yutaka Watanobe, Nikolay N. Mirenkov, Rentaro Yoshioka   +2 more
openaire   +2 more sources

Algorithms for Circuits and Circuits for Algorithms

2014 IEEE 29th Conference on Computational Complexity (CCC), 2014
The title of this paper is meant to highlight an emerging duality between two fundamental topics in algorithms and complexity theory. Algorithms for circuits} refers to the design of interesting algorithms which can perform non-trivial circuit analysis of some kind, on either a circuit or a Boolean function given as a truth table.
openaire   +1 more source

Algorithm 709: testing algorithm implementations

ACM Transactions on Mathematical Software, 1992
This paper explores the design of software for the evaluation of algorithms. We describe a number of features which may be taken as indicative of ideas and features that can be implemented in a general-purpose testing package. To facilitate our discussion, we introduce software for the testing of implementations of algorithms for solving a particular ...
openaire   +1 more source