Industrial implementation of controller performance analysis technology

In this paper, a controller performance monitoring technology is introduced with a focus on its industrial implementation and applications. The technology to be introduced in this paper is known as Performance Analysis Toolbox and Solutions (PATS). The main components are discussed, which include data collection, closed-loop systems identification, control valve stiction monitoring, univariate control performance monitoring, multivariate control performance monitoring, model predictive control performance monitoring, etc. It is shown, through a thorough industry case study with various components of PATS, that the integration of the technology provides more convincing diagnosis results and facilitates identification of control improvement opportunities. Some components of the developed technology can be downloaded from the website http://www.ualberta.ca/～bhuang/research/research.htm.     

Filtering Data Streams for Entity-Based Continuous Queries

The idea of allowing query users to relax their correctness requirements in order to improve performance of a data stream management system (e.g., location-based services and sensor networks) has been recently studied. By exploiting the maximum error (or tolerance) allowed in query answers, algorithms for reducing the use of system resources have been developed. In most of these works, however, query tolerance is expressed as a numerical value, which may be difficult to specify. We observe that in many situations, users may not be concerned with the actual value of an answer, but rather which object satisfies a query (e.g., "who is my nearest neighbor?”). In particular, an entity-based query returns only the names of objects that satisfy the query. For these queries, it is possible to specify a tolerance that is "nonvalue-based.” In this paper, we study fraction-based tolerance, a type of nonvalue-based tolerance, where a user specifies the maximum fractions of a query answer that can be false positives and false negatives. We develop fraction-based tolerance for two major classes of entity-based queries: 1) nonrank-based query (e.g., range queries) and 2) rank-based query (e.g., k-nearest-neighbor queries). These definitions provide users with an alternative to specify the maximum tolerance allowed in their answers. We further investigate how these definitions can be exploited in a distributed stream environment. We design adaptive filter algorithms that allow updates be dropped conditionally at the data stream sources without affecting the overall query correctness. Extensive experimental results show that our protocols reduce the use of network and energy resources significantly.     

Two versions of architectures for dynamic implied addressing mode

The complexity of today’s embedded applications increases with various requirements such as execution time, code size or power consumption. To satisfy these requirements for performance, efficient instruction set design is one of the important issues because an instruction customized for specific applications can make better performance than multiple instructions in aspect of fast execution time, decrease of code size, and low power consumption. Limited encoding space, however, does not allow adding application specific and complex instructions freely to the instruction set architecture. To resolve this problem, conventional architectures increases free space for encoding by trimming excessive bits required beyond the fixed word length. This approach however shows severe weakness in terms of the complexity of compiler, code size and execution time. In this paper, we propose a new instruction encoding scheme based on the dynamic implied addressing mode (DIAM) to resolve limited encoding space and side-effect by trimming. We report our two versions of architectures to support our DIAM-based approach. In the first version, we use a special on-chip memory to store extra encoding information. In the second version, we replace the memory by a small on-chip buffer along with a special instruction. We also suggest a code generation algorithm to fully utilize DIAM. In our experiment, the architecture augmented with DIAM shows about 8% code size reduction and 18% speed up on average, as compared to the basic architecture without DIAM.     

Pattern recognition using feature feedback: Application to face recognition

In this paper, we propose a new pattern recognition method using feature feedback and present its application to face recognition. Conventional pattern recognition methods extract the features employed for classification using PCA, LDA and so on. On the other hand, in the proposed method, the extracted features are analyzed in the original space using feature feedback. Using reverse mapping from the extracted features to the original space, we can identify the important part of the original data that affects the classification. In this way, we can modify the data to obtain a higher classification rate, make it more compact or abbreviate the required sensors. To verify the applicability of the proposed method, we apply it to face recognition using the Yale Face Database. Each face image is divided into two parts, the important part and unimportant part, using feature feedback, and the classification performed using the feature mask obtained from feature feedback. Also, we combine face recognition with image compression. The experimental results show that the proposed method works well.     

Multi-objective FMS process planning with various flexibilities using a symbiotic evolutionary algorithm

