• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.125-132
• /
• 2011

Fire monitoring system detects a fire based on the values of various sensors, such as smoke, CO, temperature, or change of temperature. It detects a fire by comparing sensed values with predefined threshold values for each sensor. However, to prevent a fire it is required to predict a situation which has a possibility of fire occurrence. In this work, we propose a fire recognition system using a fuzzy inference method. The rule base is constructed as a combination of fuzzy variables derived from various sensed values. In addition, in order to solve generalization and formalization problems of rule base construction from expert knowledge, we analyze features of fire patterns. The constructed rule base results in an improvement of the recognition accuracy. A fire possibility is predicted as one of 3 levels(normal, caution, danger). The training data of each level is converted to fuzzy rules by FCM(fuzzy C-means clustering) and those rules are used in the inference engine. The performance of the proposed approach is evaluated by using forest fire data from the UCI repository.

• Korean Journal of Remote Sensing
• /
• v.13 no.1
• /
• pp.31-46
• /
• 1997

In recent years, as remotly-sensed image processing technologies have been improved and spread widely in the application areas, many new requirements for the image processing technologies have arisen. However, it is difficult and costly to access remotely-sensed image processing systems. Moreover, these systems have thier own processing facilities which are not easily accessible for general users. In this paper, those problems are challenged by adopting Internet as a universal information network for accessing remotly-sensed image DBMS and by allowing users to work remotely on the image processing. A remotly-sensed image processing system which can be accessed via Internet was designed and implemented. This system can be used to manipulate images over remote DBMS. The Illustra object-oriented relational DBMS with CGI(Common Gateway Interface) web interface was used in this project. The client consists of a WWW(World Wide Web) Netscap$e^{TM}$ browser, and the server consists of HTTPD(Web daemon), Illustra DBMS and Java modules in order to process the image being displayed. The developed system was tested on LAN environment and the service response time met the requirements.

• Journal of the Korea Convergence Society
• /
• v.9 no.11
• /
• pp.91-97
• /
• 2018

The plant factory represents one of the future agricultural systems into which ubiquitous information technology (U-IT) is incorporated, including sensor networking, and helps minimize the influence of external experimental factors that constrain the use of existing greenhouse cultivation techniques. A plant factory's automated cultivation system does not merely provide convenience for crop cultivation, but also expandability as a platform that helps build a knowledge database based on its acquired information and develop education and other application services using the database. For the expansion of plant factory services, this study designed a plant factory interworking service (PFIS) which allows plant factories to share crop growth-related information efficiently among them and performed a test on the service and its implementation.

• The Journal of Korean Institute of Information Technology
• /
• v.17 no.5
• /
• pp.1-12
• /
• 2019

Unlike existing Open APIs, Linked Data are made as a huge intelligent base to perform high-level SPARQL queries, and it is possible to create efficiently a new content by mashuping different information from various datasets. This paper implements a responsive web application for location-based semantic search. We mashup DBpedia, a kind of Linked Data, and GoogleMap API provided by Google, and provide a semantic browser function to confirm detail information regarding retrieved objects. Our system can be used in various access environments such as PC and mobile by applying responsive web design idea. The system implemented in this paper compares functional specifications with existing systems with similar functions. The comparison results show the superiority of our system in various aspects such as using semantic, linked-based browser, and mashup function.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.130-142
• /
• 2008

Different from other ontology languages, TopicMap is capable of integrating numerous amount of heterogenous information resources using the locational information without any information transformation. Although many conventional editors have been developed for topic maps, they are standalone-type only for writing XTM documents. As a result, these tools request too much time for handling large-scale data and provoke practical problems to integrate with legacy systems which are mostly based on relational database. In this paper, we model a large-scale topic map structure based on XTM 1.0 into RDB structure to minimize the processing time and build up the ontology in legacy systems. We implement a topic map platform called X-TOP that can enhance the efficiency of ontology construction and provide interoperability between XTM documents and database. Moreover, we can use conventional SQL tools and other application development tools for topic map construction in X-TOP. The X-TOP is implemented to have 3-tier architecture to support flexible user interfaces and diverse DBMS. This paper shows the usability of X-TOP by means of the comparison with conventional tools and the application to healthcare cancer ontology management.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.3
• /
• pp.235-245
• /
• 2005

