Results 51 to 60 of about 68,163 (244)

Multipacking in Hypercubes [PDF]

open access: yesCoRR
For an undirected graph $G$, a dominating broadcast on $G$ is a function $f : V(G) \rightarrow \mathbb{N}$ such that for any vertex $u \in V(G)$, there exists a vertex $v \in V(G)$ with $f(v) \geqslant 1$ and $d(u,v) \leqslant f(v)$. The cost of $f$ is $\sum_{v \in V} f(v)$.
Deepak Rajendraprasad   +3 more
openaire   +2 more sources

Bayesian Optimisation for the Experimental Sciences: A Practical Guide to Data‐Efficient Optimisation of Laboratory Workflows

open access: yesAdvanced Intelligent Systems, EarlyView.
This study provides an introduction to Bayesian optimisation targeted for experimentalists. It explains core concepts, surrogate modelling, and acquisition strategies, and addresses common real‐world challenges such as noise, constraints, mixed variables, scalability, and automation.
Chuan He   +2 more
wiley   +1 more source

Short‐Term Scheduling Optimization of a Single‐Pipeline Refining System With High Melting Point Crude Oil

open access: yesAsia-Pacific Journal of Chemical Engineering, EarlyView.
ABSTRACT In order to reflect the actual production situation more comprehensively and optimize the production cost, this paper solves the short‐term scheduling optimization problem for a single pipeline containing high melting point crude oil. Based on the refining plan given by the upper layer, a multi‐objective optimization model with high melting ...
Jing Yao   +5 more
wiley   +1 more source

Hitting time for quantum walks on the hypercube

open access: yes, 2005
Hitting times for discrete quantum walks on graphs give an average time before the walk reaches an ending condition. To be analogous to the hitting time for a classical walk, the quantum hitting time must involve repeated measurements as well as unitary ...
A. Ambainis   +8 more
core   +1 more source

Adaptive Machine Learning Framework for Optimizing the Affinity Purification of Adeno‐Associated Viral Vectors

open access: yesBiotechnology and Bioengineering, EarlyView.
ABSTRACT Adeno‐associated viral (AAV) vectors for gene therapy are becoming integral to modern medicine, providing therapeutic options for diseases once deemed incurable. Currently, viral vector purification is a critical bottleneck in the gene therapy industry, impacting product efficacy and safety as well as accessibility and cost to patients ...
Kelvin P. Idanwekhai   +9 more
wiley   +1 more source

Polychromatic Colorings on the Hypercube [PDF]

open access: yes, 2018
Given a subgraph G of the hypercube Q_n, a coloring of the edges of Q_n such that every embedding of G contains an edge of every color is called a G-polychromatic coloring.
Goldwasser, John   +6 more
core   +3 more sources

Development of Raman Spectroscopy and Machine Learning Methods for Protein Aggregate Quantification: Application to BSA in Chromatographic Processes

open access: yesBiotechnology and Bioengineering, EarlyView.
ABSTRACT Protein aggregation poses a significant risk to biopharmaceutical product quality, as even minor amounts of oligomeric species can compromise efficacy and safety. Rapid and reliable detection of protein aggregates thus remains a major challenge in biopharmaceutical manufacturing.
Jakob Heyer‐Müller   +4 more
wiley   +1 more source

Existence of 3-regular subgraphs in Cartesian product of cycles

open access: yesAKCE International Journal of Graphs and Combinatorics, 2019
Let be a graph obtained by taking the Cartesian product of finitely many cycles. It is known that is bipancyclic, that is, contains cycles of every even length from 4 to We extend this result for the existence of 3-regular subgraphs in We prove that ...
Y.M. Borse, J.B. Saraf
doaj   +1 more source

A Mechanistic Model of rAAV Production in Synthetic Cell Lines

open access: yesBiotechnology and Bioengineering, EarlyView.
ABSTRACT The recombinant adeno‐associated virus (rAAV) is a widely used vector for gene therapy. Its manufacturing faces significant challenges in producing the large quantities of vectors needed for clinical applications and reducing empty particles.
Prahalad Srinivasan   +5 more
wiley   +1 more source

Saturated Subgraphs of the Hypercube [PDF]

open access: yesCombinatorics, Probability and Computing, 2016
We say a graph is (Qn,Qm)-saturatedif it is a maximalQm-free subgraph of then-dimensional hypercubeQn. A graph is said to be (Qn,Qm)-semi-saturatedif it is a subgraph ofQnand adding any edge forms a new copy ofQm. The minimum number of edges a (Qn,Qm)-saturated graph (respectively (Qn,Qm)-semi-saturated graph) can have is denoted by sat(Qn,Qm ...
Johnson, JR, Pinto, T
openaire   +4 more sources

Home - About - Disclaimer - Privacy