Judul: Keanekaragaman Jenis Burung pada Beberapa Tipe Habitat di Areal Hutan Tanaman Industri PT Riau Andalan Pulp dann Paper dan Perkebunan Kelapa Sawit PT Duta Palma Nusantara Group Propinsi Dati I Riau
Abstrak: Perubahan hutan alam tropis menjadi hutan tanaman atau perkebunan, merupakan bentuk habitat baru yang berbeda dengan kondisi sebelumnya, dimana hutan tanaman dan pcikebunan hanya berupa tegakan vegetasi sejenis (monokultur) sedangkan hutan alam merupakan hutan dengan ekosistem heterogen terdiri atas berbagai jenis vegetasi dati strata. Perubahan tersebut mcngakibatkan perubahan komunitas dan penurunan jenis burung di dalamnya, yang pada akhirnya dapat menyebabkan terjadinya kepunahan lokal berbagai jenis burung. Dalam penelitian ini mengkaji keberadaan kawasan lindung yang merupakan sisa hutan alam di areal HTI sebagai salah satu upaya pelestarian burung di hutan tanaman tersebut dengan contoh lokasi pengamatan di HPTI (Hak Pengusahaan Hutan Tanaman Industri) Riau Andalan Pulp dan Paper serTa perkebunan kelapa sawit di areal PT. Duta Palma Nusantara Group.
Keyword: 

Judul: Variasi Keanekaragaman Jenis Burung pada Berbagai Tipe Tutupan Lahan di Kebun Sawit PT Tempirai Palm Resources Sumatera Selatan.
Abstrak: Perluasan perkebunan kelapa sawit di Indonesia, telah menuai banyak tudingan negatif yaitu sebagai penyebab utama meningkatnya laju deforestasi hutan dan penurunan keanekaragaman hayati termasuk keanekaragaman spesies burung. Tujuan dari penelitian ini membandingkan keanekaragaman dan tingkat kesamaan komunitas jenis burung pada berbagai tipe tutupan lahan. Penelitian telah dilakukan di Kebun Sawit PT Tempirai Palm Resources, Sumatera Selatan pada 6 tipe tutupan lahan yang berbeda, yaitu sawit muda (SM), sawit sedang (SS), sawit tua (ST), areal nilai konservasi tinggi (NKT), semak belukar (SB), dan kebun rakyat (KR). Pengambilan data burung digunakan metode kombinasi antara metode titik hitung (point count) dan metode transek jalur (strip transect method) serta dilakukan metode analisis vegetasi. Hasil penelitian menunjukkan jumlah jenis dan indeks kekayaan tertinggi pada tutupan lahan SB (S = 27, Dmg= 5.88), sedangkan terendah pada tutupan lahan SS (S = 13 jenis, Dmg = 3.02). Nilai indeks keanekaragaman, indeks kemerataan tertinggi terdapat pada tipe tutupan lahan NKT (H’ = 2.84, E = 0.92), sedangkan terendah pada tutupan lahan KR (H’= 2.15, E = 0.81). Kesamaan komunitas tertinggi adalah antara tutupan lahan SS dengan ST sebesar 0.59, sedangkan terendah antara tutupan lahan SB dan tutupan lahan ST sebesar 0.29.
Keyword: burung, keanekaragaman jenis, kelapa sawit, sumatera selatan, tutupan lahan

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