• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 1994.10a
• /
• pp.121-125
• /
• 1994

본 논문에서는 Hu에 의해 고안된 random 탐색법과 조합된 tabu 탐색법(radnom tabu 탐색법)을 결합계수를 구하는 학습 알고리즘으로 직접 사용하여 국소적 최적해에 수렴하는 것을 방지하고, 수렴정도를 개선하는 새로운 방법을 제안한다. 이 방법을 배타적 논리합 문제에 적용하여 역전파법 및 tabu 탐색법을 이용한 오차역전파법과 비교한다. 그리고, 각 파라메터가 오차함수의 수렴에 미치는 영향을 조사한다.

• Journal of The Korean Association of Information Education
• /
• v.15 no.3
• /
• pp.387-397
• /
• 2011

In order to analyze the change of student's logical thinking, in this study, we were develop the educational materials. This educational materials were used in algorithm class through educational programming language Scratch. Algorithms of education materials were selected by analysis of foreign ACM and domestic middle school curriculum. The developed educational materials were applied to 4th grade students of elementary school. In order to analyze the change of student's logical thinking, we were used GALT short version. Total logic and Combinational reasoning, in the experimental group students, were growing significantly.

• The Journal of Korean Association of Computer Education
• /
• v.13 no.2
• /
• pp.1-14
• /
• 2010

Previous researches on the improvement of logical thinking in Informatics subject have used general logical thinking test and only limited improvement of logical thinking by programming learning result. In this study, the operational definition of the logical thinking in problem-solving process on Informatics education is different from the general logical thinking and the logical thinking of the other subjects. Firstly, we suggested the operational definition of components of logical thinking using the open questionnaire by expert and research team discussion. Also, we suggested the relationship between the operational definition and contents of the 'problem-solving methods and procedure' section in secondary Informatics subject. Finally, this study developed the evaluation contents based on the operational definition of components of logical thinking. The components of logical thinking which was required in problem-solving process on Informatics subject were ordering reasoning, propositional logic, controlling variables, combinatorial logic, proportional reasoning. We suggested the relationship between operational definition and problem-solving process and assessment of logical thinking in problem-solving process on Informatics subject. This paper will give meaningful insight to supply the guideline of the teaching strategy and evaluation methods for improving the logical thinking in Informatics education.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.546-549
• /
• 1998

다치결정도 (multiple-valued decision diagram : MDD) 와 순서화된 다치결정도 (ordered MDD:OMDD)는 다치논리함수의 표현에 폭넓게 사용된다. p치 n변수인 경우 p/sup (n-1)/으로 증가하는 노드의 수는 ROMDD(reduced OMDD)를 사용하여 현저하게 감소시킬 수 있다. 그러나 다치와 다변수의 경우에는 더욱 많은 공정을 수반하게 된다. 이러한 단점을 보완하기 위해 honghai jiang이 제안한 2치시스템에서의 input implict/output explicit 관계를 갖는 OVAG(output value array graph)를 사용하여 다치논리함수를 표현한다. 그리고 MDD 표현이 어려운 상황에서 MOVAG(multi OVAG)를 사용하여 보다 쉽게 출력값을 배열하는 그래프를 이끌어 낼 수 있다. 본 논문에서는 MOVAG의 구성방법과 회로에서 MOVAG로으 변환에 대한 알고리듬을 제안하였고, 알고리듬에 의한 결과를 MDD와 비교하여 노드수 감소에 따르는 처리속도가 개선됨을 검증하였다.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1999.05a
• /
• pp.75-79
• /
• 1999

다치결정도(Multiple-valued Decision Diagram : MDD)와 순서화된 다치결정도(Ordered MDD : OMDD)는 다치논리함수의 표현에 폭넓게 사용된다. p치 n변수 인 경우 p$^{(n-1)}$ 으로 증가하는 노드의 수는 ROMDD(Reduced OMDD)를 사용하여 현저하게 감소시킬 수 있다. 그러나 다치와 다변수의 경우에는 더욱 많은 공정을 수반하게 된다. 이러한 단점을 보완하기 위해 Honghai Jiang이 제안한 2치시스템에서의 input implict/output explicit 관계를 갖는 OVAG(Output Value Array Graph)를 사용하여 다치논리함수를 표현한다. 고리고 MDD 표현이 어려운 상황에서 MOVAG(Multi OVAG)를 사용하여 보다 쉽게 출력값을 배열하는 그래프를 이끌어 낼 수 있다. 본 논문에서는 MOVAG의 구성방법과 회로에서 MOVAG로의 변환에 대한 알고리즘을 제안하였고, 알고리즘에 의한 결과를 MDD와 비교하여 노드수 감소에 따르는 처리속도가 개선됨 을 검증하였다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.1
• /
• pp.1-7
• /
• 2007

