Query Round Research Articles

태그 수 추정 기법을 적용한 EPCglobal Class-1 Gen-2 충돌방지 알고리즘

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.

Performance Evaluation of Q-Algorithm with Tag Number Estimation Scheme

EPCglobal Class-1 Gen-2 standard proposed Q-algorithm to select a frame size for the next query round. Q-algorithm calculates the frame size without estimating the number of tags. Therefore, the Q-algorithm has advantage that the reader's algorithm is simpler than other algorithms. However, it is impossible to allocate the optimized frame size. 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 with the tag number estimation scheme, and evaluate the performance with computer simulations.

Identifying a School Counseling Research Agenda: A Delphi Study

The authors conducted a Delphi study to identify important research questions regarding school counseling. During 3 consecutive rounds of e-mail queries, an expert panel of 21 school counseling educators and practitioners were asked to identify the goals of school counseling research, develop specific research questions, and rate the importance of the questions. The highest rated research questions concerned school counseling interventions that have an impact on academic achievement and the effects of school counseling programs on student outcomes. The panel's final list of 42 research questions can help counselor educators, graduate students, and practitioners develop research projects that most effectively meet the needs of the field.

On truth-table reducibility to SAT

We show that polynomial time truth-table reducibility via Boolean circuits to SAT is the same as logspace truth-table reducibility via Boolean formulas to SAT and the same as logspace Turing reducibility to SAT. In addition, we prove that a constant number of rounds of parallel queries to SAT is equivalent to one round of parallel queries. We give an oracle relative to which Δ 2 p is not equal to the class of predicates polynomial time truth-table reducible to SAT.