• Title/Summary/Keyword: Related query

Search Result 268, Processing Time 0.023 seconds

Detection of Internal Illegal Query Using Packet Analysis (패킷 분석을 이용한 내부인 불법 질의 탐지)

  • Jang Gyong-Ohk;Koo Hyang-Ohk;Oh Chang-Suk
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.3 s.35
    • /
    • pp.259-265
    • /
    • 2005
  • The purpose of this study is for designing a illegal query detection system using Winpcap library for unauthorized access by internal person. The illegal query detection can be possible detecting the data in out of access control or searching illegal data by plagiarizing other user ID. The system used in this paper collects packets and analyzes the data related to SQL phrase among them, and selects the user's basic information by comparing the dispatch of MAC address and user's hardware information constructed previously. If the extracted information and user's one are different, it is considered as an illegal query. It is expected that the results of this study can be applied to reducing the snaking off unprotected data, and also contributed to leaving the audit records using user's access log which can be applied to the pattern analysis.

  • PDF

A Development of Query-Answer Learning Tool based on LTSA (LTSA 기반의 질의 응답 학습 도구 개발)

  • Kim, Haeng-Kon;Kim, Jung-Soo
    • The KIPS Transactions:PartA
    • /
    • v.10A no.3
    • /
    • pp.269-278
    • /
    • 2003
  • The popularity of the web based education has come the need for variety learning methods and for business to exploit the web not only for interoperability but also standardization. This way of standardization has come to researched for environments, contents and practical uses in ISO. The IEEE has special]y established five technical classes for LTSA which provide advanced e-learning environments. Feedback functions would not be supported and specified in standardization for Query Answer on LTSA. In this paper, we describe the query and answer model which we have developed on layer three of LTSA. We develop the redefined model for transforming data flow oriented into object or component based model. We have developed the Query Answer Metadata (QAM) based on Learning Object Metadata (LOM). We design and showed thing a prototyping implementation the Query Answer Learning Tool (QALT). We have used the QALT to address the problem of efficiency of web based education. We also used it to develop the related tools with quality and productivity.

Rule-based Semantic Search Techniques for Knowledge Commerce Services (지식 거래 서비스를 위한 규칙기반 시맨틱 검색 기법)

  • Song, Sung Kwang;Kim, Young Ji;Woo, Yong Tae
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.6 no.1
    • /
    • pp.91-103
    • /
    • 2010
  • This paper introduces efficient rule-based semantic search techniques to ontology-based knowledge commerce services. Primarily, the search techniques presented in this paper define rules of reasoning that are required for users to search using the concept of ontology, multiple characteristics, relations among concepts and data type. In addition, based on the defined rules, the rule-based reasoning techniques search ontology for knowledge commerce services. This paper explains the conversion rules of query which convert user's query language into semantic search words, and transitivity rules which enable users to search related tags, knowledge products and users. Rule-based sematic search techniques are also presented; these techniques comprise knowledge search modules that search ontology using validity examination of queries, query conversion modules for standardization and expansion of search words and rule-based reasoning. The techniques described in this paper can be applied to sematic knowledge search systems using tags, since transitivity reasoning, which uses tags, knowledge products, and relations among people, is possible. In addition, as related users can be searched using related tags, the techniques can also be employed to establish collaboration models or semantic communities.

AutoCor: A Query Based Automatic Acquisition of Corpora of Closely-related Languages

  • Dimalen, Davis Muhajereen D.;Roxas, Rachel Edita O.
    • Proceedings of the Korean Society for Language and Information Conference
    • /
    • 2007.11a
    • /
    • pp.146-154
    • /
    • 2007
  • AutoCor is a method for the automatic acquisition and classification of corpora of documents in closely-related languages. It is an extension and enhancement of CorpusBuilder, a system that automatically builds specific minority language corpora from a closed corpus, since some Tagalog documents retrieved by CorpusBuilder are actually documents in other closely-related Philippine languages. AutoCor used the query generation method odds ratio, and introduced the concept of common word pruning to differentiate between documents of closely-related Philippine languages and Tagalog. The performance of the system using with and without pruning are compared, and common word pruning was found to improve the precision of the system.

  • PDF

Emotional Model via Human Psychological Test and Its Application to Image Retrieval (인간심리를 이용한 감성 모델과 영상검색에의 적용)

  • Yoo, Hun-Woo;Jang, Dong-Sik
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.31 no.1
    • /
    • pp.68-78
    • /
    • 2005
  • A new emotion-based image retrieval method is proposed in this paper. The research was motivated by Soen's evaluation of human emotion on color patterns. Thirteen pairs of adjective words expressing emotion pairs such as like-dislike, beautiful-ugly, natural-unnatural, dynamic-static, warm-cold, gay-sober, cheerful-dismal, unstablestable, light-dark, strong-weak, gaudy-plain, hard-soft, heavy-light are modeled by 19-dimensional color array and $4{\times}3$ gray matrix in off-line. Once the query is presented in text format, emotion model-based query formulation produces the associated color array and gray matrix. Then, images related to the query are retrieved from the database based on the multiplication of color array and gray matrix, each of which is extracted from query and database image. Experiments over 450 images showed an average retrieval rate of 0.61 for the use of color array alone and an average retrieval rate of 0.47 for the use of gray matrix alone.

