MEAN CONVERGENCE OF HERMITE-FEJ(E)R TYPE INTERPOLATION ON AN ARBITRARY SYSTEM OF NODES

In this paper sufficient conditions for mean convergence and rate of convergence of Hermite-Fejer type interpolation in the Lp norm on an arbitrary system of nodes are presented.     

基于金刚石氮-空位色心自旋系综与超导量子电路混合系统的量子节点纠缠

量子纠缠是实现量子计算和量子通信的核心基础,本文提出了在金刚石氮-空位色心(NV centers)自旋系综与超导量子电路耦合的混合系统中实现两个分离量子节点之间纠缠的理论方案.在该混合系统中,把金刚石NV centers自旋系综和与之耦合的超导共面谐振器视为一个量子节点,两个量子节点之间通过一个空的超导共面谐振器连接.具有较长相干时间的NV centers自旋系综作为一个量子存储器,用于制备、存储和发送量子信息;易于外部操控的超导量子电路可执行量子逻辑门操作,快速调控量子信息.为了实现两个分离量子节点之间的纠缠,首先对系统的哈密顿量进行正则变换,将其等价为两个NV centers自旋系综与同一个超导共面谐振器之间的JC耦合;然后采用NV centers自旋-光子混合比特编码的方式,通过调节超导共面谐振器的谐振频率,精确控制体系演化时间,高保真度地实现了两个分离量子节点之间的量子纠缠.本方案还可以进一步扩展和集成,用于构建多节点纠缠的分布式量子网络.     

Ranking the spreading influence of nodes in complex networks: An extended weighted degree centrality based on a remaining minimum degree decomposition

Ranking the spreading influence of nodes is crucial for developing strategies to control the spreading process on complex networks. In this letter, we define, for the first time, a remaining minimum degree (RMD) decomposition by removing the node(s) with the minimum degree iteratively. Based on the RMD decomposition, a weighted degree (WD) is presented by utilizing the RMD indices of the nearest neighbors of a node. WD assigns a weight to each degree of this node, which can distinguish the contribution of each degree to the spreading influence. Further, an extended weighted degree (EWD) centrality is proposed by extending the WD of the nearest neighbors of a node. Assuming that the spreading process on networks follows the Susceptible-Infectious-Recovered (SIR) model, we perform extensive experiments on a series of synthetic and real networks to comprehensively evaluate the performance of EWD and other eleven representative measures. The experimental results show that EWD is a relatively efficient measure in running efficiency, it exposes an advantage in accuracy in the networks with a relatively small degree heterogeneity, as well as exposes a competitive performance in resolution.     

Lymph Nodes Draining Infections Investigated by PET and Immunohistochemistry in a Juvenile Porcine Model

Background: [¹⁸F]FDG and [¹¹C]methionine accumulate in lymph nodes draining S. aureus -infected foci. The lymph nodes were characterized by weight, [¹¹C]methionine- and [¹⁸F]FDG-positron emissions tomography (PET)/computed tomography (CT), and immunohistochemical (IHC)-staining. Methods: 20 pigs inoculated with S. aureus into the right femoral artery were PET/CT-scanned with [¹⁸F]FDG, and nine of the pigs were additionally scanned with [¹¹C]methionine. Mammary, medial iliac, and popliteal lymph nodes from the left and right hind limbs were weighed. IHC-staining for calculations of area fractions of Ki-67, L1, and IL-8 positive cells was done in mammary and popliteal lymph nodes from the nine pigs. Results: The pigs developed one to six osteomyelitis foci. Some pigs developed contiguous infections of peri-osseous tissue and inoculation-site abscesses. Weights of mammary and medial iliac lymph nodes and their [¹⁸F]FDG maximum Standardized Uptake Values (SUV_FDGmax) showed a significant increase in the inoculated limb compared to the left limb. Popliteal lymph node weight and their FDG uptake did not differ significantly between hind limbs. Area fractions of Ki-67 and IL-8 in the right mammary lymph nodes and SUV_Metmax in the right popliteal lymph nodes were significantly increased compared with the left side. Conclusion: The PET-tracers [¹⁸F]FDG and [¹¹C]methionine, and the IHC- markers Ki-67 and IL-8, but not L1, showed increased values in lymph nodes draining soft tissues infected with S. aureus. The increase in [¹¹C]methionine may indicate a more acute lymph node response, whereas an increase in [¹⁸F]FDG may indicate a more chronic response.     

