• 한국수학교육학회지시리즈A:수학교육
• /
• 제51권3호
• /
• pp.197-210
• /
• 2012

In this study, we will develop and implement the teaching program of 'Function', on the subject of "Poster-Making utilizing the Graph Art" in the Math Camp for middle-school students. And we will examine the didactical significance through student's activities and products. The teaching program of 'Function' utilizing the Graph Art can be promoted self-directly the understanding of 'Function' concept and the ability for handling 'Function'. In the process of drawing up the graph art, in particular, this program help students to promote the ability for problem-solving and mathematical thinking, and to communicate mathematically and attain the his own level. Ultimately, this program have a positive influence upon cognitive and affective and areas with regard to mathematics.

• 한국정보통신학회논문지
• /
• 제17권4호
• /
• pp.863-868
• /
• 2013

본 논문에서는 최근의 디지털논리시스템의 함수구성시에 도입되고 있는 그래프이론에 바탕을 둔 새로운 형태의 데이터구조 형태인 모서리값 확장 그래프를 추출하는 알고리즘을 제안하였다. 이를 위해 수학적 배경으로는 리터럴 함수와 리드 뮬러 확장에 대해 논의하였으며, 본 논문의 근간인 모서리 확장 그래프의 도출에 대해 논의하였다. 또한, 모서리 확장 그래프로부터 임의의 m치 n변수의 축약된 함수구성을 도출하는 알고리즘을 제안하였으며 이를 예에 적용하여 그 타당성을 보였다. 제안된 알고리즘의 규칙성을 고려하여 동일부분을 모듈화함으로써 일반성을 가짐을 보였다.

• 한국정보통신학회논문지
• /
• 제15권9호
• /
• pp.1965-1970
• /
• 2011

본 논문에서는 그래프에 기초하여 유한체상의 스위칭함수를 도출하는 알고리즘과 이를 바탕으로 스위칭함수를 회로로 구현하는 방법을 제안하였다. 방향성그래프의 경로 수로부터 행렬방정식을 유도한 후에 이에 따른 스위칭 함수회로설계 알고리즘을 제안하였으며, 설계된 회로와 함께 방향성 그래프의 특성을 만족할 수 있게 노드들에 대한 코드를 할당하는 알고리즘을 제안하였다. 본 논문에서 제안한 알고리즘을 통해 설계한 스위칭함수회로는 기존의 방법에 비해 좀 더 최적화된 스위칭함수회로를 구현할 수 있었으며, 제안한 스위칭함수회로설계 알고리즘을 통해 임의의 자연수의 경로 수를 갖는 방향성 그래프에 대한 설계가 가능하였다. 또한, 입출력단자 수의 감소, 회로구성의 간략화, 연산속도의 향상과 비용감소 등의 이점이 있었다.

• 한국자동차공학회논문집
• /
• 제6권4호
• /
• pp.66-75
• /
• 1998

In many case of optimal design and sensitivity analysis, obtaining of transfer function between input and output variables is a difficult and time-consuming problem. The bond graph modeling is a method that is used for making it easy to analyze complex systems composed of mechanical and electrical parts. It gives us a simple and systematic tool to get state-space equations easily. And we can obtain the transfer function graphically using bond graph and Mason's rule. This paper shows how bond graphs are converted to block diagram and how Mason's rule is applied. And the simple direct method to obtain transfer function from bond graph is introduced. As a example, induction of transfer function of electric power steering composed of mechanical and electrical parts will be done.

• 대한수학회지
• /
• 제43권6호
• /
• pp.1269-1287
• /
• 2006

As a continuation of computing the zeta function of a regular covering graph by Mizuno and Sato in [9], we derive in this paper computational formulae for the zeta functions of a graph bundle and of any (regular or irregular) covering of a graph. If the voltages to derive them lie in an abelian or dihedral group and its fibre is a regular graph, those formulae can be simplified. As a by-product, the zeta function of the cartesian product of a graph and a regular graph is obtained. The same work is also done for a discrete torus and for a discrete Klein bottle.

• 전기전자학회논문지
• /
• 제27권1호
• /
• pp.93-102
• /
• 2023