The rapid development of computer network technology has brought the Internet as the major infrastructure to our society. But the rapid increase in malicious computer intrusions using such technology causes urgent problems of protecting our information society. The recent trends of the intrusions reflect that the intruders do not break into victim host directly and do some malicious behaviors. Rather, they tend to use some automated intrusion tools to penetrate systems. Most of the unknown types of the intrusions are caused by using such tools, with some minor modifications. These tools are mostly similar to the Previous ones, and the results of using such tools remain the same as in common patterns. In this paper, we are describing design and implementation of attacker-traceback system, which traces the intruder based on the multi-agent architecture. The system first applied SOM to classify the unknown types of the intrusion into previous similar intrusion classes. And during the intrusion analysis stage, we formalized the patterns of the tools as a knowledge base. Based on the patterns, the agent system gets activated, and the automatic tracing of the intrusion routes begins through the previous attacked host, by finding some intrusion evidences on the attacked system.

• Journal of KIISE
• /
• v.42 no.8
• /
• pp.998-1009
• /
• 2015

In recent years, there has been a growing interest in RDFS Inference to build a rich knowledge base. However, it is difficult to improve the inference performance with large data by using a single machine. Therefore, researchers are investigating the development of a RDFS inference engine for a distributed computing environment. However, the existing inference engines cannot process data in real-time, are difficult to implement, and are vulnerable to repetitive tasks. In order to overcome these problems, we propose a method to construct an in-memory distributed inference engine that uses a parallel graph structure. In general, the ontology based on a triple structure possesses a graph structure. Thus, it is intuitive to design a graph structure-based inference engine. Moreover, the RDFS inference rule can be implemented by utilizing the operator of the graph structure, and we can thus design the inference engine according to the graph structure, and not the structure of the data table. In this study, we evaluate the proposed inference engine by using the LUBM1000 and LUBM3000 data to test the speed of the inference. The results of our experiment indicate that the proposed in-memory distributed inference engine achieved a performance of about 10 times faster than an in-storage inference engine.

• Journal of The Korean Association For Science Education
• /
• v.38 no.6
• /
• pp.765-780
• /
• 2018

The purpose of this study is to synthesize the theoretical perspectives, research methods, and research results of teachers' professional vision by reviewing and analyzing previous research papers and to suggest implications for science teacher education and research. Three databases were used to search peer reviewed journal articles published between 1997-2017, which include 'teachers' and 'professional vision' explicitly in abstracts and empirical studies only. 21 articles in total were analyzed and review results are as follows. First, researchers regarded professional vision as a new concept of teacher professionalism. Previous research viewed professional vision as integrated structure of teachers' knowledge or ability activated at specific moment. Second, the analytical framework of professional vision included two aspects; 'selective attention' and 'reasoning'. Several aspects of lessons or the desirable teaching and learning factors are suggested as the subcategories of selective attention. Hierarchical levels or independent reasoning ability factors are suggested as the subcategories of reasoning process. Third, research on teachers' professional vision focused more on middle school teachers than elementary teachers and on various subject areas. Most studies used video clips and more cases of using videos of non-participants were found. In case of measurement of professional vision, most quantitative scoring methods were whether the responses of experts and teachers on video clips were consistent. Last, most studies examined or assessed teachers' professional vision. It is reported that in-service teachers' professional vision was evaluated higher than novice teachers' and using video clips were effective to examine and improve teachers' professional vision.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.3 s.15
• /
• pp.67-81
• /
• 2005

Recently, the interest and research on the development of new application services such as the Location Based Service and Telemetics providing the emergency service, neighbor information search, and route search according to the development of the Geographic Information System have been increasing. User's search in the spatio-temporal database which is used in the field of Location Based Service or Telemetics usually fixes the current time on the time axis and queries the spatial and aspatial attributes. Thus, if the range of query on the time axis is extensive, it is difficult to efficiently deal with the search operation. For solving this problem, the snapshot, a method to summarize the location data of moving objects, was introduced. However, if the range to store data is wide, more space for storing data is required. And, the snapshot is created even for unnecessary space that is not frequently used for search. Thus, non storage space and memory are generally used in the snapshot method. Therefore, in this paper, we suggests the Hash-based Spatio-Temporal Clustering Algorithm(H-STCA) that extends the two-dimensional spatial hash algorithm used for the spatial clustering in the past to the three-dimensional spatial hash algorithm for overcoming the disadvantages of the snapshot method. And, this paper also suggests the knowledge extraction algorithm to extract the knowledge for the path search of moving objects from the past location data based on the suggested H-STCA algorithm. Moreover, as the results of the performance evaluation, the snapshot clustering method using H-STCA, in the search time, storage structure construction time, optimal path search time, related to the huge amount of moving object data demonstrated the higher performance than the spatio-temporal index methods and the original snapshot method. Especially, for the snapshot clustering method using H-STCA, the more the number of moving objects was increased, the more the performance was improved, as compared to the existing spatio-temporal index methods and the original snapshot method.

• 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}$의 결합거리를 이룬다.