Hermite插值多项式的导数逼近函数的导数

给出基于混合型Jacobi气点的Hermite插值多项式的导数和函数的县数之间的偏差的点态估计．     

Cayley-Bacharach定理在沿平面代数曲线插值问题中的应用

1 引 言 本文是讨论关于沿平面代数曲线的Lagrange插值问题,该问题与在二维实平面R~2上的二元Lagrange插值有关.设n为非负整数并且e_n=1/2(n+1)(n_2).P_n代表所有全     

An algebraic approach to approximate evaluation of a polynomial on a set of real points

The previous best algorithm for approximate evaluation of a polynomial on a real set was due to Rokhlin and required of the order ofmu+nu ³ infinite precision arithmetic operations to approximate [on a fixed bounded setX(m) ofm+1 real points] a degreen polynomial within the error bound . We develop an approximation algorithm which exploits algebraic computational techniques and decreases Rokhlin's record estimate toO(mlog² u+nmin-u, logn}). For logu=o(logn), this result may also be favorably compared with the record boundO(m+n)log² n) on the complexity of the exact multipoint polynomial evaluation. The new algorithm can be performed in the fields (or rings) generated by the input values, which enables us to decrease the precision of the computations [by using modular (residue) arithmetic] and to simplify our computations further in the case whereu=O(logn). Our algorithm allows NC and simultaneously processor efficient parallel implementation. Because of the fundamental nature of the multipoint polynomial evaluation, our results have further applications to numerical and algebraic computational problems. In passing, we also show a substantial improvement in the Chinese remainder algorithm for integers based on incorporating Kaminski's fast residue computation.     

“Spatial nodes” in discrete location problems

Discrete location models often assume an underlying network where demands originate at point nodes. To apply these models to planar regions with continuously distributed demand, the region is usually partitioned into zones and the demand from each zone is assumed to originate at a point, usually the zone centroid. Thus, the point node in the underlying network represents a spatial zone with a finite area. This paper examines the effect of approximating these spatial nodes by point nodes. In some problem scenarios, the approximation does not affect the solution. However, especially when the locational criterion includes the consideration of intra-zonal travel cost variances (e.g. travel time variance) and demands may originate anywhere within zones of nonzero area, point nodes do not give an accurate evaluation of the performance of a locational design. To illustrate the application of the concept of spatial nodes, a model is formulated for locatingp (fire-fighting) units in a region having continuously distributed demand with the objective of minimizing a nonlinear function of arrival times of the first and second closest units to any (fire) incident. A heuristic site-substitution procedure is presented that solves the formulated model.     

基于全局可达点的中国教育网平均最短路径近似算法

平均最短路径长度是复杂网络的一个重要特性,但由于计算时间的限制,求解大规模网络的平均最短路径长度很困难.以中国教育网数据为例,分析了中国教育网的拓扑结构,提出了全局可达点和局部可达点的概念,发现整个网络的平均最短路径长度由全局可达点决定.通过分析全局可达点的平均单源最短路径长度分布,发现整个网络的平均最短路径长度可由少数随机选取的点的平均最短路径长度来近似.通过三个网络验证了近似计算方法的有效性,并通过随机选取的数百个点,计算得到了含49041472个点的中国教育网的平均最短路径长度在14-15之间.     

(0, 2) Pál-type interpolation on a circle in the complex plane involving Möbius transforms

We study the regularity of certain (0,?2) Pál-type interpolation problems involving the Möbius transforms of the zeros of z ²ⁿ ?ρ ²ⁿ to the circle ∣z∣?=?ρ′.