This study explores the shift in behavior among high school students from traditional search engines to ChatGPT for learning support, using the Push-Pull- Mooring (PPM) model. Push factors include habit inertia, which may inhibit students from adopting new technologies. Pull factors, such as system and information quality, attract students to ChatGPT due to its efficiency and accuracy. Mooring factors, like switching costs, influence the transition. Al literacy is considered as a moderating variable. The research aims to identify key factors affecting students' switching behavior and the impact of Al literacy on this transition.

The main purpose of this study is to investigate the comparative effects of text-only and media-afforded student-provided explanations to online student-generated questions on English language learning. Four eighth-grade classes (n=118) participated in this study. An online learning system was adopted to support the activity. A non-equivalent pretest-posttest quasi-experimental design was used. The results of the analysis of covariance found that students in the text-only student-provided explanations group scored significantly higher than their counterparts in the media-afforded student-provided explanations group in terms of the use of learning strategies and social presence while no statistical differences were found in English language academic achievement.

Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata theory, such as writing pushdown acceptor and alternating Turing machines. They reduced the acceptance problems of above automata, which are exponential-time (EXPTIME) complete, to the AG circularity problem. These proofs thus show that the circularity problem is EXPTIME- hard , at least as hard as the most difficult problems in EXPTIME. However, none has shown that the problem is EXPTIME-complete. This paper presents an alternating Turing machine for the circularity problem. The alternating Turing machine requires polynomial space. Thus, the circularity problem is in EXPTIME and is then EXPTIME-complete.

Abstract ISO 10646 Universal Character Set (UCS) or Unicode covers symbols in most of the World's written languages. There are various UCS transformation formats (UTF). UTF‐8 is compatible with systems that assume 8‐bit characters. One of the problems with UTF‐8 is its space efficiency. For files containing most Asian characters such as Han ideographs, the file sizes increase by about 50% by using UTF‐8. Although the Standard Compression Scheme for Unicode (SCSU) can compress Unicode strings to the size of a locale‐specific character set, it is complicated and is not intended to serve as a general purpose interchange format. This paper proposes a page‐shift transformation format of ISO 10646, called UTF‐S. There are four pages: 1‐byte, 2‐byte, 3‐byte and 4‐byte. Shift to page 0 uses a special code $00_{16}$ ; shift to page 1, 2, and 3 uses ISO 2022 shift codes SO, SS2, and SS3, respectively. We test several text files and compare these UTF with Big5, a locale‐specific character set. The result shows that the space efficiency of UTF‐S is better than that of UTF‐16 and UTF‐8 and is close to that of SCSU. UTF‐S is suitable for replacing locale‐specific character sets with ISO 10646 in Internet applications, such as the World Wide Web. Copyright © 2001 John Wiley & Sons, Ltd.

Abstract ISO 10646 Universal Character Set (UCS) is a 31‐bit coding architecture that covers symbols in most of the world's written languages. Identifiers in programming languages are usually defined by using alphanumeric characters of ASCII, which represent mainly English words. An approach for working around this deficiency is to encode multilingual identifiers into the alphanumeric range of ASCII. For case‐sensitive languages, an encoding that utilizes [0–9][A–Z][a–z] can be more space‐efficient for multilingual identifiers. This paper proposes a base62 transformation format of ISO 10646 called UTF‐62. The resulting string of UTF‐62 is within a [0–9][A–Z][a–z] range, a total of 62 base characters. UTF‐62 also preserves the lexicographic sorting order of UCS‐4. Copyright © 2001 John Wiley & Sons, Ltd.

Character sets are one of the basic issues for information interchange. Most current national standard character sets extend 7-bit ASCII. These extensions conflict with each other and make the design of multilingual information systems complicated. Unicode or the Universal Character Set (UCS) is a character set that covers symbols in the major written languages. Text files and strings usually have no header to indicate which character set is in use, and they currently use one of the national standards by default. The transition from national standards to Unicode may take a longer time than expected. This paper presents the following methods to help the transition. (1) A text file format of fixed-width characters: if the first character in a text file is a nonzero control code, the file is in UCS; otherwise, it is in the default national standard. The control code indicates which UCS subset or byte order is in use. (2) A tagged string storage: each string has a tag representing which character set or coding format is in use, e.g., the default national standard, 8-bit subset of UCS-2, UCS-2, or UCS-4. (3) A method for assigning the format of string literals: all string literals use the same syntax notation, and their storage format is the same as that of their source files. These methods can improve multilingual support without introducing much complexity. Copyright © 2000 John Wiley & Sons, Ltd.

