• Title/Summary/Keyword: GEN1

Search Result 880, Processing Time 0.027 seconds

A Study on initial value Q of Anti-collision Algorithm in Gen2 Protocol Based RFID Systems (GEN2 기반 RFID 시스템에서의 충돌방지 알고리즘의 초기 값 Q에 대한 연구)

  • Im, Song-Bin;Oh, Young-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.5
    • /
    • pp.33-39
    • /
    • 2010
  • In this paper, we propose an improved anti-collision algorithm. We have designed an anti-collision unit using this algorithm for the 18000-6 Type C Class 1 Generation 2 standard (Gen2). The Gen2 standard uses a Q-algorithm for incremental method on the Dynamic Slot-Aloha algorithm. It has basically enhanced performance over the Slot-Aloha algorithm. Unfortunately, there are several non-clarified parts: initial value. If an incorrect value is selected, it causes degradation in performance. To increase throughput and system efficiency, and to decrease tag identification time, we propose an improved anti-collision algorithm. prorosed Q algorithm has an increment of 5% of system efficiency and a decrement of 9% of tag identification time.

Siphonostomatoid Copepoda (Crustacea) Associated with Invertebrates from Tropical Waters

  • Kim, Il-Hoi
    • Animal Systematics, Evolution and Diversity
    • /
    • no.nspc8
    • /
    • pp.1-176
    • /
    • 2010
  • Siphonostomatoid copepods associated with marine invertebrates are described from tropical waters of the West Indies and Madagascar. They belong to the families Asterocheridae (7 new genera and 39 new species), Dinopontiidae (one new species), and Nanaspididae (one new species). New taxa of the Asterocheridae are 14 species of Asterocheres (Asterocheres unioviger n. sp., A. trisetatus n. sp., A. bahamensis n. sp., A. tricuspis n. sp., A. plumosus n. sp., A. peniculatus n. sp., A. oricurvus n. sp., A. planus n. sp., A. sensilis n. sp., A. indivisus n. sp., A. nudicoxus n. sp., A. tenuipes n. sp., A. galeatus n. sp., and A. fastigatus n. sp.); 3 species of Hetairosynella n. gen. (Hetairosynella bifurcata n. sp.; H. angulata n. sp.; H. aculeata n. sp.); 15 species of Asteropontius (Asteropontius capillatus n. sp., A. membranulatus n. sp., A. plumatus n. sp., A. parvipes n. sp., A. humesi n. sp., A. angulatus n. sp., A. latioriger n. sp., A. magnisetiger n. sp., A. pinnatus n. sp., A. trifilis n. sp., A. orcafer n. sp., A. bilinguis n. sp., A. dentatus n. sp., A. minutisetiger n. sp., and A. bispinifer n. sp.); Collocherides minutus n. sp.; Cyclocheres sensilis n. gen. n. sp.; Stenomyzon edentatum n. gen. n. sp.; Cephalocheres flagellatus n. gen. n. sp.; Humesimyzon pusillum n. gen. n. sp.; Thermocheres validus n. gen. n. sp.; and Gascardama longisiphonata n. gen. n. sp. New taxa of the remaining two families are Stenopontius spinulatus n. sp. in the Dinopontiidae and Stephopontius ahni n. sp. in the Nanaspididae. Asterocheres crinoidicola Humes, Asteropontius genodon Stock, and Asteropontius ungellatus Stock are redescribed. Asteropontius gonioporae Kim is reported as a new record from Madagascar. A key to species of Asteropontius is provided.

