Solving nucleic acid structures by molecular replacement: examples from group II intron studies
Abstract not provided
SEARCH · Engineering Papers
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Abstract not provided
Abstract not provided.
Toxoplasma gondii, an Apicomplexan parasite, causes significant morbidity and mortality, including severe disease in immunocompromised hosts and devastating congenital disease, with no effective treatment for the bradyzoite stage. To address this, we used the Tropical Disease Research database, crystallography, molecular modeling, and antisense to identify and characterize a range of potential therapeutic targets for toxoplasmosis. Phosphoglycerate mutase II (PGMII), nucleoside diphosphate kinase (NDK), ribulose phosphate 3-epimerase (RPE), ribose-5-phosphate isomerase (RPI), and ornithine aminotransferase (OAT) were structurally characterized. Crystallography revealed insights into the overall structure, protein oligomeric states and molecular details of active sites important for ligand recognition. Literature and molecular modeling suggested potential inhibitors and druggability. The targets were further studied with vivoPMO to interrupt enzyme synthesis, identifying the targets as potentially important to parasitic replication and, therefore, of therapeutic interest. Targeted vivoPMO resulted in statistically significant perturbation of parasite replication without concomitant host cell toxicity, consistent with a previous CRISPR/Cas9 screen showing PGM, RPE, and RPI contribute to parasite fitness. PGM, RPE, and RPI have the greatest promise for affecting replication in tachyzoites. These targets are shared between other medically important parasites and may have wider therapeutic potential.
Examples of multiphysics problems in the field of nuclear engineering are numerous. For light water reactors the coupling of neutronics with thermal-hydraulics is the most predominant. Often this coupling is modeled by combining existing codes in a Picard Iteration scheme, that is, by solving one physics then using that answer to solve the other and iterating until both answers stabilize. However, simply solving to a high precision on every Picard (multiphysics) iteration is much less efficient than progressively solving to higher precisions. This unneeded work is known as over-solving. Over-solving in single-physics solvers has been studied previously for the Newton method and Chebyshev iteration. Both of these methods solve an inner linear problem that determines the next update step for the outer loop. If the inner problem is solved to a high precision in every outer iteration, the result will be substantially more computational expense (over-solving) and a higher probability of reaching the 'wrong' solution. Methods for reducing over-solving in partitioned multiphysics codes have only been developed recently. This work introduces further improvements, including an investigation of over-solving methods on both the multiphysics and single-physics levels.
Security-constrained unit commitment (SCUC) is a fundamental problem in power systems and electricity markets. In practical settings, SCUC is repeatedly solved via mixed-integer linear programming (MIP), sometimes multiple times per day, with only minor changes in input data. In this work, we propose a number of machine learning techniques to effectively extract information from previously solved instances in order to significantly improve the computational performance of MIP solvers when solving similar instances in the future. Based on statistical data, we predict redundant constraints in the formulation, good initial feasible solutions, and affine subspaces where the optimal solution is likely to lie, leading to a significant reduction in problem size. Computational results on a diverse set of realistic and large-scale instances show that using the proposed techniques, SCUC can be solved on average 4.3 times faster with optimality guarantees and 10.2 times faster without optimality guarantees, with no observed reduction in solution quality. Out-of-distribution experiments provide evidence that the method is somewhat robust against data-set shift. Summary of Contribution. The paper describes a novel computational method, based on a combination of mixed-integer linear programming (MILP) and machine learning (ML), to solve a challenging and fundamental optimization problem in the energy sector. The method advances the state-of-the-art, not only for this particular problem, but also, more generally, in solving discrete optimization problems via ML. We expect that the techniques presented can be readily used by practitioners in the energy sector and adapted, by researchers in other fields, to other challenging operations research problems that are solved routinely.
Our most recent work expands the water desalination case study from 76 variants to 10,897 variants using the equation-oriented model built in Pyomo as part of the PARETO project. Using the discretization formulation presented in Stinchfield (2024a), rather than solving for all 10,897 variants simultaneously, we decompose the formulation into subproblems containing subsets of variants from the process family. We solve the overall problem with Progressive Hedging (PH) deployed in parallel on a distributed HPC cluster using the open-source Python package mpi-sppy (Knueven et al., 2023). This approach allowed us to solve this process family design problem to ~1.5% relative optimality gap in about 5 hours; in comparison, Gurobi reached ~50% relative optimality gap in about 6 hours (Stinchfield et al., 2024b). However, this approach still requires discretization of the common unit module design ranges; additionally, PH acts as a heuristic for MILP’s with gap-closing capabilities. Ideally, we would not have to use ML surrogates or discretization to solve this problem, instead solving the process family design problem with the equation-oriented model directly to achieve the most accurate results. However, recall that we did not consider solving the MINLP directly due to complexity and size. In this work, we aim to decompose and solve this large-scale MINLP using a Structured Nonlinear Global Optimization algorithm presented by Cao and Zavala (2019).
For a wide range of control engineering applications, the problem of solving a system of linear equations is often encountered and has been well studied. Traditionally, this problem has been mainly solved in a centralized manner. However, for applications related to large-scale complex networked systems, centralized algorithms are often subjected to some practical issues due to limited computational power and communication bandwidth. As a promising and viable alternative, distributed algorithms can effectively address the issues associated with centralized algorithms by solving the problem efficiently in a multi-agent setting that accords with the distributed nature of networked systems. Distributed algorithms decompose the entire problem into many sub-problems that are solved by individual agents in a cooperative manner. In this survey paper, we provide a detailed overview of the state of the art relevant to distributed algorithms for solving a system of linear equations. We will first review basic distributed algorithms including both discrete-time and continuous-time algorithms. Then we will discuss the extended algorithms to achieve communication efficiency. Furthermore, we will also introduce distributed algorithms to obtain the minimum-norm solution for a system of linear equations with multiple solutions, as well as the least-squares solutions when there is no solution. Finally, the relationship of distributed algorithms for solving a system of linear equations to the existing distributed optimization algorithms is discussed.
Among the standard multi-phase multi-component phase-field (PF) methods, the Kim–Kim–Suzuki (KKS) method has the advantage of decoupling interfacial energy from bulk energy and solving concentration as the conserved variable. There are two approaches to numerically solving a KKS method: the global solution approach (GSA) solves all variables in a global system simultaneously, and the local solution approach (LSA) solves phase concentrations locally using a Newton solver. This work compares the performance of LSA and GSA for solving four KKS models of increasing complexity with the finite element method using the MOOSE framework. The solution accuracy, degrees of freedom (DOFs), memory usage, and computational efficiency are compared. We find that GSA and LSA generate similar solutions, with a maximum difference of only 0.34%. For each model, LSA has a lower number of DOFs, utilizes less memory, and less wall time. Additionally, the savings of memory and wall time in LSA increase with increasing mesh density of the same model and are more pronounced in models with higher dimensionality and more nodes. However, GSA is easier to implement in existing codes and can better solve highly nonlinear systems by utilizing sophisticated solvers.
Atomic structure of N-electron atoms is often determined by solving the Hartree-Fock equations, which are a set of integro-differential equations. The integral part of the Hartree-Fock equations treats electron exchange, but the Hartree-Fock equations are not often treated as an integro-differential equation. The exchange term is often approximated as an inhomogeneous or an effective potential so that the Hartree-Fock equations become a set of ordinary differential equations (which can be solved using the usual shooting methods). Because the Hartree-Fock equations are an iterative-refinement method, the inhomogeneous term relies on the previous guess of the wavefunction. In addition, there are numerical complications associated with solving inhomogeneous differential equations. This work uses matrix methods to solve the Hartree-Fock equations as an integro-differential equation. It is well known that a derivative operator can be expressed as a matrix made of finite-difference coefficients; energy eigenvalues and eigenvectors can be obtained by using linear-algebra packages. The integral (exchange) part of the Hartree-Fock equation can be approximated as a sum and written as a matrix. The Hartree-Fock equations can be solved as a matrix that is the sum of the differential and integral matrices. We compare calculations using this method against experiment and standard atomic structure calculations. This matrix method can also be used to solve for free-electron wavefunctions, thus improving how the atoms and free electrons interact. This technique is important for spectral line broadening in two ways: it improves the atomic structure calculations, and it improves the motion of the plasma electrons that collide with the atom.
A new method for solving nonlinear heat and mass transfer design tasks was considered. Systems using the Number of Transfer Units (NTU) method are a special type of mathematical model of heat and mass exchangers. It was observed, that the NTU models in a form of differential-algebraic equations (DAEs) cannot be directly solved with higher values of NTU. The requirements for consistent initial conditions, as well as numerical limitations of DAEs solvers, result, that the solution to the considered design problems that cannot be obtained by a classical direct shooting procedure. To overcome the presented difficulties, the αDAE model optimization algorithm was adjusted for solving NTU-based models. The new approach consists of 3 main steps: 1) task discretization by a multiple-shooting approach, 2) design an appropriate function $f_{NTU}$(α) to effectively influence the variability of the state variables described by dynamical relations, 3) the iterative numerical optimization algorithm for the new parametrized system. Moreover, computations can be performed by a chosen numerical optimization approach, which can be communicated with an available outer procedure for solving differential-algebraic equations. The presented algorithm was implemented and applied to solve the design task with the NTU model of a counter-flow exchanger. Here, the new approach was used to modify the system dynamics to influence the difficulty of the considered problem. Finally, the presented method enabled failure-free numerical computations for the higher values of the NTU parameter.
The enthalpy concept and its change were introduced to describe the forms of internal energy transfer in chemical reactions. Likewise, the concepts of exothermic and endothermic reactions introduced as a consequence of heat transfer form. In the heat measurement process at constant pressure, work is often ignored. The exothermic or endothermic reactions, usually only based on the increase or decrease of the reaction temperature, without associated with the internal energy. Depictions of enthalpy and its change assumed closely related to students’ problem-solving ability. Therefore, the study to describe pre-service chemistry teacher student’s conceptions and problem-solving ability on topic chemical thermodynamics has been done. This research was a case study of chemical education course in Provinsi Lampung. The subjects of this study were 42 students who attend the chemical thermodynamics course. Questions about exothermic and endothermic reactions, enthalpy and its change, as well as internal energy and its change were given in the form of an essay exam questions. Answers related to conception qualitatively categorized, while problem solving answers were scored and assessed. The results showed that, in general, students were having problems in enthalpy and describe the changes in the form of heat and work. The highest value of problem solving ability obtained 26.67 from the maximum value of 100. The lowest value was 0, and the average value was 14.73. These results show that the problem-solving ability of pre-service chemistry teacher students was low. The results provide insight to researchers, and educators to develop learning or lab work on this concept.
Mobile phones and Africa: a success story Dr. Mo Ibrahim, Mo Ibrahim Foundation Citizen Problem Solving Dr. Alpheus Bingham, InnoCentive The Citizen Cyberscience Lectures are hosted by the partners of the Citizen Cyberscience Centre, CERN, The UN Institute of Training and Research and the University of Geneva. The goal of the Lectures is to provide an inspirational forum for participants from the various international organizations and academic institutions in Geneva to explore how information technology is enabling greater citizen participation in tackling global development challenges as well as global scientific research. The first Citizen Cyberscience Lectures will welcome two speakers who have both made major innovative contributions in this area. Dr. Mo Ibrahim, founder of Celtel International, one of Africa’s most successful mobile network operators, will talk about “Mobile phones and Africa: a success story”. Dr. Alpheus Bingham, founder of InnoCentive, a Web-based community that solves industrial R&D; challenges, will discuss “Citizen Problem Solving”. The Citizen Cyberscience Lectures are open and free of charge. Participants from outside CERN must register by sending an email to Yasemin.Hauser@cern.ch BEFORE the 23rd october to be able to access CERN. THE LECTURES Mobile phones and Africa: a success story Dr. Mo Ibrahim, Mo Ibrahim Foundation Abstract The introduction of mobile phones into Africa changed the continent, enabling business and the commercial sector, creating directly and indirectly, millions of jobs. It enriched the social lives of many people. Surprisingly, it supported the emerging civil society and advanced the course of democracy Bio Dr Mo Ibrahim is a global expert in mobile communications with a distinguished academic and business career. In 1998, Dr Ibrahim founded Celtel International to build and operate mobile networks in Africa. Celtel became one of Africa’s most successful companies with operations in 15 countries, covering more than a third of the continent’s population and investing more than US 750 millionin Africa.The company was sold to MTC Kuwaitin 2005 for 3.4billion. In 2006 Dr Ibrahim established the Mo Ibrahim Foundation to support great African leadership. The Foundation focuses on two major initiatives to stimulate debate around, and improve the quality of, governance in Africa. The Ibrahim Prize for Achievement in African Leadership recognises and celebrates excellence; and the Ibrahim Index of African Governance provides civil society with a comprehensive and quantifiable tool to promote government accountability. Dr Ibrahim is also Founding Chairman of Satya Capital Ltd, an investment company focused on opportunities in Africa. Dr Ibrahim has been awarded an Honorary Doctorate by the University of London’s School of Oriental and African Studies, the University of Birmingham and De Montfort University, Leicester as well as an Honorary Fellowship Award from the London Business School. He has also received the Chairman’s Award for Lifetime Achievement from the GSM Association in 2007 and the Economists Innovation Award 2007 for Social & Economic Innovation. In 2008 Dr Ibrahim was presented with the BNP Paribas Prize for Philanthropy, and also listed by TIME magazine as one of the 100 most influential people in the world. Citizen Problem Solving Dr. Alpheus Bingham, InnoCentive Abstract American playwright Damien Runyon (Guys and Dolls) once remarked, "the race is not always to the swift, nor the victory to the strong -- but that IS how you bet." Not only does a system of race handicapping follow from this logic, but the whole notion of expertise and technical qualifications. Such 'credentials' allow one to 'bet' on who might most likely solve a difficult challenge, whether as consultant, contractor or employee. Of course, the approach would differ if one were allowed to bet AFTER the race. When such systems came into broad use, i.e., chat rooms, usenets, innocentive, etc., and were subsequently studied, it was often found that the greatest probability of solution lies in the "long tail" of the function rather than in the head representing formally vetted 'experts.' Insight into a problem is often the intersection of training, experience, metaphor and provocation (think Archimedes). Examples of "citizens" outside a targeted field of expertise providing uniques solutions will illustrate the principles involved. Bio Dr. Alph Bingham is a pioneer in the field of open innovation and an advocate of collaborative approaches to research and development. He is co-founder, and former president and chief executive officer of InnoCentive Inc., a Web-based community that matches companies facing R&D; challenges with scientists who propose solutions. Through InnoCentive, a platform that leverages the ability to connect to a whole planet of people through the Internet, organizations can access individuals – problem solvers – who might never have been found. Alph spent more than 25 years with Eli Lilly and Company, and offers deep experience in pharmaceutical research and development, research acquisitions and collaborations, and R&D; strategic planning. During his career he was instrumental in creating and developing Eli Lilly's portfolio management process as well as establishing the divisions of Research Acquisitions, the Office of Alliance Management and e.Lilly, a business innovation unit, from which various other ventures were spun out that create the advantages of open and networked organizational structures, including: InnoCentive, YourEncore, Inc., Coalesix, Inc., Maaguzi, Inc., Indigo Biosystems, Seriosity, Chorus and Collaborative Drug Discovery, Inc. He currently serves on the Board of Directors of InnoCentive, Inc., and Collaborative Drug Discovery, Inc.; the advisory boards of the Center for Collective Intelligence (MIT), and the Business Innovation Factory, as well as a member of the board of trustees of the Bankinter Foundation for Innovation in Madrid. He has lectured extensively at both national and international events and serves as a Visiting Scholar at the National Center for Supercomputing Application at the University of Illinois at Champaign-Urbana. He is also the former chairman of the Board of Editors of the Research Technology Management Journal. Dr. Bingham was the recipient of the Economist's Fourth Annual Innovation Summit "Business Process Award" for InnoCentive. He was also named as one of Project Management Institute's "Power 50" leaders in October 2005. Dr. Bingham received a Ph.D. in organic chemistry from Stanford University.
The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current noisy quantum devices cannot solve large problems due to hardware constraints. In this work, we develop an algorithm that decomposes the QAOA input problem graph into a smaller problem and solves MaxCut using QAOA on the reduced graph. The algorithm requires a subroutine that can be classical or quantum—in this work, we implement the algorithm twice on each graph. One implementation uses the classical solver Gurobi in the subroutine and the other uses QAOA. We solve these reduced problems with QAOA. On average, the reduced problems require only approximately 1/10 of the number of vertices than the original MaxCut instances. Furthermore, the average approximation ratio of the original MaxCut problems is 0.75, while the approximation ratios of the decomposed graphs are on average of 0.96 for both Gurobi and QAOA. With this decomposition, we are able to measure optimal solutions for ten 100-vertex graphs by running single-layer QAOA circuits on the Quantinuum trapped-ion quantum computer H1-1, sampling each circuit only 500 times. This approach is best suited for sparse, particularly k-regular graphs, as k-regular graphs on n vertices can be decomposed into a graph with at most $\frac{nk}{k+1}$ vertices in polynomial time. Further reductions can be obtained with a potential trade-off in computational time. In conclusion, while this paper applies the decomposition method to the MaxCut problem, it can be applied to more general classes of combinatorial optimization problems.
This article concerns with a computational scheme to solve two-dimensional stochastic fractional integral equations (2DSFIEs), numerically. In these equations, the fractional integral is considered in the Riemann–Liouville sense. The proposed method is essentially based on two-dimensional hat basis functions and its fractional operational matrices. The fractional-order operational matrices of integration are applied to reduce the solution of 2DSFIEs to the solution of a system of linear equations which can be solved using a direct method or iterative method. Some results concerning the convergence analysis associated with the proposed technique are discussed. In addition, we establish the rate of convergence of this approach for solving 2DSFIEs is O(h{sup 2}). Finally, some examples are solved using present method to indicate the pertinent features of the method.
Successive linear programming (SLP) is a practical approach for solving large-scale nonlinear optimization problems. Alternating current optimal power flow (ACOPF) is no exception, particularly the large size of real-world networks. However, in order to achieve tractability, it is essential to tune the SLP algorithm presented in the literature. This paper presents a modified SLP algorithm to solve the ACOPF problem, specified by the U.S. Department of Energy’s (DOE) Grid Optimization (GO) Competition Challenge 1, within strict time limits. The algorithm first finds a near-optimal solution for the relaxed problem (i.e., Stage 1). Then, it finds a feasible solution in the proximity of the near-optimal solution (i.e., Stage 2 and Stage 3). The numerical experiments on test cases ranging from 500-bus to 30,000-bus systems show that the algorithm is tractable. Here the results show that our proposed algorithm is tractable and can solve more than 80% of test cases faster than the well-known Interior Point Method while significantly reduce the number of iterations required to solve ACOPF. The number of iterations is considered an important factor in the examination of tractability which can drastically reduce the computational time required within each iteration.
The probability density function (PDF) transport equation method is a sophisticated model for the closure of turbulent mixing and turbulent reactive flows. An efficient solution approach for solving the PDF transport equation has been vital for the method to be widely used in applications. The Eulerian Monte Carlo fields (EMCF) method has been developed to solve the PDF transport equation efficiently for decades. A recent work by Wang et al. revealed a serious issue of the EMCF method for not being fully consistent with the PDF transport equation for which the method is designed to solve. This work advances the state of the art by introducing fully consistent EMCF methods for solving the PDF transport equation. The fully consistent EMCF formulations are derived for two different PDF equation forms. The consistency of the EMCF formulations is mathematically confirmed by examining the derived moment transport equations from the EMCF formulations and from the PDF transport equation. The method of manufactured solutions is employed to further verify the consistency and convergence of the different EMCF formulations numerically. The newly introduced EMCF formulations bring the EMCF method to full consistency with the PDF transport equations for the first time.
Here, in the study of subsurface seismic imaging, solving the acoustic wave equation is a pivotal component in existing models. The advancement of deep learning (DL) enables solving partial differential equations (PDEs), including wave equations, by applying neural networks to identify the mapping between the inputs and the solution. This approach can be faster than traditional numerical methods when numerous instances are to be solved. Previous works that concentrate on solving the wave equation by neural networks consider either a single velocity model or multiple simple velocity models, which is restricted in practice. Instead, inspired by the idea of operator learning, this work leverages the Fourier neural operator (FNO) to effectively learn the frequency domain seismic wavefields under the context of variable velocity models. We also propose a new framework paralleled FNO (PFNO) for efficiently training the FNO-based solver given multiple source locations and frequencies. Numerical experiments demonstrate the high accuracy of both FNO and PFNO with complicated velocity models in the OpenFWI datasets. Furthermore, the cross-dataset generalization test verifies that PFNO adapts to out-of-distribution velocity models. Finally, PFNO admits higher computational efficiency on large-scale testing datasets than the traditional finite-difference method. The aforementioned advantages endow the FNO-based solver with the potential to build powerful models for research on seismic waves.
Radiation transport arises in various scientific, industrial, and medical fields, and understanding its effect in applications is needed to make accurate predictions, safety assessments and performance optimizations. Solving the Radiation Transport Equation (RTE) is challenging due to its integro-differential nature, which involves both differential and integral terms. The differential term describes the change in radiation intensity due to absorption and emission, while the integral term accounts for scattering. The accurate modeling of radiation is further complicated in many applications due to the complex, irregular geometries. Various methods exist for solving the RTE, including the zonal, Monte Carlo, spherical harmonics, discrete ordinates, and finite volume methods. Traditional mesh-based approaches, which rely on structured or unstructured meshes, struggle with irregular geometries due to: a) the difficulty of conforming structured grids to irregular domains, b) challenges in enforcing boundary conditions correctly, and c) the additional computational cost of unstructured mesh methods. This work presents a second-order accurate method for solving the RTE in irregular geometries. The radiation intensity is discretized using the finite-volume method in both spatial and angular directions on regular Cartesian grid blocks. Leveraging the block-structured adaptive mesh refinement (AMR) framework provided by AMReX, our method refines the grid locally to reduce spatial discretization error, ensuring a converged numerical solution while minimizing computational costs elsewhere. A two-stage deferred correction approach is employed: First, a first-order discretization on grid blocks is solved using an algebraic multigrid method in HYPRE. Second, a correction term is applied explicitly to achieve second-order accuracy. The correction term is calculated by approximating the radiation flux on cell faces using a Total Variation Diminishing (TVD) scheme. This approach ensures quick convergence of the multigrid method while preserving higher-order accuracy of the numerical solution. Irregular geometries are resolved as embedded boundaries (EB), resulting in both cut cells and regular cells. In cut cells, we modify the fluxes using face fractions and incorporate additional contributions from EB boundary conditions. To ensure higher-order convergence near the EB interface, the correction term is modified by interpolating the radiation intensity to fictitious ghost points. The implementation takes advantage of modern supercomputers by leveraging AMReX’sMPI/X parallelization strategy where X can be MPI or a GPU accelerator including CUDA, HIP and DPC++. We validate our solver using classical test cases, both with and without EB, demonstrating accuracy and efficiency. Additionally, we analyze the impact of adaptive mesh refinement on solution accuracy and computational cost, highlighting the advantages of our approach for high-resolution radiation transport simulations.