Results 51 to 60 of about 57,258 (313)

METHODS OF APPROXIMATION OF FUNCTIONS BY GENERALIZED POLYNOMIALS IN NUMERICAL ANALYSIS PROBLEMS RELATED TO CALCULATIONS ON APPROXIMATE DATA

open access: yesНаука. Инновации. Технологии, 2022
Introduction: the methods of representation of functions given approximately by their singular integrals in relation to approximation problems and numerical methods for solving boundary value problems for differential equations are Investigated.
Igor Eduardovich Naats   +2 more
doaj  

Cell geometry and membrane protein crowding constrain Escherichia coli growth rate, overflow metabolism, respiration, and maintenance energy

open access: yesFEBS Letters, EarlyView.
The physical dimensions and shape of bacterial cells define the surface area available to acquire nutrients and the volume available for synthesizing proteins and DNA. Here, we use computational systems biology to decode the importance of cell geometry as a major determinant of prokaryotic phenotype, including growth rate and metabolic efficiency. This
Ross P. Carlson   +6 more
wiley   +1 more source

Robust a priori and a posteriori error analysis for the approximation of Allen–Cahn and Ginzburg–Landau equations past topological changes [PDF]

open access: yes, 2010
A priori and a posteriori error estimates are derived for the numerical approximation of scalar and complex valued phase field models. Particular attention is devoted to the dependence of the estimates on a small parameter and to the validity of the ...
Rüdiger Müller   +11 more
core   +1 more source

Strong Inequalities for Hermite-Fejér Interpolations and Characterization of K-Functionals

open access: yesAbstract and Applied Analysis, 2014
The works of Smale and Zhou (2003, 2007), Cucker and Smale (2002), and Cucker and Zhou (2007) indicate that approximation operators serve as cores of many machine learning algorithms.
Gongqiang You
doaj   +1 more source

Neural Acceleration of Graph Based Utility Functions for Sparse Matrices

open access: yesIEEE Access, 2023
Many graph-based algorithms in high performance computing (HPC) use approximate solutions due to having algorithms that are computationally expensive or serial in nature.
Joshua Dennis Booth, Gregory S. Bolet
doaj   +1 more source

Salmonella lipopolysaccharide‐containing supported lipid bilayers as platforms to study bacteriophage interactions

open access: yesFEBS 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

The role of miR‐335‐5p in the redifferentiation of BRAF p.V600E thyroid cancers

open access: yesMolecular Oncology, EarlyView.
The BRAF p.V600E mutation promotes thyroid cancer dedifferentiation and radioiodine resistance. Using a network approach, we identified miR‐335‐5p as a key regulator of BRAF‐mutated thyroid tumors. Restoring miR‐335‐5p increased thyroid‐specific gene expression and iodine uptake in cells and organoids.
Valeria Pecce   +11 more
wiley   +1 more source

Modifications of Flower Pollination, Teacher-Learner and Firefly Algorithms for Solving Multiextremal Optimization Problems

open access: yesAlgorithms, 2022
The article offers a possible treatment for the numerical research of tasks which require searching for an absolute optimum. This approach is established by employing both globalized nature-inspired methods as well as local descent methods for ...
Pavel Sorokovikov, Alexander Gornov
doaj   +1 more source

Network divergence analysis identifies adaptive gene modules and two orthogonal vulnerability axes in pancreatic cancer

open access: yesMolecular Oncology, EarlyView.
Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson   +9 more
wiley   +1 more source

Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem [PDF]

open access: yes, 2023
Uniform cost-distance Steiner trees minimize the sum of the total length and weighted path lengths from a dedicated root to the other terminals. They are applied when the tree is intended for signal transmission, e.g.
Spitzley, Yannik Kyle Dustin   +2 more
core   +1 more source

Home - About - Disclaimer - Privacy