• Koreanishche Zeitschrift fur Deutsche Sprachwissenschaft
• /
• v.1
• /
• pp.313-348
• /
• 1999

이 논문은 독일어의 겹자음회피현상을 설명함에 있어 어휘음운론에서의 분석이 보이는 문제들을 지적하고, 이 문제들이 제약에 바탕을 둔 이론에서는 어떻게 해결될 수 있는가를 보인다. 제약들간의 상호작용에서 특히 중요한 역할을 하는 것이 단일형태실현제약 (Uniform Exponence)으로서, 이 제약을 통해 독일어 동사의 현재시제, 단수, 2인칭 형태와 3인칭형태에서 나타나는 겹자음회피현상이 동사의 어형변화표 (Verbparadigma)와 밀접한 관련이 있음을 알 수 있다. 이는 규칙들을 통해 2인칭과 3인칭의 올바른 형태를 각각 개별적으로 찾아내는 어휘음운론의 분석과는 근본적으로 다르다. 왜냐하면 어휘음운론의 분석에 따를 때, 예를 들어 3인칭 동사 arbeitet에서 Schwa 모음의 삽입은 겹자음회피를 위해 일어난다고 설명되지만 겹자음이 없음에도 불구하고 Schwa 모음이 마찬가지로 삽입되는 2인칭동사 arbeitest는 설명되지 않기 때문이다. 이런 분석에서는 2인칭 형태와 3인칭 형태가 서로 아무런 관련 없이 각기 따로 존재하게된다. 이에 반해 단일형태제약은 이 두개의 형태를 동시에 비교하므로, 동사 굴절형태에서 마치 불필요한 것으로 보이는 모음삽입이나 자음탈락의 원인에 대해 이론적인 근거를 제시할 수 있다. 즉 2인칭 형태와 3인칭 형태는 보다 상위의 제약들이 막지 않는 한 서로 최대한 비슷한 형태를 가지려고 한다. 이 논문은 겹자음 회피를 위한 수단으로서 모음삽입이나 자음탈락은 오로지 이를 통해 동사의 어형변화표가 좋아질 때만 가능하다는 것을 보여줌으로써 규칙이론이 포착하지 못하고 있는 중요한 일반화를 제시하고 있다. 단일형태 실현제약의 중요성은 접두사 in- 과 un- 이 어간과 결합할 때 보이는 대조를 통해서도 확인된다. 여기서도 어휘음운론의 다층어휘부 구조에 의한 설명이 갖는 문제점이 제약들간의 상호작용을 통해 해결될 수 있음을 알 수 있다.VII-1 및 VII-2공의 3600 m 하부층은 건성 가스 생성 단계에까지 도달한 것으로 나타났다. JDZ VII-1, VII-2 시추공의 3500 m 하위 구간의 올리고세 퇴적층에서 유기물 함량 및 수소 지수가 급격히 감소하는 것은 매몰 심도가 깊어지면서 유기물이 열 분해되어 이미 탄화수소를 생성한 것으로 해석된다. JDZ VII-1 및 VII-2 시추공의 가스징후 및 길소나이트 (gilsonite)는 탄화수소가 생성되어 이동한 흔적을 시사한다.을 해석할 수 있음을 보여주는 것으로 평가된다. 다만 PLAYMAKER2가 보다 신뢰할 만한 퇴적환경 해석을 위한 전문가 시스템으로 구축되기 위해서는 향후 많은 퇴적학 전문가들이 추가로 참여하여 기존 규칙들을 재검증하고 새로운 규칙들을 첨가함으로써 보디 세련된 지식베이스를 개발하여야 할 것으로 판단된다.이며 세 개의 산소가 이루는 평면에서 $1.68{\AA}$ 소다라이트내로 이동하여 위치한다. 32개의 $Tl^{+}$ 이온은 결정학적 자리 II에 존재하고 있으며 산소와의 결합거리를 $2.70(1){\AA}$을 유지하면서 큰 동공속으로 $1.48{\AA}$ 이동하여 위치한다. 약 18개의 $Tl^+$ 이온은 결정학적 자리III에, 또 다른 10개의 $Tl^+$ 이온은 결정학적 자리III'에 존재하고 골조 산소와 각각 $2.86(2){\AA},\;2.96(4){\AA}$의 결합거리를 이룬다.

