• Title/Summary/Keyword: MODI method

Search Result 28, Processing Time 0.023 seconds

Evaluations on a Pressure-Field Calculation Method using PIV Synthetic Image (가상영상 PIV기반 압력장 계산법 평가)

  • Lee, Chang Je;Cho, Gyong Rae;Kim, Uei Kan;Kim, Dong Hyuk;Doh, Deog Hee
    • Journal of the Korean Society of Visualization
    • /
    • v.14 no.2
    • /
    • pp.46-51
    • /
    • 2016
  • In this study, a Masked Omni-Directional Integration(MODI) method for pressure calculation is proposed using the Particle Image Velocimetry (PIV) data. To obtain the velocity field, the Affine PIV method was adopted. Synthetic images were generated for a solid body rotation. Calculation on the pressure was based on the Navier-Stokes equation. The results obtained by the MODI were compared with those obtained by theoretical pressure and by the Omni-Directional Integration(ODI) method. It was shown that the minimum error by the proposed MODI method was attained when the mask size was 1.

Operation and Satisfaction of Physical Computing Classes Using MODI (MODI를 활용한 피지컬 컴퓨팅 수업 운영 및 만족도)

  • Seo, Eunsil
    • Journal of Engineering Education Research
    • /
    • v.26 no.1
    • /
    • pp.37-44
    • /
    • 2023
  • Recently, the Internet of Things is attracting attention as an important key technology of the 4th Industrial Revolution, and SW education using physical computing is suggested as a good alternative to supplement the problems raised by beginners in programming education. Among the many teaching tools that can be used for physical computing education, MODI is a modular manufacturing tool that anyone can easily assemble like Lego. MODI is a teaching tool that can improve learners' achievement by linking a self-linked block-type code editor called MODI Studio to lay the foundation for programming in a relatively small amount of time and immediately check the results in person. In this paper, a physical computing education method using MODI was designed to be applied to basic programming courses for programming beginners and applied to after-school classes for middle school students. As a result, it was found that students' interest and satisfaction were much higher in physical computing classes using MODI than in text-based programming classes. It can be seen that physical computing education that allows beginners to see and feel the results in person is more effective than grammar-oriented text programming, and it can have a positive effect on improving basic programming skills by increasing students' participation.

The Advanced z-Transform and Analysis of Sampled-Data Systems

  • Chung, Tae-Sang
    • Proceedings of the KIEE Conference
    • /
    • 1996.11a
    • /
    • pp.49-51
    • /
    • 1996
  • The z-transform method is a basic mathematical tool in analyzing and designing sampled-data control systems. However, since the z-transform method relates only the sampling-instants signals, another mathematical tool is necessary to describe the continous signals between the sampling instants. For this purpose the delayed and the modi fled z-transform methods were developed. The definition of the modi fled z-transform includes a sample in the interval [-T,0] of the original signal in its series expression, where the signal value is always zero for any physical system. From this reason one step skew of the time index always appears in its application formulas. This introduces an unnecessary operation and a gap in linking the mathematical formula and its physical interpretation. Considering the conceptual difficulty and application inconvenience, a method of using the advanced z-transform in analysis of sampled-data control systems is developed as a replacement of the modi fled z-transform. With one formulation of the advanced z-transform, now it is possible to relate both the signals of the sampling instants and those in between without any complication and conceptual difficulty.

  • PDF

NEW RANKING AND NEW ALGORITHM FOR SOLVING DUAL HESITANT FUZZY TRANSPORTATION PROBLEM

  • K. HEMALATHA;VENKATESWARLU. B
    • Journal of applied mathematics & informatics
    • /
    • v.42 no.5
    • /
    • pp.1077-1090
    • /
    • 2024
  • In this study, a dual hesitant uncertain setting is employed to study the transportation issue. The dual hesitant fuzzy set handles ambiguous, unreliable, or inaccurate data as well as conditions in real-world practical research queries that are impossible or difficult to solve according to current fuzzy uncertainties. The dual hesitant fuzzy set (DHFS) is composed of a membership hesitant function as well as a non-membership hesitant function. In this investigation, we developed a new scoring formula for converting dual hesitant fuzzy numbers (DHFNs) to crisp values and suggested a novel algorithm called contraharmonic mean for addressing the dual hesitant fuzzy problem of transportation. Excel solver is utilized to find the contraharmonic mean. Additionally, we employed the modified distribution (MODI) method to achieve the best possible result. The recommended approach is then explained using a mathematical instance, and its efficacy can be demonstrated by comparing it to previously used techniques.

Aggregate Planning Using Least Cost First Assignment Algorithm of Transportation Problem (운송 문제의 최소비용 우선 배정 알고리즘을 적용한 총괄계획)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.5
    • /
    • pp.181-188
    • /
    • 2021
  • In preparing a aggregate production plan(APP), the transportation method generally uses a linear planning(LP) software package for TSM(transportation simplex method), which seeks initial solutions with either NCM, LCM, or VAM specialized in transportation issues and optimizes them with either SSM or MODI. On the other hand, this paper proposes a transportation method that easily, quickly, and accurately prepares a APP without software package assistance. This algorithm proposed simply assigned to least cost-first, and minimized the inventory periods. Applying the proposed algorithm to 6-benchmarking data, this algorithm can be obtained better optimal solution than VAM or LP for 4 data, and we obtain the same results for the remained 2 data.

