نتایج جستجو برای: mehrotra type algorithm
تعداد نتایج: 2040369 فیلتر نتایج به سال:
The proximity criterion of Mehrotra and Beveridge, that divides the region around a solute into the Voronoi polyhedra defined by the solute atoms, has been modified to use the radical planes based on the solute atom Van der Waals spheres, as suggested by Gellatly and Finney, or on the interaction strength of the atom with the solvent. A comparison of these proximity criteria is given using the ...
Hacıgümüş, Iyer, Li and Mehrotra proposed the first scheme of executing SQL over encrypted data in the database-service-provider model. However, they did not address the security strength of the scheme over different attack models. While Hacıgümüş’ scheme looks secure in a general setting, this paper attempts to explore any plausible attacks against this scheme in specific environments. We pres...
In the present study, field goal shooting skills of female basketball players were assessed in the background to their reasoning ability. The sample consists of 100 female intercollegiate basketball players (age = 21.05±1.67 yrs.). Shooting skills and reasoning ability were assessed by Johnson’s “Basketball Field Goal Speed Shooting Test” and Mixed Type Group Test of Intelligence prepared by Me...
In this paper, we discuss the development of an Interior Point Method (IPM) solver for Second Order Cone Programming optimization problems that is capable of producing customized ANSI-C code for embedded, real-time applications. The customized code is generated for a given problem structure and makes use of no dynamic memory allocation, minimizes branching, wastes no mathematical or logical com...
This paper proposes a hybrid query refinement model for distance-based index structures supporting contentbased image retrievals. The framework refines a query by considering both the low-level feature space as well as the high-level semantic interpretations separately. Thus, it successfully handles queries where the gap between the feature components and the semantics is large. It refines the ...
Didier Portilla,* Rachel N. Shaffer, Mark D. Okusa, Rajnish Mehrotra, Bruce A. Molitoris, Timothy E. Bunchman, and Tod Ibrahim *Department of Medicine, University of Arkansas, Little Rock, Arkansas; American Society of Nephrology, Washington, DC; Department of Medicine, University of Virginia, Charlottesville, Virginia; Department of Internal Medicine, Harbor University of California–Los Angele...
This paper proposes a hybrid query refinement model for distance-based index structures supporting contentbased image retrievals. The framework refines a query by considering both the low-level feature space as well as the high-level semantic interpretations separately. Thus, it successfully handles queries where the gap between the feature components and the semantics is large. It refines the ...
In this paper, a new predictor-corrector method is proposed for solving sufficient linear complementarity problems (LCP) with an infeasible starting point. The method generates a sequence of iterates in a wide and symmetric neighborhood of the infeasible central path of the LCP. If the starting point is feasible or close to being feasible, then an ε-approximate solution is obtained in at most O...
This paper proposes a globally convergent predictor-corrector infeasible-interiorpoint algorithm for the monotone semide nite linear complementarity problem using the AlizadehHaeberly-Overton search direction, and shows its quadratic local convergence under the strict complementarity condition.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید