• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.5
• /
• pp.109-120
• /
• 2017

It is important to estimate objectively in the driving test. Especially, the driving test is examined by totally driving ability, rule observation and situational judgement. For this, a grading automation system for driving test was presented by using GPS, sensor data and equipment operation informations. This system is composed of vehicle mounted module, automatic grading terminal, data controller, data storage and processing server. The vehicle mounted module gathters sensor data in the car. The terminal performs automatic grading using the received sensor data according the driving test criterion. To overcome the misposition of vehicle in the map due to GPS error, we proposed the automatic grading system by map matching method, path deviation and return algorithm. In the experimental results, it was possible to grade automatically, display the right position of the car, and return to the right path under 10 seconds when the vehicle was out of the shadow region of the GPS. This system can be also applied to the driving education.

• Journal of the Korean School Mathematics Society
• /
• v.18 no.2
• /
• pp.223-240
• /
• 2015

This paper deals with how to design and develop white-box based e-learning contents which are equipped with conceptual understanding and step-by-step computational procedures for studying vector calculus for science-engineering majors who might need supplementary mathematics learning. Noting that rewriting rules are often used in school mathematics for students' problem solving, the theoretical aspects of rewriting rules are reviewed for developing supplementary e-learning contents for them. The software design of step-by-step problem solving requires careful arrangement of rewriting rules and pattern matching techniques for white-box procedures using a computer algebra system such as Mathematica. Several modules for step-by-step problem solving as well as producing dynamic display of e-learning contents was coded by Mathematica in order to find the length of a curve in vector calculus after implementing several rules for differentiation and integration. The developed contents are equipped with diagnostic modules and immediate feedback for supplementary learning in terms of a tutorial. At the end, this paper indicates the strengths and features of the developed contents for college students who need to increase math learning capabilities, and suggests future research directions.

• Annual Conference on Human and Language Technology
• /
• 1997.10a
• /
• pp.261-268
• /
• 1997

일본어에서 조동사 "-reru, -rareru"는 '피동', '가능', '자발', '존경' 등의 의미로 두루 쓰이고 있다. 일한 번역에서 이들은 여러 가지 대역어로 나타나며 일정한 규칙이나 패턴을 취하지 않으므로, 기계 번역시 조동사 "-reru, -rareru"는 그 처리가 쉽지 않다. 더구나, 조동사 "-reru, -rareru"는 일본어에서 높은 빈도로 등장하여 무시하기 어렵고 의미별 분포가 고루 퍼져 있어, 대표적 대역어인 "-아/어/여 지다. -되다" 등으로만 대응시킬 경우의 번역 에러는 의외로 치명적이다. 따라서, "-reru, -rareru"의 번역을 고려한 특수 처리를 행할 필요가 있다. 먼저, 본 논문에서는 조동사 "-reru, -rareru"가 포함된 아사히 신문 가사의 5,800여 문장을 대상으로 각각의 의미에 대한 분포 및 한국어 대역어의 빈도를 조사하였다. 대역어는 크게 8종류의 형태로 나누었으며 각 동사별로 "-reru, -rareru"와 결합된 경우의 의미 출현 빈도를 참고하여 대응 가능한 대역어 형태들을 미리 결정하였다. 그리고, 대역어가 여러 개 존재하는 경우는 패턴 매칭을 통하여 적절한 대역어를 선택할 수 있도록 하였다. 그 결과, 약 87%의 "-reru, -rareru"가 적절한 대역어로 번역되어, 본 논문에서 제시한 의미 출현 빈도에 기반한 각 동사별 대역어 형태 결정 방법이 "-reru, -rareru"의 다의성 해소에 유효하다고 판단된다.

• Journal of KIISE:Databases
• /
• v.37 no.5
• /
• pp.267-274
• /
• 2010

Recently, color harmony that decides the value of design is becoming important. In the paper, we propose a method that allows us to easily use harmonious colors in computer systems. Since existing work has focused on finding new color harmony rules or rules that translate emotional words into colors, a method that models these rules in the computer system has not been discussed in depth. In this paper, we model a color system and color harmony rules as a relational database and queries on this database, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.12
• /
• pp.1313-1323
• /
• 1991

n this thesis CAM(content Addressable Memory) generator and graphic display tool for run-plot sequence in automatic generation of CAM are presented. We show that implementing the layout generation, graphic menu, mouse driver, and data structure by using the basic classes is clear and easy in modification than the conventional procedural language. For the implementation of generator which is independent of design rule or process, we use the parameterized cell so that basic cell can be changed according to user's inputs. and perform the layout by means of placement and routing using pitch mathching. Finally, the display of CIF which generated and constitution of graphic menu for total run-plot sequence are explained.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2022.05a
• /
• pp.436-436
• /
• 2022

