• Journal of KIISE:Software and Applications
• /
• v.34 no.5
• /
• pp.397-406
• /
• 2007

The problem of finding an optimal alignment between sequence A and B can be solved by dynamic programming algorithm(DPA) efficiently. But, if the length of string was longer, the problem might not be solvable because it requires O(m*n) time and space complexity.(where, $m={\mid}A{\mid},\;n={\mid}B{\mid}$) For space, Hirschberg developed a linear space and quadratic time algorithm, so computer memory was no longer a limiting factor for long sequences. As computers's processor and memory become faster and larger, a method is needed to speed processing up, although which uses more space. For this purpose, we present an algorithm which will solve the problem in quadratic time and linear space. By using division method, It computes optimal alignment faster than LSA, although requires more memory. We generalized the algorithm about division problem for not being divided into integer and pruned additional space by entry/exit node concept. Through the proofness and experiment, we identified that our algorithm uses d*(m+n) space and a little more (m*n) time faster than LSA.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.6
• /
• pp.295-301
• /
• 2014

In the absence of a sorting algorithm faster than O(n log n), Quicksort remains the best and fastest of its kind in practice. For given n data, Quicksort records running in O(n log n) at best and $O(n^2)$ at its worst. In this paper, I propose an algorithm by which 3-points average P=(L+M+H)/3 is set as a pivot for first array L=a[s], last array H=a[e], and middle array $M=a[{\lfloor}(s+e)/2{\rfloor}]$ in order to find the more fast than Quicksort. Test results prove that the proposed 3-points average pivot Quicksort has the time complexity of O(n log n) at its best, average, and worst cases. And the proposed algorithm can be reduce the $O(n^2)$ time of Quicksort to O(n log n).

• The Korean Journal of Nuclear Medicine Technology
• /
• v.16 no.2
• /
• pp.35-43
• /
• 2012

Purpose : PET/CT performed CT-based attenuation correction generates the beam hardening artifact by metallic implant. The attenuation correction causes over or underestimate of the area adjacent to metallic hip prosthetic material and change of $^{18}F$-FDG uptake. Also, the image quality and the diagnosability on genitourinary disease are reduced. Therefore, this study will evaluate the usefulness of MAR (Metal Artifact Reduction) algorithm method to improve the image quality on PET/CT. Materials and Methods : PET/CT was performed by fixing hip prosthesis in SPECT/PET phantom. In PET images with and Without MAR algorithm, the Bright streak, Dark streak, Metal region and Background area that appeared on CT were confirmed, and the change of each SUV (standardized uptake value) was analyzed. Also, in 15 patients who underwent total hip arthroplasty, each MAR algorithm and Without MAR algorithm and non attenuation correction was evaluated. Results : In PET image Without MAR algorithm, SUV of Bright streak region was $0.98{\pm}0.48$ g/ml; Dark streak region was $0.88{\pm}0.02$ g/ml; Metal region was $0.24{\pm}0.16$ g/ml, Background area was $0.91{\pm}0.18$ g/ml. In SUV of PET image with MAR algorithm, Bright streak region was $0.88{\pm}0.49$ g/ml, Dark streak region was $0.63{\pm}0.21$ g/ml, Metal region was $0.06{\pm}0.07$ g/ml, Background was $0.90{\pm}0.02$ g/ml. SUV generally decreased when applying MAR algorithm. In PET image Without MAR algorithm, SUVs of Bright region were higher than those measured in the Background, and it was false positive uptake. But, in PET image with MAR algorithm, SUVs of Bright region were similar to the Background, and false positive uptake disappeared. Conclusion : MAR algorithm could reduce an increase of $^{18}F$-FDG uptake due to attenuation correction in the hip surrounding tissue. However, decrease of SUV in Dark streak region should be considered in the future. Therefore, this study propose that the diagnostic accuracy can be improved in genitourinary diseases adjacent to metallic hip prosthesis, if provided PET images with and Without MAR algorithm, and non attenuation correction images at the same time.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.942-945
• /
• 1999