• Tunnel and Underground Space
• /
• v.9 no.4
• /
• pp.337-349
• /
• 1999

There are many difficulties to the engineers in the assessment of tunnel safety. Consequently, objective assessment of concrete lining is hard even by the experts of tunnel assessment. Of several difficulties in the assessment of tunnel safety, in this study, tunnel concrete lining was focussed iud evaluated quantitatively and objectively using the Fuzzy theory which it generally considered to be appropriate for the assessment, control and judgment. T-FLAS based on fuzzy theory was developed in this study for the quantitative and objective assessment of the concrete lining in tunnels. Based on the application of T-FLAS on the evaluated field data, it was shown that the assessment system using fuzzy theory(T-FLAS) can be the effective and objective method for the assessment of concrete lining.

• Journal of Intelligence and Information Systems
• /
• v.6 no.1
• /
• pp.1-16
• /
• 2000

This paper analyzes the approaches of Web-based expert systems by comparing their pros and cons. and proposes a methodology of implementing the Web-based backward inference engines with reduced burden to Web servers. There are several alternatives to implement expert systems under the WWW environment : CGI, Web servers embedding inference engines external viewers Java Applets and HTML. Each of the alternatives have advantages and disadvantages of each own in terms of development and deployment testing scalability portability maintenance and mass service. Especially inference engines implemented using HTML possess relatively large number of advantages compared with those implemented using other techniques. This paper explains the methodology to present rules and variables for backward inference by HTML and JavaScript and suggests a framework for design and development of HTML-based Expert System. A methodology to convert a traditional rule base to an Experts Diagram and then generate a new HTML-based Expert System from the Experts Diagram is also addressed.

• Journal of KIISE:Databases
• /
• v.32 no.6
• /
• pp.628-640
• /
• 2005

The XML is well accepted in several different Web application areas. As soon as many users and applications work concurrently on the same collection of XML documents, isolating accesses and modifications of different transactions becomes an important issue. When an XML document correctly corresponds to the rules laid out in a DTD or XML schema, it is also said to be valid. The valid XML document's validity should be guaranteed after the document is updated. The validation method mentioned above, however, results in lower degree of concurrency. For getting higher degree of concurrency and minimizing the range of the XML document validity, a new validation method based on a specific locking method is required. In this paper we propose the sequence group validation method for minimizing the range of the XML document validity. We also propose the boundary locking method for isolating accesses and modifications of different transactions while supporting the valid XML document's validity. Finally, the results of some experiments show the validation and locking methods increase the degree of transaction concurrency.

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.199-207
• /
• 2008

The FP-tree(Frequency Pattern Tree) mining association rules algorithm was proposed to improve mining performance by reducing DB scan overhead dramatically, and it is recognized that the performance of it is better than that of any other algorithms based on different approaches. But the FP-tree algorithm needs a few more memory because it has to store all transactions including frequent itemsets of the DB. This paper implements a FP-tree algorithm on a general purpose UNK system and compares it with the DHP(Direct Hashing and Pruning) algorithm which uses hash tree and direct hash table from the point of memory usage and execution time. The results show surprisingly that the FP-tree algorithm is poor than the DHP algorithm in some cases even if the system memory is sufficient for the FP-tree. The characteristics of the test data are as follows. The site of DB is look, the number of total items is $1K{\sim}7K$, avenrage length of transactions is $5{\sim}10$, avergage size of maximal frequent itemsets is $2{\sim}12$(these are typical attributes of data for large-scale convenience stores).

• Journal of KIISE:Software and Applications
• /
• v.36 no.3
• /
• pp.226-235
• /
• 2009