셀룰러 오토마타(Cellular Automata; CA)는 격자(cell)에 대해 사전 정의된 규칙을 바탕으로 이웃 격자 간 상호작용을 해석하여 복잡한 동력학적 현상을 효과적으로 재현할 수 있는 이산형(discrete) 모의 기법이다. CA 기법은 격자 구조에 수치표고 자료 및 토양수분 정보 등을 직접 매칭 후 상호관계를 해석하기 때문에 공간정보를 최대한 활용하여 불균질성을 나타내는 것이 가능하다. 따라서, 도시 유출해석에 있어서 높은 정확도와 빠른 계산속도를 기대할 수 있다. 본 연구에서는 CA 기반 고해상도 물순환·침수 연계 해석 framework 개발 방향 및 CA 기반 prototype 모형의 사면유출 적용 사례를 소개한다. 개발 중인 CA 모형에서는 격자별 침수 깊이, 침투, 토양수분 저류, 지표 유출 등의 물순환 요소를 모의할 수 있다. 기존의 집중형(lumped) 모형은 지표-지표하 유출에 대한 routing algorithm이 없고 각 셀의 물수지 모형 내 파라미터가 많은 단점이 있다. 따라서 개발 중인 CA 모형에서는 cell state 내 fast reservoir와 slow reservoir를 통해 지표-지표하 상태를 구현하고 단순화된 물수지 모형 및 흐름 방향 알고리즘을 적용함으로써 실제 현장에서 발생하는 다중 피크 형태의 지표 유출을 모사한다. 최적의 지표수 흐름 방향 알고리즘 선정을 위해 3개의 다중 흐름 방향 알고리즘(D4, D8, 4+4N)을 정량적으로 비교·분석한다. 이번 발표에서는 CA 모형을 소규모 산지 사면과 도심지 등 다양한 규모의 테스트베드에 적용하여 모형의 장단점을 평가한다.

• Journal of KIISE:Software and Applications
• /
• v.35 no.10
• /
• pp.627-635
• /
• 2008

An extended form of lexical network is explored by presenting U-WIN, which applies lexical relations that include not only semantic relations but also conceptual relations, morphological relations and syntactic relations, in a way different with existing lexical networks that have been centered around linking structures with semantic relations. So, This study introduces the new methodology for constructing a syntactic relation automatically. First of all, we extract probable nouns which related to verb based on verb's sentence type. However we should decided the extracted noun's meaning because extracted noun has many meanings. So in this study, we propose that noun's meaning is decided by the example matching rule/syntactic pattern/semantic similarity, frequency information. In addition, syntactic pattern is expanded using nouns which have high frequency in corpora.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.12
• /
• pp.3010-3022
• /
• 1997

Expert system is one of AI area which was came out at the end of 19705s. It simulates the human's way of thinking to give solutions of Problem in many applications. Most expert system consists of many components such as inference engine, knowledge base, and so on. Especially the performance of expert system depends on the control of enfficiency of inference engine. Inference engine has to get features; tirst, if possible to minimize restrictions when the knowledge base is constructed second, it has to serve various kinds of inferencing methods. In this paper, we design and implement the inference engine which is able to support the general functions to knowledge domain and inferencing method. For the purpose, forward chaining, backward chaining, and direct chaining was employed as an inferencing method in order to be able to be used by user request selectively. Also we not on1y selected production system which makes one ease staradization and modulation to obtain knowledges in target domain, but also constructed knowledge base by means of Extended Clause Bit Metrics (ECBM). Finally, the performance evaluation of inference engine between Rete pattern matching and ECBM has been done.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2528-2535
• /
• 2000

Technology mapping is a part of VLSI CAD system, where circuits in logical level are mapped into circuits in physical level. The performance of technology mapping system is evaluatecJ by the delay and area of the resulting circuits. In the sequential circuits, the delay of the circuit is decided by the maximal delay between registers. In this work, we introduce an FPGA mapping algorithm improved by retiming technique used in constructive level and iterative level, and by fuzzy logic technique. Initial circuit is mapped into an FPGA circuit by constructive manner and improved by iterative retiming. Criteria given to the initial circuit are structured hierarchically by decision-making functions of fuzzy logic. The proposed system shows better results than previous systems by the experiments with MCNC benchmarkers.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1590-1597
• /
• 1999

Advertisements on the Web, rising as a major profit source of Web services, have a distinctive characteristic of detailed classification of potential customers, compared with those of other conventional media such as TV and newspaper. It is therefore possible to advertise selectively according to personal characteristics and to record precise advertisement effects. Web-based advertisement management systems of nowadays have the capability to select ones compatible with personal environment characteristics and registered information, and to provide processed information and knowledge about advertisement effects based on usage recordings. However, they have severe problems in modeling diverse requirements or characteristics of users : customers, advertisers and ISP, and in matching and coordinating of them. In order to solve these problems, we propose a frame work for coordinating the needs of users, advertisers, and ISPs, which is built on top of tree-style classification of advertisements. Other schemes are supported around the framework as follows : (1) characteristics management of pages within themselves, (2) rule-based modeling of advertisement target, and (3) user modeling and case-based analysis. We propose a prototype system within the framework.