• The Journal of the Acoustical Society of Korea
• /
• v.33 no.4
• /
• pp.262-267
• /
• 2014

Recently, long pulses are transmitted for target detection in active sonar application. Matched filtering implemented by simple convolution algorithm, requires massive computational power for long replica. The computational loads are reduced significantly by implementing the convolution in the frequency domain with overlap add method, but the performance degrades for specified input/output system delay which constrains the size of FFT function. For performance improvement, the replica could be partitioned into uniform blocks (FDL) by re-using IFFT operations, or variable blocks of increasing length (MC) by using the largest possible blocks to calculate the convolution. In this paper, by combining the strong points of the two methods, we propose a new filter partition structure that allows for further optimization of the previous two methods.

• The Korean Journal of Applied Statistics
• /
• v.31 no.1
• /
• pp.67-75
• /
• 2018

Multidimensional scaling (MDS) is an exploratory analysis of multivariate data to represent the dissimilarity among objects in the geometric low-dimensional space. However, a general MDS map only shows the information of objects without any information about variables. In this study, we used MDS based on the algorithm of Torgerson (Theory and Methods of Scaling, Wiley, 1958) to visualize some clusters of objects in categorical data. For this, we convert given data into a multiple indicator matrix. Additionally, we added the information of levels for each categorical variable on the MDS map by applying the partition method of Shin et al. (Korean Journal of Applied Statistics, 28, 1171-1180, 2015). Therefore, we can find information on the similarity among objects as well as find associations among categorical variables using the proposed MDS map.

• Journal of the Korea Convergence Society
• /
• v.6 no.3
• /
• pp.51-57
• /
• 2015

This paper proposes an efficient method such as Extended Three Region Partitioning Method for nested loops with irregular dependences for maximizing parallelism. Our approach is based on the Convex Hull theory, and also based on minimum dependence distance tiling, the unique set oriented partitioning, and three region partitioning methods. In the proposed method, we eliminate anti dependences from the nested loop by variable renaming. After variable renaming, we present algorithm to select one or more appropriate lines among given four lines such as LMLH, RMLH, LMLT and RMLT. If only one line is selected, the method divides the iteration space into two parallel regions by the selected line. Otherwise, we present another algorithm to find a serial region. The selected lines divide the iteration space into two parallel regions as large as possible and one or less serial region as small as possible. Our proposed method gives much better speedup and extracts more parallelism than other existing three region partitioning methods.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.1
• /
• pp.139-144
• /
• 2008

Generally, real system that is the object of decision-making is very variable and sometimes it lies situations with uncertainty. To solve these problem, it has used statistical methods as significance level, certainty factor, sensitivity analysis and so on. In this paper, we propose a method for fuzzy decision-making based on MFAC(Multiple Fuzzy Alpha Cut) to improve the definiteness of classification results with similarity evaluation. In the proposed method, MFAC is used for extracting multiple a ${\alpha}$-level with proximity degree at proximity relation between relative Hamming distance and max-min method and for minimizing the number of data which are associated with the partition intervals extracted by MFAC. To determine final alternative of decision-making, we compute the weighted value between extracted data by MFAC From the experimental results, we can see the fact that the proposed method is simpler and more definite than classification performance of the conventional methods and determines an alternative efficiently for decision-maker by testing significance of sample data through statistical method.

• Journal of KIISE:Databases
• /
• v.36 no.6
• /
• pp.455-465
• /
• 2009

Suffix trees are widely used in similar sequence matching for DNA. They have several problems such as time consuming, large space usages of disks and memories and data skew, since DNA sequences are very large and do not fit in the main memory. Thus, in the paper, we present a space efficient indexing method called SENoM, allowing us to build trees without merging phases for the partitioned sub trees. The proposed method is constructed in two phases. In the first phase, we partition the suffixes of the input string based on a common variable-length prefix till the number of suffixes is smaller than a threshold. In the second phase, we construct a sub tree based on the disk using the suffix sets, and then write it to the disk. The proposed method, SENoM eliminates complex merging phases. We show experimentally that proposed method is effective as bellows. SENoM reduces the disk usage less than 35% and reduces the memory usage less than 20% compared with TRELLIS algorithm. SENoM is available to query efficiently using the prefix tree even when the length of query sequence is large.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.287-299
• /
• 2000

In this paper, we classify multicast methods into three categories, i.e., tree-based, path-based, and hybrid-based multicasts, for a multicomputer employing the bidirectional torus network and wormhole routing. We propose the dynamic partition multicast routing (DPMR) as a path-based algorithm. As a hybrid-based algorithm, we suggest the hybrid multicast routing (HMR), which employs the tree-based approach in the first phase of routing and the path-based approach in the second phase. Performance is measured in terms of the average latency for various message length to compare three multicast routing algorithms. We also compare the performance of wormhole routing having variable buffer size with virtual cut-through switching. The message latency for each switching method is compared using the DPMR algorithm to evaluate the buffer size trade-off on the performance.

