Structure of planar integral self‐affine tilings

For a self‐affine tile in $\mathbf {R}^2$ generated by an expanding matrix $A\in M_2(\mathbf {Z})$ and an integral consecutive collinear digit set ${\mathcal D}$, Leung and Lau [Trans. Amer. Math. Soc. 359 , 3337–3355 (2007).] provided a necessary and sufficient algebraic condition for it to be disklike. They also characterized the neighborhood structure of all disklike tiles in terms of the algebraic data A and ${\mathcal D}$. In this paper, we completely characterize the neighborhood structure of those non‐disklike tiles. While disklike tiles can only have either six or eight edge or vertex neighbors, non‐disklike tiles have much richer neighborhood structure. In particular, other than a finite set, a Cantor set, or a set containing a nontrivial continuum, neighbors can intersect in a union of a Cantor set and a countable set.     

The Home Care Crew Scheduling Problem: Preference-based visit clustering and temporal dependencies

In the Home Care Crew Scheduling Problem a staff of home carers has to be assigned a number of visits to patients’ homes, such that the overall service level is maximised. The problem is a generalisation of the vehicle routing problem with time windows. Required travel time between visits and time windows of the visits must be respected. The challenge when assigning visits to home carers lies in the existence of soft preference constraints and in temporal dependencies between the start times of visits.     

Degradative encryption: An efficient way to protect SPIHT compressed images

Degradative encryption, a new selective image encryption paradigm, is proposed to encrypt only a small part of image data to make the detail blurred but keep the skeleton discernible. The efficiency is further optimized by combining compression and encryption. A format-compliant degradative encryption algorithm based on set partitioning in hierarchical trees (SPIHT) is then proposed, and the scheme is designed to work in progressive mode for gaining a tradeoff between efficiency and security. Extensive experiments are conducted to evaluate the strength and efficiency of the scheme, and it is found that less than 10% data need to be encrypted for a secure degradation. In security analysis, the scheme is verified to be immune to cryptographic attacks as well as those adversaries utilizing image processing techniques. The scheme can find its wide applications in online try-and-buy service on mobile devices, searchable multimedia encryption in cloud computing, etc.     

覆盖粗糙集模型增值算子及其性质

为了给不断发生变化的数据库的知识发现提供新的数学工具,本文引进覆盖粗糙集模型的确定增值算子ZX(Y)和不确定增值算子ZX(Y),并讨论了它们的有关性质,即通过研究两个新集合hX(x)、lX(x)的性质(定理2.1和定理2.2),给出并证明了两个增值算子的性质(定理2.3和定理2.4)。     

几类广义模糊集的关系

经过近五十年的发展,模糊集在理论与应用两个领域的研究都已经取得长足的进展,特别地,在模糊决策等应用领域,涌现了几类重要的广义模糊集,包括区间值模糊集,直觉模糊集,区间值直觉模糊集,II型模糊集,Vague集,灰集等。本文简要介绍关于这些广义模糊集之间关系的研究成果,以及国外关于直觉模糊集术语问题的争议。     

基于区间数度量的区间值模糊集合的归一化距离、相似度、模糊度和包含度的关系研究

区间值模糊集合的距离、相似度、模糊度和包含度及其关系研究是区间值模糊集合的一个研究热点.考虑到区间值模糊集合所表示信息的丰富性,本文使用区间数而非实数来刻画区间值模糊集合的距离,首先给出基于区间数度量的区间值模糊集合的归一化距离的公理化定义,然后通过五个定理详细研究了基于公理化定义的区间值模糊集合的归一化距离、相似度、模糊度和包含度之间的相互转换关系,最后,给出了若干公式来计算基于区间数度量的区间值模糊集合的相似度、模糊度和包含度.这些结论,一方面丰富了区间值模糊集合的信息测度(距离、相似度、模糊度和包含度)的内容,另一方面也为区间值模糊集合的近似推理、决策分析、模式识别等领域的应用提供了新方法和新理论.     

用Level Set方法求解具有自由面的流动问题

为采用Ｌｅｖｅｌ Ｓｅｔ方法来计算有自由的流动问题提出了一种方案,把自由水面视为水和空气的交界面,两种介质用统一的Ｎ－Ｓ方法求解,在自由面两侧分别采用各自的密度和粘性,并在自由面上给以适当的光滑;采用边界元法求解双调和方程来确定距离函数;Ｎ－Ｓ方程用投影法求解,文中给出了二维水池水面振荡和瞬时溃坝问题的算例,可以看出用ＬｅｖｅｌＳｅｔ方法求解有自由面流动问题是有效的。     

用Level Set算法模拟孤立波与前台阶的相互作用

进一步研究了Level Set方法的数学基础,研究了求解有自由水面水动力学问题的具体方法。并在此基础上,对孤立波与前台阶相互作用这一问题进行了计算及研究,取得了与实验结果相符合的计算结果。     

单谷Feigenbaum映射的拟极限集

给出了单谷Feigenbaum映射拟极限集的结构以及它的准确的Hausdorff维数的关系式。     

模糊(左,右)理想格的结构

本文利用截集和集合套理论研究模糊（左,右）理想格的结构。证明了环Ｒ的模糊（左,右）理想格是模格,并给出了这类格中并ＨＶＫ的构造。