Design of liveness‐enforcing supervisors via transforming plant petri net models of FMS

This paper focuses on the deadlock prevention problems in a class of Petri nets, systems of simple sequential process with resources, S³PR for short. By structure analysis, we propose an approach that can transform a plant net model into a weighted S³PR (WS³PR) that is behaviorally equivalent to the plant model. The WS³PR is made to be live by properly reconfiguring its weight distribution such that its all strict minimal siphons are self‐max'‐controlled. The resulting WS³PR can serve as a liveness‐enforcing Petri net supervisor for the plant model after removing some idle and operation places. A live controlled system can be accordingly obtained by synchronizing a plant model and the places whose weights are regulated. This research shows that a small number of monitors is obtained, leading to more permissive behavior of the controlled system. Examples are used to demonstrate the proposed concepts and methods. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Observer‐based controller design of discrete‐time piecewise affine systems

This paper presents a novel observer‐based controller design method for discrete‐time piecewise affine (PWA) systems. The basic idea is as follows: at first, a piecewise linear (without affine terms) state feedback controller and a PWA observer are designed separately, and then it is proved that the output feedback controller constructed by the resulting observer and state feedback controller gains can guarantee the stability of the closed‐loop system. During the controller design, the piecewise‐quadratic Lyapunov function technique is used. Moreover, the region information is taken into account to treat the affine terms, so the controller gains can be obtained by solving a set of linear matrix inequalities, which are numerically feasible with commercially available software. Three simulation examples are given finally to verify the proposed theoretical results. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

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.     

Elements that Influence the Implementation of Crisis Preparedness Measures by Meeting Planners

The purpose of this study was to analyse the adoption of crisis preparedness measures by meeting planners. The study sought to determine how the adoption of crisis preparedness measures relates to meeting planner characteristics and identify the elements that influence their adoption (or lack of adoption) of these measures. A survey of professional meeting planners identified significant differences in the frequency of use of some key core crisis preparedness measures. Additionally, 10 categories of elements influencing the adoption of or failure to adopt crisis preparedness measures were identified. The findings of this study should be of interest to meeting organizers and professionals who want to make their meetings more crisis prepared rather than crisis prone.     

Engineering an efficient two‐phase local search algorithm for the co‐rotating twin‐screw extruder configuration problem

The twin‐screw configuration problem arises during polymer extrusion and compounding. It consists in defining the location of a set of pre‐defined screw elements along the screw axis in order to optimize different, typically conflicting objectives. In this paper, we present a simple yet effective stochastic local search (SLS) algorithm for this problem. Our algorithm is based on efficient single‐objective iterative improvement algorithms, which have been developed by studying different neighborhood structures, neighborhood search strategies, and neighborhood restrictions. These algorithms are embedded into a variation of the two‐phase local search framework to tackle various bi‐objective versions of this problem. An experimental comparison with a previously proposed multi‐objective evolutionary algorithm shows that a main advantage of our SLS algorithm is that it converges faster to a high‐quality approximation to the Pareto front.     

Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm

This paper deals with a scheduling problem for reentrant hybrid flowshop with serial stages where each stage consists of identical parallel machines. In a reentrant flowshop, a job may revisit any stage several times. Local-search based Pareto genetic algorithms with Minkowski distance-based crossover operator is proposed to approximate the Pareto optimal solutions for the minimization of makespan and total tardiness in a reentrant hybrid flowshop. The Pareto genetic algorithms are compared with existing multi-objective genetic algorithm, NSGA-II in terms of the convergence to optimal solution, the diversity of solution and the dominance of solution. Experimental results show that the proposed crossover operator and local search are effective and the proposed algorithm outperforms NSGA-II by statistical analysis.     

A data-driven generic simulation model for logistics-embedded assembly manufacturing lines

Simulation has been used to evaluate various aspects of manufacturing systems. However, building a simulation model of a manufacturing system is time-consuming and error-prone because of the complexity of the systems. This paper introduces a generic simulation modeling framework to reduce the simulation model build time. The framework consists of layout modeling software and a data-driven generic simulation model. The generic simulation model was developed considering the processing as well as the logistics aspects of assembly manufacturing systems. The framework can be used to quickly develop an integrated simulation model of the production schedule, operation processes and logistics of a system. The framework was validated by developing simulation models of cellular and conveyor manufacturing systems.     

On fuzzy renewal processes for fuzzy random variables and extended theorems

In this paper, we construct fuzzy renewal processes involving fuzzy random variables. We first extend the renewal processes to the fuzzy renewal processes where interarrival times, rewards, and stopping times are all fuzzy random variables. According to these fuzzy renewal processes, we then extend some theorems of renewal processes to those in fuzzy renewal processes. These are elementary renewal theorem, asymptotic expected average reward, and Wald's equation. In each part, we also give examples for applications. © 2010 Wiley Periodicals, Inc.     

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.     

Consistent Sets of Secondary Structures in Proteins

Ab initio predictions of secondary structures in proteins have to combine local predictions, based on short fragments of the protein sequence, with consistency restrictions, as not all locally plausible predictions may be simultaneously true. We use the fact that secondary structures are patterns of hydrogen bonds and that a single residue can participate in hydrogen bonds of at most one secondary structure. Consistency of fixed-sized pieces of secondary structures is the easiest to approximate and we formalize it as 1-2 matching problem. Consistency of entire secondary structures is a version of set packing. We also investigate how to form a simple problem if we add the requirement that the secondary structure and the loops that connect them fit together in a metric space. Every problem that we investigated is MAX-SNP hard and it has a constant factor approximation. Computational experience suggests that in biological instances, we can find nearly optimal solutions using heuristics.