A synthetic player for Ayὸ board game using alpha-beta search and learning vector quantization

Game playing especially, Ayὸ game has been an important topic of research in artificial intelligence and several machine learning approaches have been used, but the need to optimize computing resources is important to encourage the significant interest of users. This study presents a synthetic player (Ayὸ) implemented using Alpha-beta search and Learning Vector Quantization network. The program for the board game was written in Java and MATLAB. Evaluation of the synthetic player was carried out in terms of the win percentage and game length. The synthetic player had a better efficiency compared to the traditional Alpha-beta search algorithm

A Refinement-Based Heuristic Method for Decision Making in the Context of Ayo Game

Games of strategy, such as chess have served as a convenient test of skills at devising efficient search algorithms, formalizing knowledge, and bringing the power of computation to bear on “intractable” problems. Generally, minimax search has been the fundamental concept of obtaining solution to game problems. However, there are a number of limitations associated with using minimax search in order to offer solution to Ayo game. Among these limitations are: (i.) improper design of a suitable evaluator for moves before the moves are made, and (ii.) inability to select a correct move without assuming that players will play optimally. This study investigated the extent to which the knowledge of minimax search technique could be enhanced with a refinement-based heuristic method for playing Ayo game. This is complemented by the CDG (an end game strategy) for generating procedures such that only good moves are generated at any instance of playing Ayo game by taking cognizance of the opponent strategy of play. The study was motivated by the need to advance the African board game – Ayo – to see how it could be made to be played by humans across the globe, by creating both theoretical and product-oriented framework. This framework provides local Ayo game promotion initiatives in accordance with state-of-the-art practices in the global game playing domain. In order to accomplish this arduous task, both theoretical and empirical approaches were used. The theoretical approach reveals some mathematical properties of Ayo game with specific emphasis on the CDG as an end game strategy and means of obtaining the minimal and maximal CDG configurations. Similarly, a theoretical analysis of the minimax search was given and was enhanced with the Refinement-based heuristics. For the empirical approach, we simulated Ayo game playing on a digital viii computer and studied the behaviour of the various heuristic metrics used and compared the play strategies of the simulation with AWALE (the world known Ayo game playing standard software). Furthermore, empirical judgment was carried out on how experts play Ayo game as a means of evaluating the performance of the heuristics used to evolve the Ayo player in the simulation which gives room for statistical interpretation. This projects novel means of solving the problem of decision making in move selections in computer game playing of Ayo game. The study shows how an indigenous game like Ayo can generate integer sequence, and consequently obtain some self-replicating patterns that repeat themselves at different iterations. More importantly, the study gives an efficient and usable operation support tools in the prototype simulation of Ayo game playing that has improvement over Awal

Cheminformatics Tools to Explore the Chemical Space of Peptides and Natural Products

Cheminformatics facilitates the analysis, storage, and collection of large quantities of chemical data, such as molecular structures and molecules' properties and biological activity, and it has revolutionized medicinal chemistry for small molecules. However, its application to larger molecules is still underrepresented. This thesis work attempts to fill this gap and extend the cheminformatics approach towards large molecules and peptides. This thesis is divided into two parts. The first part presents the implementation and application of two new molecular descriptors: macromolecule extended atom pair fingerprint (MXFP) and MinHashed atom pair fingerprint of radius 2 (MAP4). MXFP is an atom pair fingerprint suitable for large molecules, and here, it is used to explore the chemical space of non-Lipinski molecules within the widely used PubChem and ChEMBL databases. MAP4 is a MinHashed hybrid of substructure and atom pair fingerprints suitable for encoding small and large molecules. MAP4 is first benchmarked against commonly used atom pairs and substructure fingerprints, and then it is used to investigate the chemical space of microbial and plants natural products with the aid of machine learning and chemical space mapping. The second part of the thesis focuses on peptides, and it is introduced by a review chapter on approaches to discover novel peptide structures and describing the known peptide chemical space. Then, a genetic algorithm that uses MXFP in its fitness function is described and challenged to generate peptide analogs of peptidic or non-peptidic queries. Finally, supervised and unsupervised machine learning is used to generate novel antimicrobial and non-hemolytic peptide sequences

Scheduling and Tuning Kernels for High-performance on Heterogeneous Processor Systems

