Based on decisional Difiie-Hcllman problem, we propose a simpleproxy-protected signature scheme In the random oracle model, we also carry out the strict securityproof for the proposed scheme. The security of the propo...Based on decisional Difiie-Hcllman problem, we propose a simpleproxy-protected signature scheme In the random oracle model, we also carry out the strict securityproof for the proposed scheme. The security of the proposed scheme is not loosely related to thediscrete logarithm assumption hut tightly related to the decisional Diffie-Hellman assumption in therandom oracle model.展开更多
Mining with streaming data is a hot topic in data mining. When performing classification on data streams, traditional classification algorithms based on decision trees, such as ID3 and C4.5, have a relatively poor eff...Mining with streaming data is a hot topic in data mining. When performing classification on data streams, traditional classification algorithms based on decision trees, such as ID3 and C4.5, have a relatively poor efficiency in both time and space due to the characteristics of streaming data. There are some advantages in time and space when using random decision trees. An incremental algorithm for mining data streams, SRMTDS （Semi-Random Multiple decision Trees for Data Streams）, based on random decision trees is proposed in this paper. SRMTDS uses the inequality of Hoeffding bounds to choose the minimum number of split-examples, a heuristic method to compute the information gain for obtaining the split thresholds of numerical attributes, and a Naive Bayes classifier to estimate the class labels of tree leaves. Our extensive experimental study shows that SRMTDS has an improved performance in time, space, accuracy and the anti-noise capability in comparison with VFDTc, a state-of-the-art decision-tree algorithm for classifying data streams.展开更多
基于决策Diffie-Hellman问题(DDHP),构造了一个可证明安全性的高效多重数字签名方案,在随机预言模型下其安全性可紧归约到DDHP的难解性。在"证明拥有私钥"密钥注册假设下,证明了方案对适应性选择消息和签名群组攻击是不可伪...基于决策Diffie-Hellman问题(DDHP),构造了一个可证明安全性的高效多重数字签名方案,在随机预言模型下其安全性可紧归约到DDHP的难解性。在"证明拥有私钥"密钥注册假设下,证明了方案对适应性选择消息和签名群组攻击是不可伪造的。所生成的多重签名的长度以及验证签名的计算开销均不随实际签名人数的增加而增长。与Z C WANG提出的基于CDHP的紧安全性归约的多重数字签名方案相比,具有多重签名生成算法使用的通信轮数少、计算量小等优点,可应用于多种电子事务处理环境中。展开更多
Solubility has been widely regarded as a fundamental property of small molecule drugs and drug candidates,as it has a profound impact on the crystallization process.Solubility prediction,as an alternative to experimen...Solubility has been widely regarded as a fundamental property of small molecule drugs and drug candidates,as it has a profound impact on the crystallization process.Solubility prediction,as an alternative to experiments which can reduce waste and improve crystallization process efficiency,has attracted increasing attention.However,there are still many urgent challenges thus far.Herein we used seven descriptors based on understanding dissolution behavior to establish two solubility prediction models by machine learning algorithms.The solubility data of 120 active pharmaceutical ingredients(APIs)in ethanol were considered in the prediction models,which were constructed by random decision forests and artificial neural network with optimized data structure and model accuracy.Furthermore,a comparison with traditional prediction methods including the modified solubility equation and the quantitative structure-property relationships model was carried out.The highest accuracy shown by the testing set proves that the ML models have the best solubility prediction ability.Multiple linear regression and stepwise regression were used to further investigate the critical factor in determining solubility value.The results revealed that the API properties and the solute-solvent interaction both provide a nonnegligible contribution to the solubility value.展开更多
In this paper, an efficient hybrid proxy re-encryption scheme that allows the transformation of the ciphertexts in a traditional public key cryptosystem into the ciphertexts in an identity-based system is proposed. Th...In this paper, an efficient hybrid proxy re-encryption scheme that allows the transformation of the ciphertexts in a traditional public key cryptosystem into the ciphertexts in an identity-based system is proposed. The scheme is non-interactive, unidirectional and collude ＂safe＂. Furthermore, it is compatible with current IBE （identity-based encryption） deployments. The scheme has chosen ciphertext security in the random oracle model assuming the hardness of the Decisional Bilinear Diffie-Hellman problem.展开更多
文摘Based on decisional Difiie-Hcllman problem, we propose a simpleproxy-protected signature scheme In the random oracle model, we also carry out the strict securityproof for the proposed scheme. The security of the proposed scheme is not loosely related to thediscrete logarithm assumption hut tightly related to the decisional Diffie-Hellman assumption in therandom oracle model.
基金This research is supported by the National Natural Science Foundation of China(Grant No.60573174)the Natural Science Foundation of Anhui Province of China(Grant No.050420207).
文摘Mining with streaming data is a hot topic in data mining. When performing classification on data streams, traditional classification algorithms based on decision trees, such as ID3 and C4.5, have a relatively poor efficiency in both time and space due to the characteristics of streaming data. There are some advantages in time and space when using random decision trees. An incremental algorithm for mining data streams, SRMTDS （Semi-Random Multiple decision Trees for Data Streams）, based on random decision trees is proposed in this paper. SRMTDS uses the inequality of Hoeffding bounds to choose the minimum number of split-examples, a heuristic method to compute the information gain for obtaining the split thresholds of numerical attributes, and a Naive Bayes classifier to estimate the class labels of tree leaves. Our extensive experimental study shows that SRMTDS has an improved performance in time, space, accuracy and the anti-noise capability in comparison with VFDTc, a state-of-the-art decision-tree algorithm for classifying data streams.
文摘基于决策Diffie-Hellman问题(DDHP),构造了一个可证明安全性的高效多重数字签名方案,在随机预言模型下其安全性可紧归约到DDHP的难解性。在"证明拥有私钥"密钥注册假设下,证明了方案对适应性选择消息和签名群组攻击是不可伪造的。所生成的多重签名的长度以及验证签名的计算开销均不随实际签名人数的增加而增长。与Z C WANG提出的基于CDHP的紧安全性归约的多重数字签名方案相比,具有多重签名生成算法使用的通信轮数少、计算量小等优点,可应用于多种电子事务处理环境中。
基金supported by the National Natural Science Foundation of China(Grant No.21938009).
文摘Solubility has been widely regarded as a fundamental property of small molecule drugs and drug candidates,as it has a profound impact on the crystallization process.Solubility prediction,as an alternative to experiments which can reduce waste and improve crystallization process efficiency,has attracted increasing attention.However,there are still many urgent challenges thus far.Herein we used seven descriptors based on understanding dissolution behavior to establish two solubility prediction models by machine learning algorithms.The solubility data of 120 active pharmaceutical ingredients(APIs)in ethanol were considered in the prediction models,which were constructed by random decision forests and artificial neural network with optimized data structure and model accuracy.Furthermore,a comparison with traditional prediction methods including the modified solubility equation and the quantitative structure-property relationships model was carried out.The highest accuracy shown by the testing set proves that the ML models have the best solubility prediction ability.Multiple linear regression and stepwise regression were used to further investigate the critical factor in determining solubility value.The results revealed that the API properties and the solute-solvent interaction both provide a nonnegligible contribution to the solubility value.
基金Supported by the National Natural Science Foundation of China (60673070)the Natural Science Foundation of Jiangsu Province, China (BK2006217)
文摘In this paper, an efficient hybrid proxy re-encryption scheme that allows the transformation of the ciphertexts in a traditional public key cryptosystem into the ciphertexts in an identity-based system is proposed. The scheme is non-interactive, unidirectional and collude ＂safe＂. Furthermore, it is compatible with current IBE （identity-based encryption） deployments. The scheme has chosen ciphertext security in the random oracle model assuming the hardness of the Decisional Bilinear Diffie-Hellman problem.
