Mixing weighted values of non-atomic games

Weighted values of non-atomic games were introduced by Hart and Monderer (1997). They study these values by using two approaches: the potential approach and the asymptotic approach. In this study we develop the random order approach (the mixing value, Aumann and Shapley, 1974) to weighted values and prove that these values coincide with the asymptotic weighted values of Hart and Monderer in pNA. Received April 1995/Revised version May 1996/ Final version October 1997     

Poisson convergence in the restricted k‐partitioning problem

The randomized k‐number partitioning problem is the task to distribute N i.i.d. random variables into k groups in such a way that the sums of the variables in each group are as similar as possible. The restricted k‐partitioning problem refers to the case where the number of elements in each group is fixed to N/k. In the case k = 2 it has been shown that the properly rescaled differences of the two sums in the close to optimal partitions converge to a Poisson point process, as if they were independent random variables. We generalize this result to the case k > 2 in the restricted problem and show that the vector of differences between the k sums converges to a k ‐ 1‐dimensional Poisson point process. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

Graphs G for which both G and G¯ are Contraction Critically k-Connected

 An edge of a k-connected graph is said to be k-contractible if the contraction of the edge results in a k-connected graph. A k-connected graph with no k-contractible edge is called contraction critically k-connected. For k≥4, we prove that if both G and its complement Gˉ are contraction critically k-connected, then |V(G)|<k ^5/3+4k ^3/2. Received: October, 2001 Final version received: September 18, 2002 AMS Classification: 05C40     

Boundary convergence of vector-valued pseudocontinuable functions

In the first part of the paper we discuss a multi-dimensional analogue of the well-known construction by D. Clark that allows one to study families of spectral measures of perturbations of the model contraction. In the second part we present extensions of the relevant results on the boundary behavior of pseudocontinuable functions. We show that, although the most direct analogue of the scalar theorem on the existence of boundary values for pseudocontinuable functions with respect to Clark measures fails in the non-scalar situation, suitable vector-valued versions of such results can be found.     

Reynold''s Transport Theorem for Differential Inclusions

The well-known Reynold's Transport Theorem deals with the integral over a time-dependent set (that is evolving along a smooth vector field) and specifies its semiderivative with respect to time. Here reachable sets of differential inclusions are considered instead. Dispensing with any assumptions about the regularity of the compact initial set, we give sufficient conditions on the differential inclusion for the absolute continuity (of the integral) with respect to time and its weak derivative is formulated as a Hausdorff integral over the topological boundary.     

一类生物流体力学模型的稳定性

在研究颅内压集中参数模型的基础上，改进自适应的龙格-库塔法对一类生物流体力学模型进行数值模拟。通过合理控制计算量，得到了微分方程近似解的局部截断误差的估计。使用矩阵特征值分析微分方程的稳定性，在实际生理范围内变化模型参数，得到特征值随参数变化的关系，指出模型中存在实部为正的特征值。文章还讨论了控制矩阵特征值的变化对数值方法稳定步长的影响，并得到步长的取值范围。通过理论分析。得到控制方程的解随时间的发展和模型中生理参数的选取相关。分析了特征值变化的稳定性和参数的关系，并对模型进行改进，讨论其稳定性的情况。     

Missing value imputation strategies for metabolomics data

The origin of missing values can be caused by different reasons and depending on these origins missing values should be considered differently and dealt with in different ways. In this research, four methods of imputation have been compared with respect to revealing their effects on the normality and variance of data, on statistical significance and on the approximation of a suitable threshold to accept missing data as truly missing. Additionally, the effects of different strategies for controlling familywise error rate or false discovery and how they work with the different strategies for missing value imputation have been evaluated. Missing values were found to affect normality and variance of data and k‐means nearest neighbour imputation was the best method tested for restoring this. Bonferroni correction was the best method for maximizing true positives and minimizing false positives and it was observed that as low as 40% missing data could be truly missing. The range between 40 and 70% missing values was defined as a “gray area” and therefore a strategy has been proposed that provides a balance between the optimal imputation strategy that was k‐means nearest neighbor and the best approximation of positioning real zeros.     

Enzyme-regulated the changes of pH values for assembling a colorimetric and multistage interconnection logic network with multiple readouts

Based on enzymatic reactions-triggered changes of pH values and biocomputing, a novel and multistage interconnection biological network with multiple easy-detectable signal outputs has been developed. Compared with traditional chemical computing, the enzyme-based biological system could overcome the interference between reactions or the incompatibility of individual computing gates and offer a unique opportunity to assemble multicomponent/multifunctional logic circuitries. Our system included four enzyme inputs: β-galactosidase (β-gal), glucose oxidase (GOx), esterase (Est) and urease (Ur). With the assistance of two signal transducers (gold nanoparticles and acid–base indicators) or pH meter, the outputs of the biological network could be conveniently read by the naked eyes. In contrast to current methods, the approach present here could realize cost-effective, label-free and colorimetric logic operations without complicated instrument. By designing a series of Boolean logic operations, we could logically make judgment of the compositions of the samples on the basis of visual output signals. Our work offered a promising paradigm for future biological computing technology and might be highly useful in future intelligent diagnostics, prodrug activation, smart drug delivery, process control, and electronic applications.     

Entire functions sharing one small function CM with their shifts and difference operators

In this article, we mainly devote to proving uniqueness results for entire functions sharing one small function CM with their shift and difference operator simultaneously. Let f(z) be a nonconstant entire function of finite order, c be a nonzero finite complex constant,and n be a positive integer. If f(z), f(z + c), and ?_c~n f(z) share 0 CM, then f(z + c) ≡ Af(z),where A(= 0) is a complex constant. Moreover, let a(z), b(z)( ≡ 0) ∈ S(f) be periodic entire functions with period c and if f(z)-a(z), f(z + c)-a(z), ?_c~n f(z)-b(z) share 0 CM, then f(z + c) ≡ f(z).