Accelerated parallel computing techniques using devices such as GPUs and Xeon Phis (along with CPUs) have proposed promising solutions of extending the cutting edge of high-performance computer systems. A significant performance improvement can be achieved when suitable workloads are handled by the accelerator. Traditional CPUs can handle those workloads not well suited for accelerators. Combination of multiple types of processors in a single computer system is referred to as a heterogeneous system. This dissertation addresses tuning and scheduling issues in heterogeneous systems. The first section presents work on tuning scientific workloads on three different types of processors: multi-core CPU, Xeon Phi massively parallel processor, and NVIDIA GPU; common tuning methods and platform-specific tuning techniques are presented. Then, analysis is done to demonstrate the performance characteristics of the heterogeneous system on different input data. This section of the dissertation is part of the GeauxDock project, which prototyped a few state-of-art bioinformatics algorithms, and delivered a fast molecular docking program. The second section of this work studies the performance model of the GeauxDock computing kernel. Specifically, the work presents an extraction of features from the input data set and the target systems, and then uses various regression models to calculate the perspective computation time. This helps understand why a certain processor is faster for certain sets of tasks. It also provides the essential information for scheduling on heterogeneous systems. In addition, this dissertation investigates a high-level task scheduling framework for heterogeneous processor systems in which, the pros and cons of using different heterogeneous processors can complement each other. Thus a higher performance can be achieve on heterogeneous computing systems. A new scheduling algorithm with four innovations is presented: Ranked Opportunistic Balancing (ROB), Multi-subject Ranking (MR), Multi-subject Relative Ranking (MRR), and Automatic Small Tasks Rearranging (ASTR). The new algorithm consistently outperforms previously proposed algorithms with better scheduling results, lower computational complexity, and more consistent results over a range of performance prediction errors. Finally, this work extends the heterogeneous task scheduling algorithm to handle power capping feature. It demonstrates that a power-aware scheduler significantly improves the power efficiencies and saves the energy consumption. This suggests that, in addition to performance benefits, heterogeneous systems may have certain advantages on overall power efficiency

High-Performance Modelling and Simulation for Big Data Applications

This open access book was prepared as a Final Publication of the COST Action IC1406 “High-Performance Modelling and Simulation for Big Data Applications (cHiPSet)“ project. Long considered important pillars of the scientific method, Modelling and Simulation have evolved from traditional discrete numerical methods to complex data-intensive continuous analytical optimisations. Resolution, scale, and accuracy have become essential to predict and analyse natural and complex systems in science and engineering. When their level of abstraction raises to have a better discernment of the domain at hand, their representation gets increasingly demanding for computational and data resources. On the other hand, High Performance Computing typically entails the effective use of parallel and distributed processing units coupled with efficient storage, communication and visualisation systems to underpin complex data-intensive applications in distinct scientific and technical domains. It is then arguably required to have a seamless interaction of High Performance Computing with Modelling and Simulation in order to store, compute, analyse, and visualise large data sets in science and engineering. Funded by the European Commission, cHiPSet has provided a dynamic trans-European forum for their members and distinguished guests to openly discuss novel perspectives and topics of interests for these two communities. This cHiPSet compendium presents a set of selected case studies related to healthcare, biological data, computational advertising, multimedia, finance, bioinformatics, and telecommunications

IN SILICO METHODS FOR DRUG DESIGN AND DISCOVERY

Computer-aided drug design (CADD) methodologies are playing an ever-increasing role in drug discovery that are critical in the cost-effective identification of promising drug candidates. These computational methods are relevant in limiting the use of animal models in pharmacological research, for aiding the rational design of novel and safe drug candidates, and for repositioning marketed drugs, supporting medicinal chemists and pharmacologists during the drug discovery trajectory.Within this field of research, we launched a Research Topic in Frontiers in Chemistry in March 2019 entitled “In silico Methods for Drug Design and Discovery,” which involved two sections of the journal: Medicinal and Pharmaceutical Chemistry and Theoretical and Computational Chemistry. For the reasons mentioned, this Research Topic attracted the attention of scientists and received a large number of submitted manuscripts. Among them 27 Original Research articles, five Review articles, and two Perspective articles have been published within the Research Topic. The Original Research articles cover most of the topics in CADD, reporting advanced in silico methods in drug discovery, while the Review articles offer a point of view of some computer-driven techniques applied to drug research. Finally, the Perspective articles provide a vision of specific computational approaches with an outlook in the modern era of CADD

High-Performance Modelling and Simulation for Big Data Applications

This open access book was prepared as a Final Publication of the COST Action IC1406 “High-Performance Modelling and Simulation for Big Data Applications (cHiPSet)“ project. Long considered important pillars of the scientific method, Modelling and Simulation have evolved from traditional discrete numerical methods to complex data-intensive continuous analytical optimisations. Resolution, scale, and accuracy have become essential to predict and analyse natural and complex systems in science and engineering. When their level of abstraction raises to have a better discernment of the domain at hand, their representation gets increasingly demanding for computational and data resources. On the other hand, High Performance Computing typically entails the effective use of parallel and distributed processing units coupled with efficient storage, communication and visualisation systems to underpin complex data-intensive applications in distinct scientific and technical domains. It is then arguably required to have a seamless interaction of High Performance Computing with Modelling and Simulation in order to store, compute, analyse, and visualise large data sets in science and engineering. Funded by the European Commission, cHiPSet has provided a dynamic trans-European forum for their members and distinguished guests to openly discuss novel perspectives and topics of interests for these two communities. This cHiPSet compendium presents a set of selected case studies related to healthcare, biological data, computational advertising, multimedia, finance, bioinformatics, and telecommunications

A Perspective on Conventional High-Temperature Superconductors at High Pressure: Methods and Materials

