• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2002.05a
• /
• pp.144-151
• /
• 2002

In order to examine universal desist I have developed two analytical methodologies based on 3P(point) task analysis: structured task analysis and task matrix analysis. I also extracted me universal design items, namely (1) adjustment (2) redundancy, (3) specification and function transparency, (4) feedback and (5) error tolerance, (6) effective acquisition of information, (7) ease of understanding and judgment (8) comfortable operation, and (9) continuity of information and operation. Structured task analysis is used to uncover problems in each of the tasks constituting a job for each functionally challenged condition of users, and solutions to the extracted problems are examined in terms of the above-mentioned nine universal design items. Task matrix analysis calls for the production of a table for each task in a job. In each table, nine items from the columns, and the horizontal rows list all disability types. Then, solutions are formulated for each cell formed by the intersecting columns and rows. Using these two analysis methods, T have conducted a verification experiment for the universal design of a public bus. The results of the research have enabled me to propose various solutions from a system-based perspective, instead of coming up with the superficial and isolated solutions which are normally produced when conventional analytical methods are used.

• Journal of KIISE:Information Networking
• /
• v.31 no.2
• /
• pp.123-130
• /
• 2004

Routing and wavelength assignment(RWA) problem is an important issue in optical transport networks based on wavelength division multiplexing(WDM) technique. It is typically solved using a combination of linear programming and graph coloring, or path selection based graph algorithms. Such methods are either complex or make extensive use of heuristics. In this paper we propose a novel and efficient approach which basically obtains the maximum edge disjoint paths (EDPs) for each source-destination demand pair. And those EDPs obtained are stored in Lookup Table and used for the update of weight matrix. Routes are determined in order by the weight matrix for the demand set. The comprehensive computer simulation shows that the Proposed algorithm uses similar or fewer wavelengths with significantly less execution time than bounded greedy approach (BGA) for EDP which is currently known to be effective in practice.

• Journal of Internet Computing and Services
• /
• v.14 no.1
• /
• pp.15-22
• /
• 2013

WAVE(Wireless Access for Vehicular Environment) is new concepts and Vehicles communications technology using for ITS(Intelligent Transportation Systems) service by IEEE standard 802.11p. Also it increases the efficiency and safety of the traffic on the road. However, the efficiency of Scrambler bit computational algorithms of OFDM modulation in WAVE systems will fall as it is not able to process in parallel in terms of hardware and software. This paper proposes an algorithm to configure 64-bits matrix table in scambler bit computation as well as an algorithm to compute 64-bits matrix table and input data in parallel. The proposed algorithm on this thesis is executed using 64-bits matrix table. In the result, the processing speed for 1 and 1000 times is improved about 40.08% ~ 40.27% and processing rate per sec is performed more than 468.35 compared to bit operation scramble. And processing speed for 1 and 1000 times is improved about 7.53% ~ 7.84% and processing rate per sec is performed more than 91.44 compared to 32-bits operation scramble. Therefore, if the 64 bit-CPU is used for 64-bits executable scramble algorithm, it is improved more than 40% compare to 32-bits scrambler.

• Proceedings of the KIEE Conference
• /
• 2002.07a
• /
• pp.136-138
• /
• 2002

In this paper, we propose the analysis method of the Double Circuit Simultaneous Fault. To improve the accuracy and the promptness of the coontingency analysis, we reformed the Peterson method and extended the Sherman-Morrison equation. We also used the table of trigono -metric factor of Jacobian matrix before the fault, to compute the inverse matrix needed in the loadflow calculation.

• 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.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.10
• /
• pp.3079-3094
• /
• 1996

