图的分数[a,b]-因子存在的一个条件

图G的孤立韧度定义为I(G)=min｛｜S｜/i(G-S):S!V(G),i(G-S)≥2｝,若G不是完全图;否则,令I(G)=∞。论文给出了图的分数[a,b]-因子的存在性与图的孤立韧度的关系。证明若δ(G)≥I(G)≥a-1+a/b,则图G有分数[a,b]-因子,其中a相似文献   

5阶三角多项式空间中的拟Bézier基在三角域上的推广

为了进一步研究非多项式空间的拟B啨zier基,完善其关于三角域部分的理论,将5阶三角多项式空间G=span{1,sint,cost,sin2t,cos2t}上的基推广到三角域上,构造出满足正性、权性、对称性、边界性质和线性无关性的拟B啨zier基,使得相应的三角曲面不用有理形式就可以表示球面片.实例结果表明,使用这组基可以精确地造型出整球面.     

环[F2+uF2+vF2]上的[(1+v)-]常循环码

研究了环[R=F2+uF2+vF2] 上的[(1+v)-]常循环码。利用环[R]上奇长循环码的生成元来刻画环[R]上奇长的[(1+v)-]常循环码,进而给出了[Rn]到[(F2+uF2)2n]的一个广义Gray映射[φ],证明了环[R]上的[(1+v)-]常循环码[C]在[φ]下的广义Gray像[φ(C)]是环[F2+uF2]上的循环码。     

一种实用的身份基(t,n)门限代理签名方案

在(t,n)门限代理签名方案中,原始签名者将签名消息的权力委托给由n个成员组成的指定代理群.任意t个或更多的属于这个群的代理签名者可以合作发行一个代表原始签名者的代理签名,但是(t-1)个或更少的代理签名者是无法做到的.过去所有提出的门限代理签名方案都是基于离散对数问题,不能满足所有代理要求.提出了一个基于RSA密码体制的、实用的、有效的、安全的身份基(t,n)门限代理签名方案.方案满足所有代理的要求,只使用了一个简单的拉格朗日公式来共享代理签名密钥,并且通过身份基的密码体系,减少了原始签名者和代理签名者计算、更新密钥的开销.     

免基向量EMD(n,m)模型及其在图像密写上的应用

为解决传统全方向扩展方法(EMD)的秘密信息表达范围限制以及安全性问题,提出免基向量EMD(n,m)模型和基于EMD(n,m)模型的密写方法.首先通过计算n个载体数据最多调整m个的组合数来形成嵌密调整表,从中选取调整表行来对载体数据进行调整以嵌入秘密信息;进一步,依据密钥和混沌映射来随机指派n和m,截取秘密信息比特和置乱嵌密调整表行以提高安全性.理论和实验结果表明,与传统EMD相比,该方法避免了权值向量设置的有限性,可最大化嵌入容量,同时可通过与载体和密钥相关的嵌入提取环节来增强嵌入信息的安全性.     

(m-,P1)约束规范的动态调度算法研究

(m,p1)有效解决了μ-pattern中第一个数字为0时部分约束规范失效的问题。在弱硬实时调度算法研究的基础上,针对(m,p1)约束规范,提出了一个动态弱硬实时调度算法,分析与仿真结果表明,算法效果良好。     

基于C~∞基函数的自然邻点插值(NNI)方法在科学计算可视化上的应用

插值方法及插值基函数的选择是可视化技术的一个关键问题。该文首先根据平面域上分布的数据点集,将平面域剖分为 Ｖｏｒｏｎｏｉ ｃｅｌｌｓ进而得到相应的 Ｄｅｌａｕｎａｒ三角化网格。然后基于 Ｖｏｒｏｎｏｉ ｃｅｌｌｓ的几何性质,应用自然邻点插值（ＮＮＩ）方法,介绍了一种具有无穷次连续可微的 Ｃ∞插值基函数及其数学性质。将基于 Ｃ”基函数的 ＮＮＩ方法用于把复杂数据场重构成一个具有规则网格的经验模型。最后再根据规则网格,生成三维立体图、等值线图、矢量分布图等。文章通过实例表明了基于Ｃ∞基函数的ＮＮＩ方法能够很好地应用于处理极不规则分布数据场的可视化。     

基于差分的特殊权限下(m+n,t1+t2)门限秘密共享

在秘密共享案中,一般研究(n,t)门限秘密共享方案。我们给出的是具有特殊权限的(m+n,t1+t2)门限秘密共享方案,它是(n,t)门限秘密共享方案推广形式的门限秘密共享方案。基于差分给出(m+n,t1+t2)门限秘密共享方案,又基于Shamir方案给出(m+n,t1+t2)门限秘密共享的另一方案。     

云计算下基于特殊差分方程的(m+1,t+1)门限秘密共享方案

针对非可信云计算服务提供商窃取用户隐私数据的问题,以齐次常系数线性差分方程为工具,将秘密共享技术应用到云计算环境中,提出一种新的(m+1,t+1)门限秘密共享方案。通过对用户隐私数据的解密密钥进行管理,利用齐次常系数线性差分方程为用户与云服务提供商分别分配特殊秘密份额与普通秘密份额,在没有用户参与的情况下,云服务提供商不能恢复用户隐私数据。分析结果表明,该方案能较好地保障用户隐私数据的存储安全,并且通过优化秘密份额减少了存储开销。     

硅苯、1-硅萘及9-硅蒽的[4+4]二聚反应的比较研究

