• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.615-617
• /
• 2014

The PS algorithm divides the tags within the identification range of reader into smaller groups by increasing the transmission power incrementally and identifies them. This algorithm uses the fixed frame size at every scan. Therefore, it has problems that the performance of PS algorithm can be variously shown according to the number of tags, frame size, and power level increase. In this paper, we propose an EPS algorithm that allocates the optimal frame size by estimating the number of tags at each scan.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.20 no.3
• /
• pp.171-185
• /
• 2009

This study analyzed the characteristics and patterns of tags in cultural heritage collections. Works of art were assembled to be tagged, 100 taggers were deployed, and tagging encourged. The gathered tags were analyzed in terms of general patterns, tagging's functions, and usefulness for information access. The results can be used to improve the access of works of art.

• Science of Emotion and Sensibility
• /
• v.16 no.1
• /
• pp.53-64
• /
• 2013

Folksonomies have potential problems caused by synonyms, tagging level, neologisms and so forth when retrieving music by tags. These problems can be tackled by introducing the mood intensity (Arousal and Valence value) of music as its internal tag. That is, if moods of music pieces and their mood tags are all represented internally by numeric values, A (Arousal) value and V (Valence) value, and they are retrieved by these values, then music pieces having similar mood with the mood tag of a query can be retrieved based on the similarity of their AV values though their tags are not exactly matched with the query. As a prerequisite study, in this paper, we propose the mapping table defining the relation between AV values and folksonomy tags. For analysis of the association between AV values and tags, ANOVA tests are performed on the test data collected from the well known music retrieval site last.fm. The results show that the P values for A values and V values are 0.0, which means the null hypotheses could be rejected and the alternative hypotheses could be adopted. Consequently, it is verified that the distribution of AV values depends on folksonomy tags.

• Journal of KIISE:Databases
• /
• v.36 no.3
• /
• pp.198-214
• /
• 2009

Trajectories of RFID tags can be modeled as a line, denoted by tag interval, captured by an RFID reader and indexed in a three-dimensional domain, with the axes being the tag identifier (TID), the location identifier (LID), and the time (TIME). Distribution of tag intervals in the domain space is an important factor for efficient processing of a query for tracing tags and is changed according to arranging coordinates of each domain. Particularly, the arrangement of LIDs in the domain has an effect on the performance of queries retrieving the traces of tags as times goes by because it provides the location information of tags. Therefore, it is necessary to determine the optimal ordering of LIDs in order to perform queries efficiently for retrieving tag intervals from the index. To do this, we propose LID proximity for reordering previously assigned LIDs to new LIDs and define the LID proximity function for storing tag intervals accessed together closely in index nodes when a query is processed. To determine the sequence of LIDs in the domain, we also propose a reordering scheme of LIDs based on LID proximity. Our experiments show that the proposed reordering scheme considerably improves the performance of Queries for tracing tag locations comparing with the previous method of assigning LIDs.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.6A
• /
• pp.63-73
• /
• 2008

RFID(Radio Frequency IDentification) system is an automated identification system that basically consists of tags and readers and Back-End-Databases. Tags and Readers communicate with each other by RF signal. As a reader can identify many tags in contactless manner using RF signal, RFID system is expected to do a new technology to replace a bar-code system in supply-chain management and payment system and access control and medical record and so on. However, RFID system creates new threats to the security of systems and privacy of individuals, Because tags and readers communicate with each other in insecure channel using RF signal. So many people are trying to study various manners to solve these problems against attacks, But they are difficult to apply to RFID system based on EPCglobal UHF Class-1 Generation-2 tags. Recently, Chien and Chen proposed a mutual Authentication protocol for RFID conforming to EPCglobal UHF Class-1 Generation-2 tags. we discover vulnerabilities of security and inefficiency about their protocol. Therefore, We analyze vulnerabilities of their protocol and propose an efficient mutual authentication protocol that improves security and efficiency.

• Journal of Industrial Technology
• /
• v.28 no.A
• /
• pp.177-184
• /
• 2008

A low loss frequency doubler operated on low power for the RFID harmonic tags is presented. Using the excellent nonlinear characteristics of the Schottky barrier diode and proper matching networks between the diode and ports, the low conversion loss of the harmonic tag is accomplished. This doubler could be used to increase the detectable distance of the conventional RFID system adopted harmonic tags.

• Proceedings of the Plant Resources Society of Korea Conference
• /
• v.18 no.1
• /
• pp.143-143
• /
• 2005

• Journal of information and communication convergence engineering
• /
• v.6 no.1
• /
• pp.24-28
• /
• 2008

In RFID System, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to anti-collision algorithm. Among the existing anti-collision algorithms, static framed slot allocation algorithm is very simple. But when the number of tags is variable, its performance degrades because of the fixed frame size. This paper proposes an optimal frame size allocation scheme that determines the frame size. The proposed scheme is based on the number of collision slots at every frame. According to the simulation results, the tag identification time is faster that of SFSA.

• Proceedings of the Safety Management and Science Conference
• /
• 2007.11a
• /
• pp.323-328
• /
• 2007

This paper introduces radio frequency identification(RFID) information technologies for item management such as application interface of data protocol, data encoding rules and logical memory functions for data protocol, and, unique identification for RF tags. This study presents reference architecture and definition of parameters to be standardized, various parameters for air intreface communications, and, application requirements profiles.

• Journal of Korea Multimedia Society
• /
• v.20 no.3
• /
• pp.562-570
• /
• 2017

One shot tasks like a MERSC handling policy, a cinema poster, and so on are too small, diverse, and sporadic to make them as apps or web applications. They are usually shared as the form of notes attached in the field or messages in smart phones. In order to support inter-operability with internet web sites, QR/NFC tags are attached to them. What matters in the web technology is that HTML5 standard does not supply the accessability of smart phones' resources like a camera, an audio, magnetic sensors, and etc. In this paper, we propose a universal smart phone application for handling various one-shot tasks in the same UI/UX. One-shot tasks are described with HTML5 web documents, and the URL for the web documents are stored in QR/NFC tags. A smart phone scans a tag, and then the web document is retrieved and presented finally. QR tags can be delivered to other smart phones through messages or SNS. We solve the problem of HTML5 standard supplying a resource access library with javascrippts. We suggested the whole architecture and the internal structure of QR/NFC tags. We show that our scheme is applicable to make variable one-shot tasks.