The Efficacy of Ultrasonography-guided S1 Selective Nerve Root Block (초음파를 이용한 제 1천추 선택적 신경근 차단술의 유용성)

  • Jeon, Young Dae;Kim, Tae Gyun;Shim, Dae Moo;Kim, Chang Su
    • The Journal of Korean Orthopaedic Ultrasound Society
    • /
    • v.7 no.2
    • /
    • pp.113-119
    • /
    • 2014
  • Purpose: This study was to evaluate effect and efficiency of S1 selective nerve root block using ultrasonography-guided compared with fluoroscopy-guided for lumbar disc herniation or spinal stenosis patients. Materials and Methods: Between February 2012 and December 2013, 38 patients who were with lower leg radiating pain for more than 1months and underwent S1 selective spinal nerve root block in our institution, were reviewed. They divided into two groups: Group A included 18 patients with ultrasonography-guided and Group B included 20 patients with fluoroscopy-guided. Treatment effectiveness was assessed using a visual analogue scale (VAS) and the Korea Modified Oswestry Disability Index (K-MODI). They were evaluated its preoperatively, postoperatively and 1 month later. We were recorded whole procedure time. Results: VAS was improved from 7.4 to 4.7 at 1 month in group A and from 7.39 to 4.36 at 1month in group B. K-MODI was improved from 72.8 to 43.3 at 1month in group A and from 73.8 to 44.1 at 1month in group B. Whole procedure time were $477.53{\pm}115.02s$, $492.47{\pm}144.38s$ in group A, group B, respectively. But there was no significant difference in VAS and K-MODI between two groups. Conclusion: Ultrasonography-guided sacral nerve root block is effective and accurate method in sacral radiating pain.

  • PDF

Modified Recursive PC (수정된 반복 주성분 분석 기법에 대한 연구)

  • Kim, Dong-Gyu;Kim, Ah-Hyoun;Kim, Hyun-Joong
    • The Korean Journal of Applied Statistics
    • /
    • v.24 no.5
    • /
    • pp.963-977
    • /
    • 2011
  • PCA(Principal Component Analysis) is a well-studied statistical technique and an important tool for handling multivariate data. Although many algorithms exist for PCA, most of them are unsuitable for real time applications or high dimensional problems. Since it is desirable to avoid extensive matrix operations in such cases, alternative solutions are required to calculate the eigenvalues and eigenvectors of the sample covariance matrix. Erdogmus et al. (2004) proposed Recursive PCA(RPCA), which is a fast adaptive on-line solution for PCA, based on the first order perturbation theory. It facilitates the real-time implementation of PCA by recursively approximating updated eigenvalues and eigenvectors. However, the performance of the RPCA method becomes questionable as the size of newly-added data increases. In this paper, we modified the RPCA method by taking advantage of the mathematical relation of eigenvalues and eigenvectors of sample covariance matrix. We compared the performance of the proposed algorithm with that of RPCA, and found that the accuracy of the proposed method remarkably improved.

HERMITE INTERPOLATION USING PH CURVES WITH UNDETERMINED JUNCTION POINTS

  • Kong, Jae-Hoon;Jeong, Seung-Pil;Kim, Gwang-Il
    • Bulletin of the Korean Mathematical Society
    • /
    • v.49 no.1
    • /
    • pp.175-195
    • /
    • 2012
  • Representing planar Pythagorean hodograph (PH) curves by the complex roots of their hodographs, we standardize Farouki's double cubic method to become the undetermined junction point (UJP) method, and then prove the generic existence of solutions for general $C^1$ Hermite interpolation problems. We also extend the UJP method to solve $C^2$ Hermite interpolation problems with multiple PH cubics, and also prove the generic existence of solutions which consist of triple PH cubics with $C^1$ junction points. Further generalizing the UJP method, we go on to solve $C^2$ Hermite interpolation problems using two PH quintics with a $C^1$ junction point, and we also show the possibility of applying the modi e UJP method to $G^2[C^1]$ Hermite interpolation.

Development of Methods to lmprove the Reliability of ELECTRE (복합기준 평가방법 ELECTRE의 신뢰도 증진을 위한 방안 연구)

  • 이인성
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.23 no.1
    • /
    • pp.23-38
    • /
    • 1995
  • ELEECTRE is a less demanding and potentially Bffective multiattribute evaluation method for pre-editing proeedure. The method, however, was developed based on probabilistic mathematicsand its reliability has never'been emprieally tested. This article examined the reliability of ELECTRo under various conditions of linear and non-linear utility func- tions using a Monte-Carlo shnulation, and found the method eausea a considerably high rate of error. To enhance the reliability of ELECTRE, two ways of modi(ication - adjust- ment of threshold values of concordance and discordance matrices, and adjustment of the required nunlber of probably-dominant alternatives to eliminate a probably-dominated alternative - were suggested, and their effctiveness was also tesed by a Monte-Carlo simulation. The simulation result chows that these modifications cponsiderably improve the reliability of ELECTRE, and yet maintain a reasonably high level of efficiency. Through these modifications, ELECTRE can be used as an efficient and feliable pre-editing method. Ways to implement ELECTRE in the construction of plainning decision support systens were discussed. The impli(els combination of this method and other multiattribute evaluation methods will help to create more effective decision suport systems.

  • PDF