The preparation of thick-film glass capillary columns

A detailed method for the routine preparation of glass capillary columns is presented. The method consists of coating a glass tube with quartz powder prior to pulling the tube into a capillary. The inner surface of the capillary consists of an even distribution of quartz particles fused to the walls. This surface has been found readily deactivated by standard procedures and ideal for the preparation of thick-film glass capillary columns. The method has been thoroughly tested in two independent laboratories to ensure that the procedures described are reproducible.     

Range-Renewal Processes: SLLNs and Power Laws*

Given n samples(viewed as an n-tuple) of a γ-regular discrete distribution π,in this article the authors concern with the weighted and unweighted graphs induced by the n samples. They first prove a series of SLLN results(of Dvoretzky-Erd¨os’ type). Then they show that the vertex weights of the graphs under investigation obey asymptotically power law distributions with exponent 1 + γ. They also give a conjecture that the degrees of unweighted graphs would exhibit asymptotically power law distribu...     

A Note on the Indirect Controls for a Coupled System of Wave Equations

By a procedure of successive projections, the authors decompose a coupled system of wave equations into a sequence of sub-systems. Then, they can clarify the indirect controls and the total number of controls. Moreover, the authors give a uniqueness theorem of solution to the system of wave equations under Kalman’s rank condition.     

Multiplicity of Solutions of the Weighted p-Laplacian with Isolated Singularity and Diffusion Suppressed by Convection

In this paper, the authors study the multiplicity of solutions to the weighted p-Laplacian with isolated singularity and di?usion suppressed by convection ?div(|x|^α|?u|^p?2?u) + λ 1/|x|^β |?u|^p?2?u · x = |x|^γg(|x|) in B \ {0} subject to nonlinear Robin boundary value condition |x|^α|?u|^p?2?u · ?n = A ? ρu on ?B,where λ > 0, B ? R^N(N ≥ 2) is the unit ball centered at the origin, α > 0, p > 1, β ∈ R, γ > ?N, g ∈ C([0,1]) with g(0) > 0, A ∈ R, ρ > 0 and ?n is the unit outward normal. The same problem with di?usion promoted by convection, namely λ ≤ 0, has already been discussed by the last two authors (Song-Yin (2012)), where the existence, nonexistence and classi?cation of singularities for solutions are presented. Completely di?erent from [Song, H. J. and Yin, J. X., Removable isolated singularities of solutions to the weighted p-Laplacian with singular convection, Math. Meth. Appl. Sci., 35, 2012, 1089–1100], in the present case λ > 0, namely the di?usion is suppressed by the convection, non-singular solutions are not only existent but also may be in?nite which vary according only to the values of solutions at the isolated singular point. At the same time, the singular solutions may exist only if the di?usion dominates the convection.     

基于物联网的医用耗材智能屋管理系统

针对医用高值耗材种类繁多、管理难度大的问题,为减少人力成本、提高医用高值耗材的智能化管理水平。本文提出了基于物联网的高值医用耗材智能屋的管理系统,介绍了智能屋的整体架构、系统功能、核心业务及流程设计,主要分为结构模块、RFID模块、数据库模块、控制系统模块四大模块,具体有用户管理、出入库管理、综合查询、预警管理四大业务,通过GM(1,1)模型对2022年全年高值医用耗材的月消耗量进行预测分析,并且检验得该预测模型的精度等级为一级,模型预测效果很好,能够为医院采购人员采购提供了一个参考,避免因过度的主观估计而造成的耗材浪费。该系统能够有效地提高医院对于高值医用耗材的管理水平,减少人力、物力和财力的消耗,为广大患者提供更加优质的医疗服务。本文所提的高值医用耗材智能屋管理系统解决了传统的高值医用耗材管理的诸多难题。     

Estimation of a quantile in some nonstandard cases

A necessary condition for the asymptotic normality of the sample quantile estimator isf(Q(p))=F(Q(p))>0, whereQ(p) is thep-th quantile of the distribution functionF(x). In this paper, we estimate a quantile by a kernel quantile estimator when this condition is violated. We have shown that the kernel quantile estimator is asymptotically normal in some nonstandard cases. The optimal convergence rate of the mean squared error for the kernel estimator is obtained with respect to the asymptotically optimal bandwidth. A law of the iterated logarithm is also established.This research was partially supported by the new faculty award from the University of Oregon.     

On bandwidth sums of graphs

ＯＮＢＡＮＤＷＩＤＴＨＳＵＭＳＯＦＧＲＡＰＨＳＹＡＯＢＩＮＧ（姚兵）;ＷＡＮＧＪＩＡＮＦＡＮＧ（王建方）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ,ＮｏｒｉｈｗｅｓｔｅｔｅｒｎＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ,Ｌａｎｚｈｏｕ７３００７０,Ｃｈｉ...     

Randomized algorithms for the separation of point sets and for solving quadratic programs

A randomized algorithm for finding a hyperplane separating two finite point sets in the Euclidean space ^d and a randomized algorithm for solving linearly constrained general convex quadratic problems are proposed. The expected running time of the separating algorithm isO(dd! (m + n)), wherem andn are cardinalities of sets to be separated. The expected running time of the algorithm for solving quadratic problems isO(dd! s) wheres is the number of inequality constraints. These algorithms are based on the ideas of Seidel's linear programming algorithm [6]. They are closely related to algorithms of [8], [2], and [9] and belong to an abstract class of algorithms investigated in [1]. The algorithm for solving quadratic problems has some features of the one proposed in [7].This research was done when the author was supported by the Alexander von Humboldt Foundation, Germany.On leave from the Institute of Mathematics and Mechanics, Ural Department of the Russian Academy of Sciences, 620219 Ekaterinburg, S. Kovalevskaya str. 16, Russia.     

Two new bounds on the size of binary codes with a minimum distance of three

We prove two new upper bounds on the size of binary codes with a minimum distance of three, namelyA(10, 3)76 andA(11, 3)152.     

Multistep methods for differential algebraic equations

Multistep methods for the differential/algebraic equations (DAEs) in the form of