云时代,云API作为服务交付、数据交换和能力复制的最佳载体,已成长为当今面向服务软件开发和企业数字化转型不可或缺的核心要素.然而动态开放网络中持续增长的云API在给开发者提供了更多选择的同时,也将其淹没在海量的云API选择之中,设...云时代,云API作为服务交付、数据交换和能力复制的最佳载体,已成长为当今面向服务软件开发和企业数字化转型不可或缺的核心要素.然而动态开放网络中持续增长的云API在给开发者提供了更多选择的同时,也将其淹没在海量的云API选择之中,设计有效的云API推荐方法就此成为API经济健康发展中迫切要解决的现实问题.但是,现有研究主要利用搜索关键词、服务质量和调用偏好进行建模,生成质量高功能单一的云API推荐列表,没有考虑服务化软件实际开发中开发者对多元化高阶互补云API的客观需要.高阶互补云API推荐旨在为多个查询云API生成多元互补云API列表,要求推荐结果与查询云API均互补,以满足开发者的联合需求.针对此问题,本文提出基于概率逻辑推理的高阶互补云API推荐方法(Probabilistic Logic Reasoning for High-order Complementary Cloud API Recom⁃mendation,PLR4HCCR).首先,通过云API生态真实数据分析论证云API互补推荐需求的必要性和互补关系建模中替补噪声的客观存在,为云API互补推荐问题研究提供动机和数据支持.其次,采用Beta概率嵌入对云API及其之间的关系约束进行编码,以刻画云API间互补关系的不确定性和支持互补逻辑推理.接着,设计由投影、取反和交并三个基本逻辑算子构建的互补关系逻辑推理网络,使查询集中的每个云API获得非对称互补关系感知和替补噪声消解约束下的互补云API表示.然后,引入注意力机制为查询云API的互补云API分配不同权重,增强高阶互补云API基向量的表征能力.在此基础上,采用KL散度度量高阶互补云API基向量与候选云API之间的距离,并根据KL散度排序生成高阶互补性可感知下的云API推荐结果.最后,我们利用两个真实云API数据集在不同阶互补推荐场景下进行实验,实验表明,与传统启发式推荐方法和深度学习推荐方法相比,PLR4HCCR在互补关系感知推理和替补噪声消解方面均具有较大的优势,继而使其在低阶、高阶和混合阶互补云API推荐中均展示出更优的推荐效果和更强的泛化能力.进一步,超参数敏感性实验、实例分析和用户调查验证了方法的有效性、实用性和可行性,这使结合高阶互补关系的云API推荐方法PLR4HCCR不仅更有可能生成开发者满意的结果,而且可有效提升云API服务提供者的收益.展开更多
This paper addresses the teachability/controllability of high order mix-valued logical control networks by using the semi-tensor product method, and presents some necessary and sufficient conditions for the reachabili...This paper addresses the teachability/controllability of high order mix-valued logical control networks by using the semi-tensor product method, and presents some necessary and sufficient conditions for the reachability/controllability. The high order mix-valued logical network is converted into an algebraic form first, baaed on which the reachability/controllability of the system is then investigated, and several necessary and sufficient conditions are established. The study of several illustrative examples shows that our new method is very effective in dealing with the reachability/controllability of high order mix-valued logical control networks.展开更多
This paper presents a neural network approach, based on high-order two-dimension temporal and dynamically clustering competitive activation mecha-nisms, to implement parallel searching algorithm and many other symboli...This paper presents a neural network approach, based on high-order two-dimension temporal and dynamically clustering competitive activation mecha-nisms, to implement parallel searching algorithm and many other symbolic logicalgorithms. This approach is superior in many respects to both the commonsequential algorithms of symbolic logic and the common neura.l network usedfor optimization problems. Simulations of problem solving examples prove theeffectiveness of the approach.展开更多
The flowering time of Arabidopsis is sensitive to climate variability, with lighting conditions being a major determinant of the flowering time. Long-days induce early flowering, while short-days induce late flowering...The flowering time of Arabidopsis is sensitive to climate variability, with lighting conditions being a major determinant of the flowering time. Long-days induce early flowering, while short-days induce late flowering or even no flowers. This study investigates the intrinsic mechanisms for Arabidopsis flowering in different lighting conditions using mutual information networks and logic networks. The structure parameters of the mutual information networks show that the average degree and the average core clearly distinguish these networks. A method is then given to find the key structural genes in the mutual information networks and the logic networks respectively. Ten genes are found to possibly promote flowering with three genes that may restrain flowering. The sensitivity of this method to find the genes that promote flowering is 80%, while the sensitivity of the method to find the genes that restrain flowering is 100%.展开更多
A program construction method based on Gamma language is proposed. The problemto be solved is specified by first-order predicate logic and a semantic verification program isconstructed directly from the specification....A program construction method based on Gamma language is proposed. The problemto be solved is specified by first-order predicate logic and a semantic verification program isconstructed directly from the specification. Ways for improving efficiency of the program arealso studied. The method differs from the one proposed by Manna and Waldinger, where aprogram is extracted from the proof of the existence of an object meeting the given specification.On the other hand, it also differs from the classical one used for deriving Gamma programsof Banatre and Le Metayer, which consists in decomposing the specification into an invariantand a termination condition.展开更多
文摘云时代,云API作为服务交付、数据交换和能力复制的最佳载体,已成长为当今面向服务软件开发和企业数字化转型不可或缺的核心要素.然而动态开放网络中持续增长的云API在给开发者提供了更多选择的同时,也将其淹没在海量的云API选择之中,设计有效的云API推荐方法就此成为API经济健康发展中迫切要解决的现实问题.但是,现有研究主要利用搜索关键词、服务质量和调用偏好进行建模,生成质量高功能单一的云API推荐列表,没有考虑服务化软件实际开发中开发者对多元化高阶互补云API的客观需要.高阶互补云API推荐旨在为多个查询云API生成多元互补云API列表,要求推荐结果与查询云API均互补,以满足开发者的联合需求.针对此问题,本文提出基于概率逻辑推理的高阶互补云API推荐方法(Probabilistic Logic Reasoning for High-order Complementary Cloud API Recom⁃mendation,PLR4HCCR).首先,通过云API生态真实数据分析论证云API互补推荐需求的必要性和互补关系建模中替补噪声的客观存在,为云API互补推荐问题研究提供动机和数据支持.其次,采用Beta概率嵌入对云API及其之间的关系约束进行编码,以刻画云API间互补关系的不确定性和支持互补逻辑推理.接着,设计由投影、取反和交并三个基本逻辑算子构建的互补关系逻辑推理网络,使查询集中的每个云API获得非对称互补关系感知和替补噪声消解约束下的互补云API表示.然后,引入注意力机制为查询云API的互补云API分配不同权重,增强高阶互补云API基向量的表征能力.在此基础上,采用KL散度度量高阶互补云API基向量与候选云API之间的距离,并根据KL散度排序生成高阶互补性可感知下的云API推荐结果.最后,我们利用两个真实云API数据集在不同阶互补推荐场景下进行实验,实验表明,与传统启发式推荐方法和深度学习推荐方法相比,PLR4HCCR在互补关系感知推理和替补噪声消解方面均具有较大的优势,继而使其在低阶、高阶和混合阶互补云API推荐中均展示出更优的推荐效果和更强的泛化能力.进一步,超参数敏感性实验、实例分析和用户调查验证了方法的有效性、实用性和可行性,这使结合高阶互补关系的云API推荐方法PLR4HCCR不仅更有可能生成开发者满意的结果,而且可有效提升云API服务提供者的收益.
基金supported by the National Natural Science Foundation of China under Grant Nos.61074068,61034007,61174036the Research Fund for the Taishan Scholar Project of Shandong Province of Chinathe Natural Science Foundation of Shandong Province under Grant No.ZR2010FM013
文摘This paper addresses the teachability/controllability of high order mix-valued logical control networks by using the semi-tensor product method, and presents some necessary and sufficient conditions for the reachability/controllability. The high order mix-valued logical network is converted into an algebraic form first, baaed on which the reachability/controllability of the system is then investigated, and several necessary and sufficient conditions are established. The study of several illustrative examples shows that our new method is very effective in dealing with the reachability/controllability of high order mix-valued logical control networks.
文摘This paper presents a neural network approach, based on high-order two-dimension temporal and dynamically clustering competitive activation mecha-nisms, to implement parallel searching algorithm and many other symbolic logicalgorithms. This approach is superior in many respects to both the commonsequential algorithms of symbolic logic and the common neura.l network usedfor optimization problems. Simulations of problem solving examples prove theeffectiveness of the approach.
基金Supported by the National Natural Science Foundation of China (Nos.61170183,61033003, and 91130034)the Foundation for the Excellent Middle-Aged and Youth Scientists of Shandong Province of China(No.BS2011SW025)
文摘The flowering time of Arabidopsis is sensitive to climate variability, with lighting conditions being a major determinant of the flowering time. Long-days induce early flowering, while short-days induce late flowering or even no flowers. This study investigates the intrinsic mechanisms for Arabidopsis flowering in different lighting conditions using mutual information networks and logic networks. The structure parameters of the mutual information networks show that the average degree and the average core clearly distinguish these networks. A method is then given to find the key structural genes in the mutual information networks and the logic networks respectively. Ten genes are found to possibly promote flowering with three genes that may restrain flowering. The sensitivity of this method to find the genes that promote flowering is 80%, while the sensitivity of the method to find the genes that restrain flowering is 100%.
文摘A program construction method based on Gamma language is proposed. The problemto be solved is specified by first-order predicate logic and a semantic verification program isconstructed directly from the specification. Ways for improving efficiency of the program arealso studied. The method differs from the one proposed by Manna and Waldinger, where aprogram is extracted from the proof of the existence of an object meeting the given specification.On the other hand, it also differs from the classical one used for deriving Gamma programsof Banatre and Le Metayer, which consists in decomposing the specification into an invariantand a termination condition.
