• Agribusiness and Information Management
• /
• v.3 no.1
• /
• pp.11-22
• /
• 2011

This study describes the development of a web-based system that collects all data generated in the research conducted to set pre-harvest residue limits (PHRLs) for agricultural product safety control. These data, including concentrations of pesticide residues, limit of detection, limit of quantitation, recoveries, weather charts, and growth rates, are incorporated into a database, a regression analysis of the data is performed using statistical techniques, and the PHRL for an agricultural product is automatically computed. The development and establishment of this system increased the efficiency and improved the reliability of the research in this area by standardizing the data and maintaining its accuracy without temporal or spatial limitations. The system permits automatic computation of the PHRL and a quick review of the goodness of fit of the regression model. By building and analyzing a database, it also allows data accumulated over the last 10 years to be utilized.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.71-79
• /
• 2006

Address lookup is an essential function in the Internet routers, and it determines overall router performance. In this paper, we have thoroughly investigated the binary-search-based address lookup algorithms and proposed a new algorithm based on binary search on prefix lengths. Most of the existing binary search schemes perform binary search on prefix values, and hence the lookup speed is proportional to the length of prefixes or the log function of the number of prefixes. The previous algorithm based on binary search on prefix lengths has superior lookup performance than others. However, the algorithm requires very complicated pre-computation of markers and best matching prefixes in internal nodes since naive binary search is not possible in their scheme. This complicated pre-computation makes the composition of the routing table and incremental update very difficult. By using leaf-pushing, the proposed algorithm in this paper removes the complicated pre-computation of the Previous work in performing the binary search on prefix lengths. The performance evaluation results show that the proposed scheme has very good performance in lookup speed compared with previous works.

• Journal of Korean Society on Water Environment
• /
• v.25 no.3
• /
• pp.351-362
• /
• 2009

The Soil and Water Assessment Tool (SWAT) model, semi-distributed model, first divides the watershed into multiple subwatersheds, and then extracts the basic computation element, called the Hydrologic Response Unit (HRU). In the process of HRU generation, the spatial information of land use and soil maps within each subwatershed is lost. The SWAT model estimates the HRU topographic data based on the average slope of each subwatershed, and then use this topographic datum for all HRUs within the subwatershed. To improve the SWAT capabilities for various watershed scenarios, the Spatially Distributed-HRU (SD-HRU) pre-processor module was developed in this study to simulate site-specific topographic data. The SD-HRU was applied to the Hae-an watershed, where field slope lengths and slopes are measured for all agricultural fields. The analysis revealed that the SD-HRU pre-processor module needs to be applied in SWAT sediment simulation for accurate analysis of soil erosion and sediment behaviors. If the SD-HRU pre-processor module is not applied in SWAT runs, the other SWAT factors may be over or under estimated, resulting in errors in physical and empirical computation modules although the SWAT estimated flow and sediment values match the measured data reasonably well.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.4
• /
• pp.588-594
• /
• 2021

SIMON, a lightweight block cipher developed by the US National Security Agency, is a family of block ciphers optimized for hardware implementation. It supports many kinds of standards to operate in various environments. The counter mode of operation is one of the operational modes. It provides to encrypt plaintext which is longer than the original size. The counter mode uses a constant(Nonce) and Counter value as an input value. Since Nonce is the identical for all blocks, so it always has same result when operates with other constant values. With this feature, it is possible to skip some instructions of round function by pre-computation. In general, the input value of SIMON is affected by the counter. However in an 8-bit environment, it is calculated in 8-bit units, so there is a part that can be pre-computed. In this paper, we focus the part that can be pre-calculated, and compare with previous works.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2005.05a
• /
• pp.345-349
• /
• 2005

Massive amount of satellite image processing such asglobal/continental-level analysis and monitoring requires automated and speedy georegistration. There could be two major automated approaches: (1) rigid mathematical modeling using sensor model and ephemeris data; (2) heuristic co-registration approach with respect to existing reference image. In case of ETM+, the accuracy of the first approach is known as RMSE 250m, which is far below requested accuracy level for most of satellite image processing. On the other hands, the second approach is to find identical points between new image and reference image and use heuristic regression model for registration. The latter shows better accuracy but has problems with expensive computation. To improve efficiency of the coregistration approach, the author proposed a pre-qualified matching algorithm which is composed of feature extraction with canny operator and area matching algorithm with correlation coefficient. Throughout the pre-qualification approach, the computation time was significantly improved and make the registration accuracy is improved. A prototype was implemented and tested with the proposed algorithm. The performance test of 14 TM/ETM+ images in the U.S. showed: (1) average RMSE error of the approach was 0.47 dependent upon terrain and features; (2) the number average matching points were over 15,000; (3) the time complexity was 12 min per image with 3.2GHz Intel Pentium 4 and 1G Ram.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.12
• /
• pp.75-81
• /
• 2004

