• 전기의세계
• /
• 제22권4호
• /
• pp.25-29
• /
• 1973

The computation of transmittances between arbitrary input and output nodes is of particular interest in the signal flow graph theory imput. The signal flow matrix [T] can be defined by [X]=-[T][X] where [X] and [Y] are input nose and output node matrices, respectively. In this paper, the followings are discussed; 1) Reduction of nodes by reforming the signal flow matrix., 2) Solution of input-output relationships by means of Gauss-Jordan reduction method, 3) Extension of the above method to the matrix signal flow graph.

• Journal of applied mathematics & informatics
• /
• 제41권6호
• /
• pp.1193-1207
• /
• 2023

In this paper, we introduce an iP₂ extension of a star graph S_n for n ≥ 2 and 1 ≤ i ≤ n - 1. Certain general properties satisfied by order, size, domination (or Roman) numbers γ (or γ_R) of an iP₂ extended star graph are studied. Finally, we study how the parameters such as chromatic number and harmonious chromatic number are affected when an iP₂ extension process acts on the star graphs.

• 한국정보처리학회논문지
• /
• 제6권3호
• /
• pp.589-602
• /
• 1999

객체 지향 개념에 토대를 둔 어플리케이션 개발에는 여러 가지 이점이 있으나, 그 중 하나로서, 기존 성과물의 재이용을 들 수 있다. 유효한 재이용 수법 중의 하나로서, 본 논문에서는 클래스 계층 구조를 바탕으로 하는 확장 재구성법에 대해 논한다 우선, 클래스 계층 구조를 보다 형식적인 형태로 정의하고 이론적인 논술이 가능토록 하기 위해서, 클래스 계층 구조를 유한 유방향 그래프 형태인 클래스 계층 그래프로 나타낸다 또한, 클래스 계층 그래프간의 순서관계로써 객체 확장관계 를 정의한다. 객체 확장관계를 만족하는 클래스 계층 그래프의 재구성법으로써, 다섯가지 기본조작을 정의하고, 정의된 기본 조작만을 이용하여 클래스계층 그래프를 확장 재구성할 수 있음을 보이기위해, 기본 조작의 정당성 및 완전성을 증명한다. 본 논문에서 제안한 객체 확장관계 및 기본 재구성기법은, 기존의 객체 지향 어플리케이션을 확장 재구성하고자 할 때 이론 적인 토대로서 이용할 수 있다.

• 한국자동차공학회논문집
• /
• 제6권3호
• /
• pp.34-44
• /
• 1998

It is clear that when an automobile negotiates a curve the lateral acceleration causes an increase in tire normal load for the wheels on the outside of the curve and a decrease in load for the inside wheels. However, just how the details of the suspension linkages and the parameters of the springs and shock absorbers affect the dynamics of the load transfer os not easily understood. One even encounters the false idea that since it is the compression and extension of the main suspension springs spring body role which largely determines the changes in normal load, of roll could be reduced, the load transfer would also be reduced. Using free body diagrams, one can explain quite clearly how the load is transferred for steady state cornering, and, using complex multibody models of particular vehicles one can simulate in good fidelity how load transfer occurs dynamically. Here we adopt a middle ground by using the concept of roll center and using a series of half-car bond graph models to point out main effects. Since bond graph junction structures automatically and consistently constrain geometric and force variables simultaneously, they can be used to point out hidden assumptions of other simplified vehicle models.

• 한국지능시스템학회논문지
• /
• 제11권6호
• /
• pp.528-531
• /
• 2001

그래프에서 최단경로를 찾는 문제는 그래프 이론분야에서 고전적인 문제이다. 전통적인 최단경로 문제에서 간선의 가중치값을 정확히 결정하는것이 어려운 경우에는 퍼지 가중치를 이용하여 문제를 해결할수 있다. 그리고 이러한 퍼지 가중치값을 결정하는데 있어 또 다른 불확실성이 존재하는 경우에는, 타입 2-퍼지 가중치를 이용하여 간선이 가중치를 표현할수 있다. 본 논문에서는 타입-1 퍼지 가중치 그래프에서의 최단경로문제를 타입 2 퍼지 가중치 그래프의 경우로 확장하고, 확장된 그래프에서 최단경로를 찾기 위한 모델을 제시하였다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2001년도 추계학술대회 학술발표 논문집
• /
• pp.314-318
• /
• 2001

Constructing a shortest path on a graph is a fundamental problem in the area of graph theory. In an application where we cannot exactly determine the weights of edges, fuzzy weights can be used instead of crisp weights, and Type-2 fuzzy weights will be more suitable if this uncertainty varies under some conditions. In this paper, shortest path problem in type-1 fuzzy weighted graphs is extended for type-2 fuzzy weighted graphes. A solution is also given based on possibility theory and extension principle.

• International Journal of Contents
• /
• 제10권1호
• /
• pp.23-28
• /
• 2014

When developing a classifier using various objective functions, it is important to compare the performances of the classifiers. Although there are statistical analyses of objective functions for classifiers, simulation results can provide us with direct comparison results and in this case, a comparison criterion is considerably critical. A Receiver Operating Characteristics (ROC) graph is a simulation technique for comparing classifiers and selecting a better one based on a performance. In this paper, we adopt the ROC graph to compare classifiers trained by mean-squared error, cross-entropy error, classification figure of merit, and the n-th order extension of cross-entropy error functions. After the training of feed-forward neural networks using the CEDAR database, the ROC graphs are plotted to help us identify which objective function is better.

• Industrial Engineering and Management Systems
• /
• 제6권1호
• /
• pp.72-82
• /
• 2007

Business Rules are formal statements about the data and processes of an enterprise. They present projections of the organization's constraints and ways of working on their supporting information systems. Therefore, their collection, structuring and organization should be central activities within information systems. In an enterprise, business rules are used to represent certain aspects of a business domain (static rules) or business policy (dynamic rules). Hence, regarding problem domains in the organization, business rules are classified into two groups: static and dynamic business rules. The paper introduces a new concept of business rules, Extended Dynamic Business Rule (EDBR) which contains the results of the occurrence of business rule's action. The focus of this paper is in the organizing, defining and modeling of such business rules using Mineau's approach. Mineau's approach is an extension of Sowa's Conceptual Graph theory.

• International Journal of Contents
• /
• 제6권3호
• /
• pp.19-24
• /
• 2010

Task scheduling is an integrated component of computing with the emergence of grid computing. In this paper, we address two different task scheduling models, which are static Round-Robin (RR) and dynamic Fastest Site First (FSF) task scheduling method, using extended timed marked graphs, which is a special case of Stochastic Petri Nets (SPN). Stochastic reward nets (SRN) is an extension of SPN and provides compact modeling facilities for system analysis. We build hierarchical SRN models to compare two task scheduling methods. The upper level model simulates task scheduling and the lower level model implements task serving process for different sites with multiple servers. We compare these two models and analyze their performances by giving reward measures in SRN.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 추계학술대회 논문집 학회본부 B
• /
• pp.389-391
• /
• 2000

A representation technique of a given track topology is required by many software applications in railway technology such as signalling system simulator. To achieve these, the concept of double vertex graph architecture is proposed. These are composed of pairs of vertices and node between the single vertices. Double vertex graph architecture can be understood as a extension of classical graphs. In developed railway signalling simulation software, it is shown that track topology can be represented by proposed algorithm in a efficient way. Especially it makes sure that these are suitable technique for representing and implementing of switch, routes which can be introduced some mistake in classical graph algorithm.