Controlled gates for multi-level quantum computation

Multi-level (ML) quantum logic can potentially reduce the number of inputs/outputs or quantum cells in a quantum circuit which is a limitation in current quantum technology. In this paper we propose theorems about ML-quantum and reversible logic circuits. New efficient implementations for some basic controlled ML-quantum logic gates, such as three-qudit controlled NOT, Cycle, and Self Shift gates are proposed. We also propose lemmas about r-level quantum arrays and the number of required gates for an arbitrary n-qudit ML gate. An equivalent definition of quantum cost (QC) of binary quantum gates for ML-quantum gates is introduced and QC of controlled quantum gates is calculated.     

Simulation model for natural gas transmission pipeline network system

This paper focuses on developing a simulation model for the analysis of transmission pipeline network system (TPNS) with detailed characteristics of compressor stations. Compressor station is the key element in the TPNS since it provides energy to keep the gas moving. The simulation model is used to create a system that simulates TPNS with different configurations to get pressure and flow parameters. The mathematical formulations for the TPNS simulation were derived from the principles of flow of fluid through pipe, mass balance and compressor characteristics. In order to determine the unknown pressure and flow parameters, a visual C++ code was developed based on Newton–Raphson solution technique. Using the parameters obtained, the model evaluates the energy consumption for various configurations in order to guide for the selection of optimal TPNS. Results from the evaluations of the model with the existing TPNS and comparison with the existing approaches showed that the developed simulation model enabled to determine the operational parameters with less than 10 iterations. Hence, the simulation model could assist in decisions regarding the design and operations of the TPNS.     

Fault detection and diagnosis of an industrial steam turbine using a distributed configuration of adaptive neuro-fuzzy inference systems

The issue of fault detection and diagnosis (FDD) has gained widespread industrial interest in process condition monitoring applications. An innovative data-driven FDD methodology has been presented in this paper on the basis of a distributed configuration of three adaptive neuro-fuzzy inference system (ANFIS) classifiers for an industrial 440 MW power plant steam turbine with once-through Benson type boiler. Each ANFIS classifier has been developed for a dedicated category of four steam turbine faults. A preliminary set of conceptual and experimental studies has been conducted to realize such fault categorization scheme. A proper selection of four measured variables has been configured to feed each ANFIS classifier with the most influential diagnostic information. This consequently leads to a simple distributed FDD system, facilitating the training and testing phases and yet prevents operational deficiency due to possible cross-correlated measured data effects. A diverse set of test scenarios has been carried out to illustrate the successful diagnostic performances of the proposed FDD system against 12 major faults under challenging noise corrupted measurements and data deformation corresponding to a specific fault time history pattern.     

Online learning of task-driven object-based visual attention control

We propose a biologically-motivated computational model for learning task-driven and object-based visual attention control in interactive environments. In this model, top-down attention is learned interactively and is used to search for a desired object in the scene through biasing the bottom-up attention in order to form a need-based and object-driven state representation of the environment. Our model consists of three layers. First, in the early visual processing layer, most salient location of a scene is derived using the biased saliency-based bottom-up model of visual attention. Then a cognitive component in the higher visual processing layer performs an application specific operation like object recognition at the focus of attention. From this information, a state is derived in the decision making and learning layer. Top-down attention is learned by the U-TREE algorithm which successively grows an object-based binary tree. Internal nodes in this tree check the existence of a specific object in the scene by biasing the early vision and the object recognition parts. Its leaves point to states in the action value table. Motor actions are associated with the leaves. After performing a motor action, the agent receives a reinforcement signal from the critic. This signal is alternately used for modifying the tree or updating the action selection policy. The proposed model is evaluated on visual navigation tasks, where obtained results lend support to the applicability and usefulness of the developed method for robotics.     

Estimation of magnitude and time duration of temporary overvoltages using ANN in transmission lines during power system restoration

In most countries, the main step in the process of power system restoration, following a complete/partial blackout, is energization of primary restorative transmission lines. Artificial neural network (ANN) is employed for performing a nonlinear input–output mapping in this work, in order to estimate the temporary overvoltages (TOVs) due to transmission lines energization. In the proposed methodology, Levenberg–Marquardt second order method is used to train the multilayer perceptron. Proposed ANN is trained with equivalent circuit parameters of the network as input parameters, trained ANN has therefore satisfactory generalization capability. Both single and three-phase line energizations are analyzed. The simulated results for 39-bus New England test system, indicate that the proposed technique can estimate the peak values and duration of switching overvoltages with acceptable accuracy.     