AE-CORDIC improves the CORDIC operation speed with a rotation direction pre-computation algorithm. Its CORDIC iteration stages consist of non-predictable rotation direction states and predictable rotation stages. The non-predictable stages are replaced with lookup-table which has smaller hardware size than CORDIC iteration stages. The predictable stages can determine rotation direction with the input angle and simple encoder. In this paper, a rotation direction pre-computation algorithm with input angle encoder is proposed. and AE-CORDIC which have optimized Lookup-table is compared with the P-CORDIC algorithm. Hardware size, delay, and SQNR of the AE-CORDIC are verified with Samsung 0.18㎛ technology and Synopsys design compiler when input angle bit length is 16.

• Journal of Information Processing Systems
• /
• v.6 no.3
• /
• pp.335-346
• /
• 2010

The present study investigates the difficulty of solving the mathematical problem, namely the DLP (Discrete Logarithm Problem) for ephemeral keys. The DLP is the basis for many public key cryptosystems. The ephemeral keys are used in such systems to ensure security. The DLP defined on a prime field $Z^*_p of random prime is considered in the present study. The most effective method to solve the DLP is the ICM (Index Calculus Method). In the present study, an efficient way of computing the DLP for ephemeral keys by using a new variant of the ICM when the factors of p-1 are known and small is proposed. The ICM has two steps, a pre-computation and an individual logarithm computation. The pre-computation step is to compute the logarithms of a subset of a group and the individual logarithm step is to find the DLP using the precomputed logarithms. Since the ephemeral keys are dynamic and change for every session, once the logarithms of a subset of a group are known, the DLP for the ephemeral key can be obtained using the individual logarithm step. Therefore, an efficient way of solving the individual logarithm step based on the newly proposed precomputation method is presented and the performance is analyzed using a comprehensive set of experiments. The ephemeral keys are also solved by using other methods, which are efficient on random primes, such as the Pohlig-Hellman method, the Van Oorschot method and the traditional individual logarithm step. The results are compared with the newly proposed individual logarithm step of the ICM. Also, the DLP of ephemeral keys used in a popular password key exchange protocol known as Chang and Chang are computed and reported to launch key recovery attack.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.7
• /
• pp.47-55
• /
• 2020

In this paper, we propose one stage multi-scale face detector based Fully Convolution Network using anchor free method. Recently almost all state-of-the-art face detectors which predict location of faces using anchor-based methods rely on pre-defined anchor boxes. However this face detectors need to hyper-parameters and additional computation in training. The key idea of the proposed method is to eliminate hyper-parameters and additional computation using anchor free method. To do this, we apply two ideas. First, by eliminating the pre-defined set of anchor boxes, we avoid the additional computation and hyper-parameters related to anchor boxes. Second, our detector predicts location of faces using multi-feature maps to reduce foreground/background imbalance issue. Through Quantitative evaluation, the performance of the proposed method is evaluated and analyzed. Experimental results on the FDDB dataset demonstrate the effective of our proposed method.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.2
• /
• pp.476-483
• /
• 2010

If the data are pre-whitened, then gradient adaptive algorithms which are simpler than higher order statistics algorithms can be used in adaptive blind signal estimation. In this paper, we propose a blind subband affine projection algorithm for multiple-input multiple-output adaptive equalization in the blind environments. All of the adaptive filters in subband affine projection equalization are decomposed to polyphase components, and the coefficients of the decomposed adaptive sub-filters are updated by defining the multiple cost functions. An infinite impulse response filter bank is designed for the data pre-whitening. Pre-whitening procedure through subband filtering can speed up the convergence rate of the algorithm without additional computation. Simulation results are presented showing the proposed algorithm's convergence rate, blind equalization and blind signal separation performances.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.3
• /
• pp.264-273
• /
• 2002

Adaptive filters cannot exactly estimate the echo path of the receiving room because of the cross-correlation of stereo signals. In this paper, a new pre-processing method reducing the cross-correlation without degradation of stereophony is proposed to enhance the performance of stereophonic acoustic echo canceller. To reduce the cross-correlation, absolutes of two orthogonal signals derived from each channel signals are added to original channel signals. Assuming that the power of each channel signal is larger than that of the cross-correlation, the computation of pre-processing can be reduced. As results of simulations, it is shown that the performance of stereo acoustic echo canceller with the proposed pre-processing method is better than that of conventional ones.