By using a culture system that allows the segregation of individual precursors of cytotoxic lymphocytes, the number of clones generated by cells from different combinations of congenic mice have been measured. It has been found that 0.3% of the total anti-H2d clones are generated by stimulators which differ predominantly at the H-2 locus. The contribution of non-H-2 antigens to anti-H-2 respons...

The electrocatalytic N2 reduction reaction (eNRR) is a potential alternative to the Haber–Bosch process for ammonia (NH3) production. Tremendous efforts have been made in eNRR catalyst research promote practical application of eNRR. In this work, by means density functional theory calculations and computational hydrogen electrode model, we evaluated performance 30 single metal atoms supported o...

Thermal and mechanical properties of two-dimensional nanomaterials are commonly studied by calculating force constants using the density functional theory (DFT) classical molecular dynamics (MD) simulations. Although DFT simulations offer accurate estimations, computational cost is high. On other hand, MD strongly depend on accuracy interatomic potentials. Here, we investigate thermal conductiv...

Erdős proved that there exist graphs of arbitrarily high girth and arbitrarily high chromatic number. We give a different proof (but also using the probabilistic method) that also yields the following result on the typical asymptotic structure of graphs of high girth: for all ` ≥ 3 and k ∈ N there exist constants C1 and C2 so that almost all graphs on n vertices and m edges whose girth is great...

Nanostructured superlattices have been the focus of many researchers due to their physical and manipulatable properties. They aim find promising materials for new electronic thermoelectric devices. In present study, we investigate thermal conductivity two-dimensional (2D) C3N/ C2N using non-equilibrium molecular dynamics. We analyze dependence on total length, temperature, temperature differenc...

Given a set of nonnegative integers T , and a function S which assigns a set of integers S(v) to each vertex v of a graph G, an S-list T -coloring c of G is a vertexcoloring (with positive integers) of G such that c(v) ∈ S(v) whenever v ∈ V (G) and |c(u)− c(w)| 6∈ T whenever (u,w) ∈ E(G). For a fixed T , the T -choice number T -ch(G) of a graph G is the smallest number k such that G has an S-li...