• Journal of the Korean Wood Science and Technology
• /
• v.39 no.2
• /
• pp.163-171
• /
• 2011

Because Japanese cedar shows lower mechanical performance, glued-laminated timber (glulam) can be a better way to utilize Japanese cedar for structural purpose. However, low yield of higher grade lamination from log makes it difficult to design structural glulam. This study was aimed to increase the yield of higher grade lamination and provide higher efficiency of manufacturing structural lamination by ultrasonic log sorting technology. Logs were sorted by an existing log grading rule regulated by Korea Forest Research Institute (KFRI). It was found that the KFRI log grading rule contributed to finding better logs in viewpoint of the volumetric yield and it can reduce the number of rejected lumber by visual grading. However, it could not identify better logs to produce higher-grade products. To find an appropriate log-sorting-method for structural products, log diameter and ultrasonic time of flight (TOF) for the log were considered as factors to affect mechanical performance of resulting products. However, it was found that influence of log diameter on mechanical performance of resulting products was very small. The TOF showed a possibility to sort logs by mechanical performance of resulting products even though a coefficient of correlation was not strong (R = 0.6). In a case study, the log selection based on the ultrasonic TOF of the log increased the yield of the outermost tension lamination (E8 or better grade, KS F 3021) from 2.6% to 12.5% and reduced LTE5 (lower than E5 grade) lamination from 43.6% to 10.3%, compared with the existing KFRI log grading rule.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.53 no.6
• /
• pp.43-50
• /
• 2011

The fractal method has recently been applied to a model for determining soil grain size distribution. The objective of this study is to review the applicability of the fractal method for a analysis of submarine sedimentary environments by comparing fractal constants with grain size statistical analysis for the soil samples of Pohang (PH) and Namhae (NH). The y-interception of log (grain size)-log (passing) equation was also used because grain size distribution couldn't be expressed with fractal dimension only. The result of comparison between fractal constants (dimension, y-interception) and grain size statistical indices, the fractal dimension was directly proportional to the mean and the sorting. And the y-interception showed high correlation with the mean. The fractal dimension and y-interception didn't show significant correlation with the skewness and the kurtosis. Thus regression equations between fractal constants and two statistical indices (mean, sorting) were derived. All classifications of the mean and the sorting could be determined using the regression equation based on the fractal dimension and y-interception. Therefore, fractal constants could be used as an alternative index representing the sedimentary environments instead of the mean and sorting.

• Journal of applied mathematics & informatics
• /
• v.3 no.1
• /
• pp.11-24
• /
• 1996

The focus of this research is the class of sequential al-gorithms called predictive sorting algorithms for sorting a given set of n elements using pairwise comparisons. The order in which these pairwise comparisons are made is defined by a fixed sequence of all un-ordered pairs of distinct integers{1,2 ···,n} called a sort sequence. A predictive sorting algorithm associated with a sort sequence spec-ifies pairwise comparisons of elements in the input set in the order defined by the sort sequence except that the comparisons whose out-comes can be inferred from the preceding pairs of comparisons are not performed. in this paper predictive sorting algorithms are obtained based on known sorting algorithms and are shown to be required on the average O(n log n) comparisons.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.1
• /
• pp.33-42
• /
• 1999

지금까지의 bitonic sorting 에 대한 연구는 N 개의 key를 정렬하기 위해서는 N/2(or N)개의 프로세서가 필요하였다. 여기서는 프로세서의 수가 정렬하고자 하는 key 수에 독립적이고 또한 N/2개 이하인 경우를 고려하였다. 따라서 본 연구에서는 공유 메모리 병렬 컴퓨터 환경에서 N 개의 Key를 고정도니 수의 프로세서를 사용하여 O(log2N) 시간에 정렬 할 수 있는 두 종류의 범용 bitonic sorting 알고리즘을 구현하였다. 첫째로, VITURAL-GPBS 알고리즘은 하나의 프로세서를 사용하여 여러 개의 프로세서가 하는 역할을 모방하므로써 정렬을 수행하도록 하였다. 둘째로, VIRTUAL-GPBS 알고리즘보다 좀 더 효율적이고 빠른 FAST-GPBS 알고리즘을 소개하였다. 두 알고리즘의 주요 차이점은 FAST-GPBS 알고리즘에서는 각각의 프로세서에 배정된 여러 개의 key를 각 프로세서 내에서 가장 빠른 순차 정렬 알고리즘을 사용하면서 먼저 지역적으로 정렬을 함으로써 VIRTUAL-GPBS 보다 효율이 50% 이상 향상된 정렬을 수행할 수 있도록 하였다. FAST-GPBS 알고리즘은 compare-exchange 대신 merge-split 작업을 함으로써 컴퓨터의 사용 효율을 향상시킬 수 있다.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2690-2700
• /
• 1997

