Results 111 to 120 of about 286,749 (305)

Refinement of amino‐acid conformation vs. difference density maps in time‐resolved serial femtosecond crystallography data analysis

open access: yesFEBS Open Bio, EarlyView.
The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong   +3 more
wiley   +1 more source

An Innovative Hybrid Approach Producing Trial Solutions for Global Optimization

open access: yesApplied Sciences
Global optimization is critical in engineering, computer science, and various industrial applications as it aims to find optimal solutions for complex problems. The development of efficient algorithms has emerged from the need for optimization, with each
Vasileios Charilogis   +3 more
doaj   +1 more source

The crystal structure of the Borrelia burgdorferi nicotinamidase BBE22 resolves a long‐standing annotation error

open access: yesFEBS Open Bio, EarlyView.
The crystal structure of Borrelia burgdorferi nicotinamidase (PncA/BBE22) reveals the correct full‐length protein initiated from a non‐canonical AUU start codon. The structure validates previous biochemical findings and resolves a long‐standing annotation error, demonstrating that the truncated database sequence is structurally incompatible with the ...
Kalvis Brangulis
wiley   +1 more source

基于模拟退火粒子群算法的圆柱齿轮减速器的可靠性优化

open access: yesJixie chuandong, 2010
Simulate anneal-particle swarm optimization(SA-PSO) is a simple and efficient stochastic global optimization algorithm,and simulated annealing is involved into particle swarm optimization(PSO) with Crossover and Gaussian mutation.The reliability ...
郑严, 程文明, 程跃, 吴晓
doaj  

Global Optimality Guarantees for Policy Gradient Methods

open access: yesOperations Research
Policy gradient methods, which have powered a lot of recent success in reinforcement learning, search for an optimal policy in a parameterized policy class by performing stochastic gradient descent on the cumulative expected cost-to-go under some initial state distribution.
Jalaj Bhandari, Daniel Russo 0001
openaire   +2 more sources

A hybrid one-then-two stage algorithm for computationally expensive electromagnetic design optimization

open access: yes, 2006
A novel kriging-assisted algorithm is proposed for computationally expensive single-objective optimization. The principle behind the algorithm is to use information about objective function space at the earliest possible opportunity. After constructing a
G. I. Hawe   +7 more
core   +1 more source

Aquaporin‐3 and aquaporin‐5 impact the development of pancreatic ductal adenocarcinoma spheroids

open access: yesFEBS Open Bio, EarlyView.
Schematic representation of the role of aquaporin‐3 (AQP3) and aquaporin‐5 (AQP5) in pancreatic ductal adenocarcinoma (PDAC). Both proteins are upregulated in PDAC and are associated with tumor progression and metastatic potential. Silencing AQP3 or AQP5 in PDAC spheroids results in decreased diameter, area, and overall growth, underscoring their key ...
Catarina Pimpão   +3 more
wiley   +1 more source

Convex Programming Methods for Global Optimization

open access: yes, 2005
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected variables are fixed. The selected variables must be discrete, or else discretized if they are continuous. We provide a survey of disjunctive programming with convex relaxations,
openaire   +2 more sources

A Consensus Approach to Distributed Convex Optimization in Multi-Agent Systems [PDF]

open access: yes, 2013
In this thesis we address the problem of distributed unconstrained convex optimization under separability assumptions, i.e., the framework where a network of agents, each endowed with local private convex cost and subject to communication constraints ...
Filippo Zanella, Zanella, Filippo
core  

Modifications of the Limited Memory BFGS Algorithm for Large-scale Nonlinear Optimization

open access: yes, 2005
In this paper we present two new numerical methods for unconstrained large-scale optimization. These methods apply update formulae, which are derived by considering different techniques of approximating the objective function.
June, Leong Wah, Hassan, Malik Abu
core   +1 more source

Home - About - Disclaimer - Privacy