An MTJ element not only computes Boolean function but also stores the output result in itself. We can make the most use of magneto-logic's merits by employing the magneto-logic in substitution for the sequential logic as well as the combinational logic. This unique feature opens a new horizon for potential application of MTJ as a universal logic element. Magneto-logic circuits using MTJ elements are more integrative and non-volatile. This paper presents novel 3-bit magneto-logic up/down counters and presents simulation results based on the HSPICE macro-model of MTJ that we have developed.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.12
• /
• pp.1-7
• /
• 2008

Magnetic Tunneling Junction (MTJ) has been used as a nonvolatile universal storage element mainly in memory technology. However, according to several recent studies, magneto-logic using MTJ elements show much potential in substitution for the transistor-based logic device. Magneto-logic based on MTJ can maintain the data during the power-off mode, since an MTJ element can store the result data in itself. Moreover, just by changing input signals, the full logic functions can be realized. Because of its programmability, it can embody the reconfigurable magneto-logic circuit in the rigid physical architecture. In this paper, we propose a novel 3-bit arbitrary magneto-logic circuit beyond the simple combinational logic or the short sequential one. We design the 3-bit magneto-logic which has the most complexity using MTJ elements and verify its functionality. The simulation results are presented with the HSPICE macro-model of MTJ that we have developed in our previous work. This novel magneto-logic based on MTJ can realize the most complex logic function. What is more, 3-bit arbitrary logic operations can be implemented by changing gate signals of the current drivel circuit.

• Journal of Gifted/Talented Education
• /
• v.23 no.3
• /
• pp.335-354
• /
• 2013

The purpose of this study was to investigate cognitive development and logical thinking formation levels of elementary gifted students and to compare with those of elementary regular students. For this purpose, 79 gifted elementary school students and 114 regular elementary school students in Kyunggi Province were participated, and GALT(Group Assessment of Logical Test) was administered to them. The results obtained in this study were as follows. First, the logical thinking scores of elementary gifted students were significantly higher than general students'(p<.05). Comparing the distribution of cognitive development level, elementary gifted students showed higher ratio in formal operation and lower ratio in concrete operation compared to the general students. It was interpreted that the cognitive development of gifted students preceded general students'. Second, analyzing according to the grade of elementary gifted students, logical thinking scores were significantly different between 5th graders and 6th graders(p<.05). Compared to 5th graders, logical thinking and formal operation ratio of 6th gifted graders showed significantly higher. The scores of four logical thinking areas except for conservational logic and correlational logic of 6th gifted graders showed significantly higher than 5th gifted graders'. Both 5th and 6th graders showed the highest formation ratio in combinational logic, and the lowest ratio in correlational logic. Third, logical thinking scores of gifted students according to gender did not show a significant difference(p>.05). The gifted boys reached formal operation more than gifted girls, but stayed more in the concrete operation. There was gender difference in correlational logic. The gifted girls showed significantly higher than gifted boys in correlational logic(p<.05).

• Journal of Korean Philosophical Society
• /
• v.139
• /
• pp.1-21
• /
• 2016

To quickly and accurately grasp the consistency and the true/false of sentence description, we may require the help of a computer. It is thus necessary to research and quickly and accurately grasp the consistency and the true/false of sentence description by computer processing techniques. This requires research and planning for the whole study, namely a plan for the necessary tables and those of processing, and development of the table of the five logic rules. In future research, it will be necessary to create and develop the table of ten basic inference rules and the eleven kinds of derived inference rules, and it will be necessary to build a DB of those tables and the computer processing of sentence logic using server programming JSP and client programming JAVA over its foundation. In this paper we present the overall research plan in referring to the logic operation table, dividing the logic and inference rules, and preparing the listed process sequentially by dividing the combination of their use. These jobs are shown as a variable table and a symbol table, and in subsequent studies, will input a processing table and will perform the utilization of server programming JSP, client programming JAVA in the construction of subject/predicate part activated DB, and will prove the true/false of a sentence. In considering the table prepared in chapter 2 as a guide, chapter 3 shows the creation and development of the table of the five logic rules, i.e, The Rule of Double Negation, De Morgan's Rule, The Commutative Rule, The Associative Rule, and The Distributive Rule. These five logic rules are used in Propositional Calculus, Sentential Logic Calculus, and Statement Logic Calculus for sentence logic.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.10
• /
• pp.29-38
• /
• 1999

This paper presents a new algorithm RICP(Redundancy Identification using Critical-pair Paths) to identify untestable faults in combinational logic circuits. In a combinational logic circuit, untestable faults occurred by redundancy of circuits. The redundancy of a circuit can be detected by analyzing areas of fanout stem and reconvergent gates. The untestable faults are identified by analyzing stem area using Critical-Pair path which is an extended concept of critical path. It is showed that RICP is better than FIRE(Fault Independent REdundancy identification) algorithm in efficiency. The performance of both algorithms was compared using ISCAS85 bench mark testing circuits.