نتایج جستجو برای: local moment constraints
تعداد نتایج: 755597 فیلتر نتایج به سال:
This paper considers a modified empirical likelihood and uses it to estimate models with imperfect moment restrictions. Consistency, local normality and asymptotic optimality of the new estimator only require the local identifiability and the linear-quadratic representation. In imperfect situations, classical sandwich algorithms give bias estimations while the new estimator preserves its asympt...
UCTTP is a NP-hard problem, which must be performed for each semester frequently. The major technique in the presented approach would be analyzing data to resolve uncertainties of lecturers’ preferences and constraints within a department in order to obtain a ranking for each lecturer based on their requirements within a department where it is attempted to increase their satisfaction and develo...
This paper addresses the optimum dynamic balancing of planar parallel manipulators exemplified with a 2 DOF parallel manipulator articulated with revolute joints. The dynamic balancing is formulated as an optimisation problem such that while the shaking force balancing is accomplished through analytically obtained balancing constraints, an objective function based on the sensitivity analysis of...
abstract this study attempted to investigate the strategies used to translate clichés of emotions in dubbed movies in iranian dubbing context for home video companies. the corpus of the current study was parallel and comparable in nature, consisting of five original american movies and their dubbed versions in persian, and five original persian movies which served as a touchstone for judging n...
Segmentation of femurs in Anterior-Posterior x-ray images is very important for fracture detection, computer-aided surgery and surgical planning. Existing methods do not perform well in segmenting bones in x-ray images due to the presence of large amount of spurious edges. This paper presents an atlas-based approach for automatic segmentation of femurs in x-ray images. A robust global alignment...
In this paper we study the nonsmooth semi-infinite programming problem with inequality constraints. First, we consider the notions of local cone approximation $Lambda$ and $Lambda$-subdifferential. Then, we derive the Karush-Kuhn-Tucker optimality conditions under the Abadie and the Guignard constraint qualifications.
A novel descriptor able to improve the classification capabilities of a typical pattern recognition system is proposed in this paper. The introduced descriptor is derived by incorporating two efficient region descriptors, namely image moments and Local Binary Patterns (LBP), commonly used in pattern recognition applications, in the last decades. The main idea behind this novel feature extractio...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید