• Proceedings of the KIEE Conference
• /
• 1979.08a
• /
• pp.138-141
• /
• 1979

The purpose of this paper is to develop an efficient model for the analysis of a John's Chopper Circuit. In the John's Chopper Circuit analysis, the open branches are removed from the associated graph to formulate the modified incidence matrix. An algorithm for the generation of a modified proper tree and fundamental cut set matrix from a network graph is developed, which utilizes much less computer storage space and computation time compared to the classical methods.

• 전기의세계
• /
• v.25 no.4
• /
• pp.63-67
• /
• 1976

A new method for simplifying linear, bilateral and passive networks is presented, and the principle employed is based upon the elimination of mutual impedance and floating nodes of the metwork by introducing incidence matrix notations and bus admittance matrices. The method suggested is, particularly, suited for machine computations and applycable for reducing the calculation time in power system short-circuit and load-flow studies with good results.

• Journal for History of Mathematics
• /
• v.18 no.1
• /
• pp.103-110
• /
• 2005

This paper is aimed at studying a historical background of graph theory and we deal with the computer representation of graph through a simple example. Graph is represented by adjacency matrix, edge table, adjacency lists and we study the matrix representation by Euler circuit. The effect of the matrix representation by Euler circuit economize the storage capacity of computer. The economy of a storage capacity has meaning on a mobile system.

• The Pure and Applied Mathematics
• /
• v.8 no.2
• /
• pp.185-191
• /
• 2001

A k-hypertournament is a complete k-hypergraph with all k-edges endowed with orientations, i.e., orderings of the vertices in the edges. The incidence matrix associated with a k-hypertournament is called a 7-hypertournament matrix, where each row stands for a vertex of the hypertournament. Some properties of the hypertournament matrices are investigated. The sequences of the numbers of 1＇s and -1＇s of rows of a k-hypertournament matrix are respectively called the score sequence (resp. losing score sequence) of the matrix and so of the corresponding hypertournament. A necessary and sufficient condition for a sequence to be the score sequence (resp. the losing score sequence) of a k-hypertournament is proved.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.490-493
• /
• 2002

In this paper, the old Fourier-Motzkin method (abbreviated as the old FH method from now on) is first modified to the form which can derive all minimal vectors as well as all minimal support vectors of nonnegative integer homogeneous solutions (i.e., T-invariants) for a matrix equation $Ax=b=0^{m{\times}1}$, $A\epsilonZ^{m{\times}n}$ and $b\epsilonZ^{m{\times}1}$, of a given Petri net, where the old FM method is a well-known and direct method that can obtain at least all minimal support solutions for $Ax=0^{m{\times}1}$ from the incidence matrix . $A\epsilonZ^{m{\times}n}$, Secondly, for $Ax=b\ne0^{m{\times}n}$ a new extended FM method is given; i.e., all nonnegative integer minimal vectors which contain all minimal support vectors of not only homogeneous but also inhomogeneous solutions are systematically obtained by applying the above modified FH method to the augmented incidence matrix $\tilde{A}$ =〔A,-b〕$\epsilon$ $Z^{m{\times}(n＋1)}$ s.t. $\tilde{A}\tilde{x}$ = 0^{m{\times}1}$ However, note that for this extended FM method we need some criteria to obtain a minimal vector as well as a minimal support vector from both of nonnegative integer homogeneous and inhomogeneous solutions for Ax=b. Then those criteria are also discussed and given in this paper.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.121-124
• /
• 1996

In general, cellular manufacturing system can be constructed by the following two steps. The first step forms machine cells and part families, and the second step determines cell layout based on the result of first step. Cell layout has to be considered when cell is formed becauese the result of cell formation affects it. This paper presents a cell formation algorithm and proposes an integrated mathematical model for cell formation and cell layout. The cell formation algorithm minimizes the number of exceptional element in cellular manufacturing system. New concept for similarity and incapability is introduced, based on machine-operation incidence matrix and part-operation incidence matrix. One is similarity between the machines, the other is similarity between preliminary machine cells and machines. The incapability identifies relations between machine cells and parts. In this procedure, only parts without an exceptional element are assigned to machine cell. Bottleneck parts are considered with cell layout design in an integrated mathematical model. The integrated mathematical model determines cell layout and assigns bottleneck parts to minimize the number of exceptional element and intercell moving distance, based on linearixed 0-1 integer programming. The proposed algorithm is illustrated by using numerical examples.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.4
• /
• pp.87-96
• /
• 1998

