• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.860-863
• /
• 2003

Pulse oximetry has gained wide spread clinical acceptance in the latter part of the 21st century. The principle of pulse oximetry is based on the red and infrared light absorption features and uses a light emitter with red and infrared LEDs that shines through a reasonably translucent site with good blood flow. There are two methods of sending light through the measuring site : transmission and reflectance. After the transmitted red and infrared signals pass through the measuring site and received at the photodetector, the red/infrared ratio is calculated. But, pulse of oximeters are so sensitive that they may detect pulses when pressure is too low to provide adequate tissue blood flow, that is, SpO2 may decrease due to O2 consumption by the finger of the pulsing but stagnant arterial blood at low pressure or with vasoconstriction. This project has the limitations of pulse oximetry. Therefore, this paper is focused on the resuction of motion artifact that caused by moving when someone measures with SpO2 system.

• Journal of the Korean Society of Radiology
• /
• v.16 no.2
• /
• pp.131-139
• /
• 2022

The purpose of this study was to insert a pedicle screw into a pig thoracic vertebrae, a general CT scan(Non MAR), and a thoracic axial image obtained with the Metallic Artifact Reduction for Orthopedic Implants (O-MAR) to reduce artifacts. The image obtained by reconstructing the algorithm (Standard, Soft, Bone, Detail) was used using the image J program. Signal to noise ratio(SNR) and contrast to noise ratio(CNR) were compared and analyzed by obtaining measured values based on the given equation. And this study was to investigate tube voltage and algorithm suitable for CT scan for thoracic pedicle screw insertion. As a result, when non-MAR was used, the soft algorithm showed the highest SNR and CNR at 80, 100, 120, and 140 kVp, On the other hand, when MAR was used, the standard algorithm showed the highest at 80 kVp, and the standard and soft algorithms showed similar values at 100 kVp. At 120 kVp, the Soft and Standard algorithms showed similar values, and at 140 kVp, the Soft algorithm showed the highest SNR and CNR. Therefore, when comparing Non-MAR and MAR, even if MAR was used, SNR and CNR did not increase in all algorithms according to the change in tube voltage. In conclusion, it is judged that it is advantageous to use the Soft algorithm at 80, 100, 120, and 140 kVp in Non MAR, the Standard algorithm at 80 and 100 kVp in MAR, and the Soft algorithm at 120 and 140 kVp. This study is expected to serve as an opportunity to further improve the quality of images by using selective tube voltage and algorithms as basic data to help evaluate images of pedicle screw CT scans in the future.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2009.06a
• /
• pp.563-564
• /
• 2009

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2007.06a
• /
• pp.39-40
• /
• 2007

• Bulletin of the Korean Mathematical Society
• /
• v.37 no.1
• /
• pp.121-125
• /
• 2000

In this paper, we obtain an algorithm for finding a maximum matching in the line graph L(G) of a graph G. The complexity of our algorithm is O($$\mid$E$\mid$$), where is the edge set of G($$\mid$E$\mid$$ is equal to the number of vertices in L(G)).

• Journal of applied mathematics & informatics
• /
• v.7 no.2
• /
• pp.629-640
• /
• 2000

this paper present an efficient line-drawing algorithm that reduces the amount of space required, Because of its efficiency , this line-drawing algorithm is faster than the Bresenham algorithm or the recursive bisection method. this efficiency was achieved through a new data structure; namely , the modified segment tree (MST). Using the modified segment tree and the distribution rule suggested in this paper, we dra lines without generating the recursive calls used in [3] and without creating the binary operation used in [4]. we also show that line accuracy improves in proportion to the display resolution . In practice, we can significantly improve the algorithm's performance with respect to time and space, This improvement offer an increase in speed, specially with lines at or near horizontal, diagonal. or vertical ; that is, this algorithm requires the time complexity of (n) and the space complexity O(2k+1), where n is the number of pixels and k is a level of the modified segment tree.

• Steel and Composite Structures
• /
• v.9 no.6
• /
• pp.535-555
• /
• 2009

The harmony search method based optimum design algorithm is presented for geometrically non-linear semi-rigid steel frames. Harmony search method is recently developed metaheuristic algorithm which simulates the process of producing a musical performance. The optimum design algorithm aims at obtaining minimum weight steel frames by selecting from standard set of steel sections such as European wide flange beams (HE sections). Strength constraints of Turkish Building Code for Steel Structures (TS648) specification and displacement constraints were used in the optimum design formulation. The optimum design algorithm takes into account both the geometric non-linearity of the frame members and the semi-rigid behaviour of the beam-to-column connections. The Frye-Morris polynomial model is used to calculate the moment-rotation relation of beam-to-column connections. The robustness of harmony search algorithm, in comparison with genetic algorithms, is verified with two benchmark examples. The comparisons revealed that the harmony search algorithm yielded not only minimum weight steel frames but also required less computational effort for the presented examples.

• Steel and Composite Structures
• /
• v.8 no.6
• /
• pp.475-490
• /
• 2008

A hybrid tabu-simulated annealing algorithm is proposed for the optimum design of steel frames. The special character of the hybrid algorithm is that it exploits both tabu search and simulated annealing algorithms simultaneously to obtain near optimum. The objective of optimum design problem is to minimize the weight of steel frames under the actual design constraints of AISC-LRFD specification. The performance and reliability of the hybrid algorithm were compared with other algorithms such as tabu search, simulated annealing and genetic algorithm using benchmark examples. The comparisons showed that the hybrid algorithm results in lighter structures for the presented examples.

• Steel and Composite Structures
• /
• v.4 no.6
• /
• pp.453-469
• /
• 2004

In this article, a genetic algorithm based optimum design method is presented for non-linear steel frames with semi-rigid connections. The design algorithm obtains the minimum weight frame by selecting suitable sections from a standard set of steel sections such as European wide flange beams (i.e., HE sections). A genetic algorithm is employed as optimization method which utilizes reproduction, crossover and mutation operators. Displacement and stress constraints of Turkish Building Code for Steel Structures (TS 648, 1980) are imposed on the frame. The algorithm requires a large number of non-linear analyses of frames. The analyses cover both the non-linear behaviour of beam-to-column connection and $P-{\Delta}$ effects of beam-column members. The Frye and Morris polynomial model is used for modelling of semi-rigid connections. Two design examples with various type of connections are presented to demonstrate the application of the algorithm. The semi-rigid connection modelling results in more economical solutions than rigid connection modelling, but it increases frame drift.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.185-191
• /
• 2022

This paper proposed a division algorithm of performance complexity $O{\frac{n(n+1)}{2}}$ for a change-making problem(CMP) in which polynomial time algorithms are not known as NP-hard problem. CMP seeks to minimize the sum of the x_j number of coins exchanged when a given amount of money C is exchanged for c_j,j=1,2,⋯,n coins. Known polynomial algorithms for CMPs are greedy algorithms(GA), divide-and-conquer (DC), and dynamic programming(DP). The optimal solution can be obtained by DP of O(nC), and in general, when given C>2ⁿ, the performance complexity tends to increase exponentially, so it cannot be called a polynomial algorithm. This paper proposes a simple algorithm that calculates quotient by dividing upper triangular matrices and main diagonal for k×n matrices in which only j columns are placed in descending order of c_j of n for c_j ≤ C and i rows are placed k excluding all the dividers in c_j. The application of the proposed algorithm to 39 benchmarking experimental data of various types showed that the optimal solution could be obtained quickly and accurately with only a calculator.