• 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 Institute of Electronics Engineers of Korea SD
• /
• v.37 no.12
• /
• pp.79-90
• /
• 2000

In this paper, a high-performance floating point unit, which is suitable for high-performance superscalar microprocessors and supports IEEE 754 standard, is designed. Floating-point arithmetic unit (AU) supports all denormalized number processing through hardware, while eliminating the additional delay time due to the denormalized number processing by proposing the proposed gradual underflow prediction (GUP) scheme. Contrary to the existing fixed-radix implementations, floating-point divide/square root unit adopts a new architecture which determines variable length quotient bits per cycle. The new architecture is superior to the SRT implementations in terms of performance and design complexity. Moreover, sophisticated exception prediction scheme enables precise exception to be implemented with ease on various superscalar microprocessors, and removes the stall cycles in division. Designed floating-point AU and divide/square root unit are integrated with and instruction decoder, register file, memory model and multiplier to form a floating-point unit, and its function and performance is verified.

• Journal of Korean Port Research
• /
• v.15 no.1
• /
• pp.87-97
• /
• 2001

The calculation of earthwork plays a major role in plan or design of many civil engineering projects, and thus it has become very important to advanced the accuracy of earthwork calculation. Current method used for estimating the volume of pit excavation assumes that the ground profile between the grid points is linear(trapezoidal rule), or nonlinear(simpson's formulas). In this paper the spot height method, least square method, and chamber formulas, Chen and Lin method are compared with the volumes of the pits in these examples. As a result of this study, algorithm of chen and Lin me쇙 by spline method should provide a better accuracy than the spot height method, least square method, chamber formulas. The Chen and Lin formulas can be used for estimating the excavation volume of a pit divide into a grid with unequal intervals. From the characteristics of the cubic spline polynomial, the modeling curve of the Chen and Lin method is smooth and matches the ground profile well. Generally speaking, the nonlinear profile formulas provide better accuracy than the linear profile formulas. The mathematical model mentioned make an offer maximum accuracy in estimating the volume of a pit excavation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.1
• /
• pp.46-55
• /
• 2007

The Newton-Raphson's algorithm for finding a floating point reciprocal and inverse square root calculates the result by performing a fixed number of multiplications. In this paper, an improved Newton-Raphson's algorithm is proposed, that performs multiplications a variable number. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal and inverse square tables with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a reciprocal and inverse square root unit. Also, it can be used to construct optimized approximate tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc.

• Journal of the Korean Society of Costume
• /
• v.67 no.3
• /
• pp.47-65
• /
• 2017

The purpose of this study was to divide respondents by consumption values, and to examine the differences in their cosmetic purchase behavior. Cosmetic purchase behavior consisted of variables such as purchase frequency, purchase amount, place of purchase, purchase reason, reason for using cosmetics, purchase propensity, degree of using information source, and selection criteria. A survey was conducted with 308 women between the ages 20 and 29 from December 5th to 10th 2016. Data collected from the respondents through an Internet survey were analyzed using descriptive statistics, factor analyses, cluster analysis, analyses of variance and chi-square tests. Four consumption value dimensions emerged that were termed emotional, differentiated individuality-pursuing, functional and social value. The respondents were classified into three groups(emotional consumer group, functional consumer group, active consumer group) by cluster analysis using four dimensions of consumption value. The results of the analyses of variance and chi-square tests showed significant differences in purchase frequency, place of purchase, purchase reason, reason for using cosmetics, degree of using information source and selection criteria among groups classified by consumption value. However, there were no differences in purchase amount and purchase propensity among them.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.6
• /
• pp.1525-1536
• /
• 2016

ROTC is the system that selects the best students in university and implements the military training of two years and uses them as beginning commander of the army by commissioning as officers. ROTC makes up a very large portion of the army and society in Korea in terms of the size and role. Therefore, it is very important to enhance intangible combat power of the Korean army by improving leadership of primary grade officer from ROTC. The purpose of this paper is to investigate whether or not ROTC candidate training program is providing the right training, so as to improve ROTC's leadership and present improvement plan. First, we divide ROTC candidate training program into three areas and take the 1st and 2nd survey. Then we compare and analyze the actual condition and recognition of investigation using statistical analysis methods such as chi-square test, ANOVA and Duncan's multiple range test. Also, we analyze the element affecting the army leader's three qualities formation which are basic elements of ROTC cadet's leadership using multiple regression analysis.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.6 no.8
• /
• pp.81-91
• /
• 1983

In this study the methods of the overhead standard setting and the overhead variance analysis, which raise problems especially in business practice in case that small businesses introduce the standard cost accounting system, were examined by hypothetical examples. As the result of this study small businesses are advised to take the following in setting the overhead cost. (1) To divide the mixed cost into variable overhead and fixed overhead, it is desirable to take Beast square method. (2) In setting the overhead standard, it is desirable to fake the flexible budget system and to make a budget by the inspection method, after dividing the overhead into variable overhead and fixed overhead. (3) After dividing the overhead variance into variable overhead variance and fixed overhead variance, it is desirable to analyze them as follows. (A) Variable overhead variance is analyzed into spending variance and efficiency variance. (B) Fixed overhead valiance is analyzed into budget variance and denominator variance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.612-613
• /
• 2010

The common image processing method treat the image as the array of pixels, and every pixel with its eight neighbors who directly around it form a square neighbor domain, sometimes may be more than that such as $5{\times}5$, or $7{\times}7$, and then adopt the convolution and template for every possible pixel value and then divide a attenuation factor, restrict the result in the area between 0 and 255, while the original and processed value record respectively. During the whole procedure, the result sole exist and represent the processing without changing the original pixel.

• 한국데이터정보과학회:학술대회논문집
• /
• 2004.04a
• /
• pp.39-50
• /
• 2004

The decision tree approach is most useful in classification problems and to divide the search space into rectangular regions. Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud dection, data reduction and variable screening, category merging, etc. CHAID(Chi-square Automatic Interaction Detector) uses the chi-squired statistic to determine splitting and is an exploratory method used to study the relationship between a dependent variable and a series of predictor variables. In this paper we propose CHAID algorithm by cube-based proportional sampling and explore CHAID algorithm in view of accuracy and speed by the number of variables.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.8
• /
• pp.1535-1543
• /
• 2007

Recently, there are many researches for P2P network. P2P network technologies are a good solution about making a wide spread distributed computing in the internet environment. The recent algorithms developed by several research groups for the lookup problem present a simple and general interface, a distributed hash table (DHT). In this paper, we also introduce new schemes that enhance the available rate of an object in the MagicSquare network. Replication scheme is to replicate an object with many replicas and save them to several nodes. Fragmentation scheme is to divide an object into several fragments and save them to several nodes. Replicated Fragmentation scheme is to mix replication scheme and fragmentation scheme. We will show result of simulation for our the proposed scheme.