• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.3
• /
• pp.237-241
• /
• 2002

In this paper, we describe how to represent hand witten decimal digits by a sequence of one to five fuzzy sets. Each fuzzy set represents an arc segment of the digit and is a Cartesian product of four fuzzy sets; the first is fur the arc length of the segment, the second is for the arc direction, the third is fur the arc shape, and the fourth is a crisp number indicating whether it has a junction point and if it has an end point of a stroke. We show that an arbitrary pair of these sequences representing two different digits is mutually disjoint. We also show that various forms of a digit written in different styles can be represented by the same sequence of fuzzy sets and hence the deviations due to different writers can be modeled by using these fuzzy sets.

• Communications of the Korean Mathematical Society
• /
• v.15 no.4
• /
• pp.683-689
• /
• 2000

The convergence rate of the expectation of the logarithm of the first return time R(sub)n with block length n has been investigated for Bernoulli processes. This idea is applied to check the randomness of the digits of the decimal expansion of $\pi$, e and √2.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.55 no.11
• /
• pp.491-494
• /
• 2006

In the adder design, reduction of the delay of the carry propagation or ripple is the most important consideration. Previously, it was introduced that, if a redundant number system is adopted, the carry propagation is completely eliminated, with which addition can be done in a constant time, without regarding to the count of the digits of numbers involved in addition. In this paper, a RBCD(Redundant Binary Coded Decimal) is adopted to code 0 to 11, and an efficient and economic carry-free BCD adder is designed.

• Journal of Educational Research in Mathematics
• /
• v.24 no.4
• /
• pp.595-605
• /
• 2014

Infinite decimals have an infinite number of digits, chosen arbitrary and independently, to the right side of the decimal point. Since infinite decimals are ambiguous numbers impossible to write them down completely, the infinite decimal representation accompanies unavoidable opaqueness. This article focused the transparent aspect of infinite decimal representation with respect to the completeness axiom of real numbers. Long before the formalization of real number concept in $19^{th}$ century, many mathematicians were able to deal with real numbers relying on this transparency of infinite decimal representations. This analysis will contribute to overcome the double discontinuity caused by the different conceptualizations of real numbers in school and academic mathematics.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.2
• /
• pp.121-126
• /
• 2014

The problem of finding the fastest algorithm for multiplication of two large n-digit decimal numbers remains unsolved in the field of mathematics and computer science. To this problem so far two algorithms - Karatsuba and Toom-kook - have been proposed to shorten the number of multiplication. In the complete opposite of shorten the number of multiplication method, this paper therefore proposes an efficient multiplication algorithm using additions completely. The proposed algorithm totally applies shift-and-add algorithm of binary system to large digits of decimal number multiplication for example of RSA-100 this problem can't perform using computer. This algorithm performs multiplication purely with additions of complexity of $O(n^2)$.

• Journal of Advanced Navigation Technology
• /
• v.17 no.6
• /
• pp.700-704
• /
• 2013

Quantum-dot cellular automata(QCA) is a new technology and it is an one of the alternative high performance over existing complementary metal-oxide semi-conductor(CMOS). QCA is nanoscale device and ultra-low power consumption compared with transistor-based technologies, and various circuits using QCA technology have been proposed. Binary-coded decimal(BCD), which represents decimal digits in binary, is mainly used in electronic circuits and Microprocessor, and it is comfortable in conversion operation but many data loss. In this paper, we present an BCD-EXCESS 3 Code converter which can be efficiently used for subtraction and half adjust. The proposed scheme has efficiently designed considering space and time complexities and minimization of noise, and it has been simulated and confirmed.

• Bulletin of the Korean Chemical Society
• /
• v.11 no.6
• /
• pp.497-505
• /
• 1990

