نتایج جستجو برای: LCPs
تعداد نتایج: 196 فیلتر نتایج به سال:
The importance of long-chain polyunsaturated fatty acids (LCPs) in the development of preterm infants is now well accepted but the source of dietary LCPs to be added to infant formulas remains controversial. We measured dietary intakes, fecal output, and percentages of intestinal absorption of n-6 and n-3 LCPs in healthy preterm infants fed exclusively preterm breast milk (PBM; n = 20), formula...
communicative moves and lexical cohesion patterns (lcps), as mounting evidence shows, are two important indicators in writing and publishing the ras. however, the interaction between these two crucial elements and the contribution of this interaction to the failure or success of the ras have not been given due attention to date. having this in mind and based on a sound theoretical framework, at...
The 2-LCPS problem, first introduced by Chowdhury et al. [Fundam. Inform., 129(4):329–340, 2014], asks one to compute (the length of) a longest palindromic common subsequence between two given strings A and B. We show that the 2-LCPS problem is at least as hard as the well-studied longest common subsequence problem for 4 strings. Then, we present a new algorithm which solves the 2-LCPS problem ...
Communicative moves and lexical cohesion patterns (LCPs), as mounting evidence shows, are two important indicators in writing and publishing the RAs. However, the interaction between these two crucial elements and the contribution of this interaction to the failure or success of the RAs have not been given due attention to date. Having this in mind and based on a sound theoretical framework, at...
BACKGROUND Docosahexaenoic acid (DHA) and arachidonic acid (AA) are long-chain polyunsaturated fatty acids (LCPs) that play pivotal roles in growth and neurodevelopment. OBJECTIVE We aimed to quantify the synthesis of LCPs in preterm infants fed infant formula containing LCPs. DESIGN Twenty-two preterm infants were randomly assigned to either the no-LCP group (fed formula without LCPs; n = ...
Specially structured linear complementarity problems (LCPs) and their solution by the miss-cross method are examined. The criss-cross method is known to be finite for LCPs with positive semidefinite bisymmetric matrices and with P-matrices. It is also a simple finite algorithm for oriented matroid programming problems. Recently Cottle, Pang, and Venkateswaran identified the class of (column, ro...
In this paper we propose a new large-update primal-dual interior point algorithm for P∗( ) linear complementarity problems (LCPs). We generalize Bai et al.’s [A primal-dual interior-point method for linear optimization based on a new proximity function, Optim. Methods Software 17(2002) 985–1008] primal-dual interior point algorithm for linear optimization (LO) problem to P∗( ) LCPs. New search ...
In this paper, general linear complementarity problems(Lf'Ps) are studied via global optimization problems. In particular, unsolvable 'LCPs are reformulated as multicriteria optimization, minimax optimization and quadratic programming problems. The solvability and unsolvability of LCPs are obtained via these reformulations. Furthermore, first-order and second-order global optimaiity conditions ...
In this paper we consider the problem of the longest common parameterized subsequence with fixed common substring (STR-IC-LCPS). In particular, we show that STR-IC-LCPS is NP-complete. We describe an approach to solve STR-IC-LCPS. This approach is based on an explicit reduction from the problem to the satisfiability problem.
Main-chain liquid crystalline polymers (LCPs) are used to produce strong fibers due to their ability to form highly-ordered orientational states. For sufficiently long chains it is known that loss of entropy in such highly-ordered states is partly recovered by the formation of socalled hairpins or kinks. The presence of hairpins not only modifies the microstructure of LCPs, but it has also been...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید