A web-based Java programming learning assistant system (JPLAS) has been developed for novice students to study Java programming by themselves while enhancing code reading and code writing skills. One type of the implemented exercise problem is code writing problem (CWP), which asks students to create a source code that can pass the given test code. The correctness of this answer code is validated by running them on JUnit. In previous works, a Python-based answer code validation program was implemented to assist teachers. It automatically verifies the source codes from all the students for one test code, and reports the number of passed test cases by each code in the CSV file. While this program plays a crucial role in checking the correctness of code behaviors, it cannot detect code plagiarism that can often happen in programming courses. In this paper, we implement a code plagiarism checking function in the answer code validation program, and present its application results to a Java programming course at Okayama University, Japan. This function first removes the whitespace characters and the comments using the regular expressions. Next, it calculates the Levenshtein distance and similarity score for each pair of source codes from different students in the class. If the score is larger than a given threshold, they are regarded as plagiarism. Finally, it outputs the scores as a CSV file with the student IDs. For evaluations, we applied the proposed function to a total of 877 source codes for 45 CWP assignments submitted from 9 to 39 students and analyzed the results. It was found that (1) CWP assignments asking for shorter source codes generate higher scores than those for longer codes due to the use of test codes, (2) proper thresholds are different by assignments, and (3) some students often copied source codes from certain students.

The IEEE 802.11 wireless local-area network (WLAN) has been deployed around the globe as a major Internet access medium due to its low cost and high flexibility and capacity. Unfortunately, dense wireless networks can suffer from poor performance due to high levels of radio interference resulting from adjoining access points (APs). To address this problem, we studied the AP transmission power optimization method, which selects the maximum or minimum power supplied to each AP so that the average signal-to-interference ratio (SIR) among the concurrently communicating APs is maximized.However, this method requires measurements of receiving signal strength (RSS) under all the possible combinations of powers. It may need intolerable loads and time as the number of APs increases. It also only considers the use of channel bonding (CB), although non-CB sometimes achieves higher performance under high levels of interference. In this paper, we present an AP interface setup optimization method using the throughput estimation model for concurrently communicating APs. The proposed method selects CB or non-CB in addition to the maximum or minimum power for each AP. This model approach avoids expensive costs of RSS measurements under a number of combinations. To estimate the RSS at an AP from another AP or a host, the model needs the distance and the obstacles between them, such as walls. Then, by calculating the estimated RSS with the model and calculating the SIR from them, the AP interface setups for a lot of APs in a large-scale wireless network can be optimized on a computer in a very short time. For evaluation, we conducted extensive experiments using Raspberry Pi for APs and Linux PCs for hosts under 12 network topologies in three buildings at Okayama University, Japan, and Jatiya Kabi Kazi Nazrul Islam University, Bangladesh. The results confirm that the proposed method selects the best AP interface setup with the highest total throughput in any topology.