RBF网学习的进化优选算法

讨论了用正交最小二乘算法训练ＲＢＦ网的不足之处,然后引入了选择路径的概念,在此基础上,提出了ＲＢＦ网隐层节点选取的进化优选算法,仿真结果表明,在不同的精度要求下,用进化优选算法均能设计出比正交最小二乘算法更小的ＲＢＦ网。     

圆环面上纤维轨迹的计算机辅助设计

曲面上的曲线造型是计算机图形领域的一个新的研究热点,而且它们在纤维织物编织,三维服装裁剪以及复合材料的纤维缠绕轨迹设计等领域有十分广泛的应用,为了解决圆环面上纤维轨迹的计算机辅助设计问题,研究了圆环面上测地线的解析解以及拟测地线数值求解的具体算法并给出了其表达式,测地线是曲面上两点之间最短距离的曲线段,在一般曲面上没有解析解,但是在圆环面上却可求出其精确的解析解,但在曲面的边沿部分,测地线因不能实现自然的折返过渡,于是拟测地线就被引进到曲面上的曲线造型设计之中,在拟测地线分析研究基础上,给出了圆环面上拟测地线的方程及数值解法,通过其在一个实例中的应用结果证明,该方法可获得织物的纺织条纹以及缠绕物体的纤维轨迹。     

加工特征排序及NC代码映射

在零件的加工过程中,特征的消亡(主要指余量)和实现(主要指尺寸、精度)必须按一定的顺序进行.因此,研究了加工特征的排序机理,提出了一种基于知识的加工特征自动排序方法.在此基础上进一步提出了刀具路径和NC代码的自动生成方法.     

CONTEXTUAL LANGUAGE MODELS FOR RANKING ANSWERS TO NATURAL LANGUAGE DEFINITION QUESTIONS

Question–answering systems make good use of knowledge bases (KBs, e.g., Wikipedia) for responding to definition queries. Typically, systems extract relevant facts from articles regarding the question across KBs, and then they are projected into the candidate answers. However, studies have shown that the performance of this kind of method suddenly drops, whenever KBs supply narrow coverage. This work describes a new approach to deal with this problem by constructing context models for scoring candidate answers, which are, more precisely, statistical n‐gram language models inferred from lexicalized dependency paths extracted from Wikipedia abstracts. Unlike state‐of‐the‐art approaches, context models are created by capturing the semantics of candidate answers (e.g., “novel,”“singer,”“coach,” and “city”). This work is extended by investigating the impact on context models of extra linguistic knowledge such as part‐of‐speech tagging and named‐entity recognition. Results showed the effectiveness of context models as n‐gram lexicalized dependency paths and promising context indicators for the presence of definitions in natural language texts.     

New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems

Multi-objective shortest path problem (MOSPP) is an active area of research because of its application in a large number of systems such as transportation systems, communication systems, power transmission systems, pipeline distribution systems of water, gas, blood and drainage, neural decision systems, production planning and project planning. In these networks it becomes necessary to find the best path from one node to a specified or all other nodes. The computational complexity of the existing algorithms in the literature to compute all Pareto minimum paths from a specified source node to all other nodes in an MOSPP is of exponential order in the worst case. Instead of generating all the values of the Pareto minimum paths in exponential time, we propose an algorithm to find a set of values of the Pareto minimum paths in polynomial time, which is very significant in many contexts. If an MOSPP of a network is having negative cycle, all the existing algorithm only indicate the existence of the negative cycle, that too after exponential number of operations. However, applying the proposed algorithm, we can find a set of Pareto minimum paths of any MOSPP of a network even if it contains negative cycles. The proposed algorithm is illustrated with examples.     

针对超混沌系统图像加密算法的选择明文攻击

超混沌系统图像加密算法HYPER_HIE由于采用初等变换和异或运算作为加密措施,因此很难抵抗各种攻击。针对该算法的3个步骤,即密钥生成、像素置乱、图像扩散与混乱,选择全零矩阵、行相同矩阵和列相同矩阵这3种明文矩阵,在未知加密密钥的前提下对该算法进行选择明文攻击。通过一个实例表明,该攻击方法仅以很小的计算代价破译了密文。     

微博时代大学生媒介素养培养路径探析

微博以“井喷”的速度快速发展,正全面参与并影响着现实世界。作为微博主力军的大学生,其媒介素养培养显得尤为重要,通过政府赋予媒介素养教育合法地位,开设媒介素养教育课程等途径,培养和提高大学生媒介素养,不仅对大学生树立正确的世界观、人生观和价值观有益,也是维护社会稳定、构建和谐社会生态和政治语境的必要条件。     

基于Web日志挖掘用户的浏览兴趣路径

提出一种基于Web日志发现用户浏览偏爱路径算法。引入了支持-兴趣度概念。建立用户访问矩阵以表示用户浏览网页行为,并获得访问矩阵的海明距离矩阵。通过对距离矩阵与相似度阈值的计算获得偏爱路径的候选2项子路径,再利用支持-兴趣度对候选集做进一步的过滤,最后进行合并并生产浏览偏爱路径。实验表明该算法可以有效地反映用户的浏览兴趣。     

子网络的连接模式对关联网络可靠性影响研究

为了分析关联网络中子网络之间连接方式对网络可靠性的影响,根据不同子网络之间连接的度相关性,建立关联网络中子网络之间的连接模型,以节点之间非交叉路径的最大条数为可靠性测度,对由4个子网络组成的网络系统进行了分析。结果表明,当子网络之间的连接具有异配性时,网络具有较高的可靠性,但过大的异配性反而会降低网络的可靠性。