Готові списки джерел за темами / Minimizing total deviation

Добірка наукової літератури з теми "Minimizing total deviation"

Автор: Grafiati

Опубліковано: 30 травня 2022

Оновлено: 31 травня 2022

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Статті в журналах
Дисертації
Тези доповідей конференцій

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Minimizing total deviation".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Minimizing total deviation"

Mosheiov, Gur. "Minimizing total completion time and total deviation of job completion times from a restrictive due-date." European Journal of Operational Research 165, no. 1 (August 2005): 20–33. http://dx.doi.org/10.1016/j.ejor.2003.09.029.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Choi, Byung-Cheon, Yunhong Min, and Myoung-Ju Park. "Strong NP-hardness of minimizing total deviation with generalized and periodic due dates." Operations Research Letters 47, no. 5 (September 2019): 433–37. http://dx.doi.org/10.1016/j.orl.2019.08.002.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Chang, Pei‐Chann (Michael), and Han‐Chau (Garey) Lee. "A two‐phase approach for single machine scheduling problems: Minimizing the total absolute deviation." Journal of the Chinese Institute of Engineers 15, no. 6 (September 1992): 735–42. http://dx.doi.org/10.1080/02533839.1992.9677469.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Gao, Yuan, and Jinjiang Yuan. "Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates." Discrete Applied Mathematics 189 (July 2015): 49–52. http://dx.doi.org/10.1016/j.dam.2015.03.011.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Chang, Pei-Chann, Jih-Chang Hsieh, and Yen-Wen Wang. "Genetic algorithms applied in BOPP film scheduling problems: minimizing total absolute deviation and setup times." Applied Soft Computing 3, no. 2 (September 2003): 139–48. http://dx.doi.org/10.1016/s1568-4946(03)00009-7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Su, Ling-Huey, Fuh-Der Chou, and James C. Chen. "Minimizing makespan subject to minimum total absolute deviation of completion time on identical parallel machines." Engineering Optimization 44, no. 10 (October 2012): 1187–95. http://dx.doi.org/10.1080/0305215x.2011.644544.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Su, Ling-Huey, and Hui-Mei Wang. "Minimizing total absolute deviation of job completion times on a single machine with cleaning activities." Computers & Industrial Engineering 103 (January 2017): 242–49. http://dx.doi.org/10.1016/j.cie.2016.11.009.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Liu, Shuo, Weizhen Zhu, Zhaopeng Xu, and Meijing Gao. "Automatic and robust phase aberration compensation for digital holographic microscopy based on minimizing total standard deviation." Optics and Lasers in Engineering 134 (November 2020): 106276. http://dx.doi.org/10.1016/j.optlaseng.2020.106276.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Shahrokhi, Saman, Adel El-Shahat, Fatemeh Masoudinia, Foad H. Gandoman, and Shady H. E. Abdel Aleem. "Sizing and Energy Management of Parking Lots of Electric Vehicles Based on Battery Storage with Wind Resources in Distribution Network." Energies 14, no. 20 (October 17, 2021): 6755. http://dx.doi.org/10.3390/en14206755.

Повний текст джерела

Анотація:

In this paper, an optimal sizing and placement framework (OSPF) is performed for electric parking lots integrated with wind turbines in a 33-bus distribution network. The total objective function is defined as minimizing the total cost including the cost of grid power, cost of power losses, cost of charge and discharge of parking lots, cost of wind turbines as well as voltage deviations reduction. In the OSPF, optimization variables are selected as electric parking size and wind turbines, which have been determined optimally using an intelligent method named arithmetic optimization algorithm (AOA) inspired by arithmetic operators in mathematics. The load following strategy (LFS) is used for energy management in the OSPF. The OSPF is evaluated in three cases of the objective function such as minimizing the cost of power losses, minimizing the network voltage deviations, and minimizing the total objective function using the AOA. The capability of the AOA is compared with the well-known particle swarm optimization (PSO) and artificial bee colony (ABC) algorithms for solving the OSPF in the last case. The findings show that the power loss, voltage deviations, and power purchased from the grid are reduced considerably based on the OSPF using the AOA. The results show the lowest total cost of energy and also minimum network voltage deviation (third case) by the AOA in comparison with the PSO and ABC with a higher convergence rate, which confirms the better capability of the proposed method. The results of the first and second cases show the high cost of power purchased from the main grid as well as the high total cost. Therefore, the comparison of different cases confirms that considering the cost index along with losses and voltage deviations causes a compromise between different objectives, and thus the cost of purchasing power from the main network is significantly reduced. Moreover, the voltage profile of the network improves, and also the minimum voltage of the network is also enhanced using the OSPF via the AOA.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ganesan, Viswanath Kumar, and Appa Iyer Sivakumar. "Scheduling in static jobshops for minimizing mean flowtime subject to minimum total deviation of job completion times." International Journal of Production Economics 103, no. 2 (October 2006): 633–47. http://dx.doi.org/10.1016/j.ijpe.2005.12.004.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Minimizing total deviation"