Recently, the high-precision vibration attenuation technology becomes the essence fo the seccessful development of high-integrated and ultra-precision industries, and is expected to continue playing a key role in the enhancement of manufacturing technology. Vibration isolation system using an air-spring is widely employed owing to its excellent isolation characteristics in a wide frequency range. It has, however, some drawbacks such as low-stiffness and low-damping features and can be easily excited by exogenous disturbances, and then vibration of table is remained for a long time. Consequently, the need for active vibration control for an air-spring vibration isolation system becomes inevitable. Furthermore, for an air-spring isolation table to be successfully employed in a variety of manufacturing sites, it should have a guaranteed robust performance not only to exogenous disturbances but also to uncertainties due to various equipments which might be put on the table. In this study, an active vibration suppression control system using H.inf. theory is designed and experiments are performed to verify its robust performance. An air-spring vibration isolation table with voice-coil-motors as its actuators is designed and built. The table is modeled as 3 degree-of-freedom system. An active control system is designed based on $H_\infty$control theory using frequency-shaped weighting functions. Analysis on its performance and frequency responce properties are done through numerical simulations. Robust characteristics of$H_\infty$ control on disturbances and model uncertainties are experimentally verified through (i) the transient response to the impact excitation of the table, (ii) the steady-state response to the harmonic excitation, and (iii) the response to the mass change of the table itself. An LQG controller is also designed and its performance is compared with the $H_\infty$ controller.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.321-324
• /
• 2002

For a rule-based conversion of Hangout into the Roman alphabet rather than a word-for-word conversion, one must come up with a faultless model for the Korean standard pronunciation rules, which are the basis of the Romanization. It is on this foundation that the Korean-Roman alphabet conversion table can be created. For linguistic modeling using PetriNet, modeling boundary and notation of modeling can be defined. In order to describe PetriNet, which is a dynamic modeling tool, as a static one, one can model the standard Korean pronunciation rules and the Hangout-Roman alphabet notation by conversion into incident matrix Thus, this research attempts to develop a mathematical modeling tool for a natural language using PetriNet, and create a Korean-Roman alphabet conversion table.

• Journal of the Korean Geophysical Society
• /
• v.4 no.3
• /
• pp.163-173
• /
• 2001

This paper deals with scheduling problems which are the most important subtask in High-Level Synthesis. Especially, we have concentrated our attentions on the data-path scheduling which can get the structural informaion trom the behavioral algorithm as a first step in synthesis procedure. Suggest Forward scheduling methode is executed the ASAP and ALAP scheduling to use the fifth - order elliptic wave filter of a standard benchmark moedl, and then it is drawing up T.N matrix table by the number resource and control-step, using the table extract of the simple than down-limit value of the control-step for the number of given resource th use this table. All of existing list scheduling techniques determine the priority function first, and then do the operation scheduling, But, the suggested forward scheduling technique does the schedule first, and determines the priority functions if needed in scheduling process.

• The Journal of Engineering Research
• /
• v.4 no.1
• /
• pp.35-45
• /
• 2002

This paper deals with the scheduling problems which are the most important subtask in High-Level Synthesis. Especially, we have concentrated our attentions on the data-path scheduling which can get the structural informations from the behavioral algorithm as a first step in synthesis procedure. Suggest Forward scheduling methode is executed the ASAP and ALAP scheduling to use the fifth – order elliptic wave filter of a standard benchmark model, and then it is drawing up T.N matrix table by the number of resource and control-step, using the table extract of the simple than down-limit value of the control-step for the number of given resource to use this table. All of existing list scheduling techniques determine the priority functions first, and then do the operation scheduling, But, the suggested forward scheduling technique does the schedule first, and determines the priority functions if needed in scheduling process.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06a
• /
• pp.400-402
• /
• 2006

Matrix multiplication is an important problem in linear algebra. its main significance for combinatorial algorithms is its equivalence to a variety of other problems, such as transitive closure and reduction, solving linear systems, and matrix inversion. Thus the development of high-performance matrix multiplication implies faster algorithms for all of these problems. In this paper. we present a quantitative comparison of the theoretical and empirical performance of key matrix multiplication algorithms and use our analysis to develop a faster algorithm. We propose a Hybrid approach on Winograd's and Strassen's algorithms that improves the performance and discuss the performance of the hybrid Winograd-Strassen algorithm. Since Strassen's algorithm is based on a $2{\times}2$ matrix multiplication it makes the implementation very slow for larger matrix because of its recursive nature. Though we cannot get the theoretical threshold value of Strassen's algorithm, so we determine the threshold to optimize the use of Strassen's algorithm in nodes through various experiments and provided a summary shown in a table and graphs.