Using the concept of cellular manufacturing systems(CMS) in job shop manufacturing system is one of the most innovative approaches to improving plant productivity. However. several constraints in machine duplication cost, machining capability, cell space capacity, intercell moves and exceptional elements(EEs) are main problems that prevent achieving the goal of maintaining an ideal CMS environment. Minimizing intercell part traffics and EEs are the main objective of the cell formation problem because it is a critical point that improving production efficiency. Because the intercell moves could be changed according to the sequence of operation, it should be considered in assigning parts and machines to machine ceil. This paper presents a method that eliminates EEs under the constraints of machine duplication cost and ceil space capacity attaining two goals of minimizing machine duplications and minimizing intercell moves simultaneously. Developing an algorithm that calculates the machine duplications by cell-machine incidence matrix and part-machine Incidence matrix, and calculates the exact intercell moves considering the sequence of operation. Based on the number of machine duplications and exact intercell moves, the goal programming model which satisfying minimum machine duplications and minimum intercell moves is developed. A linear programming model is suggested that could calculates more effectively without damaging optimal solution. A numerical example is provided to illustrate these methods.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.263-266
• /
• 1998

Several constraints in machine duplication cost, machining capability, cell space capacity, intercell moves and exceptional elements(EEs) are main problems that prevent achieving the goal of ideal Cellular Manufacturin System (CMS) environment. Minimizing intercell part traffics and EEs are the main objective of the cell formation problem as it's a critical point that improving production efficiency. Because the intercell moves could be changed according to the sequence of operation, it should be considered in assigning parts and machines to machine cells. This paper presents a method that eliminates EEs under the constraints of machine duplication cost and cell space capacity attaining two goals of minimizing machine duplications and minimizing intercell moves simultaneously. Developing an algorithm that calculates the machine duplications by cell-machine incidence matrix and part-machine incidence matrix, and calculates the exact intercell moves considering the sequence of operation. Based on the number of machine duplications and exact intercell moves, the goal programming model which satisfying minimum machine duplications and minimum intercell moves is developed. A linear programming model is suggested that could calculates more effectively without damaging optimal solution. A numerical example is provided to illustrate these methods.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.18 no.6
• /
• pp.598-605
• /
• 2008

An improved beamforming method is proposed to measure the surface impedance of absorbing materials in a free field. It is possible to estimate the surface impedance by decomposing measured signals into incident and reflected signals by using the spatial filter matrix of the beamforming method. Wavelet do-noising techniques which reduce the white Gaussian noise are applied to improve the results. Phase calibration method is also used to improve the results of the measured surface impedance in a low frequency range. The results of the normal incidence experiments that are performed in a semi-anechoic chamber are verified by comparing with those of the standard test method that is presented in ASTM E1050. The proposed method is found to be reliable to measure the surface impedance for frequencies higher than 400 Hz.

• IE interfaces
• /
• v.12 no.1
• /
• pp.10-18
• /
• 1999

Job shop manufacturing environments are using the concept of cellular manufacturing systems(CMS) which has several advantages in reducing production lead times, setup times, work-in-process, etc. Utilizing the similarities between cell-machine, part-machine, and the shape/size of parts, CMS can group machines and parts resulting in improved efficiency of this system. However, when grouping machines and parts in machine cells, there inevitably occurs exceptional elements(EEs), which can not operate in the same machine cell. Minimizing these EEs in CMS is a critical point that improving production efficiency. Constraints in machine duplication cost, machining process technology, machining capability, and factory space limitations are main problems that prevent achiving the goal of maintaining an ideal CMS environment. This paper presents an algorithm that minimizes EEs under the constraints of machine duplication cost and factory space limitation. Developing exceptional operation similarity(EOS) by cell-machine incidence matrix and part-machine incidence matrix, it brings the machine cells that operate the parts or not. A mathematical model to minimize machine duplication is developed by EOS, followed by a heuristic algorithm in order to reflect dynamic situation resulting from minimizing exceptional elements process and the mathematical model. A numerical example is provided to illustrate the algorithm.