Маленко, Анастасія Олексіївна. "Задача мінімізації сумарного відхилення від спільного директивного строку при виконанні завдань паралельними пристроями". Master's thesis, Київ, 2018. https://ela.kpi.ua/handle/123456789/23799.

Повний текст джерела

Анотація:

Магістерська дисертація: 101 с., 26 рис., 22 табл., 1 додаток, 55 джерел. Актуальність. Задачі теорії розкладів широко вивчаються в літературі останні 50 років, їх розгляду приділяється значна увага з боку багатьох вчених і фахівців-практиків по всьому світу. Складні реальні задачі, з якими стикаються різні типи компаній, стали викликом для пошуку шляхів їх розв’язання. Результати отримані дослідженнями різних науковців свідчать про актуальність проблеми та потребу в її подальшому дослідженні. Таким чином, можна з упевненістю сказати, що питання теорії розкладів є одним з найбільш поширених питань в галузі дослідження операцій і наук управління. Проблематика теорії розкладів охоплює дослідження обчислювальної складності задач, розробку точних, наближених та евристичних алгоритмів їх розв’язання. При цьому більшість праць присвячено розвитку комбінаторних підходів. Однак, як показує практика, можливості комбінаторних алгоритмів суттєво обмежені розмірністю розв’язуваних задач. У зв’язку з цим актуальною є розробка програмного продукту для складання розкладу виконання завдань паралельними пристроями, який допоможе мінімізувати сумарне відхилення від директивних строків. Зв'язок роботи з науковими програмами, планами, темами. Робота виконувалась на кафедрі автоматизованих систем обробки інформації та управління Національного технічного університету України «Київський політехнічний інститут ім. Ігоря Сікорського» в рамках теми «Ефективні методи розв’язання задач теорії розкладів» (№ 0117U000919). Мета і завдання дослідження – підвищення якості розв’язку задач календарного планування за рахунок побудови оптимального чи близького до оптимального розкладу, що дозволяє мінімізувати середній час відхилення від директивних строків. 4 Для досягнення мети необхідно виконати наступні завдання:  виконати аналітичний огляд відомих результатів, з розв’язання поставленої в рамках роботи задачі;  розробити алгоритм створення календарного плану виконання завдань паралельними пристроями, що мінімізує сумарне відхилення моментів завершення завдань від директивних строків;  розробити програмну реалізацію розробленого алгоритму;  виконати аналіз отриманих результатів. Об’єкт дослідження – оперативно-календарне планування дрібносерійного виробництва. Предмет дослідження – моделі та методи розв’язання задач календарного планування з метою мінімізації сумарного відхилення виконання завдань від директивних строків паралельними пристроями. Методи дослідження, застосовані в роботі, базуються на методах та алгоритмах теорії розкладів та дослідження операцій. Наукова новизна отриманих результатів. Розроблено евристичний алгоритм розв‘язання задачі мінімізації сумарного відхилення від спільного директивного строку при виконанні завдань паралельними пристроями. Публікації. Матеріали роботи опубліковано у Міжнародному науковому журналі «Науковий огляд» – №9(14). – с. 14–32 у 2017 році [1], також матеріали опубліковано в тезах 20-ї Міжнародної науково-технічної конференції SAIT 2018 [2], наукової конференції студентів, магістрантів та аспірантів «Інформатика та обчислювальна техніка» – ІОТ-2018 [3].
Master’s thesis: 101 pages, 26 figures, 22 tables, 1 appendix, 55 references. Relevance. Scheduling problems have been widely studying in the literature for 50 years, considerable attention from many scholars and practitioners around the world is given to their consideration. The complex real problems faced by different types of companies have become a challenge to find ways to solve them. The results obtained by researches of various scholars indicate the urgency of the problem and the need for its further research. Thus, one can confidently say that the question of the scheduling problems is one of the most common issues in the field of operations research and management sciences. The question of scheduling problems covers the studying the complexity of problems, the development of accurate, approximate and heuristic algorithms for their solution. At the same time, most works are devoted to the development of combinatorial approaches. However, as practice shows, the possibilities of combinatorial algorithms are essentially limited by the dimensionality of solvable problems. In this regard, it is relevant to develop a software product to scheduling tasks by parallel machines, which will help minimize the total deviation from a common due date. Relationship of work with scientific programs, plans, themes. The work was carried out at National Technical University of Ukraine «Igor Sikorsky Kyiv Polytechnic Institute» the department of Computer-Aided Management and Data Processing Systems within the theme “Effective methods for solving the problems of the theory of schedules” (state registration number 0117U000919). Purpose and objectives of the study. Improving the quality of solving problem scheduling tasks at the expense of construction an optimal or close to optimal schedule, which minimizes the average deviation time from due dates. The following tasks:  performing the known scheduling results analytical review;  developing an algorithm for minimizing the total deviation for common due date by parallel machine scheduling; 6  developing a software implementation of the algorithm in a form that can be used for schedule optimizing;  performing an analysis of the results. The object of study is operational planning of small-scale production. Subject of research: models and methods for solving scheduling problems in order to minimize the total deviation of completion times from a common due date by parallel machines. Scientific novelty of the research. A heuristic algorithm for solving the problem of minimizing the total deviation from the common policy term when performing tasks with parallel devices is developed. Publications. Materials of the work are published in the International Scientific Journal "Scientific Review" - № 9 (14). - p. 14-32 in 2017 [1], materials are also published in the theses of the 20th International Scientific and Technical Conference SAIT 2018 [2] and in the scientific conference of students, graduate students and postgraduates "Informatics and Computing" 2018 [3].

