Judul: Keanekaragaman Jenis Kupu-kupu di Berbagai Tingkat Umur Lahan Pasca Terbakar di Taman Nasional Gunung Ciremai
Abstrak: Kebakaran hutan hampir setiap tahunnya terjadi di Taman Nasional Gunung Ciremai (TNGC) sehingga ada perbedaan umur lahan pasca terbakar yang diduga berpengaruh terhadap keanekaragaman jenis kupu-kupu. Penelitian bertujuan untuk menduga keanekaragaman dan komposisi jenis kupu-kupu, serta menduga kehilangan dan perolehan keanekaragaman jenis kupu-kupu sebagai akibat kebakaran di berbagai tingkat umur lahan pasca terbakar. Penelitian dilaksanakan pada 1 April hingga 21 Mei 2019 di tiga lokasi lahan pasca terbakar dengan umur yang berbeda. Metode yang digunakan yakni metode Pollard transect untuk inventarisasi keanekaragaman jenis kupu-kupu dan kemudian dianalisis untuk menghitung jumlah jenis kupu-kupu, indeks kekayaan, indeks keanekaragaman dan indeks kemerataan. Hasil penelitian menunjukkan bahwa ditemukan sebanyak 76 jenis kupu-kupu, indeks kekayaan jenis tertinggi pada lahan pasca terbakar berumur 2 tahun, indeks keanekaragaman tertinggi pada lahan pasca terbakar berumur 1 tahun, indeks kemerataan mendekati 1. Nilai perolehan keanekaragaman jenis kupu-kupu akibat kebakaran tertinggi pada lahan pasca terbakar berumur 4 tahun sebesar 84.21% sedangkan nilai kehilangan keanekaragaman jenis kupu-kupu akibat kebakaran tertinggi pada lahan berumur 2 tahun sebesar 45.71%.
Keyword: Kebakaran, kehilangan dan perolehan, kupu-kupu, TNGC

Judul: Perbandingan Keanekaragaman Jenis Kupu- Kupu antara Lahan Pasca Terbakar dan Tidak Terbakar di Hutan Tanaman Industri PT National Sago Prima, Provinsi Riau
Abstrak: Kebakaran hutan mengakibatkan kerugian secara ekologi dan ekonomi, termasuk kelestarian keanekaragaman kupu-kupu. Kupu-kupu adalah satwa polinator penting dan merupakan bioindikator lingkungan. Penelitian perbandingan keanekaragaman kupu-kupu khususnya antara lahan pasca terbakar dan tidak terbakar di hutan tanaman industri sagu belum banyak dilakukan, sehingga penelitian ini penting untuk dilakukan. Penelitian ini dilaksanakan pada bulan Februari-Maret 2017 dengan 10 jalur pengamatan di PT National Sago Prima dengan metode transek. Hasil pengamatan menunjukkan bahwa kupu-kupu yang ditemukan berjumlah 274 individu dari 26 jenis pada lahan pasca terbakar dan 19 jenis pada lahan tidak terbakar yang terdiri dari lima famili yaitu Papilionidae, Pieridae, Nympalidae, Lycanidae, dan Hesperidae. Nilai indeks keanekaragaman dan kekayaan tertinggi yaitu pada lahan pasca terbakar (H'=3.03, Dmg = 4.62), sedangkan terendah pada lahan tidak terbakar (H’= 2.14, Dmg= 3.79). Nilai indeks similaritas tertinggi yaitu antara jalur PT3 dengan TT3. Oleh karena itu, perubahan tutupan lahan menjadi hutan tanaman industri sagu menyebabkan adanya perbedaan nilai keanekaragaman kupu-kupu.
Keyword: keanekaragaman, PT National Sago Prima, lahan pasca terbakar dan tidak terbakar

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