- Journal Details
- First Published
- 30 Dec 2014
- Publication timeframe
- 4 times per year
- Open Access
Page range: 83 - 95
Evolutionary game theory is used to model the evolution of competing strategies in a population of players. Evolutionary stability of a strategy is a dynamic equilibrium, in which any competing mutated strategy would be wiped out from a population. If a strategy is weak evolutionarily stable, the competing strategy may manage to survive within the network. Understanding the network-related factors that affect the evolutionary stability of a strategy would be critical in making accurate predictions about the behaviour of a strategy in a real-world strategic decision making environment. In this work, we evaluate the effect of network topology on the evolutionary stability of a strategy. We focus on two well-known strategies known as the Zero-determinant strategy and the Pavlov strategy. Zero-determinant strategies have been shown to be evolutionarily unstable in a well-mixed population of players. We identify that the Zero-determinant strategy may survive, and may even dominate in a population of players connected through a non-homogeneous network. We introduce the concept of ‘topological stability’ to denote this phenomenon. We argue that not only the network topology, but also the evolutionary process applied and the initial distribution of strategies are critical in determining the evolutionary stability of strategies. Further, we observe that topological stability could affect other well-known strategies as well, such as the general cooperator strategy and the cooperator strategy. Our observations suggest that the variation of evolutionary stability due to topological stability of strategies may be more prevalent in the social context of strategic evolution, in comparison to the biological context.
- Open Access
Pulsed Power Network Based On Decentralized Intelligence For Reliable And Lowloss Electrical Power Distribution
Page range: 97 - 108
Pulsed power network is proposed for reliable and low loss electrical power distribution among various type of power sources and consumers. The proposed scheme is a derivative of power packet network so far investigated that has affinity with dispersion type power sources and has manageability of energy coloring in the process of power distribution. In addition to these advantages, the proposed scheme has system reliability and low loss property because of its intelligent operation performed by individual nodes and direct relaying by power routers. In the proposed scheme, power transmission is decomposed into a series of electrical pulses placed at specified power slots in continuous time frames that are synchronized over the network. The power slots are pre-reserved based on information exchanges among neighboring nodes following inherent algorithm of the proposed scheme. Because of this power slots reservation based on decentralized intelligence, power pulses are directly transmitted from various power sources to consumers with the least power dissipation even though a partial failure occurs in the network. The network operations with the proposed scheme is simulated to confirm the algorithms for the power slots reservation and to evaluate the power network capacity.
- Open Access
Page range: 109 - 119
Several hybrid neuron models, which combine continuous spike-generation mechanisms and discontinuous resetting process after spiking, have been proposed as a simple transition scheme for membrane potential between spike and hyperpolarization. As one of the hybrid spiking neuron models, Izhikevich neuron model can reproduce major spike patterns observed in the cerebral cortex only by tuning a few parameters and also exhibit chaotic states in specific conditions. However, there are a few studies concerning the chaotic states over a large range of parameters due to the difficulty of dealing with the state dependent jump on the resetting process in this model. In this study, we examine the dependence of the system behavior on the resetting parameters by using Lyapunov exponent with saltation matrix and Poincaré section methods, and classify the routes to chaos.
- Open Access
Application Of Artificial Intelligence Methods In Drilling System Design And Operations: A Review Of The State Of The Art
Page range: 121 - 139
Artificial Intelligence (AI) can be defined as the application of science and engineering with the intent of intelligent machine composition. It involves using tool based on intelligent behavior of humans in solving complex issues, designed in a way to make computers execute tasks that were earlier thought of human intelligence involvement. In comparison to other computational automations, AI facilitates and enables time reduction based on personnel needs and most importantly, the operational expenses.
Artificial Intelligence (AI) is an area of great interest and significance in petroleum exploration and production. Over the years, it has made an impact in the industry, and the application has continued to grow within the oil and gas industry. The application in E & P industry has more than 16 years of history with first application dated 1989, for well log interpretation; drill bit diagnosis using neural networks and intelligent reservoir simulator interface. It has been propounded in solving many problems in the oil and gas industry which includes, seismic pattern recognition, reservoir characterisation, permeability and porosity prediction, prediction of PVT properties, drill bits diagnosis, estimating pressure drop in pipes and wells, optimization of well production, well performance, portfolio management and general decision making operations and many more.
This paper reviews and analyzes the successful application of artificial intelligence techniques as related to one of the major aspects of the oil and gas industry, drilling capturing the level of application and trend in the industry. A summary of various papers and reports associated with artificial intelligence applications and it limitations will be highlighted. This analysis is expected to contribute to further development of this technique and also determine the neglected areas in the field.
- Open Access
Page range: 141 - 153
This paper proposes a method that discovers various sequential patterns from sequential data. The sequential data is a set of sequences. Each sequence is a row of item sets. Many previous methods discover frequent sequential patterns from the data. However, the patterns tend to be similar to each other because they are composed of limited items. The patterns do not always correspond to the interests of analysts. Therefore, this paper tackles on the issue discovering various sequential patterns. The proposed method decides redundant sequential patterns by evaluating the variety of items and deletes them based on three kinds of delete processes. It can discover various sequential patterns within the upper bound for the number of sequential patterns given by the analysts. This paper applies the method to the synthetic sequential data which is characterized by number of items, their kind, and length of sequence. The effect of the method is verified through numerical experiments.