Стилі APA, Harvard, Vancouver, ISO та ін.

ZHANG, CUN-ZHI, and 張存智. "Minimizing the total absolute deviation of completion time on a single machine with dust accumulation consideration." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/69278452192339526463.

Повний текст джерела

Анотація:

碩士
中原大學
工業與系統工程研究所
103
This paper considers wafer manufacturing of semiconductor where wafer cleaning should be taken to avoid pollution. The function of wafer cleaning is to clean up the dirt, i.e., particle, organic, and metal-lons on the surface of wafer. Thus, we deal with the problem of scheduling jobs and dirt clean-up based maintenance to avoid the loss of capacity. The machine has to be stopped to clean up the dirt once the accumulation of dirt on the machine is over a limited value.The objective is to minimize the total absolute deviation of completion time. This problem is strongly NP-hard. A mixed binary integer programming model is developed to optimally solve this problem. Furthermore, an efficient heuristic algorithm is proposed for solving large-sized problems. In this study, we have an integer programming model for the following problem:1│clean-up│TADC.Model uses binary variables to control whether the maintenance is carried or not. The large size problem is solved by the heuristic algorithm. The results showed that optimal solution is better than heuristic algorithm when p_i=∪[1,10] the average error is 4.35%；p_i=∪[1,100]the average error is 4.99% .

Стилі APA, Harvard, Vancouver, ISO та ін.

Che, Feng-Sheng, and 馮聖哲. "Minimizing makespan subject to minimize total absolute deviation of completion time in an identical parallel machine system." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/13566588065249963538.

Повний текст джерела

Анотація:

碩士
中原大學
工業與系統工程研究所
98
This study addresses the identical parallel machine scheduling problem in which makespan are minimized subject to minimize TADC, denoted as P||TADC/ΣCmax . An optimal algorithm is first proposed to solve TADC on identical parallel machine, then a binary integer programming model is developed to minimize makespan. Computational Experiments are conducted and the computation results are reported.

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Minimizing total deviation"

