Development and evaluation of message passing library for Maestro2 cluster network

2007 ◽  
Vol 90 (11) ◽  
pp. 109-121
Author(s):  
Keiichi Aoki ◽  
Shinichi Yamagiwa ◽  
Koichi Wada ◽  
Masaaki Ono
Keyword(s):  
Message Passing ◽  
Cluster Network

Establishing knowledge-based and digital cooperation between small and medium-sized businesses, science and the State through a cluster approach

2020 ◽  
Vol 18 (11) ◽  
pp. 2089-2110
Author(s):  
A.V. Ivanchenko ◽  
E.S. Mezentseva
Keyword(s):  
Financial Support ◽  
Triple Helix ◽  
The State ◽  
Sverdlovsk Oblast ◽  
Cluster Approach ◽  
Innovation Development ◽  
Economic Agents ◽  
Knowledge Based ◽  
Cluster Network ◽  
Digital Development

Subject. This article discusses the issues of innovative and digital development of the economy. Objectives. The article aims to justify the benefits of cluster cooperation and networking between different structures. Methods. For the study, we used systems, logical, structural, and comparative analyses, generalization and statistical methods, and the cluster-network and institutional approaches. Results. The article substantiates the role and position of small business in the innovation development of the Sverdlovsk Oblast and identifies trends of innovation and digital advancement. Conclusions. The cluster theory, supplemented with the Triple Helix concept, can be a basis for rationale for effective ways of integrating economic agents. Small innovative business has significant potential for sustainability, but it needs additional financial support from the State.

Message Passing Neural Networks for Partial Charge Assignment to Metal-Organic Frameworks

2020 ◽  
Author(s):  
Ali Raza ◽  
Arni Sturluson ◽  
Cory Simon ◽  
Xiaoli Fern
Keyword(s):  
Electronic Structure ◽  
Message Passing ◽  
Gas Adsorption ◽  
Metal Organic Frameworks ◽  
Computational Cost ◽  
Electronic Structure Calculations ◽  
High Fidelity ◽  
Partial Charges ◽  
Metal Organic ◽  
Structure Calculations

Virtual screenings can accelerate and reduce the cost of discovering metal-organic frameworks (MOFs) for their applications in gas storage, separation, and sensing. In molecular simulations of gas adsorption/diffusion in MOFs, the adsorbate-MOF electrostatic interaction is typically modeled by placing partial point charges on the atoms of the MOF. For the virtual screening of large libraries of MOFs, it is critical to develop computationally inexpensive methods to assign atomic partial charges to MOFs that accurately reproduce the electrostatic potential in their pores. Herein, we design and train a message passing neural network (MPNN) to predict the atomic partial charges on MOFs under a charge neutral constraint. A set of ca. 2,250 MOFs labeled with high-fidelity partial charges, derived from periodic electronic structure calculations, serves as training examples. In an end-to-end manner, from charge-labeled crystal graphs representing MOFs, our MPNN machine-learns features of the local bonding environments of the atoms and learns to predict partial atomic charges from these features. Our trained MPNN assigns high-fidelity partial point charges to MOFs with orders of magnitude lower computational cost than electronic structure calculations. To enhance the accuracy of virtual screenings of large libraries of MOFs for their adsorption-based applications, we make our trained MPNN model and MPNN-charge-assigned computation-ready, experimental MOF structures publicly available.<br>

Building Attention and Edge Convolution Neural Networks for Bioactivity and Physical-Chemical Property Prediction

2019 ◽  
Author(s):  
Michael Withnall ◽  
Edvard Lindelöf ◽  
Ola Engkvist ◽  
Hongming Chen
Keyword(s):  
Message Passing ◽  
State Of The Art ◽  
A Priori ◽  
Model Performance ◽  
Learning Approaches ◽  
Physical Chemical ◽  
Chemical Descriptor ◽  
Derived Properties ◽  
Memory Schemes ◽  
Hyperparameter Selection

We introduce Attention and Edge Memory schemes to the existing Message Passing Neural Network framework for graph convolution, and benchmark our approaches against eight different physical-chemical and bioactivity datasets from the literature. We remove the need to introduce <i>a priori</i> knowledge of the task and chemical descriptor calculation by using only fundamental graph-derived properties. Our results consistently perform on-par with other state-of-the-art machine learning approaches, and set a new standard on sparse multi-task virtual screening targets. We also investigate model performance as a function of dataset preprocessing, and make some suggestions regarding hyperparameter selection.

Multi-level Parallelization of Genotype Imputation on Supercomputers

2020 ◽  
Vol 15 ◽  
Author(s):  
Weiwen Zhang ◽  
Long Wang ◽  
Theint Theint Aye ◽  
Juniarto Samsudin ◽  
Yongqing Zhu
Keyword(s):  
Association Study ◽  
Message Passing ◽  
High Performance ◽  
Message Passing Interface ◽  
Genome Wide Association Study ◽  
Job Scheduling ◽  
Genotype Imputation ◽  
Job Level ◽  
Multi Level ◽  
High Performance Requirement

Background: Genotype imputation as a service is developed to enable researchers to estimate genotypes on haplotyped data without performing whole genome sequencing. However, genotype imputation is computation intensive and thus it remains a challenge to satisfy the high performance requirement of genome wide association study (GWAS). Objective: In this paper, we propose a high performance computing solution for genotype imputation on supercomputers to enhance its execution performance. Method: We design and implement a multi-level parallelization that includes job level, process level and thread level parallelization, enabled by job scheduling management, message passing interface (MPI) and OpenMP, respectively. It involves job distribution, chunk partition and execution, parallelized iteration for imputation and data concatenation. Due to the design of multi-level parallelization, we can exploit the multi-machine/multi-core architecture to improve the performance of genotype imputation. Results: Experiment results show that our proposed method can outperform the Hadoop-based implementation of genotype imputation. Moreover, we conduct the experiments on supercomputers to evaluate the performance of the proposed method. The evaluation shows that it can significantly shorten the execution time, thus improving the performance for genotype imputation. Conclusion: The proposed multi-level parallelization, when deployed as an imputation as a service, will facilitate bioinformatics researchers in Singapore to conduct genotype imputation and enhance the association study.

Sign in / Sign up

Export Citation Format

Share Document