Results 91 to 100 of about 1,535,797 (279)

Maximizing Nanoscale Disorder in Block Copolymers for Orientation‐Independent SERS Platform Toward Non‐Invasive Diagnostics

open access: yesAdvanced Science, EarlyView.
Maximizing Nanoscale Disorder in Block Copolymers for Orientation‐Independent SERS Platform toward Non‐Invasive Diagnostics is a nature‐inspired strategy that engineers controlled randomness within block copolymer lamellae to achieve optical isotropy without compromising nanoscale periodicity.
Jin Man Kim   +6 more
wiley   +1 more source

An Algorithm to Compute the Character Access Count Distribution for Pattern Matching Algorithms

open access: yesAlgorithms, 2011
We propose a framework for the exact probabilistic analysis of window-based pattern matching algorithms, such as Boyer–Moore, Horspool, Backward DAWG Matching, Backward Oracle Matching, and more.
Sven Rahmann, Tobias Marschall
doaj   +1 more source

Agent‐Based Simulations of Lung Tumor Evolution Suggest That Ongoing Cell Competition Drives Realistic Clonal Expansions

open access: yesAdvanced Science, EarlyView.
Computational simulations of tumor evolution are increasingly used to infer the rules underlying cancer growth, with the goal of one day recommending tailored treatments. Here we show that the properties of lung cancer sequencing data are best replicated by a model which assumes that cells compete both to proliferate and survive. ABSTRACT Computational
Helena Coggan   +5 more
wiley   +1 more source

Symbolic Synthesis of Mealy Machines from Arithmetic Bitstream Functions [PDF]

open access: yesScientific Annals of Computer Science, 2010
In this paper, we describe a symbolic synthesis method which given an algebraic expression that specifies a bitstream function f, constructs a (minimal) Mealy machine that realises f.
H.H. Hansen, J. Rutten
doaj  

Neural Networks as Universal Finite-State Machines: A Constructive Deterministic Finite Automaton Theory

open access: yesCoRR
We present a complete theoretical and empirical framework establishing feedforward neural networks as universal finite-state machines (N-FSMs). Our results prove that finite-depth ReLU and threshold networks can exactly simulate deterministic finite automata (DFAs) by unrolling state transitions into depth-wise neural layers, with formal ...
openaire   +3 more sources

Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order

open access: yesTheoretical Computer Science, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Latent Diffusion Process With Mechanistic Guidance For Designing Functionally Graded Metamaterials With Perfect Connectivity

open access: yesAdvanced Science, EarlyView.
A latent diffusion‐based framework is proposed for designing functionally graded metamaterials with perfect connectivity. By integrating vector‐quantized latent representations with mechanistic guidance, the framework enables accurate inverse design toward target elastic properties.
Jongbin Yu, Dosung Lee, Namjung Kim
wiley   +1 more source

CoSP: Reconfigurable Metamaterial Inverse Design via Contrastive Pretrained Large Language Model

open access: yesAdvanced Science, EarlyView.
In this work, CoSP (contrastive multi‐state pretrain), an intelligent inverse design method for reconfigurable metamaterials based on a contrastive pretrained large language model, is proposed. Numerical experiments demonstrate that CoSP can design reconfigurable metamaterial structures for multi‐state, multi‐band optical responses, showing great ...
Shujie Yang   +4 more
wiley   +1 more source

Learning a Deterministic Finite Automaton With a Recurrent Neural Network

open access: yes, 2007
We consider the problem of learning a finite automaton with recurrent neural networks, given a training set of sentences in a language. We train Elman recurrent neural networks on the prediction task and study experimentally what these networks learn. We
Tim Oates, Laura Firoiu, Paul R. Cohen
core  

On one-way cellular automata with a fixed number of cells [PDF]

open access: yes, 2003
We investigate a restricted one-way cellular automaton (OCA) model where the number of cells is bounded by a constant number k, so-called kC-OCAs. In contrast to the general model, the generative capacity of the restricted model is reduced to the set of ...
Malcher, Andreas
core  

Home - About - Disclaimer - Privacy