This paper presents parallel sorting algorithm, SHARED-MEMORY-BS and REDUCED-BS, which are implemented on shared-memory parallel computers. These algorithm sort N keys in $O(log^2N)$ time. REDUCED-BS users a parity strategy which gives an idea for the efficient usage of the local memory associated with each processor. By taking advantage of the local memory associated with each processor, the communication of REDUCED-BS is decreased by approximately half that of SHARED-MEMORY-BS. On the basis of alleviating the communication, the algorithm REDUCED-BS results in a significant improvement of performance.

• Proceedings of the Korea Multimedia Society Conference
• /
• 1998.04a
• /
• pp.366-370
• /
• 1998

One major limitation of the efficiency of parallel computer designs has been the prohibitively high cost of parallel communication between processors and memories. Linear order concentrators can be used to build theoretically optimal interconnection schemes. Current designs call for building superconcentrators from concentrators, then using these to recursively partition the connection streams O(log2N) times to achieve point-to-point routing. Since the superconcentrators each have O(N) hardware complexity but O(log2N) depth, the resulting networks are optimal in hardware, but they are of O(log2N) depth. This pepth is not better than the O(log2N) depth Bitonic sorting networks, which can be implemented on the O(N) shuffle-exchange network with message passing. This paper introduces a new method of constructing networks using linear order concentrators and expanders, which can be used to build interconnection networks with O(log2N) depth as well as O(Nlog2N) hardware cost. (All logarithms are in base 2 throughout paper)

• Journal of Food Hygiene and Safety
• /
• v.35 no.1
• /
• pp.60-67
• /
• 2020

This study determined the microbial contamination levels of hot pepper at harvest, sorting, and distribution stages to suggest a way of reducing the microbial contamination of hot peppers by changing work gloves used throughout these processes. According to the monitoring results, the contamination levels of total aerobic bacteria (TAB) were found in the following order: soil (5.3±0.9 log CFU/g), hot pepper (4.2±0.9 log CFU/g), gloves (4.2±0.6 log CFU/g), baskets (4.1±0.7 log CFU/ g), clippers (3.9±0.6 log CFU/ g) and water (3.2±1.1 log CFU/g) at harvest stage. The contamination level of coliforms were found in the following order: soil (2.2±0.9 log CFU/g), hot pepper (2.2±0.3 log CFU/g), gloves (2.1±0.6 log CFU/g), clippers (2.0±0.21 log CFU/ g) and baskets (1.9±1.1 log CFU/ g) at harvest stage. TAB on hot pepper at the harvest stage was reduced from 4.2±0.9 log CFU/g to cold storage 3.8±0.2 log CFU/g and room temperature storage 2.6±0.3 log CFU/g, respectively. By the replacement of work gloves and lower distribution temperature, TAB levels of the peppers were significantly reduced compared to those without replacement and distributed at room temperature. In addition, the utilization of plasma was effective on reducing microbial contamination of hot pepper. These results demonstrated that appropriate replacement of gloves at the harvest stages, using plasma in the distribution stage, and refrigerated distribution conditions, which are simple and easy to practice in the field, are effective to reduce microbial contamination on hot peppers.

• ETRI Journal
• /
• v.21 no.2
• /
• pp.31-39
• /
• 1999

Given two sorted lists A=(a0, a1, ${\cdots}$,a${\ell}$-1}) and B=(b0, b1, ${\cdots}$, bm-1), we are to merge these two lists into a sorted list C=(c0,c1, ${\cdots}$, cn-1), where n=${\ell}$+m. Since this is a fundamental problem useful to solve many problems such as sorting and graph problems, there have been many efficient parallel algorithms for this problem. But these algorithms cannot be performed efficiently in the postal model since the communication latency ${\lambda}$, which is of prime importance in this model, is not needed to be considered for those algorithms. Hence, in this paper we propose an efficient merge algorithm in this model that runs in $$2{\lambda}{\frac{{\log}n}{{\log}({\lambda}+1)}}+{\lambda}-1$$ time by using a new property of the bitonic sequence which is crucial to our algorithm. We also show that our algorithm is near-optimal by proving that the lower bound of this problem in the postal model is $f_{\lambda}({\frac{n}{2}})$, where $${\lambda}{\frac{{\log}n-{\log}2}{{\log}([{\lambda}]+1)}{\le}f_{\lambda}({\frac{n}{2}}){\le}2{\lambda}+2{\lambda}{\frac{{\log}n-{\log}2}{{\log}([{\lambda}]+1)}}$$.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.3
• /
• pp.290-298
• /
• 1994

In this paper we propose parallel sorting algorithm, taking 0( $n^{n}$ log n) time complexity, 0( $n^{x}$ log n) cost (parallel running time * number of processors) and 0( $n^{1-}$x＋ $n^{x}$ )data movement complexity under the ERWW- PRAM model. The methods for solving these problems similar. Parallel algorithm finds pivot for partitioning the data into ordered subsets of approximately equal size by using encording pointers..

• 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).