Search

The information and computer technology (ICT) development is currently developing smoothly, especially in education. The COVID-19 pandemic has made significant changes to some elements involving education and teaching system in various countries, especially Indonesia. Several educational institutions are rushing to develop e-learning as the teaching process and a comprehensive evaluation model for learning outcomes. This change cannot be avoided by the Akba College of Informatics and Computer Management (STMIK AKBA) which is also an educational institution, especially in the computer science sector. So the purpose of this research is to develop a subjective test application that can help students to maximize all the knowledge they have in the form of descriptions to answer the questions posed. Compared to other forms (multiple choice, true and false, etc.) this form is very flexible. The method used in developing this system was the system development life cycle (SDLC) which consists of 4 stages, namely planning, analysis, design, implementation, and maintenance. The system test technique used black box testing, expert validation and respondent test. The results showed that the system can run well based on the results of black box testing, as well as the results of the response analysis of several expert validators who stated that this system met the valid criteria. Meanwhile, the students' responses seemed very happy and they hoped that this system would be used in evaluating student learning outcomes at the end of the semester. [ABSTRACT FROM AUTHOR]

Peer-to-peer (P2P) computing and technology requirements have exploded in recent years, owing to their wide range of applications in almost every domain. P2P computing and file-sharing methods are now more accessible than ever thanks to advances in computer science and technology. The time it takes for the server to load tends to be lengthened as a result of this. The vast majority of data is held in massive libraries. Networks, on the other hand, cannot operate if several computers transmit large amounts of data over the same cable at the same time. When a computer transfers a large volume of data, other computers are summoned to assist in the processing of the information. The server and network become slow when large chunks of data are withdrawn from the network. The two processes are combined in this paper to reduce the load on the servers. The results are strong since the two algorithms are mixed. The NS2 simulator is used in the implementation. The two methods to be used are the Chunk Delivery with Adaptive Buffer Management Algorithms and the Chunk Delivery with Buffer Management Algorithms. It's based on the number of chunk requests sent to the same number of response providers. The results show that the performance validated the chunk scheduling and buffer management formula's effectiveness. [ABSTRACT FROM AUTHOR]

This paper presents an effort to incorporate assessment of manually assessed aspects in an automated code assessment process. Fully automated code assessment has its drawbacks which makes manual assessment of some aspects of student solutions a necessity. In most situations during the assessment of code written by students the most appropriate approach would thus be splitting the process in two phases - automatic plus manual. This might result in two completely distinct procedures for each of the phases. The solution proposed in this paper tries to join these procedures into one uniform process keeping the benefits from each. [ABSTRACT FROM AUTHOR]

Duplicated code detection has been an active research field for several decades. Although many algorithms have been proposed, only a few researches have focused on the comprehensive presentation of the detected clones. During the evaluation of clone detectors developed by the authors, it was observed that the results of the clone detectors were hard to comprehend. Therefore, in this paper a broadly suitable grouping method with which clone pairs can be easily grouped together to provide a more compact result is presented. [ABSTRACT FROM AUTHOR]

This paper presents a hybrid Water Flow-like Algorithm with Tabu Search for solving travelling salesman problem (WFA-TS-TSP).WFA has been proven its outstanding performances in solving TSP meanwhile TS is a conventional algorithm which has been used since decades to solve various combinatorial optimization problem including TSP. Hybridization between WFA with TS provides a better balance of exploration and exploitation criteria which are the key elements in determining the performance of one metaheuristic. TS use two different local search namely, 2opt and 3opt separately. The proposed WFA-TSTSP is tested on 23 sets on the well-known benchmarked symmetric TSP instances. The result shows that the proposed WFA-TSTSP has significant better quality solutions compared to WFA. The result also shows that the WFA-TS-TSP with 3-opt obtained the best quality solution. With the result obtained, it could be concluded that WFA has potential to be further improved by using hybrid technique or using better local search technique. [ABSTRACT FROM AUTHOR]

Most of the distributed transaction protocols rely on atomic commitment. Dealing with arbitrary failures effectively is a major operational challenge to be faced with. In the contemporary literature, protocols such as BFTDC [3] and PBFT [5] run an effective agreement protocol. The drawback with these protocols is that they incur increased message overhead as well as latency into the protocol execution. The paper presents an efficient byzantine fault tolerant distributed commit protocol. The proposed agreement protocol helps in achieving faster execution results using an effective view change mechanism. The protocol is computationally more efficient. It has lower message complexity and reduces the time overhead incurred in transaction processing. [ABSTRACT FROM AUTHOR]