Li, You, Zhibin Jiang, and Wenyou Jia. "A heuristic algorithm for minimizing total absolute deviation from distinct due dates on a single machine." In 2013 IEEE International Conference on Automation Science and Engineering (CASE 2013). IEEE, 2013. http://dx.doi.org/10.1109/coase.2013.6653966.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Mor, Baruch, and Gur Mosheiov. "Minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job rejection." In The Second International Workshop on Dynamic Scheduling Problems. Polish Mathematical Society, 2018. http://dx.doi.org/10.14708/isbn.978-83-951298-0-3p69-72.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hong-guang, Bo, Li Huan-zhi, Zhang Hui-lin, Guo Yi, and Mu Wei. "Disruption Recovery Model for Complex Flow Shop Scheduling With Considering Behavior Under Environment of the Internet of Things." In ASME 2017 12th International Manufacturing Science and Engineering Conference collocated with the JSME/ASME 2017 6th International Conference on Materials and Processing. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/msec2017-2827.

Повний текст джерела

Анотація:

Disruptions happen in the actual manufacturing system under environment of the Internet of Things and they make the system difficult to manage. However, the convenient access to information of orders, equipment and participants make disruption recovery easier. In this paper we build a disruption recovery scheduling integer programming model considering the objective of minimizing total weighted completion-time (as the original objective) and the objectives of maximizing total consumer satisfaction degree & minimizing total deviation degree (as the revising objective). A PVPS (PSO & VNS Parallel Search) algorithm is proposed. The experiments results prove all above are effective.

Стилі APA, Harvard, Vancouver, ISO та ін.

Pramanik, N., U. Roy, R. Sudarsan, R. D. Sriram, and K. W. Lyons. "Synthesis of Geometric Tolerances of a Gearbox Using a Deviation-Based Tolerance Synthesis Scheme." In ASME 2003 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2003. http://dx.doi.org/10.1115/detc2003/cie-48192.

Повний текст джерела

Анотація:

In this paper a step-by-step procedure for carrying out synthesis of geometric tolerances of a planetary gearbox using a deviation-based tolerance synthesis (TS) scheme has been presented. The TS scheme uses an optimization for minimizing total cost of manufacturing, subject to constraints for assemblability of parts and constraints for functional requirements. The TS work is carried out in several stages. First the gearbox with its nominal dimensions is converted into a model that could serve as input to the synthesis module. Cost functions and constraints equations are then generated using deviation parameters of features. The optimization is carried out using these equations in standard non-linear minimization tools (Matlab) and the optimal deviation parameters are subsequently mapped into suitable tolerance specifications or tolerance zones as per ANSI Y14.5 tolerancing standards.

Стилі APA, Harvard, Vancouver, ISO та ін.

Mihalyovics, Jan, Christian Brück, Dieter Peitsch, Ilias Vasilopoulos, and Marcus Meyer. "Numerical and Experimental Investigations on Optimized 3D Compressor Airfoils." In ASME Turbo Expo 2018: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/gt2018-76826.

Повний текст джерела

Анотація:

The objective of the presented work is to perform numerical and experimental studies on compressor stators. This paper presents the modification of a baseline stator design using numerical optimization resulting in a new 3D stator. The Rolls Royce in-house compressible flow solver HYDRA was employed to predict the 3D flow, solving the steady RANS equations with the Spalart-Allmaras turbulence model, and its corresponding discrete adjoint solver. The performance gradients with respect to the input design parameters were used to optimize the stator blade with respect to the total pressure loss over a prescribed incidence range, while additionally minimizing the flow deviation from the axial direction at the stator exit. Non-uniform profile boundary conditions, being derived from the experimental measurements, have been defined at the inlet of the CFD domain. The presented results show a remarkable decrease in the axial exit flow angle deviation and a minor decrease in the total pressure loss. Experiments were conducted on two compressor blade sets investigating the three-dimensional flow in an annular compressor stator cascade. Comparing the baseline flow of the 42° turning stator shows that the optimized stator design minimizes the secondary flow phenomena. The experimental investigation discusses the impact of steady flow conditions on each stator design while focusing on the comparison of the 3D optimized design to the baseline case. The flow conditions were investigated using five-hole probe pressure measurements in the wake of the blades. Furthermore, oil-flow visualization was applied to characterize flow phenomena. These experimental results are compared with the CFD calculations.