In this work, we proposed Proper etching algorithm for ultra-large scale integrated circuit device and simulated etching process using the proposed algorithm in the case of ICP (inductive coupled plasma) 〔1〕source. Until now, many algorithms for etching process simulation have been proposed such as Cell remove algorithm, String algorithm and Ray algorithm. These algorithms have several drawbacks due to analytic function; these algorithms are not appropriate for sub 0.1 ${\mu}{\textrm}{m}$ device technologies which should deal with each ion. These algorithms could not present exactly straggle and interaction between Projectile ions and could not consider reflection effects due to interactions among next projectile ions, reflected ions and sputtering ions, simultaneously In order to apply ULSI process simulation, algorithm considering above mentioned interactions at the same time is needed. Proposed algorithm calculates interactions both in plasma source region and in target material region, and uses BCA (binary collision approximation4〕method when ion impact on target material surface. Proposed algorithm considers the interaction between source ions in sheath region (from Quartz region to substrate region). After the collision between target and ion, reflected ion collides next projectile ion or sputtered atoms. In ICP etching, because the main mechanism is sputtering, both SiO$_2$ and Si can be etched. Therefore, to obtain etching profiles, mask thickness and mask composition must be considered. Since we consider both SiO$_2$ etching and Si etching, it is possible to predict the thickness of SiO$_2$ for etching of ULSI.

• Journal of Advanced Navigation Technology
• /
• v.5 no.1
• /
• pp.45-53
• /
• 2001

We present the frame synchronization scheme using the FFT window position restoration algorithm appropriate for wireless OFDM systems under multipath fading environment. From the restoration of the synchronization parameters of previous several frames, the algorithm can extract the synchronization parameters for the next frames. To analyze the performance of the proposed algorithm, we compare the probability of synchronization failure under time and frequency domains, respectively. From the simulation results, one can see that the algorithm in the time domain shows better performance than in the frequency one, for the $E_b/N_o$ of 6.0dB or more.

• Journal of Information Processing Systems
• /
• v.7 no.2
• /
• pp.271-286
• /
• 2011

In this paper, we propose efficient algorithms for parallel prefix computation and sorting on a recursive dual-net. The recursive dual-net $RDN^k$(B) for k > 0 has $(2n_o)^{2K}/2$ nodes and $d_0$ + k links per node, where $n_0$ and $d_0$ are the number of nod es and the node-degree of the base-network B, respectively. Assume that each node holds one data item, the communication and computation time complexities of the algorithm for parallel prefix computation on $RDN^k$(B), k > 0, are $2^{k+1}-2+2^kT_{comm}(0)$ and $2^{k+1}-2+2^kT_{comp}(0)$, respectively, where $T_{comm}(0)$ and $T_{comp}(0)$ are the communication and computation time complexities of the algorithm for parallel prefix computation on the base-network B, respectively. The algorithm for parallel sorting on $RDN^k$(B) is restricted on B = $Q_m$ where $Q_m$ is an m-cube. Assume that each node holds a single data item, the sorting algorithm runs in $O((m2^k)^2)$ computation steps and $O((km2^k)^2)$ communication steps, respectively.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.2E
• /
• pp.91-97
• /
• 2002

One of the most important things in mobile phone service is Hand-Off (H/O). Meantime soft H/O and softer H/O have been used between the same generations (2G↔2G) and there is little problem. With user's needs and the development of communication technology, the system with different generation coexists and pilot beacon and time-periodic beacon are used for H/O between generations (2.5G↔2G) to start service, but it is not economic and efficient. To improve such problems, ENHHO developed in April 2001 has recently used. Unfortunately, this method also has the defect of momentary cutoff of communication information during the procedure of H/O in case of more than 5 pilot signals. Accordingly, we suggest algorithm to improve the problem of ENHHO and examines its propriety by analyzing the results of field survey using the algorithm.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.12
• /
• pp.880-884
• /
• 2006

In an edge-weighted(positive, negative, or zero weights are possible) tree, we want to solve the problem of finding a longest path such that the sum of the weights of the edges in tile path is non-negative. To find a longest non-negative path of a tree we present a sequential algorithm with O(n logn) time and a CREW PRAM parallel algorithm with $O(log^2n)$ time and O(n) processors. where n is the number of nodes in the tree.

• Journal of Digital Contents Society
• /
• v.17 no.6
• /
• pp.523-529
• /
• 2016

Stereo matching algorithm is an essential part in computer vision and photography. Accuracy and computational complexity are challenges of stereo matching algorithm. Much research has been devoted to stereo matching based on cost volume filtering of matching costs. Local stereo matching based guided image filtering (GIF) has a computational complexity of O(N), but is still not enough to provide real-time 3-dimensional (3-D) video services. The proposed algorithm concentrates reduction of computational complexity using the concept of fast guided image filter, which increase the speed up to $O(N/\small{s}^2)$ with a sub-sampling ratio $\small{s}$. Experimental results indicated that the proposed algorithm achieves effective local stereo matching as well as a fast execution time for 3-D video service.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.1
• /
• pp.12-21
• /
• 2003

In this paper, we propose an on-line scheduling algorithm with the goal of maximizing the total reward of IRIS (Increasing Reward with Increasing Service) real-time tasks that have reward functions and arrive dynamically into the system. We focus on enhancing the performance of scheduling algorithm, which W.: based on the following two main ideas. First, we show that the problem to maximize the total reward of dynamic tasks can also be solved by the problem to find minimum of maximum derivatives of reward functions. Secondly, we observed that only a few of scheduled tasks are serviced until a new task arrives, and the rest tasks are rescheduled with the new task. Based on our observation, the Proposed algorithm doesn't schedules all tasks in the system at every scheduling print, but a part of tasks. The performance of the proposed algorithm is verified through the simulations for various cases. The simulation result showed that the computational complexity of proposed algorithm is$O(N_2)$ in the worst case which is equal to those of the previous algorithms, but close to O(N) on the average.