局域网环境下利用DHCP欺骗技术实现DNS劫持攻击

利用DHCP协议的缺陷,实现对局域网计算机的DNS劫持攻击,并给出将此类攻击应用于网站钓鱼的实现方法,旨在引起人们对局域网安全问题的重视。     

Face recognition using adaptively weighted patch PZM array from a single exemplar image per person

Though numerous approaches have been proposed for face recognition, little attention is given to the moment-based face recognition techniques. In this paper we propose a novel face recognition approach based on adaptively weighted patch pseudo Zernike moment array (AWPPZMA) when only one exemplar image per person is available. In this approach, a face image is represented as an array of patch pseudo Zernike moments (PPZM) extracted from a partitioned face image containing moment information of local areas instead of global information of a face. An adaptively weighting scheme is used to assign proper weights to each PPZM to adjust the contribution of each local area of a face in terms of the quantity of identity information that a patch contains and the likelihood of a patch is occluded. An extensive experimental investigation is conducted using AR and Yale face databases covering face recognition under controlled/ideal conditions, different illumination conditions, different facial expressions and partial occlusion. The system performance is compared with the performance of four benchmark approaches. The encouraging experimental results demonstrate that moments can be used for face recognition and patch-based moment array provides a novel way for face representation and recognition in single model databases.     

Locally linear reconstruction for instance-based learning

Instance-based learning (IBL), so called memory-based reasoning (MBR), is a commonly used non-parametric learning algorithm. k-nearest neighbor (k-NN) learning is the most popular realization of IBL. Due to its usability and adaptability, k-NN has been successfully applied to a wide range of applications. However, in practice, one has to set important model parameters only empirically: the number of neighbors (k) and weights to those neighbors. In this paper, we propose structured ways to set these parameters, based on locally linear reconstruction (LLR). We then employed sequential minimal optimization (SMO) for solving quadratic programming step involved in LLR for classification to reduce the computational complexity. Experimental results from 11 classification and eight regression tasks were promising enough to merit further investigation: not only did LLR outperform the conventional weight allocation methods without much additional computational cost, but also LLR was found to be robust to the change of k.     

Using local transition probability models in Markov random fields for forest change detection

Change detection based on the comparison of independently classified images (i.e. post-classification comparison) is well-known to be negatively affected by classification errors of individual maps. Incorporating spatial-temporal contextual information in the classification helps to reduce the classification errors, thus improving change detection results. In this paper, spatial-temporal Markov Random Fields (MRF) models were used to integrate spatial-temporal information with spectral information for multi-temporal classification in an attempt to mitigate the impacts of classification errors on change detection. One important component in spatial-temporal MRF models is the specification of transition probabilities. Traditionally, a global transition probability model is used that assumes spatial stationarity of transition probabilities across an image scene, which may be invalid if areas have varying transition probabilities. By relaxing the stationarity assumption, we developed two local transition probability models to make the transition model locally adaptive to spatially varying transition probabilities. The first model called locally adjusted global transition model adapts to the local variation by multiplying a pixel-wise probability of change with the global transition model. The second model called pixel-wise transition model was developed as a fully local model based on the estimation of the pixel-wise joint probabilities. When applied to the forest change detection in Paraguay, the two local models showed significant improvements in the accuracy of identifying the change from forest to non-forest compared with traditional models. This indicates that the local transition probability models can present temporal information more accurately in change detection algorithms based on spatial-temporal classification of multi-temporal images. The comparison between the two local transition models showed that the fully local model better captured the spatial heterogeneity of the transition probabilities and achieved more stable and consistent results over different regions of a large image scene.     

Fair referee assignments for professional football leagues

Assignment of referees to football games is an important problem faced in professional football leagues. Despite its importance, the problem has received limited academic attention. This paper presents a model and analysis of the problem for fair referee assignments, and develops a constructive heuristic and a local search procedure for its solution. Results from an extensive computational study show that the methods are effective in solving the problem in a second of computation time and yielding an excellent solution quality.     

Classification of face images using local iterated function systems

There has been an increasing interest in face recognition in recent years. Many recognition methods have been developed so far, some very encouraging. A key remaining issue is the existence of variations in the input face image. Today, methods exist that can handle specific image variations. But we are yet to see methods that can be used more effectively in unconstrained situations. This paper presents a method that can handle partial translation, rotation, or scale variations in the input face image. The principal is to automatically identify objects within images using their partial self-similarities. The paper presents two recognition methods which can be used to recognise objects within images. A face recognition system is then presented that is insensitive to limited translation, rotation, or scale variations in the input face image. The performance of the system is evaluated through four experiments. The results show that the system achieves higher recognition rates than those of a number of existing approaches. The author would like to thank the Australian Research Council (ARC) which supports this research with a Discovery Grant.     

一种改进的基音周期提取算法研究

现有的基音周期提取方法在准确度和稳健性上存在一定的局限性,很难准确地提取出信噪比较低的语音信号的周期.针对这一问题,提出一种基于小波变换的基音周期提取改进算法,将TEO(Teager Energy Operator)算子与二进小波变换结合起来,首先进行清浊判定,然后只对浊音帧采取多尺度小波分析提取周期,提出用幅度信息和出现概率信息校正二进小波模极大值间距,从而得到准确的周期.计算机仿真结果表明,与传统方法相比,不仅提高了处理效率,而且具有更高的精确度和稳定性.     

基于人脸几何结构的表情识别

介绍一种利用人脸部几何结构进行表情识别的方法。在对眼睛和嘴巴的12个特征点进行准确提取的基础上,把已经得到的特征点连接起来并以向量的形式表示,称之为特征向量,把欲识别的表情图像的特征向量与已知的中性表情的特征向量进行长度和方向的比较,根据人脸表情在生理结构上的先验知识通过局部表情识别和数据融合来识别表情。     

改进NS2对局域网分布式系统在线仿真的实现

目前大多数仿真系统采用流量发生器等模拟l离散事件的发生,为了充分模拟网络环境中分布式系统各子系统的并发运行和彼此之间依据算法的实时交互,设有虚拟局域网VLAN的IEEE802.1Q协议。提出一种改进NS2模拟局域网分布式系统实际运行的在线仿真的集成方法,将各分布式应用对象移植为NS2的C++扩展对象,执行实际算法,构造一个模拟中心调度对象,管理各分布式对象的并发运行、转发各分布式对象之间的消息交给NS2以模拟其网络延迟,与领域仿真软件交换数据等。对NS2中共享式以太网协议模块改造,添加VLAN802.1Q协议模块,分别实现对交换式局域网和多播报文的模拟。变电站自动化系统的通信网络仿真实验结果,验证了在线仿真方法是有效的、所扩展的NS2模块是正确的。     

基于纹理与灰度协同进化的图像分割算法

为了获得更好的分割效果,成功地将局部二值模式(LBP)纹理模型和灰度特征纳入到合作型协同进化算法(Co-CEA)框架中,并实现了图像分割。 该方法首先分别对LBP纹理模型和灰度特征进行编码,然后运用Co-CEA进行进化操作,最后通过本文提出的联合适应度函数确定分割区域。实验结果表明该方法在分割质量上效果明显,并有效地降低了时间复杂度。