Xiaochun Cai

Learn More
In 1.1 , the given real sequences {pn}, {qn} satisfy pn T pn > 0, qn T qn for any n ∈ Z, f : Z×R → R is continuous in the second variable, and f n T, z f n, z for a given positive integer T and for all n, z ∈ Z×R. −1 δ −1, δ > 0, and δ is the ratio of odd positive integers. By a solution of 1.1 , we mean a real sequence x {xn}, n ∈ Z, satisfying 1.1 . In 1,(More)
The detour index of a connected graph is defined as the sum of the detour distances (lengths of longest paths) between unordered pairs of vertices of the graph. We give bounds for the detour index, determine the graphs with minimum and maximum detour indices respectively in the class of n-vertex unicyclic graphs with cycle length r, where 3 ≤ r ≤ n−2, and(More)
Personal information mining can find out the hidden relationship and characteristics of the target people which can be used for active post operation. The original features which are included in the personal information raw data usually have high dimension and redundancy which often drags down data mining efficiency. A feature optimization method is(More)
In this study, we aimed to develop a safe and stable form of human growth hormone (hGH) and to refine PEGylation methods for therapeutic proteins via genetic code expansion. Through this precise approach, a series of polyethylene glycol (PEG) moieties and sites were combined in various ways. Additionally, the effects of combinatorial PEGylation on the(More)
An ionic copolymer catalyst with nanopores, large surface area, high ionic density, and superior basicity was prepared via the radical copolymerization of amino-functionalized ionic liquid bromide and divinylbenzene, followed with a hydroxyl exchange for removing bromonium. Evaluated in chemical fixation of CO2 with epoxides into cyclic carbonates in the(More)
The edge Szeged index of a connected graph G is defined as the sum of products mu(e|G)mv(e|G) over all edges e = uv of G, where mu(e|G) is the number of edges whose distance to vertex u is smaller than the distance to vertex v, and mv(e|G) is the number of edges whose distance to vertex v is smaller than the distance to vertex u. In this paper, we determine(More)
  • 1