Mobile Client-Server System for Real-time Continuous Query of Moving Objects

  • Kim, Young-Choon;Joo, Hae-Jong;Kim, Young-Baek;Rhee, Sang-Yong
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.11 no.2
    • /
    • pp.95-102
    • /
    • 2011
  • In this paper, a Mobile Continuous Query Processing System (MCQPS) is designed to solve problems related to database hoarding, maintenance of shared data consistency, and optimization of logging. These problems are caused by weak connectivity and disconnection of wireless networks inherent in mobile database systems under mobile client-server environments. We show the superiority of the proposed MCQPS by comparing its performance to the Client-Intercept-Server (C-I-S) model. In addition, several experimental results show the effectiveness of our proposed indexing structure and methodology for real-time continuous queries.

The Multiple Continuous Query Fragmentation for the Efficient Sensor Network Management (효율적인 센서 네트워크 관리를 위한 다중 연속질의 분할)

  • Park, Jung-Up;Jo, Myung-Hyun;Kim, Hak-Soo;Lee, Dong-Ho;Son, Jin-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.13D no.7 s.110
    • /
    • pp.867-878
    • /
    • 2006
  • In the past few years, the research of sensor networks is forced dramatically. Specially, while the research for maintaining the power of a sensor is focused, we are also concerned nth query processing related with the optimization of multiple continuous queries for decreasing in unnecessary energy consumption of sensor networks. We present the fragmentation algorithm to solve the redundancy problem in multiple continuous queries that increases in the count or the amount of transmitting data in sensor networks. The fragmentation algorithm splits one query into more than two queries using the query index (QR-4ree) in order to reduce the redundant query region between a newly created query and the existing queries. The R*-tree should be reorganized to the QR-tree right to the structure suggested. In the result, we preserve 20 percentage of the total energy in the sensor networks.

Spatio-temporal Query Processing Systems for Ubiquitous Environments (유비쿼터스 환경을 위한 시공간 질의 처리 시스템)

  • Lee, Ki-Young;Lim, Myung-Jae;Kim, Kyu-Ho;Kim, Joung-Joon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.3
    • /
    • pp.145-152
    • /
    • 2010
  • With the recent development of the ubiquitous computing technology, there are increasing interest and research in technologies such as sensors and RFID related to information recognition and location positioning in various ubiquitous fields. Especially, RTLS(Real-Time Locating Services) dealing with spatio-temporal data is emerging as a promising technology. For these reasons, the ISO/IEC published the RTLS standard specification for compatibility and interoperability in RTLS. Therefore, in this paper, we designed and implemented Spatio-temporal Query Processing Systems for efficiently managing and searching the incoming Spatio-temporal data stream of moving objects. Spatio-temporal Query Processing Systems's spatio-temporal middleware maintains interoperability among heterogeneous devices and guarantees data integrity in query processing through real time processing of unceasing spatio-temporal data streams and two way synchronization of spatio-temporal DBMSs. Web Server uses the SOAP(Simple Object Access Protocol) message between client and server for interoperability and translates client's SOAP message into CQL(Continuous Query Language) of the spatio-temporal middleware. Finally, this thesis proved the utility of the system by applying the spatio-temporal Query Processing Systems to a real-time Locating Services.

Mobile Client-Server System for Realtime Continuous Query of Moving Objects (이동 객체의 실시간 연속 질의를 위한 모바일 클라이언트-서버 시스템)

  • Joo, Hae-Jong;Park, young-Bae;Choi, Chang-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.6 s.44
    • /
    • pp.289-298
    • /
    • 2006
  • Many researches are going on with regard to issues and problems related to mobile database systems, which are caused by the weak connectivity of wireless networks, the mobility and the portability of mobile clients. Mobile computing satisfies user's demands for convenience and performance to use information at any time and in any place, but it has many problems to be solved in the aspect of data management. The purpose of our study is to design Mobile Continuous Query Processing System(MCQPS) to solve problems related to database hoarding, the maintenance of shared data consistency and the optimization of logging, which are caused by the weak connectivity and disconnection of wireless networks inherent in mobile database systems under mobile client server environments. We proved the superiority of the proposed MCQPS by comparing its performance to the C I S(Client-Intercept-Slaver) model. In Addition, we experiment on proposed index structure and methodology in various methods.

  • PDF

A Query Randomizing Technique for breaking 'Filter Bubble'

  • Joo, Sangdon;Seo, Sukyung;Yoon, Youngmi
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.12
    • /
    • pp.117-123
    • /
    • 2017
  • The personalized search algorithm is a search system that analyzes the user's IP, cookies, log data, and search history to recommend the desired information. As a result, users are isolated in the information frame recommended by the algorithm. This is called 'Filter bubble' phenomenon. Most of the personalized data can be deleted or changed by the user, but data stored in the service provider's server is difficult to access. This study suggests a way to neutralize personalization by keeping on sending random query words. This is to confuse the data accumulated in the server while performing search activities with words that are not related to the user. We have analyzed the rank change of the URL while conducting the search activity with 500 random query words once using the personalized account as the experimental group. To prove the effect, we set up a new account and set it as a control. We then searched the same set of queries with these two accounts, stored the URL data, and scored the rank variation. The URLs ranked on the upper page are weighted more than the lower-ranked URLs. At the beginning of the experiment, the difference between the scores of the two accounts was insignificant. As experiments continue, the number of random query words accumulated in the server increases and results show meaningful difference.