一种新的基于小波变换的掌纹图像去噪算法

掌纹图像去噪是基于掌纹的身份鉴别技术的第一步.本文提出了一种新的基于小波变换的掌纹图像去噪算法,并通过实验验证了此算法对掌纹图像去噪的有效性.     

空间离群点的模型与跳跃取样查找算法

目前无论是查找一般的离群点，还是空间离群点，都强调非空间属性的偏离，但在图像处理、基于位置的服务等许多应用领域，空间与非空间属性要综合考虑。为此，首先提出了一个综合考虑两者的空间离群点定义，然后提出了一种新的基于密度的空间离群点查找方法——基于密度的跳跃取样空间离群点查找算法DBSODLS。由于已有的基于密度的离群点查找方法对每一点都要求进行邻域查询计算，故查找效率低，而该算法由于可充分利用已知的邻居信息，即不必计算所有点的邻域，从而能快速找到空间离群点。分析与试验结果表明，该算法时间性能明显优于目前已有的基于密度的算法。     

基于邻域系统的决策表近似算法

提出一种基于邻域系统的决策表近似算法，用于数据挖掘预处理阶段的数据压缩。该方法以代表元素代替若干相近元素，有效地压缩了原始决策表的对象个数，同时保证决策表本身的判断能力基本不变。对本算法与聚类算法的关系进行了讨论，指出文中提出的近似算法所完成的功能不能用聚类算法替代。     

一种利用图像邻域信息进行边界光滑的纹理识别的方法

在传统纹理识别方法中，纹理识别是对图像分块进行的，因此得到的纹理边界不光滑，同时呈现明显的分块痕迹。一种充分利用图像邻域信息的“相关度计算”方法，通过计算包含象素点的所有图像分块被识别的概率，来判断象素点是否被识别。结果表明，“相关度计算”方法可以得到相对光滑的纹理边界。     

三维离散单元法数值模拟中查找邻居元的一种新算法

将三维离散单元法(DEM)运用到模拟泥石流运动的计算中时，发现查找邻居元耗费大量时间和空间。为了克服缺点，文中提出了一种新的算法——链树图法，并对其原理、算法、运行时间和空间进行分析。通过与原算法盒子空间法的比较表明，新算法在运行时间和空间都明显优于原算法。     

Fast Hybrid Approach for Texturing Point Models

We present three methods for texturing point models from sample textures. The first method, the point parameterization method, uses a fast distortion‐bounded parameterization algorithm to flatten the point model's surface into one or more 2D patches. The sample texture is mapped onto these patches and alpha blending is used to minimize the discontinuity in the gaps between the patches. The second method is based on neighborhood matching where a color is assigned to each point by searching the best match within an irregular neighborhood. The hybrid method combines the former two methods, capitalizing on the advantages of both. The point parameterization method is used first to color most of the points, and the point neighborhood‐matching method is then applied to the points belonging to the gaps between the parameterized patches to minimize the discontinuity. We opt for fast texture generation, while some discontinuities may appear in the gaps of anisotropic textures.     

Neighborhood Cohesion as a Buffer Against Hostile Maternal Parenting.

This study explored the moderating effects of children's neighborhoods on the link between hostile parenting and externalizing behavior. Participants were 1st- or 2nd-grade children in an urban northeastern community. Children were administered the Parenting and Neighborhood scales of the Child Puppet Interview, and mothers completed questionnaires on neighborhood quality and parenting practices. Census tract measures of neighborhood quality and teachers' reports of children's externalizing behavior also were obtained. Results indicated that children's and mothers' perceptions of neighborhood involvement-cohesion buffered the link between hostile parenting and externalizing problems. Children's externalizing behavior was unrelated to census tract variables. Findings highlight the protective effect of neighborhood social cohesion and the utility of including young children's perspectives in research on neighborhoods and families. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Developing a dynamic neighborhood structure for an adaptive hybrid simulated annealing – tabu search algorithm to solve the symmetrical traveling salesman problem

This paper applies a hybrid simulated annealing – tabu search algorithm to solve the Traveling Salesman Problem (TSP). Fully considering the characteristics of the hybrid algorithm, we develop a dynamic neighborhood structure for the hybrid algorithm to improve search efficiency by reducing the randomness of the conventional 2-opt neighborhood. A circle-directed mutation is developed to achieve this dynamic neighborhood structure. Furthermore, we propose adaptive parameters that can be automatically adjusted by the algorithm based on context specific examples. This negates the need to frequently readjust algorithm parameters. We employ benchmarks obtained from TSPLIB (a library of sample instances for the TSP) to test our algorithm, and find that the proposed algorithm can obtain satisfactory solutions within a reasonable amount of time. The experimental results demonstrate that the proposed hybrid algorithm can overcome the disadvantages of traditional simulated annealing and tabu search methods. The results also show that the dynamic neighborhood structure is more efficient and accurate than the classical 2-opt. Also, adaptive parameters are appropriate for almost all of the numerical examples tested in this paper. Finally, the experimental results are compared with those of other algorithms, to demonstrate the improved accuracy and efficiency of the proposed algorithm.     

A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows

This paper presents a new hybrid variable neighborhood-tabu search heuristic for the Vehicle Routing Problem with Multiple Time windows. It also proposes a minimum backward time slack algorithm applicable to a multiple time windows environment. This algorithm records the minimum waiting time and the minimum delay during route generation and adjusts the arrival and departure times backward. The implementation of the proposed heuristic is compared to an ant colony heuristic on benchmark instances involving multiple time windows. Computational results on newly generated instances are provided.     

Distillation separation sequence optimization synthesis based on application of adaptive parallel tabu search

Abstract

Distillation separation sequences can be described as binary tree data structures, because of the analogous structures of distillation separation sequences and binary trees, and then by applying graph theory, the change mechanism of neighborhood separation points based on binary trees is built, correspondingly a kind of highly effective, evolutionary neighborhood structure is constructed. For the purpose of researching further tabu search algorithms, adaptive mechanisms and parallel techniques are introduced. That is, according to memory frequency information, the tabu length and the number of candidates are adaptively adjusted, and multitask parallel technology is realized through the arrangement of the search assignments. The example shows that adaptive parallel tabu searches can solve, successfully, large‐scale distillation separation sequence synthesis problems.