People use various information for searching POI in the navigation system such as name, category, address, phone number. Most of users use name and category to search their POT. They don't know exact name in POI DB provided by Maker. They use abbreviated or generalized name as key word for searching POI. Because of these reasons, the hit ratio has been very low. In this paper, We suggest a extra DB_construction system for raising the hit ratio. It generates allomorphes DB link to the POI name in original DB. We classified the POI names in original DB into seven types of allomorph by analyzing the gathered patterns from the POI DB which has over 650,000 entries. For auto_generating the allomorphes, we made 577 rules based on the classified types. And we generated the allomorphes manually for the entries which are difficult to make the rule and has low frequency The generated allomorphes account for 35.8% of all original DB. The hit ratio is 89% under suggested system.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.12
• /
• pp.69-77
• /
• 1999

This paper describes the design of fuzzy digital PID controller using simplified indirect inference method. First, the fuzzy digital PID controller is derived from the conventional continuous time linear digital PID controller. Then the fuzzification, control-rule base, and defuzzification using SIM in the design of the fuzzy digital controller are discussed in detail. The resulting controller is a discrete time fuzzy version of the conventional digital PID controller, which has the same linear structure, but are nonlinear functions of the input signals. The proposed controller enhances the self-tuning control capability, particularly when the process to be controlled is nonlinear. When the SIM is applied, the fuzzy inference results can be calculated with splitting fuzzy variables into each action component and are determined as the functional form of corresponding variables. So the proposed method has the capability of the high speed inference and adapting with increasing the number of the fuzzy input variables easily. Computer simulation results have demonstrated the superior to the control performance of the one proposed by D. Misir et al.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.10 no.1
• /
• pp.107-119
• /
• 2006

Recently with developments of an internet and web techniques, the amount of data that are stored in database is increasing rapidly. So the range of adaption in database has been expanded and a research of Data Mining techniques finding useful skills from the huge database has been progressed. Many original algorithms have been developed by cutting down the item set and the size of database isn't required in the entire course of creating frequent item sets. Although those skills could save time in some course, it requires too much time for adapting those techniques in other courses. In this paper, an algorithm is proposed. In an Transaction Database that the length of it's transactions are short or the number of items are relatively small, this algorithm scans a database once by using a Hashing Technique and at the same time, stores all parts of the set, can be appeared at each transaction, in an Hash-table. So without an influence of n minimum percentage of support, it can discover a set of frequent items in more shorter time than the time what is used by an original algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1401-1408
• /
• 2000

Critical prediction models that determine whether a design entity is fault-prone or non fault-prone play an important role in reducing system development cost because the problems in early phases largely affected the quality of the late products. Real-time systems such as telecommunication system are so large that criticality prediction is more important in real-time system design. The current models are based on the technique such as discriminant analysis, neural net and classification trees. These models have some problems with analyzing cause of the prediction results and low extendability. In this paper, we propose a criticality prediction model using fuzzy rulebase constructed by genetic algorithm. This model makes it easy to analyze the cause of the result and also provides high extendability, high applicability, and no limit on the number of rules to be found.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.91-98
• /
• 2004

DHP mining association rules algorithm maintains previously independent direct hash table to reduce the sire of hash tree containing the frequency number of each candidate large itemset. It performs pruning by using the direct hash table when the hash tree is constructed. The mort large the size of direct hash table increases, the higher the effort of pruning becomes. Especially, the effect of pruning in phase 2 which generate 2-large itemsets is so high that it dominates the overall performance of DHP algorithm. So, following the speedy trends of producing VLM(Very Large Memory) systems, extreme increment of direct hash table size is being tried and one of those trials is perfect hash table in phase 2. In case of using perfect hash table in phase 2, we found that some rearrangement of DHP algorithm got about 20% performance improvement compared to simply ｜H$_2$｜ reconfigured DHP algorithm. In this paper, we examine the feasibility of perfect hash table in phase 2 and propose PHP algorithm, a rearranged DHP algorithm, which uses the characteristics of perfect hash table sufficiently, then make an analysis on the results in experimental environment.