• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.9 no.2
• /
• pp.70-76
• /
• 1984

In this paper, a functional m-redundant system, which is m-fault tolerant, is defined based on the graph-theory. This system is designed to be t(t$\geq$m) fault-diagnosable by comparing its unit's outcomes without additive test functions, so, the system down for diagnosis is not needed. The diagnostic model for this system is presented. It is to avail the redundancy of the system effectively. It is shown that this model can be converted into Preparata's model. Thus, the diagnostic characteristics of a functional m-redundant system is analyzed by the method originated by Preparata et al.

• Journal of IKEEE
• /
• v.1 no.1 s.1
• /
• pp.111-119
• /
• 1997

This paper presented a method of extracting algorithm for Edge Multiple-Valued Decision Diagrams(EMVDD), a new data structure, from Binary Decision Diagram(BDD) which is resently used in constructing the digital logic systems based on the graph theory. And we discussed the function minimization method of the n-variables multiple-valued functions. The proposed method has the visible, schematical and regular properties.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.1022-1027
• /
• 1989

CAD drawings contain drawing errors similar to manually produced drawings. This paper is concerned with a computer-aided drawing check system for the drawing errors. The problem treated in this paper is the checking of dimension errors, deficiency and redundancy of dimension lines in the mechanical drawings made by a CAD system. Graph theory is used for the checking of the deficient and redundant dimensions. The feasibility of this system is confirmed for the checking items.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.6
• /
• pp.19-28
• /
• 1995

In this paper, measured iris transmission loss data and simulated data by using 3-dimension full-wave analysis S/W are presented and compared with Marcuvitz's theory. And by using measured iris data, dual-mode narrow-band channel filters can be successfully implemented. This paper shows that there is severe difference between the transmission loss of iris calculated by using Marcuvitz's equation to calculate iris dimension, if the length of slot iris is longer than .lambda./.pi., and in the long urn the response of channel filter is distorted. Experimental result shows that the characteristic response of implemented channel filter by using the iris transmission loss graph presented here matches well the design specfications. In conclusion, iris transmission loss measurement method will be very useful to design channel filter.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.971-974
• /
• 2002

Petri net is an effective modeling tool for concurrent systems. Liveness problem is one of analysis problems in Petri net theory verifying whether the system is free from any local deadlocks. It is well known that computational complexity of liveness problem of general Petri net is deterministic exponential space. Some subclasses, such as marked graph and free choice net, are suggested where liveness problem is verified in less complexity. This paper studies liveness of siphon containing circuit (SCC) net. Liveness condition based on algebraic inequalities is shown. Then polynomial time decidability of liveness of SCC net is derived, if the given net is known to be an SCC net a priori.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1992.10a
• /
• pp.339-343
• /
• 1992

For the analysis of dynamic behavior of dynamic behavior of multibody systems by cartesian coordinate method, maximal sets of generalized coordinates and maximum numbers of differential equation and constraints must be considered. Therefore the inefficiency of the increase of CPU time is occurred. This paper is to analyze the dynamic system by using the relative coordinate method without violating the geometric condition of systems. The graph theory and system topology were used for this study. The dynamic systems could be analyzed by the automatic generation of the informations like equation of motion, constraints, and external forces etc. And the results were compared and verified with dynamic commercial package DADS.

• Proceedings of the KSPS conference
• /
• 2007.05a
• /
• pp.327-329
• /
• 2007

This paper presents a FSN-based LVCSR system and it's application to the speech TV program guide. Unlike the most popular statistical language model-based system, we used FSN grammar based on the graph theory-based FSN optimization algorithm and knowledge-based advanced word boundary modeling. For the memory and latency efficiency, we implemented the dynamic pruning scheduling based on the histogram of active words and their likelihood distribution. We achieved a 10.7% word accuracy improvement with 57.3% speedup.

• Language and Information
• /
• v.4 no.1
• /
• pp.43-65
• /
• 2000

Along with the flourishign development of computational linguistics, research on the meanings of individual words has started to resume. Polyusemous words are especially brought into focus since their multiple senses have placed a real challenge to linguists and computer scientists. This paper mainly concerns the following three questions with regard to the treatments of such polysemous nouns and verbs in English and Korean. Firstly, what types of information should be represented in individual lexical entries for those polysemous words\ulcorner Secondly, how different are corresponding polysemous lexical entries in both languages\ulcorner Thirdly, what does a mental lexicon look like with regard to polysemous lexical entries\ulcorner For the first and second questions, Pustejosky's (1995) Generative Lexicon Theory (hereafter GLT) will be discussed in detail: the main focus falls on developing alternative way of representing (polysemous) lexical entries. For the third question, a brief discussion is made on mapping between concepts and their lexicalizations. Furthermore, a conceptual graph around conept 'bake' is depicted in terms of Sowa(2000)

• The Journal of Information Technology and Database
• /
• v.3 no.1
• /
• pp.97-108
• /
• 1996

In this paper we obtain several function defined on finite partially ordered sets(posets) which may indicate constraints of comparability on sets of teams(tasks, etc.) for which evaluation is computationally simple, a relatively rare condition in graph-based algorithms. Using these functions a set of numerical coefficients and associated distributions obtained from a computer simulation of certain families of random graphs is determined. From this information estimates may be made as to the actual linearity of complicated posets. Applications of these ideas is to all areas where obtaining rankings from partial information in rational ways is relevant as in, e.g., team_, scaling_, and scheduling theory as well as in theoretical computer science. Theoretical consideration of special and desirable properties of various functions is provided permitting judgment concerning sensitivity of these functions to changes in parameters describing (finite) posets.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.1
• /
• pp.7-14
• /
• 1983

Linear feature such as lines and curves are one of important features in image processing. In this paper, new method of linear feature detection is suggested. Also, we have studied approximation technique which transforms detected linear feature into data structure for the practical. This method is based on graph theory and principle of this method is based on minimal spanning tree concept which is widely used in edge linking process. By postprocessing, Hairs and inconsistent line segments are removed. To approximate and describe traced linear feature, piecewise linear approximation is adapted. The algorithm is demonstrated through computer simulations.