Investigating evolutionary checkers by incorporating individual and social learning, N-tuple systems and a round robin tournament

In recent years, much research attention has been paid to evolving self-learning game players. Fogel's Blondie24 is just one demonstration of a real success in this field and it has inspired many other scientists. In this thesis, artificial neural networks are employed to evolve game playing strategies for the game of checkers by introducing a league structure into the learning phase of a system based on Blondie24. We believe that this helps eliminate some of the randomness in the evolution. The best player obtained is tested against an evolutionary checkers program based on Blondie24. The results obtained are promising. In addition, we introduce an individual and social learning mechanism into the learning phase of the evolutionary checkers system. The best player obtained is tested against an implementation of an evolutionary checkers program, and also against a player, which utilises a round robin tournament. The results are promising. N-tuple systems are also investigated and are used as position value functions for the game of checkers. The architecture of the n-tuple is utilises temporal difference learning. The best player obtained is compared with an implementation of evolutionary checkers program based on Blondie24, and also against a Blondie24 inspired player, which utilises a round robin tournament. The results are promising. We also address the question of whether piece difference and the look-ahead depth are important factors in the Blondie24 architecture. Our experiments show that piece difference and the look-ahead depth have a significant effect on learning abilities

PREDICTING MEDICINE DEMAND USING DEEP LEARNING TECHNIQUES

Medication supply and storage are essential components of the medical industry and distribution. Most medications have a predetermined expiration date. When the demand is met in large quantities that exceed the actual need, this leads to the accumulation of medicines in the stores, and this leads to the expiration of the materials. If demand is too low, this will have an impact on consumer happiness and drug marketing.Therefore, it is necessary to find a way to predict the actual quantity required for the organization's needs to avoid material spoilage and storage problems. A mathematical prediction model is required to assist any management in achieving the required availability of medicines for customers and safe storage of medicines. The research question is to design a system based on deep learning that can predict the amount of drugs required with high efficiency and accuracy based on the chronology of previous years.Recurrent Neural Networks (RNN), Long Short-Term Memory (LSTM), Bidirectional LSTM, and Gated Recurrent Unit (GRU) are used to build prediction models. Those models allow for the optimization of inventory levels, thus reducing costs and potentially increasing sales. Various measures such as mean squared error (MSE), mean absolute squared error (MASE), root mean squared error (RMSE), and others are used to evaluate the prediction models. RNN model achieved the best result with MSE: 0.019 MAE: 0.102, RMSE: 0.0

Investigating evolutionary checkers by incorporating individual and social learning, N-tuple systems and a round robin tournament

In recent years, much research attention has been paid to evolving self-learning game players. Fogel's Blondie24 is just one demonstration of a real success in this field and it has inspired many other scientists. In this thesis, artificial neural networks are employed to evolve game playing strategies for the game of checkers by introducing a league structure into the learning phase of a system based on Blondie24. We believe that this helps eliminate some of the randomness in the evolution. The best player obtained is tested against an evolutionary checkers program based on Blondie24. The results obtained are promising. In addition, we introduce an individual and social learning mechanism into the learning phase of the evolutionary checkers system. The best player obtained is tested against an implementation of an evolutionary checkers program, and also against a player, which utilises a round robin tournament. The results are promising. N-tuple systems are also investigated and are used as position value functions for the game of checkers. The architecture of the n-tuple is utilises temporal difference learning. The best player obtained is compared with an implementation of evolutionary checkers program based on Blondie24, and also against a Blondie24 inspired player, which utilises a round robin tournament. The results are promising. We also address the question of whether piece difference and the look-ahead depth are important factors in the Blondie24 architecture. Our experiments show that piece difference and the look-ahead depth have a significant effect on learning abilities

The blue monkey: A new nature inspired metaheuristic optimization algorithm

This paper introduces a study to Blue Monkey (BM) algorithm, which is a new metaheuristic algorithm optimization based on the performance of blue monkey swarms in nature. The BM algorithm identifies how many males in one group. Normally, outside the season of the breeding, the groups of blue monkeys have only one adult male like other forest guenons. In addition to related patas monkeys (Erythrocebus patas). Forty-three of well-known test functions, which used in the area of optimization are used as benchmark to check BM algorithm, in addition, BM verified by a comparative performance check with Artificial-Bee-Colony (ABC), Gravitational Search Algorithm (GSA), Biogeography-Based Optimizer (BBO), and Particle Swarm Optimization (PSO). The obtained results demonstrated that BM algorithm is competitive compared with the selected metaheuristic algorithms; also, BM is able to converge towards the global optimal through optimization problems. Further, this algorithm is very efficient in field of dissolving real problems with restrictions and unidentified search space. It should be mentioned that the BM algorithm has some variables and it can obtain better results. in many test functions comparing with other algorithms

