• Title/Summary/Keyword: Instance

Search Result 2,055, Processing Time 0.035 seconds

Analysis of Indexing Schemes for Structure-Based Retrieval (구조 기반 검색을 위한 색인 구조에 대한 분석)

  • 김영자;김현주;배종민
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.5
    • /
    • pp.601-616
    • /
    • 2004
  • Information retrieval systems for structured documents provide multiple levels of retrieval capability by supporting structure-based queries. In order to process structure-based queries for structured documents, information for structural nesting relationship between elements and for element sequence must be maintained. This paper presents four index structures that can process various query types about structures such as structural relationships between elements or element occurrence order. The proposed algorithms are based on the concept of Global Document Instance Tree.

  • PDF

The University Examination And Course Timetabling Problem With Integer Programming

  • Chung, Yerim;Kim, Hak-Jin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.9
    • /
    • pp.9-20
    • /
    • 2019
  • In this paper, we study the university timetabling problem, which consists of two subproblems, the university course timetabling problem and the examination timetabling problem. Given a set of classrooms, students, teachers, and lectures, the problem is to assign a number of courses (and examinations) to suitable timeslots and classrooms while satisfying the given set of constraints. We discuss the modeling and solution approaches to construct course and examination timetables for one of the largest Korean university. By using binary integer programming formulations, we describe these two complex real-world problems. Then, we propose a solution method, called NOGOOD, to solve the examination timetabling model. The computation results show that NOGOOD finds the optimal examination schedule for the given instance. Although we consider a specific instance of the university timetabling problem, the methods we use can be applicable to modeling and solving other timetabling problems.

A Suggestion for Worker Feature Extraction and Multiple-Object Tracking Method in Apartment Construction Sites (아파트 건설 현장 작업자 특징 추출 및 다중 객체 추적 방법 제안)

  • Kang, Kyung-Su;Cho, Young-Woon;Ryu, Han-Guk
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2021.05a
    • /
    • pp.40-41
    • /
    • 2021
  • The construction industry has the highest occupational accidents/injuries among all industries. Korean government installed surveillance camera systems at construction sites to reduce occupational accident rates. Construction safety managers are monitoring potential hazards at the sites through surveillance system; however, the human capability of monitoring surveillance system with their own eyes has critical issues. Therefore, this study proposed to build a deep learning-based safety monitoring system that can obtain information on the recognition, location, identification of workers and heavy equipment in the construction sites by applying multiple-object tracking with instance segmentation. To evaluate the system's performance, we utilized the MS COCO and MOT challenge metrics. These results present that it is optimal for efficiently automating monitoring surveillance system task at construction sites.

  • PDF

A Study on Dynamic Resource Management Based on K-Means Clustering in Cloud Computing (K-Means Clustering 알고리즘 기반 클라우드 동적 자원 관리 기법에 관한 연구)

  • Kwak, Minki;Yu, Heonchang
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2021.11a
    • /
    • pp.107-110
    • /
    • 2021
  • 글로벌 퍼블릭 클라우드 산업 규모는 매년 폭발적으로 성장하고 있으며 최근 COVID-19 등 비대면 문화 확산에 따라 지속 확장되고 있다. 클라우드 사업자는 유한한 인프라 자원으로 다수의 사용자에게 양질의 IT 서비스 제공을 위해 잉여 자원 할당을 최소화하는 것이 중요하다. 그러나 일반적인 퍼블릭 클라우드 환경에서는 정적 자원 할당 기법을 채택하고 있기 때문에 사용자의 주관적인 판단에 따라 잉여 자원의 발생은 필연적이다. 본 논문에서는 머신 러닝 기법 중 K-Means Clustering 알고리즘을 적용하여 클라우드 동적 자원 관리 기법을 제안한다. K-Means Clustering 기반으로 클라우드에 탑재된 각 Instance 의 자원 사용률 데이터를 분석하고, 분석 결과를 토대로 각 Instance 가 속한 Cluster 에 대하여 자원 최적화 작업을 수행한다. 이를 통해 전체 데이터센터 관점에서 잉여 자원의 발생을 최소화하면서도 SLA 수준 및 서비스 연속성을 보장한다.

Hunting for the Hurt in Chaucer′s Book of the Duchess

  • Vaughan, Miceal F.
    • Lingua Humanitatis
    • /
    • v.2 no.2
    • /
    • pp.85-107
    • /
    • 2002
  • The word play on h(e)art-hunting has become a virtual commonplace in criticism of Chaucer′s Book of the Duchess. Less widely discussed is the third meaning of ME herte, "hurt." The "hart"/ "heart" pun is, however, only implicit in the poem, while the rhyme of "heart" and "hurt" in lines 883-84 makes clear the close association of the terms for Chaucer. Earlier commentators insisted that this was in fact an instance of rime riche or "identical rhyme," but if it is so it is striking that it is the unique instance of the rhyme in Chaucer, whose works are full of occasions for hurt hearts. The essay argues that this is, instead, an instance of near-rhyme and that the confusion in scribal spellings of ME hurten(with ′u,′ ′0,′ ′i,′ ′y,′ and ′e′ ) suggests uncertainties about its root vowel that modem linguistic study has not clarified completely. If the rhyme of herte ("hurt") with herte ("heart") is, however, established by these lines in BD, then it is probably reasonable to ask about all the occasions where characters in the poem are hurt by emotional or physical distress. In the cases of A1cyone and the Man in Blak, the hurt is revealed plainly as the death of a loved one, and Alcyone′s death and the Man in Blak′s return "homwarde" offer contrasting responses to the realization and acknowledgement of their loss. In the case of the Narrator, however, the exact nature of his "hurt" is nowhere made clear and the questions this Jack of clarity raises for the reader remain unanswered when the poem declares its "hert-huntyng" done. Further examination of the Narrator′s character and his role in the poem may reveal him to be a physician himself in need of healing, and this reading of his character may identify him as an ancestor as much of Chaucer′s Pardoner as of the Pilgrim Narrator of Canterbury Tales.

  • PDF

