Results 41 to 50 of about 709,020 (315)

Research on the optimization method for PGNAA system design based on Signal-to-Noise Ratio evaluation

open access: yesNuclear Engineering and Technology, 2022
In this research, for improving the measurement performance of Prompt Gamma-ray Neutron Activation Analysis (PGNAA) set-up, a new optimization method for set-up design was proposed and investigated.
JiaTong Li   +4 more
doaj   +1 more source

Critical sets in parametric optimization [PDF]

open access: yesMathematical Programming, 1986
The authors consider the nonlinear parametric programming problem. They introduce the concept of a generalized critical point for the nonlinear programming problem as well as for the nonlinear parametric programming problem. The set of generalized critical points for the parametric programming problem is divided into five types and each type is studied
Jongen, H.Th., Jonker, P., Twilt, F.
openaire   +3 more sources

A steepest descent method for set optimization problems with set-valued mappings of finite cardinality [PDF]

open access: yes, 2021
In this paper, we study a first-order solution method for a particular class of set optimization problems where the solution concept is given by the set approach.
Bouza, Gemayqzel   +2 more
core   +1 more source

Optimal design of a set of permanent magnet generators with the same cross-section

open access: yesJournal of Microwaves, Optoelectronics and Electromagnetic Applications
The optimal design of a set of two permanent magnet generators that share the same cross section to reduce the manufacturing cost is presented using a gradient optimization algorithm.
Renato Carlson, Frederic Wurtz
doaj   +1 more source

Shape optimization for quadratic functionals and states with random right-hand sides [PDF]

open access: yes, 2015
International audienceIn this work, we investigate a particular class of shape optimization problems under uncertainties on the input parameters. More precisely, we are interested in the minimization of the expectation of a quadratic objective in a ...
Dambrine, Marc   +2 more
core   +1 more source

Test-and-Set in Optimal Space [PDF]

open access: yesProceedings of the forty-seventh annual ACM symposium on Theory of Computing, 2015
The test-and-set object is a fundamental synchronization primitive for shared memory systems. This paper addresses the number of registers (supporting atomic reads and writes) required to implement a one-shot test-and-set object in the standard asynchronous shared memory model with n processes. The best lower bound is log n − 1 for obstruction-free and
Giakkoupis, George   +3 more
openaire   +2 more sources

Isotone Optimization in R: Pool-Adjacent-Violators Algorithm (PAVA) and Active Set Methods

open access: yes, 2009
In this paper we give a general framework for isotone optimization. First we discuss a generalized version of the pool-adjacent-violators algorithm (PAVA) to minimize a separable convex function with simple chain constraints.
de Leeuw, Jan   +6 more
core   +1 more source

Proper Strict Efficiency in Set Optimization with Partial Set Order Relation

open access: yesMathematics
This paper is devoted to the investigation of the proper strict efficient solutions to a set optimization problem with a partial set order relation. Firstly, the notion of proper strict efficient solution defined by the Minkowski difference is introduced,
Wenyan Han, Guolin Yu
doaj   +1 more source

The Role of Hematopoietic Cell Transplantation in Ataxia‐Telangiectasia

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Ataxia‐telangiectasia (A‐T) is a DNA repair disorder characterized by neurodegeneration, immunodeficiency, and cancer predisposition. Hematopoietic cell transplantation (HCT) is an established therapy in related disorders such as Fanconi anemia (FA) and Nijmegen breakage syndrome (NBS), but its role in A‐T is unclear.
Laila Alkhouli   +3 more
wiley   +1 more source

The complexity of combinatorial optimization problems on d‐dimensional boxes [PDF]

open access: yes, 2007
The Maximum Independent Set problem in d-box graphs, i.e., in intersection graphs of axis-parallel rectangles in R-d, is known to be NP-hard for any fixed d >= 2.
Chlebikova, Janka   +5 more
core   +1 more source

Home - About - Disclaimer - Privacy