• International Journal of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.203-210
• /
• 2023

In this paper, we develope a stock trading system that automatically buy and sell stocks in Kiwoom Securities' HTS system. The system is made by using Kiwoom Open API+ with the Python programming language. A trading strategy is based on an enhanced system query method called a Condition-Search. The Condition-Search script is edited in Kiwoom Hero 4 HTS and the script is stored in the Kiwoom server. The Condition-Search script has the advantage of being easy to change the trading strategy because it can be modified and changed as needed. In the HTS system, up to ten Condition-Search scripts are supported, so it is possible to apply various trading methods. But there are some restrictions on transactions and Condition-Search in Kiwoom Open API+. To avoid one problem that has transaction number and frequency are restricted, a method of adjusting the time interval between transactions is applied and the other problem that do not support a threading technique is solved by an IPC(Inter-Process Communication) with multiple login IDs.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.165-174
• /
• 2000

Recent researches about range queries in OLAP are only concerned with applying an aggregation operator over a certain region. However, data analysts in real world need not only the simple range query pattern but also an extended range query pattern that finds ranges which satisfy a special condition specified by using several aggregation operators. In this work, we define the general form of the extended range query and propose an efficient processing method for the 'MAX -of-SUM' query, which is the representative form of the extended range query pattern. The MAX-of-SUM query finds the range which has the maximum range sum value in data cube where the size of the range is given. The proposed query processing method is based on the prediction of the scope of the range sum values. That is, the search space on the query processing can be reduced by using the result of the prediction, and hence, the query response time is also reduced.

• Journal of KIISE:Databases
• /
• v.36 no.1
• /
• pp.22-29
• /
• 2009

The World Wide Web has emerged as largest media which provides even a single user to market their products and publish desired information; on the other hand the user can access what kind of information abundantly enough as well. As a result web holds large amount of related information distributed over multiple web pages. The current search engines search for all the entered keywords in a single webpage and rank the resulting set of web pages as an answer to the user query. But this approach fails to retrieve the pair of web pages which contains more relevant information for users search. We introduce a new search paradigm which gives different weights to the query keywords according to their order of appearance. We propose a new arc weight measure that assigns more relevance to the pair of web pages with alternate keywords present so that the pair of web pages which contains related but distributed information can be presented to the user. Our measure proved to be effective on the similarity search in which the experimentation represented the e~arc ranking measure outperforming the conventional ones.

• Journal of Information Processing Systems
• /
• v.9 no.2
• /
• pp.217-236
• /
• 2013

Ranking thousands of web documents so that they are matched in response to a user query is really a challenging task. For this purpose, search engines use different ranking mechanisms on apparently related resultant web documents to decide the order in which documents should be displayed. Existing ranking mechanisms decide on the order of a web page based on the amount and popularity of the links pointed to and emerging from it. Sometime search engines result in placing less relevant documents in the top positions in response to a user query. There is a strong need to improve the ranking strategy. In this paper, a novel ranking mechanism is being proposed to rank the web documents that consider both the HTML structure of a page and the contextual senses of keywords that are present within it and its back-links. The approach has been tested on data sets of URLs and on their back-links in relation to different topics. The experimental result shows that the overall search results, in response to user queries, are improved. The ordering of the links that have been obtained is compared with the ordering that has been done by using the page rank score. The results obtained thereafter shows that the proposed mechanism contextually puts more related web pages in the top order, as compared to the page rank score.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.14 no.2
• /
• pp.219-228
• /
• 1996

The list of the titles of surveying-related papers and books is updated by adding newly polished paper/book titles to the existing one. A special title-search program is developed for managing and searching the surveying-re-lated paper/book titles, and the database is established from the list of the papers. The total number of papers/books in surveying-related field published in Korea upto now is 971. The number of papers/books published in the specific fields are 206 in the conventional surveying field, 218 in Photogrammetry, 183 in Remote Sensing, 127 in Geodesy and GPS, and 237 in Digital Mapping and GIS. The special title-search program is developed using the Visual Basic 3.0 for Windows 3.1 to be operated in the Window environment. The SQL(Structured Query Language) is used for the searching commands.

• Herbal Formula Science
• /
• v.25 no.1
• /
• pp.39-49
• /
• 2017

Objectives : The contents of the literature associated with the medical records were entered into the database. We want to find the structure and search methods for efficient utilization of the database. Methods : The contents were entered into the database using the 'Access 2014 of the MS'. The Query Sentences were created and utilized for a search. Results : We could find information about the prescriptions, medical records and patients by the herbs and symptom combinations using the single table named 'Integrated Knowledge' and queries. Integrated Knowledge is a table that gathered patient information, prescription information and symptom information together. Conclusions : If you store patient, prescription and symptom information on a single table, you could search and use the results by various combinations of the various elements included in the table. These results could help curing patients on the basis of evidence-based treatment at the clinics.

• Journal of the Korean Society for Library and Information Science
• /
• v.45 no.1
• /
• pp.377-393
• /
• 2011

This study aims to investigate trends of internet searching behavior of users of NAVER, a major Korean search portal. In particular, this study analyzed trends of query submission behaviors, behaviors related to typos, multimedia searching behaviors, and click behaviors. In conducting this study, query logs and click logs of unified search service were analyzed. The results of this study show that there were little changes in the topic and length of queries, the pattern of typos, and multimedia seeking behavior over a year's period. However, click counts of documents have gradually increased over time. The results of this study can be implemented to increase the portal's effective development of internet contents and searching algorithms.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.1-11
• /
• 2000

Up to the present, many GIS logical data models have been proposed to incorporate time dimension into traditional 2-dimensional (2D space) GIS databases. However, these models are difficult to implementation of multi-dimensional GIS and have problems of significant data redundancy and search performance. This paper proposes a new storage strategy and a separate storage structure, that is composed of current database and past database, in order to reduce data redundancy and improve search performance of temporal query. Also we design moving algorithm for migration from current database to past database, and design efficient search algorithm for temporal query.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.11a
• /
• pp.547-550
• /
• 2006

The criterion which judges an information retrieval system performance is to how many accurately retrieve an information that the user wants. The search result which uses only homograph has been appears the various documents that relates to each meaning of the word or intensively appears the documents that relates to specific meaning of it. So in this paper, we suggest semantic information retrieval technique using relation within User-Word Intelligent Network(U-WIN) to solve a disambiguation of query In our experiment, queries divide into two classes, the homograph used in terminology and the general homograph, and it sets the expansion query forms at "query + hypemym". Thus we found that only web document search's precision is average 73.5% and integrated search's precision is average 70% in two portal site. It means that U-WIN-Based semantic information retrieval technique can be used efficiently for a IR system.

• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.538-550
• /
• 2006

XML Keyword search enables us to get information easily without knowledge of structure of documents and returns specific and useful partial document results instead of whole documents. Element level query processing makes it possible, but computational complexity, as the number of documents grows, increases significantly overhead costs. In this paper, we present document-level ranking scheme over XML documents which predicts results of element-level processing to reduce processing cost. To do this, we propose the notion of 'keyword proximity' - the correlation of keywords in a document that affects the results of element-level query processing using path information of occurrence nodes and their resemblances - for document ranking process. In benefit of document-centric view, it is possible to reduce processing time using ranked document list or filtering of low scored documents. Our experimental evaluation shows that document-level processing technique using ranked document list is effective and improves performance by the early termination for top-k query.