• Journal of information and communication convergence engineering
• /
• v.9 no.3
• /
• pp.260-265
• /
• 2011

In RFID System, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to anti-collision algorithm. In 13.56MHz RFID system, STAC protocol is defined as an anti-collision algorithm for multiple tag reading. In STAC protocol, there is no differentiation between the collided tags and others in the identification process. Therefore, tags may never be successfully identified because its responses may always collide with others. This situation may cause the tag starvation problem. This paper proposes a fair identification scheme for STAC protocol. In the proposed scheme, if the number of collided slots is large during a query round, the reader broadcasts a CollisionRound command to begin a collision round. During the collision round, the reader identifies only tags that are experienced collision during the previous query round.

• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.1
• /
• pp.55-60
• /
• 2012

Recent botnets are widely using the DNS services at the connection of C&C server in order to evade botnet's detection. It is necessary to study on DNS analysis in order to counteract anomaly-based technique using the DNS. This paper studies collection of DNS traffic for experimental data and supervised learning for DNS traffic-based malicious domain classification such as query of domain name corresponding to C&C server from zombies. Especially, this paper would aim to determine significant features of DNS-based classification system for malicious domain extraction by the Principal Component Analysis(PCA).

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.5
• /
• pp.92-95
• /
• 1997

Thlephone pushbuttons simply consist of 0~9 digits, #, and ${\ast}$). So it is difficulty for user to input the various query command for information retrieval of audio response sevice. We suggest the new retrieval algorithm for audio response service using Korean initial sounds sequences. User those who do not know the retrieval code can retrieve the audio response service by pushing the telephone digit buttons which correspond to initial sounds of its name.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.41-51
• /
• 2003

The spatiotemporal database concerns about the time-varying spatial attributes. One of the important research areas is related to the support of various location-based services in motile communication environments. It is known that database systems may be difficult to manage the accurate geometric locations of moving objects due to their continual changes of locations. However, this requirement is necessary in various spatiotemporal applications including mobile communications, traffic control and military command and control (C2) systems. In this paper we propose the $B^{st}$-tree that utilizes the concept of multi-version B-trees. It provides an indexing method (or the historical and future range query Processing on moving object's trajectories. Also we present a dynamic version management algorithm that determines the appropriate version evolution induced by the mobility patterns to keep the query performance. With experiments we .;hi)w that our indexing approach is a viable alternative in this area.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.7
• /
• pp.834-839
• /
• 2005

When a great variety of services become available to user through the broadband convergence network in the ubiquitous home environment, an intelligent agent is required to deal with the complexity of services and perceive intension of a user. Different from the old-fashioned command-based user interface for selecting services, conversation enables flexible and rich interactions between human and agents, but diverse expressions of the user's background and context make conversation hard to implement by using either user-initiative or system-initiative methods. To deal with the ambiguity of diverse expressions between user and agents, we have to apply hierarchial bayesian networks for the mixed initiative conversation. Missing information from user's query is analyzed by hierarchial bayesian networks to inference the user's intension so that can be collected through the agent's query. We have implemented this approach in ubiquitous home environment by implementing simulation program.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.1
• /
• pp.89-98
• /
• 2022

As deep learning technology was applied to various fields, research on adversarial attack techniques, a security problem of deep learning models, was actively studied. adversarial attacks have been mainly studied in the field of images. Recently, they have even developed a complete decision-based attack technique that can attack with just the classification results of the model. However, in the case of the audio field, research is relatively slow. In this paper, we applied several decision-based attack techniques to the audio field and improved state-of-the-art attack techniques. State-of-the-art decision-attack techniques have the disadvantage of requiring many queries for gradient approximation. In this paper, we improve query efficiency by proposing a method of reducing the vector search space required for gradient approximation. Experimental results showed that the attack success rate was increased by 50%, and the difference between original audio and adversarial examples was reduced by 75%, proving that our method could generate adversarial examples with smaller noise.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.3
• /
• pp.68-76
• /
• 2016

The pre-paid nation-wide interoperable transportation card, which an pay fee of bus, subway, train, and highway with just one card, released in June. 2014. It has started and operated from Seoul, Gyeonggi, and major local metropolitan area. In this paper, after starting of service, we evaluate conformance and interoperability of nation-wide interoperable transportation card system in real situation. Through this, we check the status of its technical operation. For this, we choose 6 region included Seoul, Gyeonggi which are serviced by different transport vendors and check recognition and billing result from field of transportation card terminal. As a result, we can reach that the major nation-wide interoperable transportation card operate normally and deliver CONFIG DF query command. It means nation-wide interoperable transportation card system which use only one card stably adapt the public transport system and it can make user's public transport use convenience higher through the extension of service area.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.4
• /
• pp.669-677
• /
• 2020

As the number of Internet users exploded, attacks on the web increased. In addition, the attack patterns have been diversified to bypass existing defense techniques. Traditional web firewalls are difficult to detect attacks of unknown patterns.Therefore, the method of detecting abnormal behavior by artificial intelligence has been studied as an alternative. Specifically, attempts have been made to apply natural language processing techniques because the type of script or query being exploited consists of text. However, because there are many unknown words in scripts and queries, natural language processing requires a different approach. In this paper, we propose a new classification model which uses byte pair encoding (BPE) technology to learn the embedding vector, that is often used for web attack payloads, and uses an attention mechanism-based Bi-GRU neural network to extract a set of tokens that learn their order and importance. For major web attacks such as SQL injection, cross-site scripting, and command injection attacks, the accuracy of the proposed classification method is about 0.9990 and its accuracy outperforms the model suggested in the previous study.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.11
• /
• pp.127-133
• /
• 2019

SQL is the most common language in data processing. Therefore, most of the colleges offer SQL in their curriculum. In this research, an auto scoring SQL test is proposed for the efficient results of SQL education. The system was treated with algorithms instead of using expensive DBMS(Data Base Management System) for automatic scoring, and satisfactory results were produced. For this system, the test question bank was established out of 'personnel management' and 'academic management'. It provides users with different sets of test each time. Scoring was done by dividing tables into two sections. The one that does not change the table(select) and the other that actually changes the table(update, insert, delete). In the case of a search, the answer and response were executed at first and then the results were compared and processed, the user's answers are evaluated by comparing the table with the correct answer. Modification, insertion, and deletion of table actually changes the data table, so data was restored by using ROLLBACK command. This system was implemented and tested 772 times on the 88 students in Computer Information Division of our college. The results of the implementation show that the average scoring time for a test consisting of 10 questions is 0.052 seconds, and the performance of this system is distinguished considering that multiple responses cannot be processed at the same time by a human grader, we want to develop a problem system that takes into account the difficulty of the problem into account near future.