• Journal of the Korea Society of Computer and Information
• /
• v.17 no.4
• /
• pp.139-145
• /
• 2012

Generally, Quicksort selects the pivot from leftmost, rightmost, middle, or random location in the array. This paper suggests Quicksort using middle range pivot $P_0$ and continually divides into 2. This method searches the minimum value $L$ and maximum value $H$ in the length n of list $A$. Then compute the initial pivot key $P_0=(H+L)/2$ and swaps $a[i]{\geq}P_0$,$a[j]<P_0$ until $i$=$j$ or $i$>$j$. After the swap, the length of list $A_0$ separates in two lists $a[1]{\leq}A_1{\leq}a[j]$ and $a[i]{\leq}A_2{\leq}a[n]$ and the pivot values are selected by $P_1=P_0/2$, $P_2=P_0+P_1$. This process repeated until the length of partial list is two. At the length of list is two and $a$[1]>$a$[2], swaps as $a[1]{\leftrightarrow}a[2]$. This method is simpler pivot key process than Quicksort and improved the worst-case computational complexity $O(n^2)$ to $O(n{\log}n)$.

• Journal of the korean veterinary medical association
• /
• v.30 no.3
• /
• pp.162-171
• /
• 1994

이 자료는, 국제수역사무국(Office de International Epizooties : O.I.E.)에서 발행한 Manual of Standards for Diagnostic Tests and Vaccines for List A and List B Diseases of Mammals, Birds and Bees(1992) (포유류, 조류, 꿀벌에 있어서의 A급 및 B급 질병에 대한 진단시약 및 예방백신에 대한 표준지침) 중에서 광견병(B8, Rabies)에 관한 내용(Chapter 22, 205-215)을 우리나라의 광견병 방역대책 수립과 생물학적 제제개발을 위한 참고자료로 활용하기 위하여 번역 소개한 것이다. 본래의 원저자는 프랑스의 Dr J. Blancou로서 프랑스 국립수의식품연구원(CNEVA) 산하의 광견병 및 야생동물 병리연구소(Laboratoire d'Etudes sul la Rage et de la Pathologie des Animaux Sauvages)에 책임자로 재직한 바 있으며, 1991년 이후 현재에는 국제수역사무국(O.I.E)의 사무총장(Director-general)직을 맡고 있다.

• Proceedings of the International Microelectronics And Packaging Society Conference
• /
• 2003.09a
• /
• pp.109-119
• /
• 2003

o In order to start SIP Project .Marketing (& ASIC team) should present biz planning, schedule, device/SIP specs., in SIP TFT prior to request SIP development for package development project. .In order to prevent (PCB) revision, test, burn-in, & quality strategy should be fixed by SIP TFT (PE/Test, QA) prior to request for PKG development. .Target product price/cost, package/ test cost should be delivered and reviewed. o Minimum Information for PCB Design, Package Size, and Cost .(Required) package form factor: size, height, type (BGA, QFP), Pin count/pitch .(Estimated) each die size including scribe lane .(Estimated) pad inform. : count, pitch, configuration(in-line/staggered), (open) size .(Estimated) each device (I/O & Core) power (especially for DRAM embedded SIP) .SIP Block diagram, and net-list using excel sheet format o Why is the initial evaluation important\ulcorner .The higher logic power resulted in spec. over of DRAM Tjmax. This caused business drop longrightarrow Thermal simulation of some SIP product is essential in the beginning stage of SIP business planning (or design) stage. (i.e., DRAM embedded SIP) .When SIP is developed using discrete packages, the I/O driver Capa. of each device may be so high for SIP. Since I/O driver capa. was optimized to discrete package and set board environment, this resulted in severe noise problem in SIP. longrightarrow In this case, the electrical performance of product (including PKG) should have been considered (simulated) in the beginning stage of business planning (or design).

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2013.05a
• /
• pp.1125-1126
• /
• 2013

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2204-2218
• /
• 2000

This paper proposes a dynamic storage allocation algorithm, QHF(quick-half-fit) for real-time systems. The proposed algorithm manages a free block list per each worked size for memory requests of small size, and a free block list per each power of 2 size for memory requests of large size. This algorithms uses the exact-fit policy for small sie requests and provides high memory utilization. The proposed algorithm also has the time complexity O(I) and enables us to easily estimate the worst case execution time (WCET). In order to confirm efficiency of the proposed algorithm, we compare he memory utilization of proposed algorithm with that of half-fit and binary buddy system that have also time complexity O(I). The simulation result shows that the proposed algorithm guarantees the constant WCET regardless of the system memory size and provides lower fragmentation ratio and allocation failure ratio thant other two algorithms.

• Journal of Information Technology Applications and Management
• /
• v.13 no.2
• /
• pp.115-126
• /
• 2006

Recently, flash memories are one of best media to support portable computer's storages in mobile computing environment. We propose a new transaction recovery scheme for a flash memory database environment which is based on a flash media file system. We improved traditional shadow paging schemes by reusing old data pages which are supposed to be invalidated in the course of writing a new data page in the flash file system environment. In order to reuse these data pages, we exploit deferred cleaning list structure in our flash memory shadow paging (FMSP) scheme. FMSP scheme removes the additional storage overhead for keeping shadow pages and minimizes the I/O performance degradation caused by data page distribution phenomena of traditional shadow paging schemes. We also propose a simulation model to show the performance of FMSP. Based on the results of the performance evaluation, we conclude that FMSP outperforms the traditional scheme.

• The Journal of Korean Association of Computer Education
• /
• v.6 no.3
• /
• pp.1-8
• /
• 2003

In this paper, I proposed a sort algorithm named Information Block Sort Algorithm(IBSAl which is not influenced on distribution of data in the list and has time complexity of O(NlogN). Also I evaluated the IBSA using a simulator. Performance analysis shows that, in case of sorting randomly generated two millions data, the number of actual comparisons has taken place about 36% of the number of comparisons in the improved Quick sort algorithm and 22% in Quick sort algorithm.

• Proceedings of the KIEE Conference
• /
• 2003.07c
• /
• pp.1604-1606
• /
• 2003

In this paper, investigated the core of transformer of high power factor and high effectiveness about design and choice technology. Transformer that use existent general core and material is high no-load loss power. Presented core choice method that can reduce loss. Could do to reduce loss according to choice technology of use material more than about 10 (%). Presented classification and check list by Core's type.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.7
• /
• pp.569-573
• /
• 2001

An approximate representation of discrete functions {f$_{i,j}\mid$｜i, j=-1, 0, 1, …, N+1}in two variables by a fuzzy system is described. We use the cubic B-splines as fuzzy sets for the input fuzzification and spike functions as the output fuzzy sets. The ordinal number of f$_{i,j}$ in the sorted list is taken to be the out put fuzzy set number in the (i, j) th entry of the fuzzy rule table. We show that the fuzzy system is an exact representation of the cubic spline function s(x, y)=$\sum_{N+1}^{{i,j}=-1}f_{i,j}B_i(x)B_j(y)$ and that the approximation error S(x, y)-f(x, y) is surprisingly O($h^2$) when f(x, y) is three times continuously differentiable. We prove that when f(x, y) is a gray scale image, then the fuzzy system is a smoothed representation of the image and the original image can be recovered exactly from its fuzzy system representation when it is a digitized image.e.

• Journal of Korean Institute of Industrial Engineers
• /
• v.3 no.1
• /
• pp.55-59
• /
• 1977

This paper develops a portfolio management game applicable to Korean Stock Market with an emphasis on teaching and training aid. It allows each participant to start out with a certain amount of money and pick his favorable stocks from a list of stocks chosen by instructor. Each participant must make a transaction at each time period and he gets a readout that states his individual performance, i.e., stock lists, cash on hand, net worth, transactions he has made and rank in accordance with his net worth. This game package consists of 10 subprograms and 7 files written with Fortran language for use on the Nova 840 computer and is divided into 3 main categories according to their functions, i.e., book-keeping function, data processing function and information searching function. This package may be used for training portfolio decison makings in the stock market and for comparing various investment methods through hypothetical investments.