The linear complementarity problem (LCP ) belongs to the class of NP-complete problems. Therefore we can not expect a polynomial time solution method for LCP s without requiring some special property of the matrix of the problem. We show that the dual LCP can be solved in polynomial time if the matrix is row sufficient, moreover in this case all feasible solutions are complementary. Furthermore...

results the mean age in breathing technique with lavender and breathing technique alone were 25.5 ± 4.3 and 26 ± 4.9, respectively .two groups were comparable in this regards (p = 0.6), but the length of active phase in interventional group was 7.85 ± 3.85 hours and in the control group it was 9.88 ± 6.65 hours. the decrease of the length of labor in the active phase was higher in the experimen...

In this paper, based on the assumption that both the leading principal submatrix of r-order and its complementary submatrix in A(t) have eigenvalues with only negative real parts, we establish a criterion for the stability of a class of nonlinear time-varying dynamic system dx/dt = A(t)x+ f(t, x). Also a feasible method for decomposition and aggregation of large-scale system is provided. Moreov...

Linear programming with linear complementarity constraints (LPLCC) is an area of active research in Optimization, due to its many applications, algorithms, and theoretical existence results. In this paper, a number of formulations for important nonconvex optimization problems are first reviewed. The most relevant algorithms for computing a complementary feasible solution, a stationary point, an...

This research assesses whether fortified cereal blends such as corn-soy blend (CSB) or wheat-soy (WSB) blend can significantly contribute to improving the quality of the diet of infants and young children 6 to 23 months of age. A series of participatory recipe trials was conducted to assess current complementary feeding practices in the Central Plateau of Haiti and to develop new, improved reci...

This paper introduces two complexity-theoretic formulations of Bennett’s logical depth: finite-state depth and polynomial-time depth. It is shown that for both formulations, trivial and random infinite sequences are shallow, and a slow growth law holds, implying that deep sequences cannot be created easily from shallow sequences. Furthermore, the E analogue of the halting language is shown to b...

PURPOSE/OBJECTIVES To evaluate patient characteristics to predict selection and maintenance of a complementary therapy and the feasibility of a randomized clinical trial (RCT) of complementary therapies. DESIGN Quasi-experimental, exploratory study, unblinded and nonrandomized. SETTING A comprehensive cancer center in Michigan. SAMPLE 96 patients undergoing chemotherapy, predominantly Cau...

It is common to identify the class of computable functions with the class of functions computable by the Turing machine. The identification is done on the ground of the famous Church-Turing thesis. In fact, the thesis justifies only one implication: computable function are Turing computable. The other implication is quite obviously false if computability means practical computability. I am not ...

As complementary technologies evolve, data compression continues to be a foundational aspect of growing digital collections. In this study, selected lossless still image codecs from 1992 through 2022 were benchmarked across variety efficiency and performance measures using reference images cultural heritage. Additionally, entropy estimates calculated by source assist in characterizing informati...