超高效液相色谱-串联质谱法测定牛奶中头孢喹肟残留量

建立了牛奶中硫酸头孢喹肟的超高效液相色谱-串联质谱(UPLC-MS/MS)检测方法。用80％乙腈提取试样中的药物,加水稀释后采用HLB固相萃取柱净化,UPLC-MS/MS法测定,仪器检测程序总色谱时间仅为1 min。结果表明,方法平均回收率为80.3％～85.7％;批内变异系数在2.8％～6.3％之间;批间变异系数在3...     

CP violation in B→φKs decay in R-parity violating supersymmetry

In the framework of R-parity violating supersymmetry, we investigate the time dependent CP asymmetry SφKs anomaly of B→φKs decay. When the values of the weak phase φ in the R-parity violating coupling fall into certain parameter spaces （246°〈 φ 〈 263°） we find that this anomaly can be easily explained; at the same time, the branching ratio of B→φKs decay can also be in agreement with experimental measurements.     

不饱和聚酯/有机蒙脱土复合材料的固化动力学

用动态扭振法研究不饱和聚酯／有机蒙脱土复合材料的固化动力学行为。结果表明该实验体系能够很好地应用Flory理论和Avami方程进行拟合。用非平衡态热力学涨落理论对纳米复合材料的固化作了理论顸估,顸估结果与实验固化曲线有很好的相符性。有机蒙脱土的加入降低了不饱和聚酯的固化反应速率,对固化反应表现活化能和复合材料的形成过程没有很大的影响。根据实验结果分析不饱和聚酯在有机蒙脱土存在下的固化分为定型和熟化两个阶段,在一定的固化温度和填充含量下。从动态扭振曲线上可以明显地观察到这种“二次固化”现象。     

Graphs with Cayley canonical double covers

A canonical double cover $B\left(X\right)$ of a graph $X$ is the direct product of $X$ and the complete graph $K_2$ on two vertices. In order to answer the question when a canonical double cover of a given graph is a Cayley graph, in 1992 Maru?i? et al. introduced the concept of generalized Cayley graphs. In this paper this concept is generalized to a wider class of graphs, the so-called extended generalized Cayley graphs. It is proved that the canonical double cover of a connected non-bipartite graph $X$ is a Cayley graph if and only if $X$ is an extended generalized Cayley graph. This corrects an incorrectly stated claim in [Discrete Math. 102 (1992), 279–285].     

Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory

Rice's Theorem says that every nontrivia semantic property of programs is undecidable. In this spirit we show the following: Every nontrivia absolute (gap, relative) counting property of circuits is UP‐hard with respect to polynomial‐time Turing reductions. For generators [31] we show a perfect analogue of Rice's Theorem.     

Detecting strong cliques

A strong clique in a graph is a clique intersecting every maximal independent set. We study the computational complexity of six algorithmic decision problems related to strong cliques in graphs and almost completely determine their complexity in the classes of chordal graphs, weakly chordal graphs, line graphs and their complements, and graphs of maximum degree at most three. Our results rely on connections with matchings and relate to several graph properties studied in the literature, including well-covered graphs, localizable graphs, and general partition graphs.