• Journal of the Korean School Mathematics Society
• /
• v.12 no.3
• /
• pp.307-317
• /
• 2009

Formally p$\rightarrow$q means that affirming p one implicitly affirms q and that denying q one implicitly denies p. Denying p or affirming q do not lead to certain conclusions. Middle school students can recognize practical implication p$\rightarrow$q is true whenever p is false, but they don't recognize theoretical implication p$\rightarrow$q is true whenever p is false. They have not assimilated intuitively the complete structure of implication. Thus they do not distinguish naturally between the uncertain conclusion which can be drawn by affirming p and the certain rejection of p which follows from the negation of q. Also they can not recognize the uncertain conclusion which can be drawn by negation of p. There is no significant difference between practical conditional statements, formal conditional statements and conditional Inferences in advanced mathematics students. But there is a significant difference between formal conditional inferences and specific conditional inferences with statement p$\rightarrow$q is true when p is false.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.1
• /
• pp.38-49
• /
• 1994

One of the most common problems encountered in the automatic translation of FORTRAN source code to VECTRAN is the occurrence of conditional transfer of control within loops. Transfers of control create control dependencies, in which the execution of a statement is dependent on the value of a variable in another statement. In this paper I propose algorithms involve an attempt to convert statements in the loop into conditional assignment statements that can be easily analyzed for data dependency, and this paper presents a simplification method for conditional assignment statement. Especially, I propose not only a method for simplifying boolean functions but extended method for n-state functions.

• Korean Journal of Logic
• /
• v.18 no.3
• /
• pp.337-358
• /
• 2015

Vann Mcgee produced "counterexamples" to Modus Ponens in "A Counterexample to Modus Ponens". Discussions about the examples tended to focus on a probabilistic reading of conditional statements. This article attempts to establish both (1) Modus Ponens is a deductively valid rule of inference, and (2) the counterexample-like appearance of Mcgee's example can be (and should be) explained without making a reference to the notion of conditional probability. The reason why his examples seem to counter Modus Ponens is found rather within the ambiguity a conditional statement exhibits. That is, Mcgee's examples are cases of equivocation on the conditional statements involved.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1365-1376
• /
• 1997

In this paper, we designed real time mechanism control language and proposed execution time analysis technique. It was impossible to handle real-time mechanism control programs like programmable controller, numerical controller, distributed control system and robot controller with general purpose programming languages and operating systems because they have to process electric signals generated by thousands of sensors at the same at the same time and in real time. So we made it possible to predict plausibility of time constraint constructs of tiem constraint construct of a real time application program at compilation time by adding time constraint constructs and mechanism synchronization structure to conditional statement and iteration statement of a programming language and developing execution time analysis technique.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.11
• /
• pp.29-38
• /
• 1997

As the trend of the automation is increasing, the usage of the programmable automation equipments like programmable controller(PC), numerical controller(NC), distributed control systems(DCS) and robot controller is greatly expanding in the area of the industrial equipments. But the development of the programing language for the programmable automatic equipment is rarely accomplished. In this paper, we propose design and implementation technique of the real-time mechanism control language by adding time constraint constructs and timing analysis constructs ot conditional statement and iteration statement of a programming language. Moreover, we made it possible to predict plausibility of time constraint constructs of a real time application program at compilation time and developing execution time analysiss technique.

• Journal of Communications and Networks
• /
• v.13 no.1
• /
• pp.1-5
• /
• 2011

Feedback with carry shift registers (FCSRs) over 2-adic number would be suitable in hardware implementation, but the are not efficient in software implementation since their basic unit (the size of register clls) is 1-bit. In order to improve the efficiency we consider FCSRs over $2^{\ell}$-adic number (i.e., FCSRs with register cells of size ${\ell}$-bit) that produce ${\ell}$ bits at every clocking where ${\ell}$ will be taken as the size of normal words in modern CPUs (e.g., ${\ell}$ = 32). But, it is difficult to deal with the carry that happens when the size of summation results exceeds that of normal words. We may use long variables (declared with 'unsigned _int64' or 'unsigned long long') or conditional operators (such as 'if' statement) to handle the carry, but both the arithmetic operators over long variables and the conditional operators are not efficient comparing with simple arithmetic operators (such as shifts, maskings, xors, modular additions, etc.) over variables of size ${\ell}$-hit. In this paper, we propose some conditions for FCSRs over $2^{\ell}$-adic number which admit fast software implementations using only simple operators. Moreover, we give two implementation examples for the FCSRs. Our simulation result shows that the proposed methods are twice more efficient than usual methods using conditional operators.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.3
• /
• pp.475-477
• /
• 2014

Lee and Lim (2009) state three characterizations of Loamax, exponential and power function distributions, the proofs of which, are based on the solutions of certain second order non-linear differential equations. For these characterizations, they make the following statement : "Therefore there exists a unique solution of the differential equation that satisfies the given initial conditions". Although the general solution of their first differential equation is easily obtainable, they do not obtain the general solutions of the other two differential equations to ensure their claim via initial conditions. In this very short report, we present the general solutions of these equations and show that the particular solutions satisfying the initial conditions are uniquely determined to be Lomax, exponential and power function distributions respectively.

• The KIPS Transactions:PartB
• /
• v.10B no.4
• /
• pp.389-396
• /
• 2003

In this paper, we present a Korean partial parser based on rules, which is used for running applications such as a grammar checker and a machine translation. Basically partial parsers construct one or more morphemes and/or words into one syntactical unit, but not complete syntactic trees, and accomplish some additional operations for syntactical parsing. The system described in this paper adopts a set of about 140 manually-written rules for partial parsing. Each rule consists of conditional statements and action statement that defines which one is head node and also describes an additional action to do if necessary. To observe that this approach can improve the efficiency of overall processing, we make simple experiments. The experimental results have shown that the average number of edges generated in processing without the partial parser is about 2 times more than that with the partial parser.

• The Journal of Natural Sciences
• /
• v.5 no.2
• /
• pp.39-43
• /
• 1992

Detection of parallelism by a compiler is very desirable from a user's point of view. However, even the most sophisticated techniques to detect parallelism trip on trivial impediments, such as conditionals, function calls, and input/output statements, fail to detect most of the parallelism present in a program. Some parallelizing compilers provide feedback to the user when they have difficulty in deciding about parallel execution. Under these circumstances, a programmer has to restructure the source code to aid the detection of parallelism. But, functional and declarative languages can be said to offer many advantages in this context. Functional programs are easier to reason about because their output is determinate, that is, independent of the order of evaluation. However, functional languages traditionally have lacked good facilities for manipulating arrays and matrices. In this paper, a declarative language called Id has been proposed as a solution to some of these problems.

• Journal of Korea Game Society
• /
• v.18 no.5
• /
• pp.103-112
• /
• 2018

"Ito2", an early childhood educational coding game that allows students to learn sequential, loop, and conditional statement concepts through games is introduced. The developed game is a two-stage process of mock and practical classes for children in actual nursing cares, and coding education is conducted for actual children to determine its effectiveness. The degree of change is observed by observing trends in childhood cognitive development performance in all six areas, including parts and the overall, space, observation, shape and measurement, classification, comparison, and listing, as the coding training is conducted. In this paper, the improvement of cognitive development and spatial perceptual abilities were achieved by children playing games with infant functional coding with fun elements plus learning factors.