The function exp$(x^2)$erfc(x), which is often encountered in studies of electrode kinetics, is evaluated to an extended precision with 32 significant decimal digits in order to find theoretical relationships used in derivative polarography/voltammetry for a chemically-coupled electrode process. Computations with a lower precision are not successful. Evaluation of the function is accomplished by using three types of expansions for the function. Best ranges of arguments are selected for each equation for particular precisions for efficiencies. The method is successfully applied to calculate higher-order derivatives of the current-potential curves in all potential ranges for a reversible electron transfer reaction coupled with a prior chemical equilibrium (i.e., a CE type process). Various parameters that characterize the peak asymmetry (such as ratios of peak-heights, ratios of half-peak-widths, and separations in peak-potentials) are analyzed to find how kinetic and thermodynamic parameters influence shapes of the derivatives. The results from the CE process is compared with those from an EC process in which a reversible electron transfer is coupled with a follow-up homogeneous chemical reaction. The two processes exibit quite contrasting differences for values of the parameters.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.1 no.1
• /
• pp.23-35
• /
• 1983

In its global meaning language translation refers to the process whereby a program which is executable in one computer can be executed in another computer directly to obtain the same result. There are four different ways of approaching translation. The first way is translation by a Translator or a Compier, the second way is Interpretation, the third way is Simulation, the last way is Emulation. This paper introduces the M-C Translator which was designed as the first way of translation. The MUSS 80 language (the subsystem of the UNIVAC Solid State 80 S-4 assembly language system) was chosen as the source language which includes forty-three instructions, using the CYBER COMPASS as the object language. The M-C translator is a two pass translator and is a two pas translator and es written in Fortran Extended language. For this M-C Translation, seven COMPASS subroutines and a set of thirty-five macros were prepared. Each executable source instruction corresponds to a macro, so it will be a macro instruction within the object profram. Subroutines are used to retain and handle the source data representation the same way in the object program as in the source system, and are used to convert the decimal source data into the equivalent binary result into the equivalent USS-80digits before and after arithmetic operations. The source instructions can be classified into three categories. First, therd are some instructions which are meaningless in the object system and are therefore unnecessary to translate, and the remaining instructions should be translated. Second, There are some instructions are required to indicate dual address portions. Third, there are Three instructions which have overflow conditions, which are lacking in the remaining instructions. The construction and functions of the M-C Translator, are explained including some of the subroutines, and macros. The problems, difficulties and the method of solving them, and easier features on this translation are analysed. The study of how to save memory and time will be continued.

• Journal of Advanced Navigation Technology
• /
• v.23 no.4
• /
• pp.316-321
• /
• 2019

In this paper, by applying the constant current principle we develop an impedance measurement system which can measure the high precision impedance of various electric materials by using microprocessor. This measurement system board has an interface device for acquiring digital data from an external device including an impedance measuring device, and system software is also developed by a firmware program executed on such an embedded board. It can measure the high precision impedance of a specific band with 1/32768 precision by using 15-bit ADC(analog to digital converter) and calculate it to the five digits to the right of the decimal point(fraction part). Data is transmitted through a USB interface of a general computer and a measuring device to manage digital data. An impedance measurement system equipped with a communication function capable of a more general and easy-to-use interface than other equipment is developed and verified.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.3
• /
• pp.132-140
• /
• 1994

SCRIPT (Symbol/Character Recognition In Pen-based Technology) is an algorithm for on-line recognition of handwriting Hangeul. English upperacase letters, decimal digits, and some keyboard symbols. The shape of handwriting symbols has a large variation even when written by the same person. Though the feature analysis approach using a conventional decision tree is efficient, it is not robust under shape variations and prone to misclassification. Thus, a new method to overcome this shortcoming is necessary. In this paper, a feature analysis algorithm using two fuzzy decision trees which utilize the hierarchical property of the pattern is proposed. The first tree is used to represent the stroke shape, and the other tree is used to represent the relation between the strokes. since this method stores various possibilities. it is robust to shape variations and can readily modify false selections. In addition, there is a large increase in the recognition rate of high-level patterns due to low-level candidated. Experimental results show 91% recognition rate for Hangeul at the recognition speed of 0.33 second per character, and the recognition rate of alphanumerics and some keyboard symbols is 95% at 0.08 second per symbol. This is 8~18% increase in the recognition rate over th method not applying fuzzy decision trees.