其树

This paper proposes an universal e-cash system based on partially blind signature which can be divided to small pieces of arbitrary number one time, so-called single-divisibility.

针对通用电子现金系统的难点在于其可分性，本文提出的方案以SK00系统为基础，实现其转移性(SK00公开问题)，并给商家颁发电子执照行使银行的部分职能，进而提出了一个显式可分(即一次性任意分割电子现金)的离线电子货币系统；同时利用以前的技术实现了一个采用树型结构的可分电子现金系统，并比较了这两个方案和以前方案的效率；二者安全性基于离散对数问题和强无碰撞Hash函数安全性；最后本文利用代理签名给出了一个新的部分盲签名方案。

Applying the De Caen"s inequality of sum of the squares of the degree and Cauchy"s inequality, we obtain a strict lower bound and a strict upper bound of the largest Laplace eigenvalues only in terms of vertex number of a unicycle graph. Applying the Laplace matrix theorem of trees, we obtain an upper bound of the second smallest Laplace eigenvalues of a unicycle. Extremal graph whose second smallest Laplace eigenvalues reach the obtained upper bound is determined. We also obtain an upper bound of the second largest Laplace eigenvalues in terms of vertex number of the largest connected branch of unicycle graph, and obtain a theoretical method to calculate the second largest Laplace eigenvalues of unicycle graph. We obtain an upper bound of any Laplace eigenvalues in terms of vertex number of a unicycle graph. We also obtain the distribution of Laplace eigenvalues in the inter [0,n] in terms of the matching number.

本文得到了以下几个方面的结果： 1、利用图度平方和的De Caen不等式和Cauchy不等式给出单圈图的最大Laplace特征值仅依赖于顶点数的严格的上下界；利用树的Laplace理论给出了单圈图次小Laplace特征值的一个上界，并刻画了达到该上界的极图；利用子图的连通分支的顶点个数给出了单圈图次大Laplace特征值的一个上界，并给出了单圈图次大Laplace特征值一个理论上的一个求法；利用单圈图的阶数给出了其一般Laplace特征值的一个上界；利用单圈图的匹配数给出其Laplace矩阵谱在区间[0，n]上的分布情况。

This protein sequence had 71.1%-85.7% identity with Sparus aurata, Oncorhymchus keta, Oreochromis niloticus and Danio rerio.

蛋白二级结构预测表明其含有丰富的螺旋和β折叠结构，系统树分析显示其与金头鲷亲缘关系最近。

The analysis of the chemical constitutes among sterns roots and leaves of Dracaena cochinchinenis, showed that there' s small amount loureirin A in their extracts, with 0.053mg/g, 0.058mg/g, 0.015mg/g respectively only. Therefore, the roots, stems and leaves of Dracaena cochinchinenis have too low contents of loureirins to be raw materials of dragon's blood.

分析剑叶龙血树根、茎、叶的成分，发现风干的剑叶龙血树根、茎、叶中没有龙血素B的存在，只含有少量的龙血素A，其含量在根、茎、叶中分别为：0.058mg/g，0.053mg/g，0.015mg/g，其含量远低于现行的龙血竭中龙血素A含量不低于2％的质检标准，因此剑叶龙血树的根、茎、叶不能直接用作生产龙血竭的原料。

The apical buds and axillary buds of Dracaena cambodiana Pierre ex Gagnep. were inoculated on MS medium containing 1 mg/L BA, 0.1 mg/L NAA, 100 mg/L PVP and 30 g/L sucrose for inducing shoots. After cultured for 40~50 d, the shoots bourgeoned. They were then transferred onto MS medium supplemented with 2 mg/L BA, 0.5 mg/L KT and 30 g/L sucrose for inducing clustered buds. After 25~10 d, the clustered buds formed. The proliferation rate of the clustered buds was 300%~500% per month.

