Key-dependent side-channel cube attack on CRAFT

CRAFT is a tweakable block cipher introduced in 2019 that aims to provide strong protection against differential fault analysis. In this paper, we show that CRAFT is vulnerable to side-channel cube attacks. We apply side-channel cube attacks to CRAFT with the Hamming weight leakage assumption. We found that the first half of the secret key can be recovered from the Hamming weight leakage after the first round. Next, using the recovered key bits, we continue our attack to recover the second half of the secret key. We show that the set of equations that are solvable varies depending on the value of the key bits. Our result shows that 99.90% of the key space can be fully recovered within a practical time.     

空间数据立方体的物化视图选择方法研究

针对决策支持系统(DSS)中集成空间分析能力的应用趋势，研究基于空间数据仓库的一种决策分析工具——空间在线分析处理(Spatial OLAP)，拟解决影响空间OLAP在线响应的瓶颈难点——空间数据立方体的物化问题。首先系统地提出空间OLAP的模型，然后对现有空间度量物化视图选择方法进行改进，提出了双向空间Greedy算法。实验证明．该算法在降低选择时间和求解质量两方面具有更好的表现。     

制冷空调用铜管质量标准现状

本文介绍了我国制冷空调用铜管的质量标准:GB/T17791-1999《空调与制冷用无缝铜管》、YS/T440-2001《内螺纹铜管》、GB/T1531-1994《铜及铜合金毛细管》以及《冰箱用高清洁度铜管》和《铜及铜合金无缝翅片管》的制订背景,分析了标准水平,提出了制冷空调用铜管在满足标准的同时,还要加强实物质量的提升。     

改进的第三代相干算法及应用

在讨论相干技术发展及三代相干算法优缺点的基础上，介绍了改进的第三代相干算法。应用自行开发的相干软件对多个油气勘探和开发区块的三维地震资料进行处理、分析，对相干时窗长度、相关道数等参数对算法效果的影响及相干体对断层、异常地质体的识别，以及解释方法进行了探讨。应用实例证明，改进的第三代相干算法抗干扰能力强，横向分辨率高，不仅适用于倾斜地层，而且对断层尤其对小断层、异常地质体具有较高的检测能力，是油气勘探和开发的一项有效和实用的技术。     

Chromaticity contour map of the RGB cube: A simple algorithm

A simple algorithm (amenable to spreadsheets) is described for plotting a luminance contour map of the color gamut of an additive‐primary display given the chromaticities of its primaries and screen white. Each contour of the plot represents (in either r,g or x,y coordinates) the polygon of intersection of the RGB cube with a plane of constant Y. Each vertex on a contour is an intersection of 1 of the 12 edges of the RGB cube with the constant‐Y plane. Feasibility of an edge as a vertex of the polygon is tested through comparison of the computed r,g coordinates with functions of the luminosity coefficients of the primaries. By ordering the RGB‐cube edges in a particular way prior to scanning them for feasibility, one is guaranteed to retrieve the vertices of any constant‐Y polygon in convex order. This fact facilitates plotting of the polygons.     

Growth of CeO_2, Y_2O_3 Buffer Layers for YBCO Coated Conductor

~~Growth of CeO_2, Y_2O_3 Buffer Layers for YBCO Coated Conductor     

Fast Recognition of Fibonacci Cubes

Fibonacci cubes are induced subgraphs of hypercubes based on Fibonacci strings. They were introduced to represent interconnection networks as an alternative to the hypercube networks. We derive a characterization of Fibonacci cubes founded on the concept of resonance graphs. The characterization is the basis for an algorithm which recognizes these graphs in O(mlog n) time. A. Vesel supported by the Ministry of Science of Slovenia under the grant 0101-P-297.     

基于Logistic混沌系统与魔方变换的图像加密方案

设计了一种基于Logistic映射与魔方变换的图像加密方案。该方案采用改进的混沌序列二值化方法,并借用魔方变换的思想,将二值序列转换所得的整数序列与图像像素值运算后,对图像的行列分别作循环移位完成对图像的加密。实验结果分析表明,该加密方案具有良好的图像加密效果,对于常见的攻击具有较强的抗干扰能力。     

MC算法在医学图像三维重建中的应用

详细介绍了MC算法,提出了优化网格模型简化算法。优化网格模型简化算法选取坐标点的原则是,尽可能地接近原始网格,通常采用子集选择法或优化选择法。在尽可能保证图像精度的前提下,优化网格模型简化算法可以提高运算速度,而单纯的网格算法由于失真严重而缺乏实用价值。基于体绘制的网格化简化算法重建的三维模型比较完全,且算法简单,在多排螺旋CT等医学图像三维重建中有较好的应用。     

SVM-based ontology matching approach

There are a lot of heterogeneous ontologies in semantic web, and the task of ontology mapping is to find their semantic relationship. There are integrated methods that only simply combine the similarity values which are used in current multi-strategy ontology mapping. The semantic information is not included in them and a lot of manual intervention is also needed, so it leads to that some factual mapping relations are missed. Addressing this issue, the work presented in this paper puts forward an ontology matching approach, which uses multi-strategy mapping technique to carry on similarity iterative computation and explores both linguistic and structural similarity. Our approach takes different similarities into one whole, as a similarity cube. By cutting operation, similarity vectors are obtained, which form the similarity space, and by this way, mapping discovery can be converted into binary classification. Support vector machine (SVM) has good generalization ability and can obtain best compromise between complexity of model and learning capability when solving small samples and the nonlinear problem. Because of the said reason, we employ SVM in our approach. For making full use of the information of ontology, our implementation and experimental results used a common dataset to demonstrate the effectiveness of the mapping approach. It ensures the recall ration while improving the quality of mapping results.