[1]
A. Picciano, and J. Seaman, K-12 online learning: A survey of US schoold district administrators, Journal of Asynchronous Learning Networks, (2007), 11, 11-37.
DOI: 10.24059/olj.v11i3.1719
Google Scholar
[2]
R. Kaplan, and D. Saccuzzo, Psychological testing: Principles, applications, and issues, Wadsworth Pub Co, (2008).
Google Scholar
[3]
O. Meyer, Testing and assessment strategies, including alternative and new approaches, Toxicology letters, Elsevier, (2003), 140, 21-30.
DOI: 10.1016/s0378-4274(02)00492-7
Google Scholar
[4]
J. Millman, and J. A. Arter, Issues in item banking, Journal of Educational Measurement, (1984), 21, 315-330.
DOI: 10.1111/j.1745-3984.1984.tb01037.x
Google Scholar
[5]
C. Liu, Using mutual information for adaptive item comparison and student assessment, Educational Technology & Society, Citeseer, (2005), 8, 100-119.
Google Scholar
[6]
P. Brusilovsky, Methods and techniques of adaptive hypermedia, User modeling and user-adapted interaction, Springer, (1996), 6, 87-129.
DOI: 10.1007/bf00143964
Google Scholar
[7]
C. Forgy, Rete: A fast algorithm for the many pattern/many object pattern match problem, Artificial intelligence, Elsevier, (1982), 19, 17-37.
DOI: 10.1016/0004-3702(82)90020-0
Google Scholar
[8]
J. Smith, and S. Chang, VisualSEEk: a fully automated content-based image query system, Proceedings of the fourth ACM international conference on Multimedia, (1997), 87-98.
DOI: 10.1145/244130.244151
Google Scholar
[9]
M. Crochemore, T. Lecroq, and P. Eciently, Pattern matching and text compression algorithms, ACM Computing Surveys, (2003).
DOI: 10.1145/234313.234331
Google Scholar
[10]
D. Knuth, J. Morris Jr, and V. Pratt, Fast pattern matching in strings, SIAM journal on computing, (1977), 6, 323.
DOI: 10.1137/0206024
Google Scholar
[11]
R. Boyer, and J. Moore, A fast string searching algorithm, Communications of the ACM, ACM, (1977), 20, 762-772.
DOI: 10.1145/359842.359859
Google Scholar
[12]
A. Apostolico, and M. Crochemore, Optimal canonization of all substrings of a string, Information and Computation, Elsevier, (1991), 95, 76-95.
DOI: 10.1016/0890-5401(91)90016-u
Google Scholar
[13]
M. Crochemore, A. Czumaj, L. Gasieniec, S. Jarominek, T. Lecroq, W. Plandowski, and W. Rytter, Speeding up two string-matching algorithms, Algorithmica, Springer, (1994), 12, 247-267.
DOI: 10.1007/bf01185427
Google Scholar
[14]
L. Colussi, Fastest pattern matching in strings, Journal of Algorithms, Elsevier, (1994), 16, 163-189.
DOI: 10.1006/jagm.1994.1008
Google Scholar
[15]
D. Sunday, A very fast substring search algorithm, Communications of the ACM, ACM, (1990), 33, 132-142.
DOI: 10.1145/79173.79184
Google Scholar
[16]
Z. Feng, and T. TAKAOKA, On improving the average case of the Boyer-Moore string matching algorithm, Journal of Information Processing, (1988), 10, 173-177.
Google Scholar
[17]
T. Berry, and S. Ravindran, A fast string matching algorithm and experimental results, Proceedings of the Prague Stringology Club Workshop, (1999), 99, 16-28.
Google Scholar
[18]
T. Lecroq, A variation on the Boyer-Moore algorithm, Theoretical Computer Science, Citeseer, (1992), 92, 119-144.
DOI: 10.1016/0304-3975(92)90139-7
Google Scholar
[19]
R. Karp, and M. Rabin, Efficient randomized pattern-matching algorithms, IBM Journal of Research and Development, IBM, (1987), 31, 249-260.
DOI: 10.1147/rd.312.0249
Google Scholar
[20]
Information on http: / www. hle. com. tw.
Google Scholar