Two hydrogen-rich materials, H$_3$S and LaH$_{10}$, synthesized at megabar pressures, have revolutionized the field of condensed matter physics providing the first glimpse to the solution of the hundred-year-old problem of room temperature superconductivity. The mechanism underlying superconductivity in these exceptional compounds is the conventional electron-phonon coupling. Here we describe recent advances in experimental techniques, superconductivity theory and first-principles computational methods which have made possible these discoveries. This work aims to provide an up-to-date compendium of the available results on superconducting hydrides and explain how the synergy of different methodologies led to extraordinary discoveries in the field. Besides, in an attempt to evidence empirical rules governing superconductivity in binary hydrides under pressure, we discuss general trends in the electronic structure and chemical bonding. The last part of the Review introduces possible strategies to optimize pressure and transition temperatures in conventional superconducting materials as well as future directions in theoretical, computational and experimental research.Comment: 68 pages, 30 figures, Preprint submitted to Physics Report

Technological developments in Virtual Screening for the discovery of small molecules with novel mechanisms of action

Programa de Doctorat en Recerca, Desenvolupament i Control de Medicaments[eng] Advances in structural and molecular biology have favoured the rational development of novel drugs thru structure-based drug design (SBDD). Particularly, computational tools have proven to be rapid and efficient tools for hit discovery and optimization. The main motivation of this thesis is to improve and develop new methods in the area of computer-based drug discovery in order to study challenging targets. Specifically, this thesis is focused on docking and Virtual Screening (VS) methodologies to be able to exploit non-standard sites, like protein-protein interfaces or allosteric sites, and discover bioactive molecules with novel mechanisms of action. First, I developed an automatic pipeline for binding mode prediction that applies knowledge- based restraints and validated the approach by participating in the CELPP Challenge, a blind pose prediction challenge. The aim of the first VS in this thesis is to find small molecules able to not only disrupt the RANK-RANKL interaction but also inhibit the constitutive activation of the receptor. With a combination of computational, biophysical, and cell-based assays we were able to identify the first small molecule binders for RANK that could be used as a treatment for Triple Negative Breast Cancer. When working with challenging targets, or with non-standard mechanisms of action, the relationship between binding and the biological response is unpredictable, because the biological response (if any) will depend on the biological function of the particular allosteric site, which is generally unknown. For this reason, we then tested the applicability of the combination of ultrahigh-throughput VS with low-throughput high content assay. This allowed us to characterize a novel allosteric pocket in PTEN and also describe the first allosteric modulators for this protein. Finally, as the accessible Chemical Space grows at a rapid pace, we developed an algorithm to efficiently explore ultra-large Chemical Collections using a Bottom-up approach. We prospectively validated the approach in BRD4 and identified novel BRD4 inhibitors with an affinity comparable to advanced drug candidates for this target.[spa] Els avenços en biologia estructural i molecular han afavorit el desenvolupament racional de nous fàrmacs a través del disseny de fàrmacs basat en l'estructura (SBDD). En particular, les eines computacionals han demostrat ser ràpides i eficients per al descobriment i l'optimització de fàrmacs. La principal motivació d'aquesta tesi és millorar i desenvolupar nous mètodes en l'àrea del descobriment de fàrmacs per ordinador per tal d'estudiar proteïnes complexes. Concretament, aquesta tesi se centra en les metodologies d'acoblament i de cribratge virtual (CV) per poder explotar llocs no estàndard, com interfícies proteïna-proteïna o llocs al·lostèrics, i descobrir molècules bioactives amb nous mecanismes d'acció. En primer lloc, vaig desenvolupar un protocol automàtic per a la predicció del mode d’unió aplicant restriccions basades en el coneixement i vaig validar l'enfocament participant en el repte CELPP, un repte de predicció del mode d’unió a cegues. L'objectiu del primer CV d'aquesta tesi és trobar petites molècules capaces no només d'interrompre la interacció RANK-RANKL sinó també d'inhibir l'activació constitutiva del receptor. Amb una combinació d'assajos computacionals, biofísics i basats en cèl·lules, vam poder identificar les primeres molècules petites per a RANK que es podrien utilitzar com a tractament per al càncer de mama triple negatiu. Quan es treballa amb proteïnes complexes, o amb mecanismes d'acció no estàndard, la relació entre la unió i la resposta biològica és impredictible, perquè la resposta biològica (si n'hi ha) dependrà de la funció biològica del lloc al·lostèric particular, que generalment és desconeguda. Per aquest motiu, després vam provar l'aplicabilitat de la combinació de CV d'alt rendiment amb assaig de contingut alt de baix rendiment. Això ens va permetre caracteritzar un nou lloc d’unió al·lostèric en PTEN i també descriure els primers moduladors al·lostèrics d'aquesta proteïna. Finalment, a mesura que l'espai químic accessible creix a un ritme ràpid, hem desenvolupat un algorisme per explorar de manera eficient col·leccions de productes químics molt grans mitjançant un enfocament de baix a dalt. Vam validar aquest enfocament amb BRD4 i vam identificar nous inhibidors de BRD4 amb una afinitat comparable als candidats a fàrmacs més avançats per a aquesta proteïna