Стилі APA, Harvard, Vancouver, ISO та ін.

Söderberg, Rikard. "Robust Design by Tolerance Allocation Considering Quality and Manufacturing Cost." In ASME 1994 Design Technical Conferences collocated with the ASME 1994 International Computers in Engineering Conference and Exhibition and the ASME 1994 8th Annual Database Symposium. American Society of Mechanical Engineers, 1994. http://dx.doi.org/10.1115/detc1994-0064.

Повний текст джерела

Анотація:

Abstract Involving customer values in the design process is necessary to improve the total quality of a product. The purpose of this work is to establish a theoretical base for tolerance allocation which allows both quality and manufacturing cost to be considered. The paper addresses functional tolerance chains, i.e. tolerance chains that involve a dimension important for the function of the product or component. The total loss to customer is determined as the sum of two tolerance dependent properties; the functionality loss and the component price. The functionality loss represents the customer’s economical loss due to poor functionality. The optimal tolerance limits are found by minimizing the total loss to customer. These are the limits that represent the best trade-off between cost and quality, from the customer’s point of view. This work specially emphasizes a method for treating asymmetrical functionality loss, i.e. when the design is more sensitive to a deviation of a critical parameter in one direction than in the other. By moving the manufacturing target in a direction away from the most sensitive part, the total loss to customer can be reduced. This paper describes how the optimal manufacturing target and corresponding symmetrical tolerance band are found. This method thus increases the robustness of the design. The method may be used for single tolerances or any resulting tolerance of a tolerance chain.

Стилі APA, Harvard, Vancouver, ISO та ін.

Garzon, Victor E., and David L. Darmofal. "On the Aerodynamic Design of Compressor Airfoils for Robustness Under Geometric Uncertainty." In ASME Turbo Expo 2004: Power for Land, Sea, and Air. ASMEDC, 2004. http://dx.doi.org/10.1115/gt2004-53581.

Повний текст джерела

Анотація:

This paper considers the aerodynamic design of compressor blade sections for improved performance robustness in the face of geometric uncertainty caused by noisy manufacturing processes. A probabilistic, gradient-based optimization method was used to redesign subsonic and transonic compressor airfoils subjected to geometric variability. Three different design goals were considered: Minimizing the deterministic profile total pressure loss coefficient, minimizing the mean value of loss coefficient, and minimizing the loss variability. In both transonic and subsonic applications, deterministic minimization of loss coefficient produced essentially the same airfoils as the probabilistic minimization of mean loss. However probabilistic minimization of loss variability produced clearly different airfoils which achieved reductions of 20% or more in standard deviation of loss compared to the minimum-loss designs. For the subsonic application, the improved robustness of the minimum variability design was achieved through a reduction in diffusion immediately downstream of the leading edge on the pressure side. This reduction in diffusion resulted in less sensitivity of the boundary layer to geometric variability in the leading edge region. For the transonic application, the robustness improvement was achieved by redesigning the suction side to produce a constant pressure region immediately downstream of the passage shock, which had the effect of desensitizing the boundary layer to variability in shock strength and position. A meanline model was used to assess the impact of probabilistic airfoil section optimization on overall compressor performance. While the mean efficiency was found to be nearly the same for all designs, the robust blade designs produced a decrease in compressor efficiency variability of 50% compared to the minimum-loss designs.

Стилі APA, Harvard, Vancouver, ISO та ін.

Kazancioglu, Emre, Guangquan Wu, Jeonghan Ko, Stanislav Bohac, Zoran Filipi, S. Jack Hu, Dennis Assanis, and Kazuhiro Saitou. "Robust Optimization of an Automotive Valvetrain Using a Multiobjective Genetic Algorithm." In ASME 2003 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2003. http://dx.doi.org/10.1115/detc2003/dac-48714.

Повний текст джерела

Анотація:

