• Title/Summary/Keyword: Query process

Search Result 526, Processing Time 0.024 seconds

An Efficient Feature Point Extraction and Comparison Method through Distorted Region Correction in 360-degree Realistic Contents

  • Park, Byeong-Chan;Kim, Jin-Sung;Won, Yu-Hyeon;Kim, Young-Mo;Kim, Seok-Yoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.1
    • /
    • pp.93-100
    • /
    • 2019
  • One of critical issues in dealing with 360-degree realistic contents is the performance degradation in searching and recognition process since they support up to 4K UHD quality and have all image angles including the front, back, left, right, top, and bottom parts of a screen. To solve this problem, in this paper, we propose an efficient search and comparison method for 360-degree realistic contents. The proposed method first corrects the distortion at the less distorted regions such as front, left and right parts of the image excluding severely distorted regions such as upper and lower parts, and then it extracts feature points at the corrected region and selects the representative images through sequence classification. When the query image is inputted, the search results are provided through feature points comparison. The experimental results of the proposed method shows that it can solve the problem of performance deterioration when 360-degree realistic contents are recognized comparing with traditional 2D contents.

A New Flash TPR-tree for Indexing Moving Objects with Frequent Updates

  • Lim, Seong-Chae
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.14 no.1
    • /
    • pp.95-104
    • /
    • 2022
  • A TPR-tree is a well-known indexing structure that is developed to answer queries about the current or future time locations of moving objects. For the purpose of space efficiency, the TPR-tree employs the notion of VBR (velocity bounding rectangle)so that a regionalrectangle presents varying positions of a group of moving objects. Since the rectangle computed from a VBR always encloses the possible maximum range of an indexed object group, a search process only has to follow VBR-based rectangles overlapped with a given query range, while searching toward candidate leaf nodes. Although the TPR-tree index shows up its space efficiency, it easily suffers from the problem of dead space that results from fast and constant expansions of VBR-based rectangles. Against this, the TPR-tree index is enforced to update leaf nodes for reducing dead spaces within them. Such an update-prone feature of the TPR-tree becomes more problematic when the tree is saved in flash storage. This is because flash storage has very expensive update costs. To solve this problem, we propose a new Bloom filter based caching scheme that is useful for reducing updates in a flash TPR-tree. Since the proposed scheme can efficiently control the frequency of updates on a leaf node, it can offer good performance for indexing moving objects in modern flash storage.

DNS key technologies based on machine learning and network data mining

  • Xiaofei Liu;Xiang Zhang;Mostafa Habibi
    • Advances in concrete construction
    • /
    • v.17 no.2
    • /
    • pp.53-66
    • /
    • 2024
  • Domain Name Systems (DNS) provide critical performance in directing Internet traffic. It is a significant duty of DNS service providers to protect DNS servers from bandwidth attacks. Data mining techniques may identify different trends in detecting anomalies, but these approaches are insufficient to provide adequate methods for querying traffic data in significant network environments. The patterns can enable the providers of DNS services to find anomalies. Accordingly, this research has used a new approach to find the anomalies using the Neural Network (NN) because intrusion detection techniques or conventional rule-based anomaly are insufficient to detect general DNS anomalies using multi-enterprise network traffic data obtained from network traffic data (from different organizations). NN was developed, and its results were measured to determine the best performance in anomaly detection using DNS query data. Going through the R2 results, it was found that NN could satisfactorily perform the DNS anomaly detection process. Based on the results, the security weaknesses and problems related to unpredictable matters could be practically distinguished, and many could be avoided in advance. Based on the R2 results, the NN could perform remarkably well in general DNS anomaly detection processing in this study.