A Virtual Object Hosting Technology for IoT Device Controlling on Wireless AP's (무선 인터넷 공유기에서 사물 인터넷 장치 제어를 위한 가상 오브젝트 호스팅 기술 연구)

  • Yang, Jinhong;Park, Hyojin;Kim, Yongrok;Choi, Jun Kyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.2
    • /
    • pp.164-172
    • /
    • 2014
  • Recently, as the number of IoT (Internet of Things) devices for personal or home intelligence increases, the need for unified control and cooperative utilization is required. This paper presents a novel idea, proposes methods for virtualizing Internet of Things (IoT) devices and hosting them on the home AP instead of relying on a cloud service or purchasing a new device to do so. For this, the process and profile of the IoT gadgets need to be virtualized into JavaScript-based objects. Then, to execute and control the instances of the virtualized IoT objects on the wireless AP, a novel instance management method and their interfaces are designed. The implementation and performance section demonstrates the proposed system's stability and operability by showing the stress test results while the wireless AP is running for its wireless routing.

SuperDepthTransfer: Depth Extraction from Image Using Instance-Based Learning with Superpixels

  • Zhu, Yuesheng;Jiang, Yifeng;Huang, Zhuandi;Luo, Guibo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.10
    • /
    • pp.4968-4986
    • /
    • 2017
  • In this paper, we primarily address the difficulty of automatic generation of a plausible depth map from a single image in an unstructured environment. The aim is to extrapolate a depth map with a more correct, rich, and distinct depth order, which is both quantitatively accurate as well as visually pleasing. Our technique, which is fundamentally based on a preexisting DepthTransfer algorithm, transfers depth information at the level of superpixels. This occurs within a framework that replaces a pixel basis with one of instance-based learning. A vital superpixels feature enhancing matching precision is posterior incorporation of predictive semantic labels into the depth extraction procedure. Finally, a modified Cross Bilateral Filter is leveraged to augment the final depth field. For training and evaluation, experiments were conducted using the Make3D Range Image Dataset and vividly demonstrate that this depth estimation method outperforms state-of-the-art methods for the correlation coefficient metric, mean log10 error and root mean squared error, and achieves comparable performance for the average relative error metric in both efficacy and computational efficiency. This approach can be utilized to automatically convert 2D images into stereo for 3D visualization, producing anaglyph images that are visually superior in realism and simultaneously more immersive.

Pattern and Instance Generation for Self-knowledge Learning in Korean (한국어 자가 지식 학습을 위한 패턴 및 인스턴스 생성)

  • Yoon, Hee-Geun;Park, Seong-Bae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.25 no.1
    • /
    • pp.63-69
    • /
    • 2015
  • There are various researches which proposed an automatic instance generation from freetext on the web. Existing researches that focused on English, adopts pattern representation which is generated by simple rules and regular expression. These simple patterns achieves high performance, but it is not suitable in Korean due to differences of characteristics between Korean and English. Thus, this paper proposes a novel method for generating patterns and instances which focuses on Korean. A proposed method generates high quality patterns by taking advantages of dependency relations in a target sentences. In addition, a proposed method overcome restrictions from high degree of freedom of word order in Korean by utilizing postposition and it identifies a subject and an object more reliably. In experiment results, a proposed method shows higher precision than baseline and it is implies that proposed approache is suitable for self-knowledge learning system.

XML Schema Model of Great Staff Music Score using the Integration Method (통합 방식을 이용한 대보표 악보의 XML 스키마 모델)

  • 김정희;곽호영
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.2
    • /
    • pp.302-313
    • /
    • 2003
  • Currently, DTD(Document Type Definition) Definition of Music score has been widely studied according to applications, and the methods of automatic transformation from defined DTD to XML Schema is in progress. In addition, studies of structure of DTD definition are focused on the expression of music information by individual format. In this paper, expression method of the music information by continuous string values is suggested using the fact that measure is basically a component of score, and XML Schema is also modelled. In addition, mechanism extracting the music information from XML instance which was expressed using the proposed method is presented. As a result, XML Schema taking the continuous string values could be defined, instance obtained by the proposed method results in increasing efficiency by simplicity of XPATH and reduction of search step compared to previous method. In addition, it is possible for human to make direct expression, and it is known that the instance size decreases.