Judul: Perbandingan Keanekaragaman Jenis Herpetofauna antara Lahan Pasca Terbakar dan Tidak Terbakar di PT Waimusi Agroindah
Abstrak: yang mengalami kebakaran tersebut adalah PT Waimusi Agroindah. Tujuan penelitian ini yaitu untuk membandingkan keanekaragaman dan komposisi jenis herpetofauna setelah 4 tahun terbakar pada berbagai tutupan lahan di PT Waimusi Argroindah. Penelitian dilakukan di bulan Februari-Maret 2019 pada lahan pasca terbakar, lahan tidak terbakar, lahan kelapa sawit, dan areal NKT (Nilai Konservasi Tinggi). Metode yang digunakan yaitu VES (Visual Encounter Survey), transek dengan jalur, dan perangkap. Jenis yang ditemukan berjumlah 23 jenis yang teridiri dari 15 famili. Lahan tidak terbakar memiliki keanekaragaman lebih tinggi dengan jumlah 13 jenis dibandingkan dengan lahan pasca terbakar dengan jumlah 10 jenis. Nilai kemerataan dan nilai kekayaan pada lahan tidak terbakar lebih tinggi dibandingkan dengan lahan pasca terbakar yaitu berturut-turut 3.28 dan 0.89. Indeks kesamaan komunitas antara lahan pasca terbakar dan lahan tidak terbakar sebesar 0.87. Beberapa jenis herpetofauna yang ditemukan memiliki status konservasi dilindungi berdasarkan IUCN dan CITES.
Keyword: kekayaan, kemerataan, NKT, VES

Judul: Perbandingan Keanekaragaman Jenis Herpetofauna antara Lahan Pasca Terbakar dan Tidak Terbakar di Perkebunan Sawit PT Waimusi Agroindah, Sumatera Selatan
Abstrak: Indonesia mengalami kebakaran yang hebat tahun 2015. Kebakaran di duga berdampak terhadap penurunan keanekaragaman hayati, khususnya herpetofauna. Penelitian ini bertujuan untuk mengidentifikasi keanekaragaman jenis dan perbandingan komunitas antara lahan pasca terbakar, tidak terbakar dan kelapa sawit pada lahan gambut. Penelitian dilakukan pada bulan Februari dan Maret 2017. Metode yang digunakan adalah Visual Encouner Survey (VES) dengan kombinasi transect. Analisis vegetasi menggunakan metode jalur berpetak dengan membuat 5 plot 2m x 2m di setiap jalur. Analisis data yang digunakan adalah Index Kemerataan (E), Indeks Kekayaan (Dmg), dan Kesamaan Komunitas (IS). Berdasarkan pengamatan, di temukan 24 jenis herpetofauna (9 amfibi dan 15 reptil). Lahan pasca terbakar memiliki nilai kemerataan lebih rendah namun nilai kekayaan jenis lebih tinggi dibanding lahan tidak terbakar. Kesamaan komunitas antara lahan pasca terbakar dan lahan tidak terbakar adalah 0,56. Penelitian ini menunjukan bahwa kebakaran tidak menurunkan keanekaragaman jenis herpetofauna.
Keyword: keanekaragaman, kebakaran, herpetofauna, indeks kesamaan, sumatera selatan

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