Results 71 to 80 of about 174,873,121 (310)
Persisting randomness in randomly growing discrete structures: graphs and search trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values.
Rudolf Grübel
doaj +1 more source
An algorithm for LET-analysis [PDF]
Physics in Medicine & Biology, 1972 An algorithm for the derivation of LET-distributions from pulse- height spectra obtained with proportional counters is described. The method is based on Fourier transformation: it is applicable to spherical as well as non-spherical proportional counters.
openaire +3 more sources
Analysis and improvements to MATE algorithm [PDF]
IEEE International Conference on Performance, Computing, and Communications, 2004, 2004 This paper describes an implementation, analysis and improvements to MATE (MPLS adaptive traffic engineering) algorithm. MATE is an on-line load balancing algorithm. As MATE was originally thought for constant average incoming traffic, the first improvement is the usage of an adaptive update step size for time varying traffic.
Remersaro, Santiago +3 more
openaire +2 more sources
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
Analysis and Improvement of Fireworks Algorithm [PDF]
Algorithms, 2017 The Fireworks Algorithm is a recently developed swarm intelligence algorithm to simulate the explosion process of fireworks. Based on the analysis of each operator of Fireworks Algorithm (FWA), this paper improves the FWA and proves that the improved algorithm converges to the global optimal solution with probability 1.
Xi-Guang Li +2 more
openaire +3 more sources
Engineering peptides into antibodies—opportunities and strategies for therapeutic innovation
FEBS Letters, EarlyView.Peptides and antibodies occupy complementary therapeutic niches. Peptides recognize difficult targets in a compact format, while antibodies add specificity, long half‐life, and effector functions. This review examines strategies that merge both modalities—peptide grafting into loops, terminal and Fc fusions, and bioconjugation—highlighting how ...
Jinling Wang +2 more
wiley +1 more source
Globally convergent algorithms for dc operating point analysis of nonlinear circuits [PDF]
, 2003 An important objective in the analysis of an electronic circuit is to find its quiescent or DC operating point. This is the starting point for performing other types of circuit analysis.
Zwolinski, Mark +3 more
core +1 more source
Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry
FEBS Letters, EarlyView.EGF and HRG induce distinct G1/S progression programs in ErbB2‐amplified BT474 breast cancer cells. Despite activating the potent ErbB2–ErbB3 heterodimer, HRG does not accelerate cell‐cycle entry. Instead, EGF promotes earlier restriction‐point passage via ERK–FOS signaling, whereas HRG activates the AKT–MYC axis, driving transcriptional heterogeneity ...
Ririn Rahmala Febri +5 more
wiley +1 more source
Parameterized Algorithms in Bioinformatics: An Overview
, 2019 International audienceBioinformatics regularly poses new challenges to algorithm engineers and theoretical computer scientists. This work surveys recent developments of parameterized algorithms and complexity for important NP-hard problems in ...
Laurent Bulteau +3 more
core +1 more source
Algorithmic Randomness and Fourier Analysis [PDF]
Theory of Computing Systems, 2018 Suppose $1 < p < \infty$. Carleson's Theorem states that the Fourier series of any function in $L^p[-π, π]$ converges almost everywhere. We show that the Schnorr random points are precisely those that satisfy this theorem for every $f \in L^p[-π, π]$ given natural computability conditions on $f$ and $p$.
Johanna N. Y. Franklin +2 more
openaire +3 more sources