• Journal of the Korea Society of Computer and Information
• /
• v.18 no.4
• /
• pp.123-129
• /
• 2013

The performance and practicality of cryptosystem for encryption, decryption, and primality test are primarily determined by the implementation efficiency of the modular exponentiation of $a^b$ (mod m). To compute $a^b$ (mod m), the standard binary squaring (square-and-multiply) still seems to be the best choice. However, in large b bits, the preprocessed n-ary, ($n{\geq}2$ method could be more efficient than binary squaring method. This paper proposes a square-and-divide and unpreprocessed n-ary square-and-divide modular exponentiation method. Results confirmed that the square-and-divide method is the most efficient of trial number in a case where the value of b is adjacent to $2^k+2^{k-1}$ or to. $2^{k+1}$. It was also proved that for b out of the beforementioned range, the unpreprocessed n-ary square-and-divide method yields higher efficiency of trial number than the general preprocessed n-ary method.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.2
• /
• pp.209-215
• /
• 2019

The objective of this study was to identify the determinants of digital divide according to the characteristics of the elderly. In order to achieve this objective, this study selected elderly people (${\geq}65$ years old) who used a senior welfare center in Chungcheongbuk-do. The survey was conducted using a self-filling survey method for 12 days. Total 289 copies of questionnaires were used for the analysis. The results of this study are as follows. First, gender and age among the demographic characteristics were the factors causing the digital divide of the elderly. Second, education level, economic level, Secondly, education level, economic level, health level, and occupation were factors creating the digital divide of the elderly. This study suggested practical and policy implications based on these results.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.6
• /
• pp.41-50
• /
• 2012

This paper presents a new sequence alignment method using the divide approach, which solves the problem by decomposing sequence alignment into several sub-alignments with respect to exact matching subsequences. Exact matching subsequences in the proposed method are bounded on the generalized suffix tree of two sequences, such as protein domain length more than 7 and less than 7. Experiment results show that protein sequence pairs chosen in PFAM database can be aligned using this method. In addition, this method reduces the time about 15% and space of the conventional dynamic programming approach. And the sequences were classified with 94% of accuracy.

• Journal of the Korean Physical Society
• /
• v.73 no.11
• /
• pp.1644-1649
• /
• 2018

Aiming at infrared thermal images with different buried depth defects, we study a variety of image segmentation algorithms based on the threshold to develop global search ability and the ability to find the defect area accurately. Firstly, the iterative thresholding method, the maximum entropy method, the minimum error method, the Ostu method and the minimum skewness method are applied to image segmentation of the same infrared thermal image. The study shows that the maximum entropy method and the minimum error method have strong global search capability and can simultaneously extract defects at different depths. However none of these five methods can accurately calculate the defect area at different depths. In order to solve this problem, we put forward a strategy of "divide and conquer". The infrared thermal image is divided into several local thermal maps, with each map containing only one defect, and the defect area is calculated after local image processing of the different buried defects one by one. The results show that, under the "divide and conquer" strategy, the iterative threshold method and the Ostu method have the advantage of high precision and can accurately extract the area of different defects at different depths, with an error of less than 5%.

• Information Systems Review
• /
• v.19 no.2
• /
• pp.159-183
• /
• 2017

Despite the rapid increase in the use of mobile Internet, only a few studies examined digital divide issues in the mobile internet environment. Prior studies on digital divide mainly focused on the usage environments of consumers. The present study analyzes mobile digital divide by considering user environments and the cognitive values of users. Therefore, we estimated the cognitive value of users in mobile Internet environments through contingent valuation method (CVM). We also analyzed the digital divide factors that cause this value difference. We found that domestic users perceive mobile Internet value up to 51,723 Korean Won per month. We analyzed the value differences of digital divide factors, such as "accessibility," "competency," and "usability." Based on this analysis, we found that a difference of 31,878 Korean Won was generated due to accessibility. Competitiveness resulted in a difference of 7,736 Korean Won, whereas that of usability resulted in 6,463 Korean Won. Accessibility is the most important digital divide factor that maximizes the difference of cognitive value of users in a domestic mobile Internet environment.

• The Korean Journal of Applied Statistics
• /
• v.35 no.2
• /
• pp.217-227
• /
• 2022

Quantile regression is widely used in many fields based on the advantage of providing an efficient tool for examining complex information latent in variables. However, modern large-scale and high-dimensional data makes it very difficult to estimate the quantile regression model due to limitations in terms of computation time and storage space. Divide-and-conquer is a technique that divide the entire data into several sub-datasets that are easy to calculate and then reconstruct the estimates of the entire data using only the summary statistics in each sub-datasets. In this paper, we studied on a variable selection method using Bayes information criteria by applying the divide-and-conquer technique to the penalized quantile regression. When the number of sub-datasets is properly selected, the proposed method is efficient in terms of computational speed, providing consistent results in terms of variable selection as long as classical quantile regression estimates calculated with the entire data. The advantages of the proposed method were confirmed through simulation data and real data analysis.

• Kyungpook Mathematical Journal
• /
• v.60 no.2
• /
• pp.255-277
• /
• 2020

Divide knots and links, defined by A'Campo in the singularity theory of complex curves, is a method to present knots or links by real plane curves. The present paper is a sequel of the author's previous result that every knot in the major subfamilies of Berge's lens space surgery (i.e., knots yielding a lens space by Dehn surgery) is presented by an L-shaped curve as a divide knot. In the present paper, L-shaped curves are generalized and it is shown that every knot in the minor subfamilies, called sporadic examples of Berge's lens space surgery, is presented by a generalized L-shaped curve as a divide knot. A formula on the surgery coefficients and the presentation is also considered.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.12
• /
• pp.101-106
• /
• 2015

This paper suggests heuristic algorithm with polynomial time complexity for rigging elections problem that can be obtain the optimal solution using linear programming. The proposed algorithm transforms the given problem into adjacency graph. Then, we divide vertices V into two set W and D. The set W contains majority distinct and the set D contains minority area. This algorithm applies divide-and-conquer method that the minority area D is include into majority distinct W. While this algorithm using simple rule, that can be obtains the optimal solution equal to linear programing for experimental data. This paper shows polynomial time solution finding rule potential in rigging elections problem.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.179-182
• /
• 2003

This paper proposes a new stereo matching algorithm using both the divide-and-conquer method and the DSI(Disparity Space Image) technique. Firstly, we find salient feature points on the each scanline of the left image and find the corresponding feature point at the right image. Then the problem of a scanline is divided into several subproblems. By this way, matching of the subintervals is implemented by using the DSI technique. The DSI technique for stereo matching process is a very efficient solution to find matches and occlusions simultaneously and it is very speedy. In addition, we apply three occluding patterns to process occluded regions, as a result, we reduce mismatches at the disparity discontinuity.

• Journal of Korea Multimedia Society
• /
• v.15 no.4
• /
• pp.439-448
• /
• 2012

TFT-LCD panel images have non-uniform brightness, noise signal and defect signal. It is hard to divide defect signal because of non-uniform brightness and noise signal, so various divide methods have being developed. In this paper, we suggest method to divide defective regions on TFT-LCD panel image by estimating a menas of two different size of windows, which is suggested by Eikvil et al., and using difference of them. But in this method, the size of detectable defects is restricted by the size of window, hence it has inefficient problem that the size of window have to increase to divide a large defect region. To solve this problem we suggest an algorithm which can divide various size of defects, by using Multi-scale and restrict a detectable size of defects in each scale. To prove an efficiency of suggested algorithm, we show that resulting images of real TFT-LCD panel images and an artificial image with various defects.