This paper presents an evolutionary algorithm, called the multi-objective symbiotic evolutionary algorithm (MOSEA), to solve a multi-objective FMS process planning (MFPP) problem with various flexibilities. The MFPP problem simultaneously considers four types of flexibilities related to machine, tool, sequence, and process and takes into account three objectives: balancing the machine workload, minimizing part movements, and minimizing tool changes. The MOSEA is modeled as a two-leveled structure to find a set of well-distributed solutions close to the true Pareto optimal solutions. To promote the search capability of such solutions, two main processes imitating symbiotic evolution and endosymbiotic evolution are introduced, together with an elitist strategy and a fitness sharing scheme. Evolutionary components suitable for the MFPP problem are provided. With a variety of test-bed problems, the performance of the proposed MOSEA is compared with those of existing multi-objective evolutionary algorithms. The experimental results show that the MOSEA is promising in solution convergence and diversity.     

Efficient RNTS system for privacy of banking off-line customer

With the development in IT technology and with growing demands of users, a ubiquitous environment is being made. Because individual identification is important in ubiquitous environment, RFID technology would be used frequently. RFID is a radio frequency identification technology to replace bar code. The reader transmits query (request of user information) and tag-provides user information. RFID has various advantages, such as high speed identification rates, mass memory storages. However, eavesdropping is possible as well as a problem that user information is exposed (Juels et al. in Conference on Computer and Communications Security—ACM CCS, pp. 103–111, 2003; Ohkubo et al. in RFID Privacy Workshop 2003; Weis et al. in International Conference on Security in Pervasive Computing, pp. 201–212, 2003; Weis et al. in Cryptographic Hardware and Embedded Systems—CHES, pp. 454–469, 2002). Therefore, when off-line customer had visited bank for banking service, RNTS (RFID number ticket service) system provides both anonymity in customer identification and efficiency of banking service. In addition, RNTS system protects privacy of an off-line user visiting the bank and it is an efficient method offering service in order of arriving in the bank.     

Regularizers for fault tolerant multilayer feedforward networks

Fault tolerance is an important issue for multilayer feedforward networks (MFNs). However, in the classical training approach for open node fault and open weight fault, we should consider many potential faulty networks. Clearly, if the number of faulty networks considered in the objective function is large, this training approach would be very time consuming. This paper derives two objective functions for attaining fault tolerant MFNs. One objective function is designed for handling open node fault while another one is designed for handling open weight fault. With the linearization technique, each of these two objective functions can be decomposed into two terms, the training error and a simple regularization term. In our approach, the objective functions are computationally simple. Hence the conventional backpropagation algorithm can be simply applied to handle these fault tolerant objective functions.     

Multiwalled carbon nanotubes grafted chitosan nanobiocomposite: A prosperous functional nanomaterials for glucose biosensor application

Multiwalled carbon nanotubes (MWNTs) grafted chitosan (CS) nanowire (NW) was prepared by phase separation method. Glucose oxidase (GOx) was sequentially immobilized into MWNT-CS-NW to obtain MWNT-CS-NW/GOx biosensor. Field emission scanning electron microscopy (FESEM) images of MWNT-CS-NW/GOx reveals the existence of MWNT and CS. Cyclic voltammetry and amperometry were used to evaluate the electrochemical determination of glucose. The MWNT-CS-NW/GOx biosensor shows an excellent performance for glucose at +0.34 V with a high sensitivity (5.03 μA/mM) and lower response time (3 s) in a wide concentration range of 1-10 mM (correlation coefficient of 0.9988). In addition, MWNT-CS-NW/GOx biosensor possesses better reproducibility, storage stability and there is negligible interference from other electroactive components.     

Global optimization of case-based reasoning for breast cytology diagnosis

Case-based reasoning (CBR) is one of the most popular prediction techniques in medical domains because it is easy to apply, has no possibility of overfitting, and provides a good explanation for the output. However, it has a critical limitation – its prediction performance is generally lower than other AI techniques like artificial neural networks (ANN). In order to obtain accurate results from CBR, effective retrieval and matching of useful prior cases for the problem is essential, but it is still a controversial issue to design a good matching and retrieval mechanism for CBR systems. In this study, we propose a novel approach to enhance the prediction performance of CBR. Our suggestion is the simultaneous optimization of feature weights, instance selection, and the number of neighbors that combine using genetic algorithms (GA). Our model improves the prediction performance in three ways – (1) measuring similarity between cases more accurately by considering relative importance of each feature, (2) eliminating useless or erroneous reference cases, and (3) combining several similar cases represent significant patterns. To validate the usefulness of our model, this study applied it to a real-world case for evaluating cytological features derived directly from a digital scan of breast fine needle aspirate (FNA) slides. Experimental results showed that the prediction accuracy of conventional CBR may be improved significantly by using our model. We also found that our proposed model outperformed all the other optimized models for CBR using GA.