QWERTY-based Arabic keyboard layouts have been in existence in order to assist QWERTY users in Arabic typing. However, there was lack of empirical evidence presenting the comparative usability of this layout and the common non-QWERTY-based Arabic keyboard layout. This study examined the usability of a QWERTY-based Arabic keyboard layout (QB) and the common non-QWERTY-based Arabic keyboard layout (NQB) from the perspective of QWERTY users, and compared the evaluation results between the two layouts. After experiments using within-subjects and between-subjects designs, the results showed that QB is significantly better in efficiency and learnability than NQB. QB also enabled more effective typing in almost all experiment designs, except in one between-subjects study. The relatively short interaction time of participants’ first encounter with Arabic keyboards possibly caused this exception. Most participants subjectively preferred QB to NQB in their overall usability.

Longtail tuna (Thunnus tonggol) is a pelagic fish which is generally found in tropical waters. Research on fishery resource sustainability by applying bioeconomic and length weight assessments is necessary to be done in order to determine status of longtail tuna. This research was conducted in south part of Java Sea namely Indramayu waters West Java from January 2020 to April 2020 which aims to estimate utilization status of longtail tuna (T. tonggol) namely exploitation rate, Maximum Sustainable Yield (MSY), Total Allowable Catch (TAC), Maximum Economic Yield (MEY), and Open Access (OA), and to determine length and weight relationship. The research used quantitative descriptive method based on catch and effort data from 2010 to 2019 as well as length weight primary data as much as 987 fish. Result showed that catch and effort at MSY level was 8,453 tons/year and 2,974 trips/year respectively with value of TAC as much as 6,762 ton/year. While the estimated values of catch and effort at MEY level was 8,168 tons/year and 2,427 trips/year with optimum profit as much as 88.98 billion Indonesia dollar rupiah (IDR). Another analysis indicated that OA level was achieved when effort reached at 4,855 trips/year and whilst exploitation rate was 93%. Meanwhile length weight relationship analysis showed that fish had a balance length weight growth which b value = 3.039 with equation W = 0.0147L3.0393. In conclusion, the fish has an isometric length weight relationship and the utilization status of fish is in fully exploited condition hence additional fishing effort must be prohibited in order to maintain stock sustainability.

ABSTRAKPerubahan kompleksitas jalur pada internet sejalan dengan meningkatnya perkembangan internet. Sehingga Network flow optimization menjadi permasalahan utama terkait dengan pemilihan rute terpendek (routing protocol) di balik kompleksitas jalur pada WAN. Algoritma yang digunakan pada routing protocol dirancang untuk memiliki kemampuan pencarian rute terpendek. Dengan perkembangan berbagai algoritma saat ini, apakah algoritma penentuan rute terpendek pada graf seperti A* dapat diterapkan untuk penentuan rute terpendek pada jaringan. Fokus pada penelitian ini yaitu mengetahui dan membandingkan proses komputasi dalam pencarian rute terpendek dengan algoritma Dijkstra dan algoritma A* guna mengurangi beban kerja jaringan. Penelitian dilakukan dengan simulasi pada topologi mesh yang menggunakan fiber link. Berdasarkan hasil simulasi dapat diketahui bahwa algoritma A* memiliki proses komputasi yang lebih sedikit dan jarak yang dihasilkan lebih pendek dibandingkan dengan algoritma Dijkstra. Oleh karena itu, algoritma A* dapat dipertimbangkan sebagai algoritma pada routing protocol.

Perubahan kompleksitas jalur pada internet sejalan dengan meningkatnya perkembangan internet. Sehingga Network flow optimization menjadi permasalahan utama terkait dengan pemilihan rute terpendek (routing protocol) di balik kompleksitas jalur pada WAN. Algoritma yang digunakan pada routing protocol dirancang untuk memiliki kemampuan pencarian rute terpendek. Dengan perkembangan berbagai algoritma saat ini, apakah algoritma penentuan rute terpendek pada graf seperti A* dapat diterapkan untuk penentuan rute terpendek pada jaringan. Fokus pada penelitian ini yaitu mengetahui dan membandingkan proses komputasi dalam pencarian rute terpendek dengan algoritma Dijkstra dan algoritma A* guna mengurangi beban kerja jaringan. Penelitian dilakukan dengan simulasi pada topologi mesh yang menggunakan fiber link. Berdasarkan hasil simulasi dapat diketahui bahwa algoritma A* memiliki proses komputasi yang lebih sedikit dan jarak yang dihasilkan lebih pendek dibandingkan dengan algoritma Dijkstra. Oleh karena itu, algoritma A* dapat dipertimbangkan sebagai algoritma pada routing protocol.