The Study on Improvement of Reading Ability for Dyslexia Wearing Color filter lens (ChromaGenTM Lens) (칼라필터 렌즈(ChromaGenTM)를 이용한 읽기능력 향상에 대한 임상연구)

  • Lee, Seok-Ju;Park, Ji-Hoon;Lee, So-Hee;Whang, Kwang-Ha;Ryu, Guen-Chang
    • Journal of Korean Ophthalmic Optics Society
    • /
    • v.16 no.1
    • /
    • pp.65-74
    • /
    • 2011
  • Purpose: In this study we investigated improvement degree of reading ability of the student who was in a condition of dyslexia symptoms by wearing $ChromaGen^{TM}$ lenses. Methods: After wearing the $ChromaGen^{TM}$ lens for 3 months, the dyslexia symptoms corrective lens, 52 students who had suspected symptom of dyslexia were asked questions, and we measured the improvement degree of reading ability of the student. Results: The $ChromaGen^{TM}$ wearer read 110.26${\pm}$22.07 words in 1 minute, and naked yeses or glass wearing students read 106.42${\pm}$22.70 words. Reading ability of the student having suspected symptom of dyslexia were measured after wearing $ChromaGen^{TM}$ for 3 months. The results showed improvement reading ability of 3.70${\pm}$0.29 (p=0.01, t=2.26), 4.50%${\pm}$0.10 (p=0.01, t=2.78) for $ChromaGen^{TM}$ wearer with statistical difference. A survey on the satisfaction of reading improvement with wearing $ChromaGen^{TM}$ showed that 88.4% of questioned person answered wearing $ChromaGen^{TM}$ had improved their dyslexia symptoms. Conclusions: With statisical significance (p<0.05). this study suggests that $ChromaGen^{TM}$ lens has an effect on improving reading speed of dyslexia patient. We know from these results that the $ChromaGen^{TM}$ lens which is used to dyslexia had an effect to improvement of reading speed for dyslexia. And the results of this study is statistically different (p<0.05).

EPCglobal Class-1 Gen-2 Anti-collision Algorithm with Tag Number Estimation Scheme (태그 수 추정 기법을 적용한 EPCglobal Class-1 Gen-2 충돌방지 알고리즘)

  • Lim, In-Taek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.5
    • /
    • pp.1133-1138
    • /
    • 2010
  • In the anti-collision scheme proposed by EPCglobal Class-1 Gen-2 standard, the frame size for a query round is determined by Q-algorithm. In the Q-algorithm, the reader calculates a frame size without estimating the number of tags in it's identification range. It uses only the slot status. Therefore, Q-algorithm has advantage that the reader's algorithm is simpler than other algorithms. However, it cannot allocate an optimized frame size because it does not consider the number of tags. Also, the conventional Q-algorithm does not define an optimized parameter value C for adjusting the frame size. In this paper, we propose a modified Q-algorithm and evaluate the performance with computer simulations. The proposed Q-algorithm estimates the number of tags at every query round, and determines the parameter value C based on the estimated number of tags.

Six new species of Copepoda (Clausiidae, Pseudanthessiidae, Polyankyliidae) associated with polychaetes from Korea

  • Kim, Il-Hoi
    • Journal of Species Research
    • /
    • v.3 no.2
    • /
    • pp.95-122
    • /
    • 2014
  • Six new species of copepods associated with polychaetes are described from Korea. Included are Indoclausia bipartita n. sp., Clausia parva n. sp., and Maxilliclausia propria n. gen. n. sp. in the Clausiidae; Pseudanthessius excertus n. sp. in the Pseudanthessiidae; and Polyankylis ovilaxa n. sp. and Sewelloya plana n. gen. n. sp. in the Polyankyliidae. The new genus Maxilliclausia has a peculiar maxilla in which the distal segment forms a sucking disk, a non-prehensile antenna, vestigial legs 3 and 5, and lacks a maxilliped and leg 4. The two new species of the Polyankyllidae are discovered as external associates of terebellid polychaetes. The new genus Sewelloya has a simple female maxilliped bearing only two small setae on its terminal segment, an uniramous leg 4 bearing 1-segmented exopod, and a reduced leg 5 represented by three setae. The genera Terebelliphilus Kim, 2001 which was originally placed in the Sabelliphilidae, and Octophiophora Stock, 1988 and Stockia Sebastian and Pillai, 1974, both of the latters with uncertain familial positions, are transferred to the Polyankyliidae. A key to five genera of the Polyankyliidae are provided.

Weight Decision Scheme based on Slot-Count in Gen-2 Q-Algorithm

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.2
    • /
    • pp.172-176
    • /
    • 2011
  • In the Gen-2 Q-algorithm, the values of weight C, which is the parameter for incrementing or decrementing the slot-count size, are not optimized in the standard. However, the standard suggests that the reader uses small values of C when the slot-count is large and larger values of C when the slot-count is small. In this case, if the reader selects an inappropriate weight, there are a lot of empty or collided slots. As a result, the performance will be declined because the frame size does not converge to the optimal point quickly during the query round. In this paper, we propose a scheme to select the weight based on the slot-count size of current query round. Through various computer simulations, it is demonstrated that the proposed scheme achieves more stable performances than Gen-2 Q-algorithm.