A robust optimization of an automobile valvetrain is presented where the variation of engine performances due to the component dimensional variations is minimized subject to the constraints on mean engine performances. The dimensional variations of valvetrain components are statistically characterized based on the measurements of the actual components. Monte Carlo simulation is used on a neural network model built from an integrated high fidelity valvetrain-engine model, to obtain the mean and standard deviation of horsepower, torque and fuel consumption. Assuming the component production cost is inversely proportional to the coefficient of variation of its dimensions, a multi-objective optimization problem minimizing the variation in engine performances and the total production cost of components is solved by a multi-objective genetic algorithm (MOGA). The comparisons using the newly developed Pareto front quality index (PFQI) indicate that MOGA generates the Pareto fronts of substantially higher quality, than SQP with varying weights on the objectives. The current design of the valvetrain is compared with two alternative designs on the obtained Pareto front, which suggested potential improvements.

Стилі APA, Harvard, Vancouver, ISO та ін.

Yau, Hong-Tzong. "Best Fit Uncertainty Analysis for Computing Geometric Tolerances." In ASME 1997 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1997. http://dx.doi.org/10.1115/detc97/dac-3727.

Повний текст джерела

Анотація:

Abstract In computing geometric tolerances using point data from a coordinate measuring machine (CMM), a best fit process needs to be carried out to bring the measurement data to the coordinate system of the substitute geometry. The measurement data does not precisely conform to the substitute geometry. It involves errors from machining as well as measurement itself. With this error-carrying measurement data, the best fit result contains uncertainties which in turn reduce the accuracy of the evaluated tolerances. In this paper, a model is proposed to estimate the best fit uncertainties caused by surface deviation, point location, and CMM sample size. The model was verified by simulation and experiment. To explore factors that affect the uncertainty variations, geometric variables that influence the uncertainties were first studied. Then, to understand the effect of point location on the uncertainty, optimization using the conjugate gradient method was developed to find the best measurement locations by minimizing the total uncertainties. In addition, simulations showed that the uncertainty is inversely proportional to the squared root of the number of points. This result can be used to predict the CMM sample size that will control the best fit uncertainty under certain tolerances.

Стилі APA, Harvard, Vancouver, ISO та ін.

Hargett, Zachary, Manuel Gutierrez, and Melinda Harman. "Verification of Manual Digitization Methods During Experimental Simulation of Knee Motion." In ASME 2019 Verification and Validation Symposium. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/vvs2019-5158.

Повний текст джерела

Анотація:

Abstract Cadaveric testing is a common approach for verifying mathematical models used in computational modeling work. In the case of a knee joint model for calculating ligament tension during total knee replacement (TKR) motion, model inputs include rigid body motions defined using the Grood-Suntay coordinate system as a spatial linkage between the tibial component orientation relative to the femoral component. Using this approach requires the definition of coordinate systems for each rigid TKR component (i.e. tibial and femoral) based on fiducial points, manual digitization of a point cloud within the experimental setup, and registration of the orientation relative to the relevant bone marker array. The purpose of this study was to compare the variability between two different manual point digitization methods (a hand-held stylus and pivot tool each calibrated in the optical tracking system), using a TKR femoral component in a simulated cadaver limb experimental setup as an example. This was accomplished by verifying the mathematical algorithm used to calculate the coordinate system from the digitized points, quantifying the variability of the manual digitization methods, and discussing how any error could affect the computational model. For the hand-held stylus method, the standard deviation of the origin and, x-, y-, and z-axis calculations were 0.50mm, 1.31 degrees, 0.51 degrees, and 0.62 degrees, respectively. It is important to note that there is an additional error created using the hand-held stylus from required manual digitization of each rigid marker array. This average additional error was 0.54mm for the origin and 1.70, 1.66, and 0.98 degrees for the x-, y-, and z-axes, respectively. For the pivot tool method, the standard deviation was 0.35mm, 0.37 degrees, 1.27 degrees, and 1.24 degrees for the origin, x-, y-, and z-axes, respectively. It is essential to minimize experimental error, as small errors in alignment can substantially alter model outputs. In this study of cadaver simulation of limb motion, the pivot tool is the better option for minimizing error. Careful definition of fiducial points and repeatable manual digitization of the point cloud is critical for meaningful computational models of TKR motion based on cadaver experimental work.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!