Allocating small code space to frequent symbols can achieve data compression. The well-known Huffman coding technique is the optimal method that allocates code space in an integral number of bits. By allocating code space precisely to a fraction of a bit, arithmetic coding achieves a better efficiency than Huffman coding. In arithmetic coding, the range of the code points is usually kept in [1/2, 1) by applying a normalization technique. This paper proposes a method that adjusts the range in [1/2d, 1). The range is allowed to decrease below 1/2 without applying normalization each time. This method reduces the number of shifts in normalization to 1/d. When d=8, normalization can be implemented byte-by-byte. This is particularly advantageous to applications where inputs and outputs are handled in bytes. We apply this method both to adaptive coding and semi-static coding. Timing results on four platforms are presented. Copyright © 1999 John Wiley & Sons, Ltd.

Cache performance in modern computers is important for program efficiency. A cache is thrashing if a significant amount of time is spent moving data between the memory and the cache. This paper presents two cache thrashing examples, one in scientific computing and one in image processing, both of which involve several one-dimensional arrays that are accessed sequentially, i.e., with unit strides. Accessing arrays in unit strides was considered very efficient on cache-based computer systems. However, the existence of cache thrashing is demonstrated by significant increases in computing speed in the equivalent programs tuned for cache locality. This shows that accessing several arrays sequentially may cause cache thrashing. Thus, to improve cache performance, it is important that the compiler or the programmer takes all arrays inside a loop into consideration. © 1997 by John Wiley & Sons, Ltd.

The demand for random numbers in scientific applications is increasing. However, the most widely used multiplicative, congruential random-number generators with modulus 2 31 - 1 have a cycle length of about 2.1 × 10 9 . Moreover, developing portable and efficient generators with a larger modulus such as 2 61 - 1 is more difficult than those with modulus 2 31 - 1. This article presents the development of multiplicative, congruential generators with modulus m = 2 p - 1 and four forms of multipliers: 2 k 1 - 2 k 2 , 2 k 1 + 2 k 2 , m - 2 k 1 + 2 k 2 , and m - 2 k 1 - 2 k 2 , k 1 > k 2. The multipliers for modulus 2 31 - 1 and 2 61 - 1 are measured by spectral tests, and the best ones are presented. The generators with these multipliers are portable and vary fast. They have also passed several empirical tests, including the frequency test, the run test, and the maximum-of-t test.

The efficiency of object-oriented programs has become a point of great interest. One necessary factor for program efficiency is the optimization techniques involved. This paper presents the performance of several variations of a given C++ program and compares them with a version that uses no object-oriented features. Our result indicates that some object-oriented features in C++ are not well optimized in current C++ compilers. We thus discuss some code optimization techniques that can improve the efficiency based on the given C++ program.

Parallel BLAS libraries have recently shown promise as a means of taking advantage of parallel computing in solving scientific problems. However, little work has been done on providing such a parallel library in LAN-connected workstations. Our motivation for this research lies in the strong belief that since LAN-connected workstations are highly cost-effective, it is important to study the issues in such environments. Dynamic load balancing is a method that allows parallel programs to run efficiently in LAN-connected workstations. Introducing dynamic load balancing leads to new design concerns for data distribution, sequential implementation, and library interfaces. Through a series of experiments, we investigate the influence of these factors. We also propose a set of guidelines for developing an efficient parallel Level 3 BLAS library.>

Although the circularity test problem for attribute grammars (AGs) has been proven to be intrinsically exponential, to date, a worst case for the existing circularity test algorithms has yet to be presented. This note presents a worst-case AG in which the number of incomparable dependency graphs induced at the root is exponential. The worst case can help to clarify the complexity of the problem.