RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제
      • 좁혀본 항목 보기순서

        • 원문유무
        • 원문제공처
          펼치기
        • 등재정보
        • 학술지명
          펼치기
        • 주제분류
        • 발행연도
          펼치기
        • 작성언어
        • 저자
          펼치기

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • KCI등재

        차세대 웹을 위한 SWRL 기반 역방향 추론엔진 SMART-B의 개발

        송용욱,홍준석,김우주,윤숙희,이성규,Song Yong-Uk,Hong June-Seok,Kim Woo-Ju,Lee Sung-Kyu,Youn Suk-Hee 한국지능정보시스템학회 2006 지능정보연구 Vol.12 No.2

        While the existing Web focuses on the interface with human users based on HTML, the next generation Web will focus on the interaction among software agents by using XML and XML-based standards and technologies. The inference engine, which will serve as brains of software agents in the next generation Web, should thoroughly understand the Semantic Web, the standard language of the next generation Web. As abasis for the service, the W3C (World Wide Web Consortium) has recommended SWRL (Semantic Web Rule Language) which had been made by compounding OWL (Web Ontology Language) and RuleML (Rule Markup Language). In this research, we develop a backward chaining inference engine SMART-B (SeMantic web Agent Reasoning Tools -Backward chaining inference engine), which uses SWRL and OWL to represent rules and facts respectively. We analyze the requirements for the SWRL-based backward chaining inference and design analgorithm for the backward chaining inference which reflects the traditional backward chaining inference algorithm and the requirements of the next generation Semantic Web. We also implement the backward chaining inference engine and the administrative tools for fact and rule bases into Java components to insure the independence and portability among different platforms under the environment of Ubiquitous Computing. 현재의 웹이 HTML을 바탕으로 인간 사용자와의 인터페이스에 초점을 맞추고 있는데 비하여, 차세대 웹은 XML 및 XML 기반 각종 표준들을 바탕으로 소프트웨어 에이전트간의 상호작용에 초점을 맞추어 나가고 있다. 차세대 웹에서 소프트웨어 에이전트의 두뇌 역할을 수행하기 위하여 추론엔진은 차세대 웹의 표준 언어인 시맨틱 웹 - (Semantic Web)을 충실히 이해할 수 있어야 한다. 이를 위한 기초 작업의 일환으로 OWL(Web Ontology Language) 과 RuleML(Rule Markup Language)을 조합한 SWRL(Semantic Web Rule Language)이 W3C에 제안된 바 있다. 본 연구에서는 SWRL을 규칙 표현 방법으로 사용하고, OWL을 사실 표현 방법으로 사용하는 역방향 추론엔진인 SMART-B(SeMantic web Agent Reasoning Tools -Backward chaining inference engine)를 개발하고자 하였다. 이를 위하여 SWRL 기반 역방향 추론을 위한 요구 기능을 분석하고, 기존 역방향 추론 알고리즘에 차세대 시맨틱 웹의 요구 기능을 반영한 역방향 추론 알고리즘을 설계하였다. 또한, 유비쿼터스 환경에서의 각종 플랫폼간의 독립성과 이식성을 확보하고 기기간의 성능 차이를 극복할 수 있도록 사실 베이스 및 규칙 베이스의 관리도구와 역방향 추론 엔진 등을 Java 프로그래밍 언어를 이용하여 단위 컴포넌트의 형태로 개발하였다.

      • KCI등재

        백트래킹 기법을 이용한 불확정성 하에서의 역방향추론 방법에 대한 연구

        송용욱(Yong Uk Song),신현식(Hyunsik Shin) 한국IT서비스학회 2010 한국IT서비스학회지 Vol.9 No.3

        As knowledge becomes a critical success factor of companies nowadays, lots of rule-based systems have been and are being developed to support their activities. Large number of rule-based systems serve as Web sites to advise, or recommend their customers. They usually use a backward chaining inference algorithm based on backtrack to implement those interactive Web-enabled rule-based systems. However, when the users like customers are using these systems interactively, it happens frequently where the users do not know some of the answers for the questions from the rule-based systems. We are going to design a backward chaining inference methodology considering unknown facts based on backtrack technique. Firstly, we review exact and inexact reasoning. After that, we develop a backward chaining inference algorithm for exact reasoning based on backtrack, and then, extend the algorithm so that it can consider unknown facts and reduce its search space. The algorithm speeded-up inference and decreased interaction time with users by eliminating unnecessary questions and answers. We expect that the Web-enabled rule-based systems implemented by our methodology would improve users' satisfaction and make companies' competitiveness.

      • 자동화 공정의 에러 상태 감지를 위한 영상처리 기반 디지털 제어 신호의 데이터 전처리 알고리즘 개발

        송용욱(Yong-Uk Song),백수정(Sujeong Baek) 대한기계학회 2020 대한기계학회 춘추학술대회 Vol.2020 No.12

        Since many data-driven fault detection studies have been done, data pre-processing becomes important. However, it is difficult to determine healthy states and to obtain additional information on the healthy states in automatic manufacturing systems operated only with digital control signals. In this paper, we develop a pre-processing algorithm which detects system’s healthy states in real-time and collects datasets during healthy states of a manufacturing system automatically. Image data is obtained by a webcam, and the proposed algorithm detects the process movement by analyzing the image. When such operation movement is identified, we export the raw dataset to a pre-processing database and we additionally determine the current operation as healthy or not. This method was applied to a smart factory testbed and the performance is verified. As a result, we expect that the proposed pre-processing study will improve the accuracy of process error detection in automatic manufacturing systems using CCTV.

      • KCI우수등재

        온라인 전기자동차의 상용화를 위한 인프라 구축비용 타당성에 대한 연구

        송용욱(Yong Uk Song),박상언(Sangun Park),김우주(Wooju Kim),홍준석(June S. Hong),전동규(DongKyu Jeon),이상헌(Sangheon Lee),박종한(Jonghan Park) 한국전자거래학회 2013 한국전자거래학회지 Vol.18 No.1

        본 연구는 온라인 전기자동차를 상용화하기 위해 필요한 인프라 구축비용의 타당성을 알아보기 위한 연구이다. 이를 위해 서울시의 버스노선을 대상으로, 온라인 전기자동차 운영을 위해 필요한 인프라의 구축비용에 대해 연구하였다. 현재 전기자동차 운영방식의 대안으로는 OLEV 방식과 PEV 방식이 고려되고 있으며, 각 방식은 충전지 비용과 충전기 비용에서 각기 장점을 갖고 있다. 두 방식의 총비용을 비교하기 위해 본 논문에서는 온라인 전기버스의 급전장치 설치비용을 최소화하기 위한 급전 장치 최적 배치 모형을 제시하였다. 이를 위하여 먼저 버스정류장에 서로 다른 길이의 급전장치를 설치할 경우의 총 설치비용을 최소화하는 혼합정수계획법(Mixed Integer Programming) 모형을 모델링하였다. 모형에서 사용하는 계수를 구하기 위해 각 버스정류장에서의 평균 정차시간을 구하는 시뮬레이터를 개발하였으며, 계산된 계수와 최적화모형을 이용하여 시내버스 노선 전체에 대하여 최적화된 인프라의 배치 개수와 위치를 결정할 수 있는 시스템을 개발하였다. 서울시의 실제 자료를 대상으로 OLEV 방식과 PEV 방식에서의 총비용을 계산하고 비교한 결과 OLEV 방식의 총 비용이 저렴하게 나타났으며, 결과적으로 OLEV 방식의 상용화 타당성을 입증할 수 있었다. This study aims to validate the cost of building the infrastructure to commercialize online electric vehicles. For that purpose, we probe the cost to construct the necessary infrastructure for online electric vehicles regarding Seoul area public bus transit. OLEV and PEV are considered as alternative electric vehicle schemes, and each of them has their own cons and pros in terms of rechargeable battery cost and charger cost. An optimization model which minimizes the cost to install online electric bus feeding devices is proposed in order to compare the total costs of the two alternative schemes. We developed a Mixed Integer Programming model to locate the feeding devices of several different lengths at each bus stops. Furthermore, we implemented a computer simulator to obtain the parameters which will be used in the MIP model and a Web-based system which determines the optimal location of infrastructure for the whole city area from a result of the MIP model. The cost comparison result shows that the total cost of OLEV is cheaper than that of PEV considering the real data of Seoul area public transit, and, as a result, confirms the feasibility of the commercialization of OLEV.

      • KCI등재

        PLC 디지털 제어 신호를 통한 LSTM기반의 이산 생산 공정의 실시간 고장 상태 감지

        송용욱(Yong-Uk Song),백수정(Sujeong Baek) 한국산업경영시스템학회 2021 한국산업경영시스템학회지 Vol.44 No.2

        A lot of sensor and control signals is generated by an industrial controller and related internet-of-things in discrete manufacturing system. The acquired signals are such records indicating whether several process operations have been correctly conducted or not in the system, therefore they are usually composed of binary numbers. For example, once a certain sensor turns on, the corresponding value is changed from 0 to 1, and it means the process is finished the previous operation and ready to conduct next operation. If an actuator starts to move, the corresponding value is changed from 0 to 1 and it indicates the corresponding operation is been conducting. Because traditional fault detection approaches are generally conducted with analog sensor signals and the signals show stationary during normal operation states, it is not simple to identify whether the manufacturing process works properly via conventional fault detection methods. However, digital control signals collected from a programmable logic controller continuously vary during normal process operation in order to show inherent sequence information which indicates the conducting operation tasks. Therefore, in this research, it is proposed to a recurrent neural network-based fault detection approach for considering sequential patterns in normal states of the manufacturing process. Using the constructed long short-term memory based fault detection, it is possible to predict the next control signals and detect faulty states by compared the predicted and real control signals in real-time. We validated and verified the proposed fault detection methods using digital control signals which are collected from a laser marking process, and the method provide good detection performance only using binary values.

      • KCI등재

        의류 인터넷 쇼핑몰에서 브랜드를 고려한 상품 입고 및 재배치 방법 연구

        송용욱(Yong Uk Song),안병혁(Byung-Hyuk Ahn) 한국지능정보시스템학회 2010 지능정보연구 Vol.16 No.2

        An Internet shopping mall for clothing operates a warehouse for packing and shipping products to fulfill its orders. All the products in the warehouse are put into the boxes of same brands and the boxes are stored in a row on shelves equiped in the warehouse. To make picking and managing easy, boxes of the same brands are located side by side on the shelves. When new products arrive to the warehouse for storage, the products of a brand are put into boxes and those boxes are located adjacent to the boxes of the same brand. If there is not enough space for the new coming boxes, however, some boxes of other brands should be moved away and then the new coming boxes are located adjacent in the resultant vacant spaces. We want to minimize the movement of the existing boxes of other brands to another places on the shelves during the warehousing of new coming boxes, while all the boxes of the same brand are kept side by side on the shelves. Firstly, we define the adjacency of boxes by looking the shelves as an one dimensional series of spaces to store boxes, i.e. cells, tagging the series of cells by a series of numbers starting from one, and considering any two boxes stored in the cells to be adjacent to each other if their cell numbers are continuous from one number to the other number. After that, we tried to formulate the problem into an integer programming model to obtain an optimal solution. An integer programming formulation and Branch-and-Bound technique for this problem may not be tractable because it would take too long time to solve the problem considering the number of the cells or boxes in the warehouse and the computing power of the Internet shopping mall. As an alternative approach, we designed a fast heuristic method for this reallocation problem by focusing on just the unused spaces-empty cells-on the shelves, which results in an assignment problem model. In this approach, the new coming boxes are assigned to each empty cells and then those boxes are reorganized so that the boxes of a brand are adjacent to each other. The objective of this new approach is to minimize the movement of the boxes during the reorganization process while keeping the boxes of a brand adjacent to each other. The approach, however, does not ensure the optimality of the solution in terms of the original problem, that is, the problem to minimize the movement of existing boxes while keeping boxes of the same brands adjacent to each other. Even though this heuristic method may produce a suboptimal solution, we could obtain a satisfactory solution within a satisfactory time, which are acceptable by real world experts. In order to justify the quality of the solution by the heuristic approach, we generate 100 problems randomly, in which the number of cells spans from 2,000 to 4,000, solve the problems by both of our heuristic approach and the original integer programming approach using a commercial optimization software package, and then compare the heuristic solutions with their corresponding optimal solutions in terms of solution time and the number of movement of boxes. We also implement our heuristic approach into a storage location assignment system for the Internet shopping mall.

      • KCI등재

        온라인 쇼핑몰의 브랜드 중심 창고관리 기법에 대한 연구

        송용욱(Yong Uk Song),안병혁(Byung-Hyuk Ahn) 한국데이타베이스학회 2011 Journal of information technology applications & m Vol.18 No.1

        As the sales volume of online shops increases, the job burden in the back-offices of the online shops also increases. Order picking is the most labor-intensive operation among the jobs in a back-office and mid-size pure click online shops are experiencing the time delay and complexity in order picking nowadays while fulfilling their customers' orders. Those warehouses of the mid-size shops are based on manual systems, and as order pickings are repeated, the warehouses get a mess and lots of products in those warehouses are getting missing, which results in severe delay in order picking. To overcome this kind of problem in online clothing shops, we research a methodology to locate warehousing products. When products arrive at a warehouse, they are packed into a box and located on a rack in the warehouse. At this point, the operator should determine the box to be put in and the location on the rack for the box to be put on. This problem could be formulated as an Integer Programming model, but the branch-and-bound algorithm to solve the IP model requires enormous computation, and sometimes it is even impossible to get a solution in a proper time. So, we relaxed the problem, developed a set of heuristics as a methodology to get a semi-optimum in an acceptable time, and proved by an experiment that the solutions by our methodology are satisfactory and acceptable by field managers.

      • KCI등재

        임베디드 SQL 기반 정보시스템의 개발 및 관리 방법에 대한 연구

        송용욱 ( Yong Uk Song ) 한국정보시스템학회 2010 情報시스템硏究 Vol.19 No.4

        As companies introduced ERP (Enterprise Resource Planning) systems since the middle of 1990s, the databases of the companies has become centralized and gigantic. The companies are now developing data-mining based applications on those centralized and gigantic databases for knowledge management. Almost of them are using Pro*C/C++, a embedded SQL programming language, and it`s because the Pro*C/C++ is independent of platforms and also fast. However, they suffer from difficulties in development and maintenance due to the characteristics of corporate databases which have intrinsically large number of tables and fields. The purpose of this research is to design and implement a methodology which makes it easier to develop and maintain embedded SQL applications based on relational databases. Firstly, this article analyzes the syntax of Pro*C/C++ and addresses the concept of repetition and duplication which causes the difficulties in development and maintenance of corporate information systems. Then, this article suggests a management architecture of source codes and databases in which a preprocessor generates Pro*C/C++ source codes by referring a DB table specification, which would solve the problem of repetition and duplication. Moreover, this article also suggests another architecture of DB administration in which the preprocessor generates DB administration commands by referring the same table specification, which would solve the problem of repetition and duplication again. The preprocessor, named PrePro*C, has been developed under the UNIX command-line prompt environment to preprocess Pro*C/C++ source codes and SQL administration commands, and is under update to be used in another DB interface environment like ODBC and JDBC, too.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