Time series forecasting using a TSK fuzzy system tuned with simulated annealing

In this paper, a combination of a Takagi-Sugeno fuzzy system (TSK) and simulated annealing is used to predict well known time series by searching for the best configuration of the fuzzy system. Simulated annealing is used to optimise the parameters of the antecedent and the consequent parts of the fuzzy system rules. The results of the proposed method are encouraging indicating that simulated annealing and fuzzy logic are able to combine well in time series prediction

A Method to Change Phase Transition Nature -- Toward Annealing Method --

In this paper, we review a way to change nature of phase transition with annealing methods in mind. Annealing methods are regarded as a general technique to solve optimization problems efficiently. In annealing methods, we introduce a controllable parameter which represents a kind of fluctuation and decrease the parameter gradually. Annealing methods face with a difficulty when a phase transition point exists during the protocol. Then, it is important to develop a method to avoid the phase transition by introducing a new type of fluctuation. By taking the Potts model for instance, we review a way to change the phase transition nature. Although the method described in this paper does not succeed to avoid the phase transition, we believe that the concept of the method will be useful for optimization problems.Comment: 27 pages, 3 figures, revised version will appear in proceedings of Kinki University Quantum Computing Series Vo.

Comparison of Methods of Pump Scheduling in Water Supply Systems

In the domestic water supply industry, the reduction of pumping costs is a continuing objective. With the efficient scheduling of pumping operations, it is considered that 10% of the annual expenditure on energy and related costs may be saved. A typical cost function will include all of the expenditure caused by the pumping process and also consider the electrical cost of pumping taking into account the various electrical tariffs, as well as peak demand and pump switching costs. Using only fixed speed pumps, it is possible to use an efficient dynamic programming based method, provided that the storage reservoir levels are known. Other techniques that are showing fruitful results in optimisation are genetic programming and simulated annealing. This paper compares these methods and discusses which is more appropriate in this type of pump scheduling problem

Node placement in Wireless Mesh Networks: a comparison study of WMN-SA and WMN-PSO simulation systems

(c) 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.With the fast development of wireless technologies, Wireless Mesh Networks (WMNs) are becoming an important networking infrastructure due to their low cost and increased high speed wireless Internet connectivity. In our previous work, we implemented a simulation system based on Simulated Annealing (SA) for solving node placement problem in wireless mesh networks, called WMN-SA. Also, we implemented a Particle Swarm Optimization (PSO) based simulation system, called WMN-PSO. In this paper, we compare two systems considering calculation time. From the simulation results, when the area size is 32 × 32 and 64 × 64, WMN-SA is better than WMN-PSO. When the area size is 128 × 128, WMN-SA performs better than WMN-PSO. However, WMN-SA needs more calculation time than WMN-PSO.Peer ReviewedPostprint (author's final draft

Versatile stochastic dot product circuits based on nonvolatile memories for high performance neurocomputing and neurooptimization.

The key operation in stochastic neural networks, which have become the state-of-the-art approach for solving problems in machine learning, information theory, and statistics, is a stochastic dot-product. While there have been many demonstrations of dot-product circuits and, separately, of stochastic neurons, the efficient hardware implementation combining both functionalities is still missing. Here we report compact, fast, energy-efficient, and scalable stochastic dot-product circuits based on either passively integrated metal-oxide memristors or embedded floating-gate memories. The circuit's high performance is due to mixed-signal implementation, while the efficient stochastic operation is achieved by utilizing circuit's noise, intrinsic and/or extrinsic to the memory cell array. The dynamic scaling of weights, enabled by analog memory devices, allows for efficient realization of different annealing approaches to improve functionality. The proposed approach is experimentally verified for two representative applications, namely by implementing neural network for solving a four-node graph-partitioning problem, and a Boltzmann machine with 10-input and 8-hidden neurons

A Simulated Annealing Method to Cover Dynamic Load Balancing in Grid Environment

High-performance scheduling is critical to the achievement of application performance on the computational grid. New scheduling algorithms are in demand for addressing new concerns arising in the grid environment. One of the main phases of scheduling on a grid is related to the load balancing problem therefore having a high-performance method to deal with the load balancing problem is essential to obtain a satisfactory high-performance scheduling. This paper presents SAGE, a new high-performance method to cover the dynamic load balancing problem by means of a simulated annealing algorithm. Even though this problem has been addressed with several different approaches only one of these methods is related with simulated annealing algorithm. Preliminary results show that SAGE not only makes it possible to find a good solution to the problem (effectiveness) but also in a reasonable amount of time (efficiency)