Several parameters of generalized Mycielskians

The generalized Mycielskians (also known as cones over graphs) are the natural generalization of the Mycielski graphs (which were first introduced by Mycielski in 1955). Given a graph G and any integer m?0, one can transform G into a new graph μ_m(G), the generalized Mycielskian of G. This paper investigates circular clique number, total domination number, open packing number, fractional open packing number, vertex cover number, determinant, spectrum, and biclique partition number of μ_m(G).     

小球与均质自由杆的碰撞

讨论了小球与自由杆碰撞过程中所遵从的物理规律,明确了完全非弹性碰撞过程的能量特征,指出完全非弹性碰撞后两物体不一定粘在一起共同运动的事实.     

Synthesis of new 7-aminosterol squalamine analogues with high antimicrobial activities through a stereoselective titanium reductive amination reaction

A series of 7-amino- and polyaminosterol analogues of squalamine and trodusquemine were synthesized involving a new stereoselective titanium reductive amination reaction in high chemical yields of up to 95% in numerous cases. These derivatives were evaluated for their in vitro antimicrobial properties against human pathogens. All the compounds present excellent activities against Gram-positive bacteria exhibiting similar results against Staphylococcus aureus and Streptococcus faecalis with minimum inhibitory concentrations (MICs) varying from 2.5 to 10 μg/mL. Numerous derivatives possess also MICs against Gram-negative Escherichia coli bacteria (MICs varying from 2.5 to 10 μg/mL) suggesting that nature of the amino group attached to the sterol moiety plays an important role on the activities of such products.     

图的k-单圈划分中的优化问题

图的划分问题曾引起图论界的广泛关注，在文献[4]中讨论了k-单圈划分，本文进一步研究基于k-单圈划分的优化问题，即在一个赋权图中求一个最小权可k-单圈划分的支撑子图，以及对一个不存在k-单圈划分支撑子图的图，如何添最少的边使得它有k-单圈划分的支撑子图。     

A bound on the total size of a cut cover

A cycle cover (cut cover) of a graph G is a collection of cycles (cuts) of G that covers every edge of G at least once. The total size of a cycle cover (cut cover) is the sum of the number of edges of the cycles (cuts) in the cover.We discuss several results for cycle covers and the corresponding results for cut covers. Our main result is that every connected graph on n vertices and e edges has a cut cover of total size at most 2e-n+1 with equality precisely when every block of the graph is an odd cycle or a complete graph (other than K₄ or K₈). This corresponds to the result of Fan [J. Combin. Theory Ser. B 74 (1998) 353-367] that every graph without cut-edges has a cycle cover of total size at most e+n-1.     

<Emphasis Type="Italic">L</Emphasis><Subscript>1</Subscript> linear interpolator for missing values in time series

We propose a minimum mean absolute error linear interpolator (MMAELI), based on theL ₁ approach. A linear functional of the observed time series due to non-normal innovations is derived. The solution equation for the coefficients of this linear functional is established in terms of the innovation series. It is found that information implied in the innovation series is useful for the interpolation of missing values. The MMAELIs of the AR(1) model with innovations following mixed normal andt distributions are studied in detail. The MMAELI also approximates the minimum mean squared error linear interpolator (MMSELI) well in mean squared error but outperforms the MMSELI in mean absolute error. An application to a real series is presented. Extensions to the general ARMA model and other time series models are discussed. This research was supported by a CityU Research Grant and Natural Science Foundation of China.     

高灵敏可见／紫外条纹相机的最小可探测能量密度

分析了影响条纹相机最小可探测能量密度的主要因素，通过采用两级增强器级联的方法降低了条纹最小可探测能量密度。利用超短激光脉冲经过标准具后形成一个能量等比衰减的脉冲序列，对ＺＰＴ－３Ｋ紫外／可见皮秒条纹相机的最小可探测能量密度进行了测量。测量表明：相机最小可探测能量密度在可见波段（５３２ｎｍ）达１×１０－１３Ｊ／ｃｍ２。     

L1-optimal estimates for a regression type function in R

Let X₁, X₂, …, X_n be random vectors that take values in a compact set in R^d, d ≥ 1. Let Y₁, Y₂, …, Y_n be random variables (“the responses”) which conditionally on X₁ = x₁, …, X_n = x_n are independent with densities f(y | x_i, θ(x_i)), i = 1, …, n. Assuming that θ lives in a sup-norm compact space Θ_q,d of real valued functions, an optimal L₁-consistent estimator of θ is constructed via empirical measures. The rate of convergence of the estimator to the true parameter θ depends on Kolmogorov's entropy of Θ_q,d.     

第Ⅰ种强度不对称三态叠加多模叠加态光场N次方Y压缩—第一正交相位分量的压缩情况

根据量子力学中的线性叠加原理,构造了由三个强度不等的多模相干态光场|{Z_j^(A)}>_q、|{Z_j^(B)}>_q和|{Z_j^(C)}>_q的线性叠加所组成的第Ⅰ种强度不对称三态叠加多模叠加态光场|ψ_l^(ABC)>_q.利用多模压缩态理论,研究了态|ψ_l^(ABC)>_q的第一正交方分量(即磁场分量)的广义非线性等幂次N次方Y压缩特性.结果发现:①在上述各多模相干态光场中各模的强度和各模的初始相位各不相等的情况下,态|ψ_l^(ABC)>_q的第一正交分量-磁场分量在一定的条件下,总可呈现出周期性变化的、任意等幂次的N次方Y压缩效应;②当上述各多模相干态光场的强度和各模的初始相位相等时,态|ψ_l^(ABC)>_q的磁场分量的N次方Y压缩现象消失,态|ψ_l^(ABC)>_q可恒处于等幂次N-Y最小测不准态.     

The complexity of minimum difference cover

The complexity of searching minimum difference covers, both in Z⁺ and in Z_n, is studied. We prove that these two optimization problems are NP-hard. To obtain this result, we characterize those sets—called extrema—having themselves plus zero as minimum difference cover. Such a combinatorial characterization enables us to show that testing whether sets are not extrema, both in Z⁺ and in Z_n, is NP-complete. However, for these two decision problems we exhibit pseudo-polynomial time algorithms.