악성코드 분석을 위한 기술 중 하나로 실행 프로그램의 함수 호출 관계를 시퀀스 또는 그래프 작성한 후, 그 결과를 분석하는 기술이 제안되었다. 이러한 기술들은 일반적으로 실행 프로그램 파일의 정적 분석을 통해 함수 호출 코드를 분석하고, 함수 호출 관계를 시퀀스 또는 그래프로 정리한다. 그러나 난독화 된 실행 프로그램의 경우, 실행 프로그램 파일의 구성이 표준구성과 다르기 때문에 정적분석 만으로는 함수 호출관계를 명확히 분석하기 어렵다. 본 논문에서는 난독화 된 실행 프로그램의 함수 호출관계를 분석하기 위한 동적 분석 방법을 제안하고, 제안된 기술을 이용하여 함수 호출관계를 그래프로 구성하는 방법을 제안한다.

• 대한전자공학회논문지
• /
• 제27권7호
• /
• pp.1025-1032
• /
• 1990

We proposed a neural network energy function for the optimal graph partitioning and its optimization method using Boltzmann Machine. We composed a Boltzmann Machine with the proposed neural network energy function, and the simulation results show that we can obtain an optimal solution with the energy function parameters of A=50, B=5, c=14 and D=10, at the Boltzmann Machine parameters of To=80 and \ulcorner0.07 for a 6-node 3-partition problem. As a result, the proposed energy function and optimization parameters are proved to be feasible for the optimal graph partitioning.

• 전기학회논문지P
• /
• 제53권4호
• /
• pp.210-215
• /
• 2004

This paper proposes an implicit method for computing the minimum cost feedback vertex set for a graph. For an arbitrary graph, a Boolean function is derived, whose satisfying assignments directly correspond to feedback vertex sets of the graph. Importantly, cycles in the graph are never explicitly enumerated, but rather, are captured implicitly in this Boolean function. This function is then used to determine the minimum cost feedback vertex set. Even though computing the minimum cost satisfying assignment for a Boolean function remains an NP-hard problem, it is possible to exploit the advances made in the area of Boolean function representation in logic synthesis to tackle this problem efficiently in practice for even reasonably large sized graphs. The algorithm has obvious application in flip-flop selection for partial scan. The algorithm proposed in this paper is the first to obtain the MFVS solutions for many benchmark circuits.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제12권1호
• /
• pp.47-55
• /
• 2005

For topological spaces X, Y and the function f : X → Y, it induces a function gr(f) : X → X x Y defined as gr(f)(χ) = (χ, f(χ)), for every χ ∈ X. It deals with some preliminary investigations relating to the behavior of functions and its graph functions. It has also been found that continuous functions are homotopic if and only if their graph functions are homotopic.

• 한국학교수학회논문집
• /
• 제1권1호
• /
• pp.151-163
• /
• 1998

In mathematics education, teaching-learning activity can be divided largely into the understanding the mathematical concepts, derivation of principles and laws, acquirement of the mathematical abilities. We utilize various media, teaching tools, audio-visual materials, manufacturing materials for understanding mathematical concepts. But sometimes we cannot define or explain correctly the concepts as well as the derivation of principles and laws by these materials. In order to solve the problem we can use the computer. In this paper, character and movement state of various quadratic function graph types can be used. Using the computers is more visible than other educational instruments like blackboards, O.H.Ps., etc. Then, students understand the mathematical concepts and the correct quadratic function graph correctly. Consquently more effective teaching-learning activity can be done. Usage of computers is the best method for improving the mathematical abilities because computers have functions of the immediate reaction, operation, reference and deduction. One of the important characters of mathematics is accuracy, so we use computers for improving mathematical abilities. This paper is about the program focused on the part of "the quadratic function graph", which exists in mathematical curriculum the middle school. When this program is used for students, it is expected the following educational effect. 1, Students will have positive thought by arousing interests of learning because this program is composed of pictures, animations with effectiveness of sound. 2. This program will cause students to form the mathematical concepts correctly. 3. By visualizing the process of drawing the quadratic function graph, students understand the quadratic function graph structually. 4. Through the feedback, the recognition ability of the trigonometric function can be improved. 5. It is possible to change the teacher-centered instruction into the student-centered instruction. For the purpose of increasing the efficiencies and qualities of mathmatics education, we have to seek the various learning-teaching methods. But considering that no computer can replace the teacher′s role, tearchers have to use the CIA program carefully.