Machining quality of clean-up region has a strong influence on the performances of the impeller. In order to plan clean-up tool paths rapidly and obtain good finish surface quality, an efficient and robust tool path g...Machining quality of clean-up region has a strong influence on the performances of the impeller. In order to plan clean-up tool paths rapidly and obtain good finish surface quality, an efficient and robust tool path generation method is presented, which employs an approach based on point-searching. The clean-up machining mentioned in this paper is pencil-cut and multilayer fillet-cut for a free-form model with a ball-end cutter. For pencil-cut, the cutter center position can be determined via judging whether it satisfies the distance requirement. After the searching direction and the tracing direction have been determined, by employing the point-searching algorithm with the idea of dichotomy, all the cutter contact （CC） points and cutter location （CL） points can be found and the clean-up boundaries can also be defined rapidly. Then the tool path is generated. Based on the main concept of pencil-cut, a multilayer fillet-cut method is proposed, which utilizes a ball-end cutter with its radius less than the design radius of clean-up region. Using a sequence of intermediate virtual cutters to divide the clean-up region into several layers and given a cusp-height tolerance for the final layer, then the tool paths for all layers are calculated. Finally, computer implementation is also presented in this paper, and the result shows that the proposed method is feasible.展开更多
为解决搜爆人员在爆炸装置搜索训练过程中,真实训练环境搭建繁琐、人力与物资成本投入大等问题,在分析搜索爆炸装置训练过程的基础上,设计了一套爆炸装置搜索训练视景仿真系统。该系统通过搜爆场景逐级细化的方法构建虚拟场景,且以具有...为解决搜爆人员在爆炸装置搜索训练过程中,真实训练环境搭建繁琐、人力与物资成本投入大等问题,在分析搜索爆炸装置训练过程的基础上,设计了一套爆炸装置搜索训练视景仿真系统。该系统通过搜爆场景逐级细化的方法构建虚拟场景,且以具有感应能力的三维模型模拟摩尔探测仪与非线性节点探测仪等搜爆工具。基于Open Scene Graph(OSG)图形开发库,以VC++为开发环境实现了爆炸装置搜索训练视景仿真。实践证明:该系统仿真度高,达到了爆炸装置搜索仿真训练的效果,并且运行流畅,沉浸感强。展开更多
In lightweight cryptographic primitives, round functions with only simple operations XOR, modular addition and rotation are widely used nowadays. This kind of ciphers is called ARX ciphers. For ARX ciphers, impossible...In lightweight cryptographic primitives, round functions with only simple operations XOR, modular addition and rotation are widely used nowadays. This kind of ciphers is called ARX ciphers. For ARX ciphers, impossible differential cryptanalysis and zero-correlation linear cryptanalysis are among the most powerful attacks, and the key problems for these two attacks are discovering more and longer impossible differentials(IDs) and zero-correlation linear hulls(ZCLHs). However, finding new IDs and ZCLHs for ARX ciphers has been a manual work for a long time, which has been an obstacle in improving these two attacks. This paper proposes an automatic search method to improve the efficiency of finding new IDs and ZCLHs for ARX ciphers. In order to prove the efficiency of this new tool, we take HIGHT, LEA, SPECK three typical ARX algorithms as examples to explore their longer and new impossible differentials and zero-correlation linear hulls. To the best of our knowledge, this is the first application of automatic search method for ARX ciphers on finding new IDs and ZCLHs. For HIGHT, we find more 17 round IDs and multiple 17 round ZCLHs. This is the first discovery of 17 round ZCLHs for HIGHT. For LEA, we find extra four 10 round IDs and several 9 round ZCLHs. In the specification of LEA, the designers just identified three 10 round IDs and one 7round ZCLH. For SPECK, we find thousands of 6 round IDs and forty-four 6 round ZCLHs. Neither IDs nor ZCLHs of SPECK has been proposed before. The successful application of our new tool shows great potential in improving the impossible differential cryptanalysis and zero-correlation linear cryptanalysis on ARX ciphers..展开更多
基金National Natural Science Foundation of China （51005183） National Science and Technology Major Project （2011X04016-031）
文摘Machining quality of clean-up region has a strong influence on the performances of the impeller. In order to plan clean-up tool paths rapidly and obtain good finish surface quality, an efficient and robust tool path generation method is presented, which employs an approach based on point-searching. The clean-up machining mentioned in this paper is pencil-cut and multilayer fillet-cut for a free-form model with a ball-end cutter. For pencil-cut, the cutter center position can be determined via judging whether it satisfies the distance requirement. After the searching direction and the tracing direction have been determined, by employing the point-searching algorithm with the idea of dichotomy, all the cutter contact （CC） points and cutter location （CL） points can be found and the clean-up boundaries can also be defined rapidly. Then the tool path is generated. Based on the main concept of pencil-cut, a multilayer fillet-cut method is proposed, which utilizes a ball-end cutter with its radius less than the design radius of clean-up region. Using a sequence of intermediate virtual cutters to divide the clean-up region into several layers and given a cusp-height tolerance for the final layer, then the tool paths for all layers are calculated. Finally, computer implementation is also presented in this paper, and the result shows that the proposed method is feasible.
文摘为解决搜爆人员在爆炸装置搜索训练过程中,真实训练环境搭建繁琐、人力与物资成本投入大等问题,在分析搜索爆炸装置训练过程的基础上,设计了一套爆炸装置搜索训练视景仿真系统。该系统通过搜爆场景逐级细化的方法构建虚拟场景,且以具有感应能力的三维模型模拟摩尔探测仪与非线性节点探测仪等搜爆工具。基于Open Scene Graph(OSG)图形开发库,以VC++为开发环境实现了爆炸装置搜索训练视景仿真。实践证明:该系统仿真度高,达到了爆炸装置搜索仿真训练的效果,并且运行流畅,沉浸感强。
基金supported by the National Natural Science Foundation of China under Grant No. 61572516, 61402523, 61202491, 61272041 and 61272488
文摘In lightweight cryptographic primitives, round functions with only simple operations XOR, modular addition and rotation are widely used nowadays. This kind of ciphers is called ARX ciphers. For ARX ciphers, impossible differential cryptanalysis and zero-correlation linear cryptanalysis are among the most powerful attacks, and the key problems for these two attacks are discovering more and longer impossible differentials(IDs) and zero-correlation linear hulls(ZCLHs). However, finding new IDs and ZCLHs for ARX ciphers has been a manual work for a long time, which has been an obstacle in improving these two attacks. This paper proposes an automatic search method to improve the efficiency of finding new IDs and ZCLHs for ARX ciphers. In order to prove the efficiency of this new tool, we take HIGHT, LEA, SPECK three typical ARX algorithms as examples to explore their longer and new impossible differentials and zero-correlation linear hulls. To the best of our knowledge, this is the first application of automatic search method for ARX ciphers on finding new IDs and ZCLHs. For HIGHT, we find more 17 round IDs and multiple 17 round ZCLHs. This is the first discovery of 17 round ZCLHs for HIGHT. For LEA, we find extra four 10 round IDs and several 9 round ZCLHs. In the specification of LEA, the designers just identified three 10 round IDs and one 7round ZCLH. For SPECK, we find thousands of 6 round IDs and forty-four 6 round ZCLHs. Neither IDs nor ZCLHs of SPECK has been proposed before. The successful application of our new tool shows great potential in improving the impossible differential cryptanalysis and zero-correlation linear cryptanalysis on ARX ciphers..