Initial Slot-Count Selection Scheme with Tag Number Estimation in Gen-2 RFID System

  • Lim, In-Taek;Ryu, Young-Tae
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.5
    • /
    • pp.519-523
    • /
    • 2010
  • In Gen-2 RFID system, the initial value of $Q_{fp}$, which is the slot-count parameter of Q-algorithm, is not defined in the standard. In this case, if the number of tags within the reader's identification range is small and we let the initial $Q_{fp}$ be large, the number of empty slot will be large. On the other hand, if we let the initial $Q_{fp}$ be small in spite of many tags, almost all the slots will be collided. As a result, the performance will be declined because the frame size does not converge to the optimal point quickly during the query round. In this paper, we propose a scheme to allocate the optimal initial $Q_{fp}$ through the tag number estimation before the query round begins. Through computer simulations, it is demonstrated that the proposed scheme achieves more stable performance than Gen-2 Q-algorithm.

Performance Analysis of EPCglobl Gen-2 Q-Algorithm According to Weight and Initial Slot-Count

  • Lim, Intaek;Choi, Jin-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.10a
    • /
    • pp.635-637
    • /
    • 2012
  • In Gen-2 Q-algorithm, the value of initial $Q_{fp}$ and weight C is not defined in the standard. If we let the initial $Q_{fp}$ be large or small, the number of empty slot will be large during the initial query round or almost all the slots will be collided, respectively. Also, if the reader selects an inappropriate weight, there are a lot of empty or collided slots. As a result, it is anticipated that the performance will be declined because the frame size does not converge to the optimal point quickly during the query round. In this paper, we analyze how the performances of Gen-2 Q-algorithm will be affected by the weight and initial slot-count size.

  • PDF

Variability in the coat protein genes of two orchid viruses from Phlaenopsis orchids in Korea

  • Park, S.H.;H.R. Lim;G.D. Ye;K.H. Ryu
    • Proceedings of the Korean Society of Plant Pathology Conference
    • /
    • 2003.10a
    • /
    • pp.145.1-145
    • /
    • 2003
  • This study was conducted to designing conserved regions of molecules for virus-derived resistance to transgenic Phlaenopsis orchids to protect against two major orchid viruses, Cymbidum mosaic virus (CymMV) and Odontoglossum ringspot virus (ORSV). Infected leaf samples of Phalaenopsis were randomly screened by the RT-PCR with specific primers to both of viruses. RT-PCR products of the viruses were cloned and their nucleotide sequences were determined. Multiple alignments of coat protein (CP) genes of the viruses revealed that over the 88 % and 94 % identities with CymMV and ORSV, respectively, were observed. These data can be useful for selection of highly conserved regions of CP gene of the viruses for transgenic orchid experiments.

  • PDF

SwiftQ: A Time-Efficient RFID Collision Arbitration Algorithm for Gen2-Based RFID Systems

  • Donghwan Lee;Wonjun Lee
    • Journal of Information Processing Systems
    • /
    • v.20 no.3
    • /
    • pp.307-316
    • /
    • 2024
  • In the realm of large-scale identification deployments, the EPCglobal Class-1 Generation-2 (Gen2) standard serves as a cornerstone, facilitating rapid processing of numerous passive RFID tags. The Q-Algorithm has garnered considerable attention for its potential to markedly enhance the efficiency of Gen2-based RFID systems with minimal adjustments. This paper introduces a groundbreaking iteration of the Q-Algorithm, termed Time-Efficient Q-Algorithm (SwiftQ), specifically designed to push the boundaries of time efficiency within Gen2-based RFID systems. Through exhaustive simulations, our study substantiates that SwiftQ outperforms existing algorithms by a significant margin, demonstrating exceptional expediency that positions it as a formidable contender in the landscape of large-scale identification environments. By prioritizing time efficiency, SwiftQ offers a promising solution to meet the escalating demands of contemporary Internet of Things applications, underscoring its potential to catalyze advancements in RFID technology for diverse industrial and logistical contexts.