建筑制图标准中图形符号适宜性、区分性的研究

应用线段长短、间距大小视觉反应的量化规律，提出设计图形符号大小的原则——既更使其大小满足“长”“短”“大”“小”的心理要求，又要互相之间在大小上有区分性。根据图形组织的相似、接近、连续三原则提出设计图形符号形状的原则——图形符号之间尽量减少相似、接近、连续，以保证较好的区分性。通过分析发现，现行建筑制图标准中的图形符号绝大部分在大小和形状具有适宜性、区分性。     

四方连续式面料图案的自动生成算法

提出了自动合成四方连续面料图案的数学模型;介绍了人机交互色彩调配算法;从数学模型、色彩处理、应用前景库三方面对有关设计思想和实现方法作了详细说明.     

Dyadic perfectionism as a predictor of relationship continuity and distress among college students.

This study examined the nature and impact of dyadic perfectionism over a 3-month interval within a sample of 116 college students who were currently involved in an intimate heterosexual relationship. Dyadic perfectionism scores were stable and correlated as expected with scores on concurrent measures of adult attachment orientations and relationship satisfaction. Logistic regression analyses revealed that, controlling for initial commitment status and adult attachment orientations, Time 1 dyadic perfectionism scores significantly and uniquely predicted relationship continuity 3 months later. Lastly, controlling for social desirability, relationship commitment status, and Time 1 adult attachment orientation scores, Time 1 dyadic perfectionism scores also uniquely predicted Time 2 relationship distress. Findings provide additional evidence that dyadic perfectionism is a risk factor for relationship dysfunction. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

显式BEZIER三角曲面的构造及其在离散数据插值中的应用

本文较系统地讨论了显式Bezier三角曲面的Clough-Tocher分割构造方法，并从工程应用角度提出了一种准C‘连续的Bezier三角曲面。由这种准C‘连续的Bezier三角曲面，通过进一步求解整体C‘连续的Bezier三角曲面在解决3D离散数据的曲面插值中取得了较好的应用效果。     

多元函数可微性的一个注记

给出了Henle定理的简单证明，并指出该定理在n≥3时不再成立，进而又给出了一个当n≥3时，函数z=f(x1，x2，…，xn)在点M0可微的定理及其证明。     

Context-aware adaptive IP mobility anchoring

The novel distributed mobility management trend is a promising direction to cope with the increasing mobile data traffic and flatten network architectures. Most of the novel mobility approaches distribute the mobility anchors through the access level, as opposed to the centralized mobility anchoring model. Other recent approaches argue that mobility anchors closer to the content servers may be the solution to optimize the mobility performance. However, none of the mobility anchoring models is ideal for all scenarios, since it depends on the user, the session and the network. Hence, we propose an IP mobility approach driven by the context of the user, sessions and the network, where the mobility anchors for IP address allocation and for routing/forwarding are distributed through the network nodes, while the mobility context is managed by the mobile devices. Although each session is properly anchored in the establishment phase, the routing/forwarding is adapted over time, according to the user, the session and the network context: the proposed approach is able to signal different mobility anchors to optimize the routing path to new and ongoing sessions of the user. The outcome of the evaluation shows that the proposed approach overall reduces the data cost, the data delay, the tunneled packets and the tunnel length, when compared with other anchoring models.     

图的b-边染色数及b-边连续性研究

图染色及色数问题是图论中的一个重要内容,也是图论中的一个十分活跃的领域,同时有着深刻而丰富的理论结果和广泛的实际应用,其理论和方法在离散数学中占有重要地位.本文在图的b-染色数和b-连续概念的基础上提出图的b-边染色数及b-边连续的概念,给出了路图、圈图以及满n叉树图的b-边染色数,并且证明了这些图都是b-边连续的.     

改进相位一致的岩心图像裂缝提取方法

针对传统相位一致算法提取裂缝连续性差的缺点,提出改进的相位一致算法.首先对岩心图像进行预提取,增大目标和背景区域的对比度,并标记疑似目标像素点;然后,利用双圆投影断点检测算子判定并重建岩心图像裂缝中的断点;最后利用相位一致算法延伸裂缝走向的特性,再次对岩心图像中的裂缝目标进行提取,并进行图像去噪处理.实验结果表明,改进后的相位一致算法,能够保留提取效果不受光照亮度影响、对目标区域敏感度高的传统相位一致算法的优点,并且有效改善所提取裂缝的连续性.     

Dealing with Process Overload Attacks in UNIX

ABTRACT

A process overload attack is an attack on a shared computer system in which a user repeatedly forks new processes and hence makes the system unusable for others. The specific problem we address is seen in an academic environment where student programs create unintentional process overload attacks in UNIX systems by careless coding. Instead of rebooting the system or manually examining and killing the processes, our approach to dealing with these attacks was to build a process load monitoring tool to detect and kill these processes automatically. This paper focuses on what we learned about the behaviors of different fork bombs, how we classified them based on their self-replicating capabilities, and our experience with detecting, killing and cleaning these unwanted processes.