• Architectural research
• /
• v.3 no.1
• /
• pp.1-7
• /
• 2001

This paper try to provide basic insight of the changing functions of urban parks for the future direction of the maintenance and management of the urban parks using the results of the case study done for the city of Osaka, Japan. To accomplish this purpose this study considers the behavior characteristics of the elderly within the parks in Osaka, Japan. Based on the findings of the study authors propose the chaining meaning of urban parks in the users perspective and summarize the results of the study. Study results show high values on the environmental factors of the park, such as the fresh air and the shadow of trees and low values on noise and stairways in it. The multidimensional quantitative III classifies the purposes of the elderly using the parks into 3 types: a multi-use type, a walking type and a sightseeing type.

• Fire Science and Engineering
• /
• v.6 no.2
• /
• pp.33-39
• /
• 1992

This work presents an expert system for the classification of a given substance and thus enabling one to select the proper container in consultation with the computer. The system consists of 34 rules and uses Micro Expert as a shell program based on backward chaining method. The prototype system will have to be under extensive test. However, its use is bound to have advantages over conventional methods, e.g. looking up in a reference book or using conventional programs with a database. Since the expert system determines the group of the given substance not by its name but by its physical and chemical properties, it is not necessary to add data items even for newly synthesized substances. The system also provides reasoning for its determination and therefore it can be used as a good package for the training of unskilled operators.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.155-158
• /
• 2004

We propose a dynamic wavelength assignment algorithm for online RWA problem in WDM networks with wavelength conversion. With our algorithm, for a given network condition, the following results have been proven mathematically: (1) the probability to find the set of wavelengths for a requested connection is equal or better than any other previously proposed algorithms, (2) our algorithm minimizes the usage of converters by chaining the minimum number of the longest wavelength continuous segments, leaving more converters available for future requests and (3) the complexity of our algorithm is reasonable, which is also another advantage of our algorithm.

• Journal of the Korean Society of Safety
• /
• v.7 no.1
• /
• pp.31-38
• /
• 1992

This paper presents a study on application of expert system technique for the diagnosis of fire-causes in plants. A need is recognized for new methods to diagnose exactly the causes of fires without the help of the human experts. To cope with the difficulty, the expert system techiuque is applied to this area. The expert system suggested in this paper is developed to infer the causes of fires(or, ignition source ) by using the information drawn from the circumstances in fire. For the convenience of inference, ignition sources we classified into eight types ; elecoic spark, adiabatic compression, welding spark, material of high temperature, impact and friction, spontaneous ignition, naked fire, and static electricity. The knowledge base is composed of the rule base and dynamic database, which contain the rules and facts obtained by the expenence in this area, respectively. Both depth-first search and backward chaining schemes are used in reasoning process. This expert system is written in an artificial intelligence language "PROLOG", and its availability is demonstrated through the case study.

• Journal of Korean Institute of Industrial Engineers
• /
• v.17 no.2
• /
• pp.63-74
• /
• 1991

An expert scheduling system on real time basis for computer-aided manufacturing systems has been developed. In developing expert scheduling system, the most time-consuming job is to obtain rules from expert schedulers. An efficient process of obtaining rules directly form the schedules produced by expert schedulers is proposed. By the process, a set of complete and minimal set of rules is obtained. During a real time scheduling, when given information on possible values of elements, the rules produce possible values of decision elements, where logical explanations of the result may be offered in terms of chaining rules. The learning and scheduling processes have been simulated with an automated manufacturing line engaged in the production of circuit boards.

• Journal of Intelligence and Information Systems
• /
• v.8 no.2
• /
• pp.51-69
• /
• 2002

In the supply chain environment on the web, collaborative problem solving and case-based modeling has been getting more important, because it is difficult to cope with diverse problem requirements and inefficient to manage many models as well. Hence, the approach on case-based modeling is required. This paper provides a framework that generates a goal model based on multiple cases, modeling knowledge, and forward chaining and it also develops a search algorithm through sensitivity analysis to reduce the modeling effort.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.100-102
• /
• 2003

