抵御已知/选择明文攻击的混沌图像加密算法

论文在对现有一类典型图像混沌加密算法的分析基础上,提出了一种改进的图像混沌加密算法。该算法引入小波变换,可以有效地克服一些混沌加密算法不能抵御已知/选择明文攻击的缺陷。     

Efficient Parallel Algorithms for Some Graph Theory Problems

In this paper,a sequential algorithm computing the aww vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n^2,processors,a parallel version of the sequential algorithm is shown.This method can also be used to get a parallel algorithm to compute transitive closure array A^* of an undirected graph.The time complexity of the parallel algorithm is O(n^3/p).If D,P and A^* are known,it is shown that the problems to find all connected components,to compute the diameter of an undirected graph,to determine the center of a directed graph and to search for a directed cycle with the minimum(maximum)length in a directed graph can all be solved in O(n^2/p logp)time.     

Sub-optimal solutions to track detection problem using graph theoretic concepts

This paper demonstrates how the problem of tracking targets, which appear as either straight or curved lines in two-dimensional display images (or data images) can be formulated in terms of a directed weighted graph model and how dynamic programming techniques can be efficiently applied to reach an optimal or sub-optimal solution. In general, track detection algorithms providing optimal solutions have good detective ability, but most of them suffer from the inability to detect discontinuous lines or to resolve efficiently pairs of crossing lines. A sub-optimal solution is provided that efficiently overcomes these weaknesses. We focus on modeling the track detection problem in terms of a graph, formulating fast sequential/parallel sub-optimal track detection algorithms and testing them on simulated data in order to show their detective ability. Moreover, we specify the conditions under which sub-optimal algorithms can perform at least as well as their corresponding optimal algorithms. This is significant for the track detection problem where fast, accurate and real-time detection is considered a necessity.     

Recommending suitable learning scenarios according to learners’ preferences: An improved swarm based approach

The paper presents a new approach for recommending suitable learning paths for different learners groups. Selection of the learning path is considered as recommendations to choosing and combining the sequences of learning objects (LOs) according to learners’ preferences. Learning path can be selected by applying artificial intelligence techniques, e.g. a swarm intelligence model. If we modify and/or change some LOs in the learning path, we should rearrange the alignment of new and old LOs and reallocate pheromones to achieve effective learning recommendations. To solve this problem, a new method based on the ant colony optimisation algorithm and adaptation of the solution to the changing optimum is proposed. A simulation process with a dynamic change of learning paths when new LOs are inserted was chosen to verify the method proposed. The paper contributes with the following new developments: (1) an approach of dynamic learning paths selection based on swarm intelligence, and (2) a modified ant colony optimisation algorithm for learning paths selection. The elaborated approach effectively assist learners by helping them to reach most suitable LOs according to their preferences, and tutors – by helping them to monitor, refine, and improve e-learning modules and courses according to the learners’ behaviour.     

解决组合公钥共谋攻击和密钥碰撞的新方法

以解决组合公钥体制中共谋攻击和密钥碰撞问题为目的。首先,针对线性共谋攻击,提出了一种新的构造种子矩阵的方法,使得种子密钥和大于基点加法群的阶数,从而使密钥之间不能相互线性表示。其次在密钥的生产过程中,引入系数破坏了层不同和层互斥不同的关系,为解决选择共谋攻击提供了一种有效的方法,同时增强了抵御随机共谋攻击的能力。最后,在密钥产生的流程中,通过公钥对比来避免密钥碰撞,为解决密钥碰撞问题提出了一种新方法。     

Tool path generation framework for accurate manufacture of complex 3D sheet metal parts using single point incremental forming

The prototyping of complex sheet metal parts using single point incremental forming (SPIF) requires the generation of optimal tool paths and/or tool path sequences that ensure that the formed part is within geometric design specifications. The presence of a multitude of features on complex parts leads to multiple inaccuracy inducing phenomena occurring simultaneously due to interactions between the features. This paper proposes a network analysis methodology using topological conceptual graphs to capture the effects of different phenomena on the final accuracy of a sheet metal part manufactured by SPIF. Using this framework optimized tool paths can be generated that compensate for the inaccuracy inducing behavior. Tool path generation algorithms to create partial tool paths that account for the accuracy of specific features in the part based on the proposed framework are also presented. Finally, the creation of integrated tool paths maintaining complementarity between tool paths and desired continuity behavior using non-uniform cubic B-splines is illustrated. A number of case studies demonstrating the applicability of the integrated framework are discussed, where the maximum deviations in the part are significantly reduced and the average absolute deviations for the complete part are brought down to less than 0.5 mm.     

一种超混沌图像加密方案的安全性分析

该文针对一种超混沌图像加密算法进行选择明文攻击,结果表明该算法中间密钥序列与明文图像不存在关联,所采用的加密公式可进行反推运算,并且待加密像素仅仅采用异或的加密方式,导致中间密钥序列可被破解,进而可对密文信息进行恢复.     

基于AR规则的全路径测试数据自动生成方法

基于全路径的研究现正处于起步阶段,提出了一种全新的NRPS算法（不重复路径搜索算法）和AR规则来对程序的源文件进行静态分析,生成有向无负权图,进而得到不重复路径集;并结合粒子群优化算法最终生成最优测试用例。实验表明,该方法具有可行性。     

Profiling selected paths with loops

Path profiling records the frequency of each path in an executed program.To accomplish profiling,probes are instrumented in the program and executed as the program runs.So,the number of probes has a significant impact on the efficiency of a profiling technique.By profiling only the interesting paths,existing techniques try to improve the profiling efficiency by reducing the number of probes and optimize path encodings for efficient storage.However,they lack accuracy,waste time on running uninteresting paths,and can mainly deal with acyclic paths.In this article,a novel technique called Profiling Selected Paths(PSP)is introduced to profile selected paths,which enables custom selection for both acyclic and cyclic paths and increases the execution efficiency by early termination on uninteresting paths.Theoretical analysis and experimental evaluation indicate that PSP performs better than existing techniques.     

基于子结构的内力约束连续体拓扑优化

通过拓扑优化可以得到传力路径,不同传力路径对应不同内力载荷。如果将内力载荷作为目标或约束进行拓扑优化,可以得到满足不同需求的传力路径,为拓扑优化的发展提供新思路和新方法。为了得到不同内力载荷需求的传力路径,基于子结构法将结构分开使内力暴露出来。以结构质量最小为目标,以内力为约束建立拓扑优化模型,基于独立、连续、映射( independent, continuous, mapping, ICM)方法和单位载荷法将内力显式化,通过累加获得需要控制的传力路径上的内力,通过迭代调整2个路径上的内力使其比值达到一个稳定的值,从而获得满足内力约束的传力路径。算例表明：不同的内力约束可以得到不同的传力路径。