• Proceedings of the Korean Society of Soil and Groundwater Environment Conference
• /
• 2002.09a
• /
• pp.283-286
• /
• 2002

Solubilization and partitioning of naphthalene was investigated in an aqueous system containing soils and surfactants. The environmental behavior of polycyclic aromatic hydrocarbons(PAHs) was mainly governed by their solubility and partitioning properties on soil media in a subsurface system. In surfactant-enhanced remediation systems, surfactants might be an additional variable. a natural soil ,silica and kaolinite were tested as soil media. two nonionic surfactants, Triton X-100 and Hydropropy1-$\beta$-cyclodextrin (HPCD) were employed for naphthalene solubilization. Naphthalene showed linear on natural soil while non-linear sorption on silica and kaolinite. Soils have higher sorption capacity for Triton X-100 than HPCD indicating Triton X-100 formed ad-micelle on the soil surface. Desorption study showed a hysterysis and reversible desorption. The partitioning coefficient(K$_{D}$) of naphthalene was increased as the concentration of surfactant was increased. (below CMC), however, the coefficient was decreased above CMC. This indicates that naphthalene is partitioned into the micelles and the partition occurs competitively on both ad-micelle and free micelles as surfactant concentration increases. Therefore, the target compounds to be dissolved into aqueous phase in a surfactant enhanced remediation system might be highly partitioned on to the ad-micelle resulting in an adverse effect rather increased solubilization would be achieved.d.

• Korean Journal of Veterinary Research
• /
• v.41 no.1
• /
• pp.13-19
• /
• 2001

A simple and rapid analytical method for the determination of tylosin in chicken, pork and muscle was established by High-Performance Liquid Chromatography(HPLC). Chicken, pork and beef muscle(5 g) were fortified by adding the $0.2{\mu}g/ml$ of standard tylosin and the drug was extracted from meats with 70% acetonitrile(ACN) and followed by liquid-liquid partition for clean-up procedure. Then $20{\mu}l$ portion of ACN elution was directly analyzed by HPLC with spectra 100 variable wavelength detector, and unfortified blank control were treated similarly. The average recovery rate of tylosin added to chicken, pork and beef muscle were $83{\pm}2.3$, $96{\pm}3.3$ and $92{\pm}1.6$(%) at the level 0.2 ppm, respectively. No tylosin residues in marketing meats. These results suggested that HPLC methodology could be acceptable for the extraction, determination and screening of tylosin residues in edible meats.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06b
• /
• pp.165-170
• /
• 1998

This paper presents a new prediction method RBP region-based prediction model where the context used for prediction contains regions instead of individual pixels. There is a meaningful property that RBP can partition a cartoon image into two distinctive types of regions, one containing full-color backgrounds and the other containing boundaries, edges and home-chromatic areas. With the development of computer techniques, synthetic images created with CG (computer graphics) becomes attactive. Like the demand on data compression, it is imperative to efficiently compress synthetic images such as cartoon animation generated with CG for storage of finite capacity and transmission of narrow bandwidth. This paper a lossy compression method to full-color regions and a lossless compression method to homo-chromatic and boundaries regions. Two criteria for partitioning are described, constant criterion and variable criterion. The latter criterion, in form of a linear function, gives the different threshold for classification in terms of contents of the image of interest. We carry out experiments by applying our method to a sequence of cartoon animation. We carry out experiments by applying our method to a sequence of cartoon animation. Compared with the available image compression standard MPEG-1, our method gives the superior results in both compression ratio and complexity.

• Biotechnology and Bioprocess Engineering:BBE
• /
• v.7 no.1
• /
• pp.26-30
• /
• 2002

A droplet fractionation method was previously developed to concentrate a dilute nonfoaming protein solution. In that earlier study with invertase, it was demonstrated that droplets created by ultrasonic energy waves could be enriched up to 8 times that of the initial dilute invertase solution. In this study, a mixture of bromelain (a foaming protein) and invertase (a nonfoaming protein) is investigated as a preliminary step to determine if droplet fractionation can also be used to separate a non-foaming protein from foaming proteins. The foaming mixture containing bromelain is first removed by bubbling the binary mixture with air. After the foam is removed, the protein rich air-water interfacial layer is skimmed off (prior to droplet fractionation) so as not to interfere with the subsequent droplet production from the remaining bulk liquid, rich in non-foaming protein. Finally, sonic energy waves are then applied to this residual bulk liquid to recover droplets containing the non-foaming protein, presumed to be invertase. The primary control variable used in this droplet fractionation process is the pH, which ranged for separate experiments between 2 and 9. It was observed that the maximum overall protein partition coefficients of 5 and 4 were achieved at pH 2 and 4, respectively, for the initial foaming experiment followed by the post foaming droplet fractionation experiment.