인터넷의 등장 이후 폭발적으로 증대되는 웹 정보를 효율적으로 사용하기 위한 방안이 연구되고 있다. 현재, 웹 서비스에서 사용하고 있는 키워드 기반 검색은 syntactic 정보만을 제공하므로 원하는 서비스를 받고자하는 사용자의 의도와 상관없는 정보를 탐색하여 서비스한다. 그러나 시멘틱 웹을 기반으로 만들어진 시스템들은 서비스 정보의 질을 향상시키기 위하여 DQL(Daml Query Language)을 이용한 시멘틱 서치(Semantic search)기법을 이용하고 있다. 시멘틱 서치는 사용자가 입력한 질의들을 의미상으로 해석하고, 이를 통하여 사용자의 원하는 정보와 의미가 같은 해답을 얻어내는 것이다. 그러나 기존의 시멘틱 서치는 사용자가 복잡한 질의들을 수작업으로 처리하여 원하는 정보를 탐색해야하고 DQL(Daml Query Language)은 자체 추론 기능을 갖지 않기 때문에 DQL엔진에서 각각의 메타데이터들을 비교하여 사용자의 질의에 맞는 해답을 찾아내야 함으로 시스템 과부하 현상이 일어나게 된다. 본 논문은 이러한 기존의 시멘틱 서치 방식의 효율성과 속도를 놀이기 위하여, 사용자 중심의 키워드 형태 질의를 시스템 중심의 DQL로 변환하는 DQL 컨버터 시스템과 추론엔진을 불러내어 전방향 추론과 단일화를 실행하는 DQL 엔진을 제안한다.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.3
• /
• pp.77-83
• /
• 2008

In this paper, CPLD low power technology mapping for reuse module design under the time constraint is proposed. Traditional high-level synthesis do not allow reuse of complex, realistic datapath component during the task of scheduling. On the other hand, the proposed algorithm is able to approach a productivity of the design the low power to reuse which given a library of user-defined datapath component and to share of resource sharing on the switching activity in a shared resource. Also, we are obtainable the optimal the scheduling result in experimental results of our using chaining and multi-cycling in the scheduling techniques. Low power circuit make using CPLD technology mapping algorithm for selection reuse module by scheduling.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.10a
• /
• pp.122-125
• /
• 2018

최근 다양한 네트워크 서비스에 대한 수요가 증가함에 따라 Service Function (SF)의 동적 구성을 위한 유연한 모델이 요구된다. Service Function Chaining (SFC)은 일련의 SF로 구성된 새로운 네트워크 서비스 배포 모델을 정의한다. Software Defined Networking (SDN)은 제어 평면을 중앙 집중화함으로써 네트워크 트래픽 제어를 단순화하여 SFC동작에 중요한 역할을 한다. SDN 기반 SFC(SD_SFC)는 SF 장애를 감지하기 위한 모니터링 시스템이 필요하다. 그러나 기존의 모니터링 방식은 모든 SF에 Monitoring Agent(MA)를 배치하기 때문에 높은 시그널링 비용을 가진다. 본 논문에서는 최소한의 SF에 MA를 배치함으로써 시그널링 비용을 줄이는 SFC모니터링 방식을 제안한다. 제안하는 SF selection 알고리즘은 최적화된 SF 집합을 사용하여 오버로드된 SF를 반환하여 MA를 배치한다. 우리는 제안 시스템의 효율성을 평가하기 위해 테스트베드 구현을 통해 실험하였다. 실험 결과에 따르면 우리는 기존 방식에 비해서 시그널링 비용을 59.2% 절감하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.05a
• /
• pp.65-68
• /
• 2018

오늘날 네트워크 서비스에 대한 수요가 증가함에 따라 네트워크 트래픽 또한 증가하고 있다. 이는 네트워크 서비스 구성을 복잡하게 만들어 최종 사용자에게 전달되는 네트워크 기능의 동적 구성이 요구된다. Service Function Chaining (SFC)은 일련의 Service Function (SF) 세트로 구성된 새로운 네트워크 서비스 배포 모델이다. SFC는 특정 서비스에 따라 플로우를 분류하여 네트워크 운영자의 효율적인 서비스 제공을 보장한다. SFC의 성능은 SFC를 구성하는 SF Instance (SFI)와 상관 관계를 가진다. 이때 다수의 SFC 환경에서 단일의 SFI 사용 시, 트래픽 오버플로우가 발생할 수 있다. 따라서, 본 논문에서는 확장 가능한 SFC 프로비저닝을 위한 Monitoring as a Service (MaaS)를 제안한다.