Search

Uncorrelated Linear Discriminant Analysis (U-LDA) which seeks a set of statistically uncorrelated discriminant vectors has been pursued by many researchers in the field of face recognition. Unfortunately, it has two inborn deficiencies. First, it provides little new knowledge in addition to conventional LDA since discriminant vectors of Fisher Linear Discriminant are usually statistically uncorrelated. Second, it is based on an unreliable intuition that removal of statistical correlation between discriminant vectors is favorable for pattern recognition. From experimental studies conducted in the paper we found that U-LDA methods could be significantly inferior to their orthogonal counterparts in face recognition. Our work implies that U-LDA methods might be futureless in face recognition.

A new routing algorithm applicable for client network of Wireless Mesh Network (WMN), called hybrid maintenance routing (HMR), is presented. WMN share common features with ad hoc networks, the routing protocols developed for ad hoc networks can be applied to WMN. Based on DSR (dynamic source routing), HMR applies multi-path routing to improve the routing fault tolerance of client networks of WMN. Route maintenance has been the main area of protocol in ad hoc network. There are two kinds of approach for route maintenance, the proactive routing maintenance and the on-demand reactive routing maintenance. A hybrid maintenance approach which combines the proactive routing maintenance and the reactive routing maintenance will improve the validity of multi-path without increasing too much overhead.

In this paper, we models autonomous adaptive agents after several ecological concepts and mechanisms. We have concentrated on developing an agent-based model for controlling query messages that are represented as agent; the Ecologically Inspired Distributed Search (EIDS), which derives its inspiration from natural ecosystem, is presented.. As an experiment result, we compare its performance against the well-known k-random walker approach. We focus on the problem of actively changing the topology of the P2P network by utilizing Schelling's segregation model to improve the efficiency of search.

In an ad hoc network, QoS support is one of the major concerns. Because of the constant changes of available link state and bandwidth information, the limited node power, and the dynamic network topology, it is difficult for routing algorithms to satisfy the QoS requirements of many applications. In recent study, we proposed CEQoS routing algorithm for ad hoc networks. Taking bandwidth as the QoS parameter, CEQoS uses a node credit model to evaluate the link stability, and uses an energy function to estimate the node power situation. Based on these strategies, CEQoS can support QoS requirement and has better QoS routing performance. In this paper, we give an example to show how CEQoS works.

In this paper, a new routing algorithm applicable for wireless mesh network (WMN) backbone, called hybrid multi-path routing (HMR), is presented. Based on DSR (dynamic source routing), HMR applies multi-path routing to improve the performance and routing fault tolerance of WMN backbone. A hybrid approach which combines the source routing and routing table improves the performance of WMN backbone without incurring too much overhead. HMR have some advantages on fault tolerance, control overhead of transferring data and delay of switching between routes.