• 한국학교수학회논문집
• /
• 제2권1호
• /
• pp.93-104
• /
• 1999

The subject of this study was the graph of relation of direct inverse proportion, linear function and quadratic function in the 1st, 2nd and 3rd grade of current middle school mathematics curriculum. GSP materials were developed to simplify the principle, trait and characteristics of graphs and make them easier to understand. The overall aim of the materials is to improve the effectiveness of teaching and learning through the utilization of enhanced students' practice. Additionally, the use of the GSP will be useful in the development of mere effective materials. The effectiveness of the GSP materials will be as followings. 1. The step by step approach of GSP materials through computer interaction will enhance students motivation and interest in mathematics. 2. By presenting the subject matter simply and in a variety of ways, difficult concepts can be understood without the use of complex mathematical calculation. 3. The GSP program is different from CAI and other software programs. It should be used only after learning how to input and output data.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2001년도 The Pacific Aisan Confrence On Intelligent Systems 2001
• /
• pp.496-507
• /
• 2001

An expert system for the diagnosis and indication of hypertension is implemented through HTML-based backward inference. HTML-based backward inference is performed using the hypertext function of HTML, and many HTML files, which are hyperlinked to each other based on the backward rules, should be prepared beforehand. The development and maintenance of the HTML files are conducted automatically using the decision graph. Still, the drawing and input of the decision graph is a time consuming and tedious job if it is done manually. So, automatic generator of the decision graph for the diagnosis and indication of hypertension was implemented. The HTML-based backward inference ensures accessibility, multimedia facilities, fast response, stability, easiness, and platform independency of the expert system. So, this research reveals that HTML-based inference approach can be used for many Web-based intelligent site with fast and stable performance.

• 천문학회보
• /
• 제44권1호
• /
• pp.79.1-79.1
• /
• 2019

We present an algorithm for the fast computation of the general N-point spatial correlation functions of any discrete point set embedded within an Euclidean space of ${\mathbb{R}}n$. Utilizing the concepts of kd-trees and graph databases, we describe how to count all possible N-tuples in binned configurations within a given length scale, e.g. all pairs of points or all triplets of points with side lengths < rmax. Through benchmarking we show the computational advantage of our new graph-based algorithm over more traditional methods. We show that all 3-point configurations up to and beyond the Baryon Acoustic Oscillation scale (~200 Mpc in physical units) can be performed on current Sloan Digital Sky Survey (SDSS) data in reasonable time. Finally we present the first measurements of the 4-point correlation function of ~0.5 million SDSS galaxies over the redshift range 0.43< z <0.7. We present the publicly available code GRAMSCI (GRAph Made Statistics for Cosmological Information; bitbucket.org/csabiu/gramsci), under a GNU General Public License.

• 대한수학회보
• /
• 제58권1호
• /
• pp.171-181
• /
• 2021

The fixing number of a graph G is the smallest order of a subset S of its vertex set V (G) such that the stabilizer of S in G, ��S(G) is trivial. Let G1 and G2 be the disjoint copies of a graph G, and let g : V (G1) → V (G2) be a function. A functigraph FG consists of the vertex set V (G1) ∪ V (G2) and the edge set E(G1) ∪ E(G2) ∪ {uv : v = g(u)}. In this paper, we study the behavior of fixing number in passing from G to FG and find its sharp lower and upper bounds. We also study the fixing number of functigraphs of some well known families of graphs like complete graphs, trees and join graphs.

• 대한수학회보
• /
• 제54권3호
• /
• pp.1037-1067
• /
• 2017

Motzkin and Straus established a close connection between the maximum clique problem and a solution (namely graph-Lagrangian) to the maximum value of a class of homogeneous quadratic multilinear functions over the standard simplex of the Euclidean space in 1965. This connection and its extensions were successfully employed in optimization to provide heuristics for the maximum clique problem in graphs. It is useful in practice if similar results hold for hypergraphs. In this paper, we develop a homogeneous multilinear function based on the structure of hypergraphs and their complement hypergraphs. Its maximum value generalizes the graph-Lagrangian. Specifically, we establish a connection between the clique number and the generalized graph-Lagrangian of 3-uniform graphs, which supports the conjecture posed in this paper.

• 전자공학회논문지A
• /
• 제33A권2호
• /
• pp.184-195
• /
• 1996