Review of neural networks and particle swarm optimization contribution in intrusion detection

The progress in the field of computer networks and internet is increasing with tremendous volume in recent years. This raises important issues concerning security. Several solutions emerged in the past, which provide security at the host or network level. These traditional solutions like antivirus, firewall, spyware and authentication mechanism provide security to some extents but they still face the challenges of inherent system flaws and social engineering attacks. Some interesting solution emerged like intrusion detection and prevention systems but these too have some problems like detecting and responding in real time and discovering novel attacks. Because the network intrusion behaviors are characterized with uncertainty, complexity and diversity, an intrusion detection method based on neural network and Particle Swarm Optimization (PSO) algorithm is widely used in order to address the problem. This paper gives an insight into how PSO and its variants can be combined with various neural network techniques in order to be used for anomaly detection in network intrusion detection system in order to enhance the performance of intrusion detection system

Survey on intrusion detection systems based on deep learning

Intrusion Detection Systems (IDSs) have a significant role in all networks and information systems in the world to earn the required security guarantee. IDS is one of the solutions used to reduce malicious attacks. As attackers always changing their techniques of attack and find alternative attack methods, IDS must also evolve in response by adopting more sophisticated methods of detection. The huge growth in the data and the significant advances in computer hardware technologies resulted in the new studies existence in the deep learning field, including intrusion detection. Deep learning is sub-field of Machine Learning (ML) methods that are based on learning data representations. In this paper, a detailed survey of various deep learning methods applied in IDSs is given first. Then, a deep learning classification scheme is presented and the main works that have been reported in the deep learning works is summarized. Utilizing this approach, we have provided a taxonomy survey on the available deep architectures and algorithms in these works and classify those algorithms to three classes, which are: discriminative, hybrid and generative. After that, chosen deep learning applications are reviewed in a wide range of fields of intrusion detection. Finally, popular types of datasets and frameworks are discussed

Solving Competitive Traveling Salesman Problem Using Gray Wolf Optimization Algorithm

In this paper a Gray Wolf Optimization (GWO) algorithm is presented to solve the Competitive Traveling Salesman Problem (CTSP). In CTSP, there are numbers of non-cooperative salesmen their goal is visiting a larger possible number of cities with lowest cost and most gained benefit. Each salesman will get a benefit when he visits unvisited city before all other salesmen. Two approaches have been used in this paper, the first one called static approach, it is mean evenly divides the cities among salesmen. The second approach is called parallel at which all cities are available to all salesmen and each salesman tries to visit as much as possible of the unvisited cities. The algorithms are executed for 1000 times and the results prove that the GWO is very efficient giving an indication of the superiority of GWO in solving CTSP

Review of Erbium-doped fiber amplifier

Data communication systems are increasingly employing optical fiber communication systems (OFCS) as the transmission paths for information. Various types of optical amplifiers have been developed in OFCS to amplify optical signals. In particular, the Erbium-doped fiber amplifier (EDFA) is one example of an optical fiber amplifier that is widely known for use in amplifying optical signals. The most significant points in any optical amplifier design are gain and noise figure (NF). They are closely related to each other. Low NF and high gain are the main features for optimum amplifier (Desurvire, 1987). On the other hand, the gain and NF have very strong impact with EDFA’s configurations. Therefore, changes in EDFA’s configuration play very important role during the designing of optical amplifier. The literature shows that there is no study that has been done to review the EDF configuration. Therefore, in this paper we are presenting an overview of most of the EDFA’s configurations that have been proposed in order to provide the researchers with a clear view of what has been done in this field

A Framework for an Automatic Generation of Neural Networks

Abstract The automatic generation of neural network architecture is a useful concept as in many applications while the optimal architecture is not a priori known. Often trial and error is done before a satisfactory architecture is found. Construction deconstruction algorithms can be used as an approach but they have several drawbacks. Sometimes an evolutionary computation and evolutionary algorithms are used but the idea in this paper is reserved for a special kind of evolutionary algorithms. So in this paper we proposed framework for neural networks which try to get best solution for problems by automatic generation technique. The obtained results are promising, suggesting many other research directions.