arXiv subjects

Bo Deng

Publications and source records attributed to Bo Deng.

24 records · Page 2Linked to original sources

arXiv2018

First Integrated Implosion Experiment of Three-Axis Cylindrical Hohlraum at the SGIII Laser Facility

The first integrated implosion experiment of three-axis cylindrical hohlraum (TACH) was accomplished at the SGIII laser facility. 24 laser beams of the SGIII laser facility were carefully chosen and quasi-symmetrically injected into the TACH, in which a highly symmetric radiation filed was generated with a peak radiation temperature of ~190eV. Driven by the radiation field, the neutron yield of a deuterium gas filled capsule reached ~1e9, and the corresponding yield over clean (YOC) was ~40% for a convergence ratio (Cr) of ~17. The X-ray self-emission image of imploded capsule cores was nearly round, and the backscatter fraction of laser beams was less than 1.25%. This experiment preliminarily demonstrated the major performance of TACH, such as the robustness of symmetry, and a laser plasma instability (LPI) behavior similar to that of the outer ring of traditional cylindrical hohlraum.

physics.plasm-ph↗

arXiv2017

Conflict-free connection numbers of line graphs

A path in an edge-colored graph is called \emph{conflict-free} if it contains at least one color used on exactly one of its edges. An edge-colored graph $G$ is \emph{conflict-free connected} if for any two distinct vertices of $G$, there is a conflict-free path connecting them. For a connected graph $G$, the \emph{conflict-free connection number} of $G$, denoted by $cfc(G)$, is defined as the minimum number of colors that are required to make $G$ conflict-free connected. In this paper, we investigate the conflict-free connection numbers of connected claw-free graphs, especially line graphs. We first show that for an arbitrary connected graph $G$, there exists a positive integer $k$ such that $cfc(L^k(G))\leq 2$. Secondly, we get the exact value of the conflict-free connection number of a connected claw-free graph, especially a connected line graph. Thirdly, we prove that for an arbitrary connected graph $G$ and an arbitrary positive integer $k$, we always have $cfc(L^{k+1}(G))\leq cfc(L^k(G))$, with only the exception that $G$ is isomorphic to a star of order at least~$5$ and $k=1$. Finally, we obtain the exact values of $cfc(L^k(G))$, and use them as an efficient tool to get the smallest nonnegative integer $k_0$ such that $cfc(L^{k_0}(G))=2$.

math.CO↗

arXiv2015

Mechanistic Model to Replace Hodgkin-Huxley Equations

In this paper we construct a mathematical model for excitable membranes by introducing circuit characteristics for ion pump, ion current activation, and voltage-gating. The model is capable of reestablishing the Nernst resting potentials, all-or-nothing action potentials, absolute refraction, anode break excitation, and spike bursts. We propose to replace the Hodgkin-Huxley model by our model as the basis template for neurons and excitable membranes.

q-bio.NC↗

arXiv2007

Mismatch Repair Error Implies Chargaff's Second Parity Rule

Chargaff's second parity rule holds empirically for most types of DNA that along single strands of DNA the base contents are equal for complimentary bases, A = T, G = C. A Markov chain model is constructed to track the evolution of any single base position along single strands of genomes whose organisms are equipped with replication mismatch repair. Under the key assumptions that mismatch error rates primarily depend the number of hydrogen bonds of nucleotides and that the mismatch repairing process itself makes strand recognition error, the model shows that the steady state probabilities for any base position to take on one of the 4 nucleotide bases are equal for complimentary bases. As a result, Chargaff's second parity rule is the manifestation of the Law of Large Number acting on the steady state probabilities. More importantly, because the model pinpoints mismatch repair as a basis of the rule, it is suitable for experimental verification.

q-bio.GN↗

arXiv2007

The Time Invariance Principle, Ecological (Non)Chaos, and A Fundamental Pitfall of Discrete Modeling

This paper is to show that most discrete models used for population dynamics in ecology are inherently pathological that their predications cannot be independently verified by experiments because they violate a fundamental principle of physics. The result is used to tackle an on-going controversy regarding ecological chaos. Another implication of the result is that all continuous dynamical systems must be modeled by differential equations. As a result it suggests that researches based on discrete modeling must be closely scrutinized and the teaching of calculus and differential equations must be emphasized for students of biology.

q-bio.PE↗

arXiv2007

The Origin of 2 Sexes Through Optimization of Recombination Entropy Against Time and Energy

Sexual reproduction in Nature requires two sexes, which raises the question why the reproductive scheme did not evolve to have three or more sexes. Here we construct a constrained optimization model based on the communication theory to analyze trade-offs among reproductive schemes with arbitrary number of sexes. More sexes on one hand lead to higher reproductive diversity, but on the other hand incur greater cost in time and energy for reproductive success. Our model shows that the two-sexes reproduction scheme maximizes the recombination entropy-to-cost ratio, and hence is the optimal solution to the problem.

q-bio.PE↗