Claim Missing Document
Check
Articles

Found 6 Documents
Search

PENGARUH MINAT PADA LAGU BAHASA INGGRIS TERHADAP KEMAHIRAN MENDENGARKAN SISWA DI SMA KRISTEN IRENE MANADO ANGMALISANG, HELEN YULIANA
JURNAL ELEKTRONIK FAKULTAS SASTRA UNIVERSITAS SAM RATULANGI Vol 1, No 1 (2013)
Publisher : JURNAL ELEKTRONIK FAKULTAS SASTRA UNIVERSITAS SAM RATULANGI

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

This skripsi is entitled ?Pengaruh Minat pada Lagu Bahasa Inggris terhadap Kemahiran Mendengarkan Siswa di SMA Kristen Irene Manado?. The objective of this research is to analyze in what extent the interest in English songs have an effect on students? listening skills in SMA Kristen Irene Manado. This research is based on the theory of Slameto (2010) stating that learning is more successful when dealing with interest of students. In conducting this study, the writer uses quantitative approach in order to investigate a particular population or sample with data collection using research instruments, and data analysis focusing on quantitative/statistical analysis to test the hypotheses that have been set. Questionnaire and test are used as the research instruments. The population of this research is the students in SMA Kristen Irene, and the sample is the twelve grader students as many as 31 students. The data is analyzed using regression-correlation analysis. The result of this research shows a significantly positive correlation between interest in English songs and listening skills. The effect of interest in English songs to listening skills is 71.1%. In conclusion, interest in listening to English songs makes people repeatedly do the activities that are related with English songs, with pleasant feelings which also add new knowledge. This knowledge helps listeners understand what they listen to. In addition, this interest also helps the listening process, since people?s attention is amplified when accompanied with personal interest, which help the listening process to be more effective. Keywords: interest, song, listening skills
Leaders and followers algorithm for constrained non-linear optimization Helen Yuliana Angmalisang; Syaiful Anam; Sobri Abusini
Indonesian Journal of Electrical Engineering and Computer Science Vol 13, No 1: January 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v13.i1.pp162-169

Abstract

Leaders and Followers algorithm was a novel metaheuristics proposed by Yasser Gonzalez-Fernandez and Stephen Chen. In solving unconstrained optimization, it performed better exploration than other well-known metaheuristics, e.g. Genetic Algorithm, Particle Swarm Optimization and Differential Evolution. Therefore, it performed well in multi-modal problems. In this paper, Leaders and Followers was modified for constrained non-linear optimization. Several well-known benchmark problems for constrained optimization were used to evaluate the proposed algorithm. The result of the evaluation showed that the proposed algorithm consistently and successfully found the optimal solution of low dimensional constrained optimization problems and high dimensional optimization with high number of linear inequality constraint only. Moreover, the proposed algorithm had difficulty in solving high dimensional optimization problem with non-linear constraints and any problem which has more than one equality constraint. In the comparison with other metaheuristics, Leaders and Followers had better performance in overall benchmark problems.
Leaders and Followers Algorithm for Balanced Transportation Problem Helen Yuliana Angmalisang; Harrychoon Angmalisang; Sylvia Jane Sumarauw
Computer Engineering and Applications Journal Vol 12 No 2 (2023)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18495/comengapp.v12i2.436

Abstract

Leaders and Followers algorithm is a metaheuristic algorithm which uses two sets of solutions and avoid comparison between random exploratory sample solutions and the best solutions. In this paper, it is used to solve the balanced transportation problem. There are some modifications in the proposed algorithm in order to fit the algorithm to the problem. The proposed algorithm is evaluated using 138 problems. The results are better than the results obtained by other algorithm from previous studies. Overall, Leaders and Followers algorithm has no difficulty in finding optimal solution, even in problems that have large dimension, number of supply and number of demands.
Leaders and Followers Algorithm for Balanced Transportation Problem Angmalisang, Helen Yuliana; Angmalisang, Harrychoon; Sumarauw, Sylvia J. A.
Computer Engineering and Applications Journal (ComEngApp) Vol. 12 No. 2 (2023)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Leaders and Followers algorithm is a metaheuristic algorithm which uses two sets of solutions and avoid comparison between random exploratory sample solutions and the best solutions. In this paper, it is used to solve the balanced transportation problem. There are some modifications in the proposed algorithm in order to fit the algorithm to the problem. The proposed algorithm is evaluated using 138 problems. The results are better than the results obtained by other algorithm from previous studies. Overall, Leaders and Followers algorithm has no difficulty in finding optimal solution, even in problems that have large dimension, number of supply and number of demands.
LEADERS AND FOLLOWERS ALGORITHM FOR TRAVELING SALESMAN PROBLEM Angmalisang, Helen Yuliana; Anam, Syaiful
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 18 No 1 (2024): BAREKENG: Journal of Mathematics and Its Application
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol18iss1pp0449-0456

Abstract

Leaders and Followers algorithm is a metaheuristics algorithm. In solving continuous optimization, this algorithm is proved to be better than other well-known algorithms, such as Genetic Algorithm and Particle Swarm Optimization. This paper aims to apply the Leaders and Followers algorithm for the Traveling Salesman Problem (TSP), a well-known combinatorial optimization problem to minimize distance. There are some modifications in order to fit the algorithm in TSP problems. Some most-used-problems in TSP are used to test this algorithm. The result is that the Leaders and Followers algorithm performs well, stable, and guarantees the optimality of the obtained solution in TSP with fewer than 20 cities. In TSP with a bigger number of cities, the proposed algorithm is not stable and might has difficulties in finding the optimal solutions.
Leaders and Followers Algorithm for the Binary Knapsack Problem Angmalisang, Helen Yuliana; Angmalisang, Harrychoon; Anggriani, Nita
MALCOM: Indonesian Journal of Machine Learning and Computer Science Vol. 5 No. 4 (2025): MALCOM October 2025
Publisher : Institut Riset dan Publikasi Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.57152/malcom.v5i4.2164

Abstract

The Leaders and Followers (LaF) algorithm, as a relatively recent metaheuristic compared to other well-established algorithms, has demonstrated strong performance in solving continuous constrained optimization problems, the balanced transportation problem, and the traveling salesman problem. The distinctive feature of the LaF algorithm lies in its dual-population structure, where two groups operate with different roles, namely exploration and exploitation, to balance search diversity and convergence. This design effectively prevents premature convergence. In this study, the LaF algorithm is applied to address the binary knapsack problem. The proposed algorithm was evaluated using a well-established benchmark dataset for this problem. The results indicate that the LaF algorithm exhibits stable performance in solving binary knapsack problems with moderately sized capacities and outperforms several other metaheuristic algorithms