以海南龙血树的顶芽和侧芽作为外植体，把其接种于MS+BA 1 mg/L+NAA0.1 mg/L+PVP100 mg/L+蔗糖30 g/L培养基上培养40~50 d可诱导其腋芽萌发，再把萌发后所形成的新芽切割下来接种于MS+BA 2mg/L+KT 0.5 mg/L+蔗糖30 g/L的培养基上培养25~30 d可诱导形成丛生芽，丛生芽在继代培养过程中每25~30 d可增殖3~5倍。

ID〓 is characterized by the fast speed of training and classifying, and it can be applied to large-scaled learning problems. But the selection criterion of attribute is the core of ID〓, and is now doubted. AQ〓 is a type of decision rule induction, presented by Michalski, a scientist of U. S.. It is characterized by high-precision classifying and capability of knowledge expression, and it can be applied to automatic knowledge acquisition in expert system. However, the inducing and matching speed of AQ〓 is slow.

其中决策树归纳以澳大利亚学者Quinlan的ID〓为代表，其特点是训练与分类速度都很快，适用于大规模的学习问题，但ID〓把注意力集中在属性的选择标准上，然而这种思想方法已开始受到人们的怀疑；决策规则归纳以美国学者Michalski的AQ〓为代表，其特点是分类精度高和知识表达能力强，适用于专家系统的知识自动获取，但归纳和匹配速度都慢。

Firstly,the wavelet-based contourlet coding using an SPIHT-like algorithm is utilized on the plain image,and as a result,the compressed datum stream could be achieved which is then mapped to a 3D bit matrix. Afterward,a chaotic sequence is generated by Lorenz chaotic map,and it is preprocessed to a bit sequence which is used to permute and substitute the elements of the 3D bit matrix achieved above. In the end,the processed 3D matrix is mapped back to datum stream,and the encrypted compressed image could be achieved if decoding and inverse transform are performed on the datum stream.

首先采用基于小波的Contourlet变换的类等级树集合分割编码算法对明文图像进行压缩，得到压缩数据流，然后将压缩数据流映射为一个三维位矩阵；利用Lorenz混沌映射产生混沌序列，并对其进行预处理得到比特值序列，根据比特值序列对上述三维位矩阵进行置乱和替代操作；将置乱和替代后的位矩阵重新映射为数据流，并对其进行解码和反变换操作，得到加密后的压缩图像。

They said:'The extreme corruption and wickedness of the English nation has provoked the just anger of God. When malice shall have reached the fullness of its measure, God will, in His wrath, send to the English people wicked spirits, who will punish and afflict them with great severity, by separating the green tree from its parent stem the length of three furlongs. But at last this same tree, through the compassionate mercy of God, and without any national assistance, shall return to its original root, reflourish and bear abundant fruit.

他们说：'极端腐败和邪恶的英语国家已挑起只是愤怒的上帝时，有恶意，应已达到丰满的，其衡量，神将，在他的愤怒，发送到英语的人邪恶的灵魂，他们将严惩和折磨，他们怀着极大的严重性，由分离绿树来自其母公司干的长度三furlongs ，但在去年同一树中，通过富有同情心怜悯的上帝，也没有任何国家提供的协助，应恢复其原来的根， reflourish并结出丰盛的果实。

A new algorithm for deleting a node from a red-black tree is presented,whose main idea is to process certain subtrees from above to below first and then to delete the node, without relating to the backtracking from below to above.

唐自立，讲师，主研领域：算法设计与分析提出一种新的删除红黑树的结点的算法，其主要思想是先自上而下处理某些子树再删除结点，不涉及自下而上的后退。

On one hand,it ensured the minimum modification to the computation already precomputed just before the dynamic case happened to reduce computation complexity.

其意义在于，如果成员加入或离开后树的结构不能保持，下一步加入或离开就不能顺利进行，需重新进行树结构的划分。

As she looked at Warrington's manly face, and dark, melancholy eyes, she had settled in her mind that he must have been the victim of an unhappy attachment.

每逢看到沃林顿那刚毅的脸，那乌黑、忧郁的眼睛，她便会相信，他一定作过不幸的爱情的受害者。

Maybe they'll disappear into a pothole.

也许他们将在壶穴里消失