A purification procedure of pertussis toxin (PT) from submerged culture of Bordetella pertussis (B.pertussis) strain 134 using adsorption and affinity chromatography was discussed. The yield of the resulting PT was approximately 37.5mg/l of concentrated culture supernatant. The polypeptide pattern of the purified PT was investigated by SDS-PAGE and showed five bands between 11 to 26 KDa using l...

We consider the oscillatory property of the following p(t)-Laplacian equations −(|u′|p(t)−2u′)′ = 1/tθ(t)g(t,u), t > 0. Since there is no Picone-type identity for p(t)Laplacian equations, it is an unsolved problem that whether the Sturmian comparison theorems for p(x)-Laplacian equations are valid or not. We obtain sufficient conditions of the oscillatory of solutions for p(t)-Laplacian equations.

The trees, respectively unicyclic graphs, on n vertices with the smallest Laplacian permanent are studied. In this paper, by edge-grafting transformations, the n-vertex trees of given bipartition having the second and third smallest Laplacian permanent are identified. Similarly, the n-vertex bipartite unicyclic graphs of given bipartition having the first, second and third smallest Laplacian pe...

Abstract. Inspired by the graph Laplacian and the point integral method, we introduce a novel weighted graph Laplacian method to compute a smooth interpolation function on a point cloud in high dimensional space. The numerical results in semi-supervised learning and image inpainting show that the weighted graph Laplacian is a reliable and efficient interpolation method. In addition, it is easy ...

The trees, respectively unicyclic graphs, on n vertices with the smallest Laplacian permanent are studied. In this paper, by edge-grafting transformations, the n-vertex trees of given bipartition having the second and third smallest Laplacian permanent are identified. Similarly, the n-vertex bipartite unicyclic graphs of given bipartition having the first, second and third smallest Laplacian pe...

Let G be a graph of order n such that ∑n i=0(−1)iaiλn−i and ∑n i=0(−1)ibiλn−i are the characteristic polynomials of the signless Laplacian and the Laplacian matrices of G, respectively. We show that ai ≥ bi for i = 0,1, . . . , n. As a consequence, we prove that for any α, 0 < α ≤ 1, if q1, . . . , qn and μ1, . . . ,μn are the signless Laplacian and the Laplacian eigenvalues of G, respectively,...

Laplacian eigenmap algorithm is a typical nonlinear model for dimensionality reduction in classical machine learning. We propose an efficient quantum Laplacian eigenmap algorithm to exponentially speed up the original counterparts. In our work, we demonstrate that the Hermitian chain product proposed in quantum linear discriminant analysis (arXiv:1510.00113,2015) can be applied to implement qua...

In this paper, we study the multiplicity of positive solutions for the Laplacian systems with sign-changing weight functions. Using the decomposition of the Nehari manifold, we prove that an elliptic system has at least two positive solutions.

Core-shell nanostructures are emerging as more important materials than alloy nanostructures and have much more interesting potential applications in various fields. In this work, we demonstrated the fast and facile synthesis of core-shell nanoparticles consisting of Pt thin layer as the shell and Ni nanoparticles as the cores. The described method herein is suitable for large-scale and low-cos...