采用密度泛函理论(DFT)在B3LYP/6-31G(d)水平上,研究硅苯、1-硅萘及9-硅蒽的[4+4]二聚反应的微观机理和势能剖面,考察了反应的取代基效应和溶剂效应.计算结果表明,所研究反应均为协同反应,且2个C-Si键同步形成.随反应物分子芳香环从小到大的增加,[4+4]反应在热力学和动力学上均变得越来越有利.硅苯...     

Quantum-chemical, NMR and X-ray diffraction studies on (+/-)-1-[3,4-(methylenedioxy)phenyl]-2-methylaminopropane

Time-averaged conformations of (±)-1-[3,4-(methylenedioxy)phenyl]-2-methylaminopropane hydrochloride (MDMA, “ecstasy”) in D₂O, and of its free base and trifluoroacetate in CDCl₃, were deduced from their ¹H NMR spectra and used to calculate their conformer distribution. Their rotational potential energy surface (PES) was calculated at the RHF/6-31G(d,p), B3LYP/6-31G(d,p), B3LYP/cc-pVDZ and AM1 levels. Solvent effects were evaluated using the polarizable continuum model. The NMR and theoretical studies showed that, in the free base, the N-methyl group and the ring are preferentially trans. This preference is stronger in the salts and corresponds to the X-ray structure of the hydrochloride. However, the energy barriers separating these forms are very low. The X-ray diffraction crystal structures of the anhydrous salt and its monohydrate differed mainly in the trans or cis relationship of the N-methyl group to the -methyl, although these two forms interconvert freely in solution.     

Design and synthesis of a novel class of carbonic anhydrase-IX inhibitor 1-(3-(phenyl/4-fluorophenyl)-7-imino-3H-[1,2,3]triazolo[4,5d]pyrimidin 6(7H)yl)urea

Carbonic anhydrase IX (CAIX) is a promising target in cancer therapy especially in the case of hypoxia-induced tumors. The selective inhibition of CA isozymes is a challenging task in drug design and discovery process. Here, we performed fluorescence-binding studies and inhibition assay combined with molecular docking and molecular dynamics (MD) simulation analyses to determine the binding affinity of two synthesized triazolo-pyrimidine urea derived (TPUI and TPUII) compounds with CAIX and CAII. Fluorescence binding results are showing that molecule TPUI has an excellent binding-affinity for CAIX (k_D = 0.048 μM). The TPUII also exhibits an appreciable binding affinity (k_D = 7.52 μM) for CAIX. TPUI selectively inhibits CAIX as compared to TPUII in the 4-NPA assay. Docking studies show that TPUI is spatially well-fitted in the active site cavity of CAIX, and is involve in H-bond interactions with His94, His96, His119, Thr199 and Thr200. MD simulation studies revealed that TPUI efficiently binds to CAIX and essential active site residual interaction is consistent during the entire simulation of 40 ns. These studies suggest that TPUI appeared as novel class of CAIX inhibitor, and may be used as a lead molecule for the development of potent and selective CAIX inhibitor for the hypoxia-induced cancer therapy.     

关于求平面点集凸包的一个O(n)时间算法的商榷

王志强等于1998年提出了一个计算平面点集凸包的新算法,并且声称该算法的最坏时间复杂度为O(n),从而为张性时间排序提供了可能性,该文对王志强等提出的求平面点集凸包算法的时间分析提出了不同观点,进一步明确了平面集凸包算法和排序算法的时间下界为Ω(nlogn).     

On solving the minimization problem and the fixed-point problem for a finite family of non-expansive mappings in CAT(0) spaces

In this paper, we propose a new modified proximal point algorithm for a finite family of non-expansive mappings in the framework of CAT(0) spaces. We establish Δ-convergence and strong convergence theorems under some mild conditions. Our results extend some known results which appeared in the literature.     

L(2, 1)-labellings for direct products of a triangle and a cycle

An L(2, 1)-labelling of a graph G is a vertex labelling such that the difference of the labels of any two adjacent vertices is at least 2 and that of any two vertices of distance 2 is at least 1. The minimum span of all L(2, 1)-labellings of G is the λ-number of G and denoted by λ(G). Lin and Lam computed λ(G) for a direct product G=K _m ×P _n of a complete graph K _m and a path P _n . This is a natural lower bound of λ(K _m ×C _n ) for a cycle C _n . They also proved that when n≡ 0±od 5m, this bound is the exact value of λ(K _m ×C _n ) and computed the value when n=3, 5, 6. In this article, we compute the λ-number of G, where G is the direct product K ₃×C _n of the triangle and a cycle C _n for all the other n. In fact, we show that among these n, λ(K ₃×C _n )=7 for all n≠7, 11 and λ(K ₃×C _n )=8 when n=7, 11.     

Ambiguity and fuzziness measures defined on the set of closed intervals in [0, 1]

Starting from the idea of activity orders, we define a family of orders on the set of closed intervals of a distributive lattice L, that will allow us to set up some preorders associated to the ambiguity and fuzziness in order to measure the ambiguity and fuzziness degree of any closed interval in [0, 1].     

Necessary and sufficient conditions on Q ( = C( I + PC)) for stabilization of the linear feedback system S(P, C)

We find the following necessary and sufficient conditions for Q (:=C(I+PC)⁻¹) to -stabilize the standard linear time-invariant unity feedback system S(P, C) where P has the l.c.f. (D_pl, N_pl) and the r.c.f. (N_pr, D_pr); and is a principal ideal domain. (i) Q must have elements in (ii) (resp. (iii)) Q must factorize in with D_pr, (resp. D_pl) as a left (resp. right) factor and (iv) (I – QP) must factor in with D_pr, as a left factor.