Sketch Map System using Clustering Method of XML Documents (XML 문서의 클러스터링 기법을 이용한 스케치맵 시스템)

  • Kim, Jung-Sook;Lee, Ya-Ri;Hong, Kyung-Pyo
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.12
    • /
    • pp.19-30
    • /
    • 2009
  • The service that has recently come into the spotlight utilizes the map to first approach the map and then provide various mash-up formed results through the interface. This service can provide precise information to the users but the map is barely reusable. The sketch-map system of this paper, unlike the existing large map system, uses the method of presenting the specific spot and route in XML document and then clustering among sketch-maps. The map service system is designed to show the optimum route to the destination in a simple outline map. It is done by renovating the spot presented by the map into optimum contents. This service system, through the process of analyzing, splitting and clustering of the sketch-map's XML document input, creates a valid form of a sketch-map. It uses the LCS(Longest Common Subsequence) algorithm for splitting and merging sketch-map in the process of query. In addition, the simulation of this system's expected effects is provided. It shows how the maps that share information and knowledge assemble to form a large map and thus presents the system's ability and role as a new research portal.

Shader Space Navigator: A Similar Shader Retrieval System (Shader Space Navigator: 유사 쉐이더 검색 시스템)

  • Lee, Jae-Ho;Jang, Min-Hee;Kim, Du-Yeol;Kim, Sang-Wook;Kim, Min-Ho;Choi, Jin-Sung
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.3
    • /
    • pp.58-67
    • /
    • 2008
  • In this paper, we first point out difficulties faced by CG artists in the shading process: (1) a lot of technical details on shaders required, (2) long rendering time, and (3) repeated trials-and-errors. To make them overcome such difficulties, we propose Shader Space Navigator, a system that efficiently searches for shaders similar to a given query shader from a shader database containing a large number of quality shaders. With Shader Space Navigator, CG artists find appropriate shaders from the database that are very close to the final result shader, and thus complete the shading process easily by slightly tuning some attributes of those shaders. Thus, the CG artists can create their final shaders in an intuitive and efficient way without a large number of time-consuming rendering processes. Also, we deal with implementation issues related to Shader Space Navigator and constructing an abundant shader database in detail.

Design and Implementation of the Notification System using Event-Profile Filtering (이벤트-프로파일 여과를 이용한 통지시스템의 설계 및 구현)

  • Ban, Chae-Hoon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.129-132
    • /
    • 2010
  • Users can obtain useful information from large of data because of development of internet. Since these data rise continuously like stream data, it is required to extract the appropriate information efficiently for the user's needs. In the traditional scheme, they are acquired by processing the user queries after the occurred data are stored at a database. However, it is inefficient to process the user queries over the large volume of continuous data by using the traditional scheme. In this paper, we propose the Event-Profile Model to define the data occurrence on the internet as the events and the user's requirements as the profiles. We also propose and implement the filtering scheme to process the events and the profiles efficiently. We evaluate the performance of the proposed scheme and our experiments show that the new scheme outperforms the other on various dataset.

  • PDF

Design and Implementation of the Notification System based on the Event-Profile Model (이벤트-프로파일 모델을 기반으로 한 통지 시스템의 설계 및 구현)

  • Ban, Chae-Hoon;Kim, Dong-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.8
    • /
    • pp.1750-1755
    • /
    • 2011
  • Recently, it is possible for users to acquire necessary data easily as the various schemes of the searching information are developed. Since these data rise continuously like stream data, it is required to extract the appropriate data for the user's needs from the mass data on the internet. In the traditional scheme, they are acquired by processing the user queries after the occurred data are stored at a database. However, it is inefficient to process the user queries over the large volume of continuous data by using the traditional scheme. In this paper, we propose the Event-Profile Model to define the data occurrence on the internet as the events and the user's requirements as the profiles. We also propose and implement the filtering scheme to process the events and the profiles efficiently. We evaluate the performance of the proposed scheme and our experiments show that the new scheme outperforms the other on various dataset.