A hybrid method for flowshops scheduling with condition-based maintenance constraint and machines breakdown

One of the most important assumptions in production scheduling is that the machines are permanently available without any breakdown. In the real world of scheduling, machines can be made unavailable due to various reasons such as preventive maintenance and unpredicted breakdown. In this paper, we explore flowshop configuration under the assumption of condition-based maintenance to minimize expected makespan. Furthermore, we consider a condition-based maintenance (CBM) strategy which could be used in most industrial settings. The proposed algorithm is designed for non-resumable flowshop state where the processing of jobs after preventive maintenance is restarted from the beginning. We propose a hybrid algorithm based on genetic algorithm and simulated annealing. Additionally, we conduct an extensive parameter calibration with the utilization of Taguchi method and select the optimal levels of the algorithm’s performance influential factors. The preliminary results indicate that the proposed method provides significantly better results compared with other high performing algorithms in the literature.     

Attention control with reinforcement learning for face recognition under partial occlusion

In this paper a new method for handling occlusion in face recognition is presented. In this method the faces are partitioned into blocks and a sequential recognition structure is developed. Then, a spatial attention control strategy over the blocks is learned using reinforcement learning. The outcome of this learning is a sorted list of blocks according to their average importance in the face recognition task. In the recall mode, the sorted blocks are employed sequentially until a confident decision is made. Obtained results of various experiments on the AR face database demonstrate the superior performance of proposed method as compared with that of the holistic approach in the recognition of occluded faces.     

A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations

A resource investment problem with discounted cash flows (RIPDCF) is a project-scheduling problem in which (a) the availability levels of the resources are considered decision variables and (b) the goal is to find a schedule such that the net present value of the project cash flows optimizes. In this paper, the RIPDCF in which the activities are subject to generalized precedence relations is first modeled. Then, a genetic algorithm (GA) is proposed to solve this model. In addition, design of experiments and response surface methodology are employed to both tune the GA parameters and to evaluate the performance of the proposed method in 240 test problems. The results of the performance analysis show that the efficiency of the proposed GA method is relatively well.     

Optimal Local Basis: A Reinforcement Learning Approach for Face Recognition

This paper presents a novel learning approach for Face Recognition by introducing Optimal Local Basis. Optimal local bases are a set of basis derived by reinforcement learning to represent the face space locally. The reinforcement signal is designed to be correlated to the recognition accuracy. The optimal local bases are derived then by finding the most discriminant features for different parts of the face space, which represents either different individuals or different expressions, orientations, poses, illuminations, and other variants of the same individual. Therefore, unlike most of the existing approaches that solve the recognition problem by using a single basis for all individuals, our proposed method benefits from local information by incorporating different bases for its decision. We also introduce a novel classification scheme that uses reinforcement signal to build a similarity measure in a non-metric space. Experiments on AR, PIE, ORL and YALE databases indicate that the proposed method facilitates robust face recognition under pose, illumination and expression variations. The performance of our method is compared with that of Eigenface, Fisherface, Subclass Discriminant Analysis, and Random Subspace LDA methods as well.     

Multi-Verse Optimizer: a nature-inspired algorithm for global optimization

This paper proposes a novel nature-inspired algorithm called Multi-Verse Optimizer (MVO). The main inspirations of this algorithm are based on three concepts in cosmology: white hole, black hole, and wormhole. The mathematical models of these three concepts are developed to perform exploration, exploitation, and local search, respectively. The MVO algorithm is first benchmarked on 19 challenging test problems. It is then applied to five real engineering problems to further confirm its performance. To validate the results, MVO is compared with four well-known algorithms: Grey Wolf Optimizer, Particle Swarm Optimization, Genetic Algorithm, and Gravitational Search Algorithm. The results prove that the proposed algorithm is able to provide very competitive results and outperforms the best algorithms in the literature on the majority of the test beds. The results of the real case studies also demonstrate the potential of MVO in solving real problems with unknown search spaces. Note that the source codes of the proposed MVO algorithm are publicly available at http://www.alimirjalili.com/MVO.html.