This paper proposes a speckle image recognition method using data mining techniques to ensure speckle identification system feasible for authentication. This is an interdisciplinary method that integrates the researches of optics, data mining, and image processing. Because objects have unique but imperfect surfaces, their laser speckle is capable of providing suitable identifiable features for authentication. In our method, matching points among speckle images acquired from one plastic card are extracted by scale-invariant feature transform (SIFT). The spatial relations among the matching points are then transformed to 9 direction lower triangular (9DLT) representations. Then, the Apriori algorithm mines frequent patterns so a useful association rule is obtained as the feature to identify the similarity between each of the speckle images for the purpose of authenticity verification. The proposed method is especially robust in the cases of card displacement and luminance change resulted from laser attenuation. Experimental results show that the proposed method has promising results and outperforms existing methods in identification accuracy.

Discovering frequent patterns from huge amounts of data is one of the most studied problems in data mining. However, some sensitive patterns with security policies may cause a threat to privacy. We investigate to find an appropriate balance between a need for privacy and information discovery on frequent patterns. By multiplying the original database and a sanitization matrix together, a sanitized database with privacy concerns is obtained. Additionally, a probability policy is proposed to against the recovery of sensitive patterns and reduces the modifications of the sanitized database. A set of experiments is also performed to show the benefit of our work.

Data mining techniques have been developed in many applications. However it also causes a threat to privacy. We investigate to find an appropriate balance between a need for privacy and information discovery on association patterns. We propose an innovative technique for hiding sensitive patterns. In our approach, a sanitization matrix is defined. By multiplying the original transaction database and the sanitization matrix, a new database, which is sanitized for privacy concern, is described. Moreover a set of experiments is performed to show the effectiveness of our approach.

Partial periodic patterns mining is a very interesting domain in data mining problem. In the previous studies, full and partial multiple periodic patterns mining problems are considered. The proposed methods, however, may produce redundant information and are inefficient. In this paper, a novel concept and new parameters are proposed to improve the performance of partial multiple periodic patterns mining. Instead of considering the whole database, the information needed for mining partial periodic patterns is transformed into a bit vector which can be stored in a main memory. A set of simulations is also performed to show the benefit of our approach.

Mobility management and quality-of-service (QoS) provisioning are the important tasks on the future development of wireless networks. The high host mobility makes these tasks more challenging. In this paper, we propose an architecture which supports both mobility and QoS management in Internet protocol (IP)-based wireless networks. In mobility management, the fast handoff, which the packets are forwarded in advance to the neighboring locations where a mobile node (MN) may move to, is provided to reduce the service disruption. Also, the fast location lookup, which the routing information about a MN is replicated to some routers, is provided to avoid the triangular routing problem incurred by the protocol of mobile IP. In QoS provisioning, we enable the end-to-end QoS guarantee by using the resource reservation protocol (RSVP) signaling. In particular, the RSVP aggregation technique is used to avoid the scalability problem. Also, the technique of passive resource reservation is used to reduce the influence of host mobility on the resource reservation delay. We emphasize the integration of mobility and QoS management in the architecture design. A performance analysis is given to justify the benefits of our proposed architecture.

To expand support for applications with QoS requirements in wireless local area networks (WLANs), the 802.11 E Task Group was formed to enhance the current IEEE 802.11 Medium Access Control (MAC) protocol. The multipolling mechanism was discussed in the task group, but some problems remain unsolved. In this paper, we show a design of the multipolling mechanism with the advantages of high channel utilization and low implementation overhead. In our proposed mechanism, wireless stations use a priority-based contention scheme to coordinate in themselves the transmission order on the channel. Moreover, we propose a polling schedule mechanism for our proposed multipoll to serve real-time traffic with constant and variable bit rates. The bounded delay requirement of the real-time traffic can be satisfied in our scheduling model. We establish an admission test to estimate the system capacity and to determine whether a new connection can be accepted. We study the performance of our proposed mechanism analytically, as well as through simulated experiments. The results show that the proposed mechanism is more efficient than the one discussed in the IEEE 802.11 E task group.

The problem of transmitting data items with timing constraint in the multiple broadcast channels where clients equipped with multiple receivers is studied. In our approach, the data items are divided into two sets, the broadcast data set and the on-demand data set. The data items in the broadcast data set is periodically broadcast on the broadcast channels while the data items in the on-demand data set are transmitted when they are requested. The server offline allocates the data items in the broadcast data set to the multiple broadcast channels. The clients retrieved data items from the broadcast channels are guaranteed to receive them within the timing constraint. Once the desired data item is not included in the broadcast channels, clients make requests associated with deadlines to the server. By using the bandwidth remaining for the on-demand mode, the server broadcasts the requested data items in an online fashion. The intention of our work is to serve as many requests as possible.

In a wireless environment, the bandwidth of the channels and the energy of the portable devices are limited. Data broadcast has become an excellent method for efficient data dissemination. In this paper the problem for generating a broadcast program of a set of data items with the associated access frequencies on multiple channels is explored. In our approach, we consider allocating index information and data items on multiple broadcast channels by extending the distributed indexing approach. Moreover global data replication and local data allocation are performed to improve the average access time of all data items. Simulation is performed to compare the performance of our approach with an existing approach. The result of the experiments shows that our approach outperforms the existing approach.

Many approaches have been proposed to schedule data items for broadcasting in a mobile environment. However, the issues of accessing multiple data items on the broadcast channel are less discussed. In this paper, an efficient strategy for accessing multiple data items in mobile environments is proposed. Two issues are investigated in this paper, that is, deciding the content of the broadcast channel based on the queries from the clients, and scheduling the data items to be broadcast. Experiments are performed to compare our proposed methods for deciding the content and to show that our data scheduling methods can reduce the average access time without considerable increase on processing time.

Data broadcast is an excellent method for efficient data dissemination in the mobile computing environment. The application domain of data broadcast will be widely expanded in the near future, where the client is expected to perform complex queries or transactions on the broadcast data. To reduce the access latency for processing the complex query, it is beneficial to place the data accessed in a query close to each other on the broadcast channel. In this paper, we propose an efficient algorithm to determine the allocation of the data on the broadcast channel such that frequently co-accessed data are not only allocated close to each other, but also in a particular order which optimizes the performance of query processing. Our mechanism is based on the well-known problem named optimal linear ordering. Experiments are performed to justify the benefit of our approach.

In a wireless environment, the bandwidth of the channels and the energy of the portable devices are limited. Data broadcast has become an excellent method for efficient data dissemination. In this paper, the problem for generating a broadcast program of a set of data items with the associated access frequencies on multiple channels is explored. In our approach, an expected average access time of the broadcast data items is first derived. The broadcast program is then generated, which minimizes the expected average access time. Simulation is performed to compare the performance of our approach with two existing approaches. The result of the experiments shows that our approach outperforms others and is in fact close to the optimal.