The Mobile Priority Analysis System Using AHP (AHP를 이용한 모바일 우선순위분석시스템)

  • Jang, Rae-Young;Jung, Sung-Jae;Bae, Yu-Mi;Sung, Kyung;Soh, Woo-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.10a
    • /
    • pp.450-453
    • /
    • 2012
  • We must be the best choice in a variety of situations in decision every time. If you need to select one of several alternatives in a variety of fields, In this paper, we implement the system using AHP to analyze the results with the highest priority. AHP is one of the decision-making techniques. When Decision-makers making decisions, AHP would be useful if you need to select the alternative conflicting purpose. Excel using AHP software, or software for the PC exist. Recently, Smartphone and tablet PC is the modern man's necessities and has shown remarkable penetration. In this paper, we have developed a priority investigation Mobile Application.

  • PDF

Study on Methods for Sasang Constituion Diagnosis (사상체질진단 방법론 연구)

  • Kim Jon-Won;Lee Eui-Ju;Kim Kyn-Kon;Kim Jong-Yeol;Lee Yong-Tae
    • Journal of Physiology & Pathology in Korean Medicine
    • /
    • v.19 no.6
    • /
    • pp.1471-1474
    • /
    • 2005
  • Sasang constitution medicine is to do different treatment accordining to sasang constitution. Therefore, the constitution diagnosis in the Sasang constitution medicine is very important thing. The Process of Sasang constitution diagnosis Is difficult thing, because of consuming much time, making every effort. It is apt to be subjective tendency. So it need to make objective method. The QSCC II (Questionnaire of Sasang Constitution Classification II ) have several problems- can't do diagnosis of Taeyangin, the accuracy rate of Sasang constitution diagnosis is not high (probably 60%), and so on. So, we need the new methods for the Sasang constitution Diagnosis. We will modify the problems of QSCC II. The First is the problems of the study execution process, not-multicenter study, a low data, the absent of Taeyangin cases. So, we have to do the multicenter study. The Second is the problems of a query and the method of statistics analysis. We will modify the problems of self-report Questionnaire. That is the problems of self-report Questionnaire, the lack of objective estimation( body type, personal appearance, etc), the absent of the estimation on typical or non-typical type constitution. We modified the problems of QSCC II. Therefore we made the new self-report Questionnaire for patients. We modified the problems of self-report Questionnaire. Therefore we made the new Constituion diagnosis Questionnaire for doctors. We develop the Questionnaire of two ways for the Sasang constitution Diagnosis. The one is the new self-report Questionnaire for patients. The other is the new Constitution diagnosis Questionnaire for doctors. We have to melt down the Questionnaire of two ways for the Sasang constitution Diagnosis.

Development of an Editor for Reference Data Library Based on ISO 15926 (ISO 15926 기반의 참조 데이터 라이브러리 편집기의 개발)

  • Jeon, Youngjun;Byon, Su-Jin;Mun, Duhwan
    • Korean Journal of Computational Design and Engineering
    • /
    • v.19 no.4
    • /
    • pp.390-401
    • /
    • 2014
  • ISO 15926 is an international standard for integration of lifecycle data for process plants including oil and gas facilities. From the viewpoint of information modeling, ISO 15926 Parts 2 provides the general data model that is designed to be used in conjunction with reference data. Reference data are standard instances that represent classes, objects, properties, and templates common to a number of users, process plants, or both. ISO 15926 Parts 4 and 7 provide the initial set of classes, objects, properties and the initial set of templates, respectively. User-defined reference data specific to companies or organizations are defined by inheriting from the initial reference data and the initial set of templates. In order to support the extension of reference data and templates, an editor that provides creation, deletion and modification functions of user-defined reference data is needed. In this study, an editor for reference data based on ISO 15926 was developed. Sample reference data were encoded in OWL (web ontology language) according to the specification of ISO 15926 Part 8. iRINGTools and dot15926Editor were benchmarked for the design of GUI (graphical user interface). Reference data search, creation, modification, and deletion functions were implemented with XML (extensible markup language) DOM (document object model), and SPARQL (SPARQL protocol and RDF query language).