Beause BiCMOS logic circuits consist of CMOS part which constructs logic function and bipolar part which drives output load, the effect of short faults on BiCMOS logic circuits represented different types from that on CMOS. This paper proposes new test method which detects short faults on BiCMOS logic circuits using current path graph. Proposed method transforms BiCMOS circuits into raph constructed by nodes and edges using extended switch-level model and separates the transformed graph into pull-up part and pull-down part. Also, proposed method eliminates edge or add new edge, according ot short faults on terminals of transistor, and can detect short faults using current path graph that generated from on- or off-relations of transistor by input patterns. Properness of proposed method is verified by comparing it with results of spice simulation.

• Journal of applied mathematics & informatics
• /
• 제39권3_4호
• /
• pp.497-506
• /
• 2021

Let G be a graph. Let f : V (G) → {0, 1, …, k - 1} be a function where k ∈ ℕ and k > 1. For each edge uv, assign the label $f(uv)={\lceil}{\frac{f(u)+f(v)}{2}}{\rceil}$. f is called k-total mean cordial labeling of G if ${\mid}t_{mf}(i)-t_{mf}(j){\mid}{\leq}1$, for all i, j ∈ {0, 1, …, k - 1}, where t_mf (x) denotes the total number of vertices and edges labelled with x, x ∈ {0, 1, …, k-1}. A graph with admit a k-total mean cordial labeling is called k-total mean cordial graph.

• Journal of applied mathematics & informatics
• /
• 제41권2호
• /
• pp.321-330
• /
• 2023

Let G = (V, E) be a graph. Consider the group S₃. Let g : V (G) → S₃ be a function. For each edge xy assign the label 1 if ${\lceil}{\frac{o(g(x))+o(g(y))}{2}}{\rceil}$ is odd or 0 otherwise. g is a group S₃ mean cordial labeling if |v_g(i) - v_g(j)| ≤ 1 and |e_g(0) - e_g(1)| ≤ 1, where vg(i) and e_g(y)denote the number of vertices labeled with an element i and number of edges labeled with y (y = 0, 1). The graph G with group S₃ mean cordial labeling is called group S₃ mean cordial graph. In this paper, we discuss group S3 mean cordial labeling for star related graphs.

• 한국학교수학회논문집
• /
• 제6권1호
• /
• pp.101-113
• /
• 2003

본 연구의 목적은 삼각함수에 관한 학생들의 오개념을 분석해보고 삼각함수 개념 지도 개선방안의 하나로 컴퓨터를 활용한 지도 방법을 고안하는 것이다. 이를 위해, 이미 삼각함수를 배운 학생들을 대상으로 삼각함수 개념과 관련된 학생들의 이해도 검사를 실시하여 호도법 활용과 삼각함수그래프와 관련된 학생들의 오개념을 분석하였다. 분석 결과를 바탕으로 GSP를 활용한 학생 주도형 교수-학습 자료를 고안하여, 삼각함수그래프 지도과정에 투입하였다. 그 결과, 컴퓨터 조작에 의한 역동적인 탐구과정이 학생들이 호도법과 삼각함수그래프를 이해하는데 도움을 줄 수 있음을 확인하였다.

• 정보과학회 논문지
• /
• 제42권6호
• /
• pp.713-722
• /
• 2015

OSS(Open-Source Software)의 사용 증가와 함께 라이선스 위반, 취약한 소스코드 재사용 등에 의한 분쟁 및 피해가 빈번해지고 있다. 이에, 실행파일(바이너리) 수준에서 프로그램에 OSS 모듈이 포함되었는지 여부를 확인하는 기술이 필요해졌다. 본 논문에서는 바이너리에서 함수 수준의 특징정보를 사용하여 OSS 모듈을 탐지하는 기법을 제안한다. 기존 소프트웨어 특징정보(버스마크) 기반 도용 탐지 기법들은 프로그램 전체 간 유사성을 비교하기 때문에 프로그램의 일부로 포함된 OSS 모듈들을 탐지하는데 부적합하다. 본 논문에서는, 함수 수준의 실행명령어, 제어 흐름 그래프(Control Flow Graph)와 개선된 함수 수준 구조적 특징정보를 추출하고 유사성을 비교하여 OSS 모듈의 임의 사용 여부를 탐지한다. 제안기법의 효율성과 각 특징정보들의 OSS 탐지 성능을 평가하기 위해, 특징정보량, OSS 모듈 탐지 시간 및 정확도, 컴파일러 최적화에 대한 강인성을 실험하였다.