Judul: Keragaman Ordo Diptera (Insecta) di Gunung Kendeng dan Gunung Botol, Taman Nasional Gunung Halimun, Jawa Barat
Abstrak: Diptera termasuk ordo terbesar dari serangga selain Coleoptera, Lepidotera, dan Hymenoptera denganjumlah sekitar 150.000 spesies yang termasuk dalam 108 famili. Di a1am, Diptera berperan sebagai saprofag, agen pengendali hayati, dan bioindikator lingkungan. Penelitian ini bertujuan untuk mempelajari keragaman ordo Diptera di Gunung Kendeng dan Gunung Botol, Taman Nasional Gunung Halimun (INGH), Jawa Barat
Keyword: 

Judul: Keragaman ordo lepidoptera (insecta) di gunung Kendeng dan gunung Botol, Taman Nasional gunung Halimun, Jawa Barat
Abstrak: Lepidoptera memiliki sekitar 215 000 spesies, mencakup kupu-kupu dan ngengat yang memiliki berbagai peran. Lepidoptera dewasa memiliki peran penting yaitu membantu penyerbukan bunga dan merupakan pola dasar untuk seni. Beberapa jenis larva Lepidoptera memiliki peran yang menguntungkan antara lain menghasilkan bahan dasar sutera, tetapi dapat juga merugikan yaitu sebagai hama tanaman budidaya. Selain itu, larva Lepidoptera berperan sebagai defoliator, pengurai daun, predator atau ektoparasit pada serangga lain, sebagai agen pengendali biologi, dan indikator kualitas lingkungan. Penelitian ini bertujuan untuk mempelajari keragaman ordo Lepidoptera di Gunung Kendeng dan Gunung Botol, Taman Nasional Gunung Halimun (TNGH), Jawa Barat. Pengambilan sampel Lepidoptera dilakukan pada bulan Februari, Maret, dan Juni 2000 di dua lokasi yaitu di Gunung Kendeng (1000-1500 m dpl) dan di Gunung Botol (1500 - 1800 m dpl). Pengumpulan Lepidoptera dilakukan dengan menggunakan jaring serangga dan perangkap cahaya (light trup). Spesimen Lepidoptera yang didapatkan, diawetkan secara kering (Borror et al., 1996) dan secara basah dalam alkohol 70 %. Identifikasi spesimen berdasarkan Borror et al. (1996), Holloway et al. (1987), Nielsen & Common (1996). Analisis keragaman Lepidoptera dilakukan dengan menghitung indeks keragaman Shannon (H') dan sebarannya (E), indeks keragaman William (a), dan indeks kesamaan Jaccard (Cj). Dalam penelitian ini didapatkan 38 famili ordo Lepidoptera, terdiri dari 33 famili termasuk subordo Heterocera dan lima famili termasuk subordo Rhopalocera Keragaman famili di Gunung Kendeng (H = 2,37; a 5,67) lebih tinggi dibandingkan dengan Gunung Botol (H' 2,09; a 5,59). Kesamaan keragaman = = famili Lepidoptera antara Gunung Kendeng dengan Gunung Botol cukup rendah (Cj= 0,47). Perbedaan keragaman famili dari ordo Lepidoptera dipengaruhi oleh vegetasi. ketinggian tempat, suhu, kelembaban, cuaca, cahaya, dan parameter fisik kimia lainnya
Keyword: 

Judul: The Construction of Greedy SVP LLL Algorithm
Abstrak: A lattice is a set of all integer linear combination of a set of linearly independent vectors in ℝ𝑛���. The independent vectors are called bases of lattice. Any lattice can be generated from many bases, and these bases have the same cardinality. In the lattice, the most fundamental and renowned problem is the Shortest Vector Problem (SVP). SVP is a tracking problem of the shortest nonzero vector in a lattice with equivalent bases. In two dimensions, SVP problem has resolved exactly by Gauss’ algorithm. When the lattice dimension is higher than two, A.K. Lenstra, H.W. Lenstra and L. Lovasz gave a LLL algorithm to compute approximation of nonzero shortest vector in the lattice. Reduced bases solution obtained from LLL algorithm still be an approximation and has polynomial running time of arbitrary dimension which large enough. In 1994, Schnoor and Euchner modified this LLL algorithm as a new variant which later was named deep insertion LLL algorithm. This algorithm is a modified version of the LLL algorithm to the terms of the exchange step to improve the accuracy of output of LLL reduced bases and applying it to the subset sum problem. The purpose of this research are: (1) Reconstruct the LLL algorithm and deep insertion LLL algorithm using a geometric approach. (2) Construct a greedy SVP LLL algorithm. (3) Implement the three algorithms in a symbolic programming language, and evaluate them experimentally. A bases ℬ=[𝐛���1,𝐛���2,…,𝐛���𝑛���] in ℝ𝑚��� is called reduced LLL with parameter 𝛿��� if satisfies: (a) |𝜇���𝑗���𝑖���|≤12, for every integer 𝑖���,𝑗��� with 1≤𝑖���<𝑗���<𝑛���. (b)𝛿���‖𝜋���𝑗���(𝐛���𝑗���)‖2≤‖𝜋���𝑗���(𝐛���𝑗���+1)‖2, for 𝑗���=1,2,…,𝑛���−1,where 𝛿��� is a reduced parameter of real numbers with 14<𝛿���<1. The first requirement is the reduced basis 𝛿��� must “nearly orthogonal” and in its computation case, this requirement can be reached out by using the Gram-Schmidt’s orthogonalization. While the second requirement is called exchange step, or used to called as Lovasz condition. By using both of these requirements, then they establish the LLL algorithm. Then, Schnoor and Euchner modify the LLL algorithm based on the requirements of the exchange step called the deep insertion LLL algorithm, where the exchange step is based on the comparison of the projected vector in orthogonal complement [𝐛���1,𝐛���2,…,𝐛���𝑘���−1]⊥ after j-th reduction. To construct greedy SVP LLL algorithm, the requirements of the exchange step is based on purely by comparing norm of lattice 𝐛���𝑗��� with norm lattice 𝐛���𝑖��� for 𝑖���=1,2,3…,𝑗���−1. The process of insertion reduced vector after the exchange step also has done greedily. Then, we calculate the number of arithmetic operation in greedy SVP LLL algorithm for further analysis. The result of our exprimentation for three algorithms on the certain matrix size shows that the running time of the three algorithms increases propotional to the size of the matrix. The result also shows that by using 𝛿���=34 for the LLL algorithm and the deep insertion LLL algorithm, and the greedy SVP LLL algorithm which is a new variant made by using no parameter of 𝛿���, outperform of the other of two previous algorithm in terms of speed with the same output.
Keyword: LLL algorithm, LLL deep insertion algorithm, greedy SVP LLL algorithm