Judul: Populasi Kangkareng Perut-Putih pada Areal Hutan yang Berbatasan dengan Kebun Sawit di Kotawaringin Barat.
Abstrak: Kangkareng perut-putih termasuk suku burung rangkong yang dapat menghuni habitat terbuka. Informasi keberadaannya di areal yang didominasi oleh kegiatan manusia belum banyak didokumentasikan. Tujuan penelitian ini adalah mengidentifikasi karakteristik habitat, menduga parameter populasi, dan pola sebaran serta menganalisis hubungan antara kepadatan dan karakteristik habitat kangkareng perut-putih. Karakteristik habitat bertengger dan makan kangkareng perut-putih yakni areal hutan yang jarang hingga terbuka dan ditumbuhi pohon tinggi berdiameter besar serta bertajuk jarang. Pohon pakan yang ditemukan antara lain Baccaurea sp, Ficus benjamina, Crudia teysmannii, Litsea ficoidea dan Shorea belangeran. Kelimpahan kangkareng perut putih di areal penelitian sebanyak 524 individu dengan kepadatan 74.95±31.68 individu/Km2, nisbah kelamin 1:0.75 dan menyebar mengelompok. Keberadaan kangkareng perut-putih untuk bertengger dipengaruhi oleh keragaman jenis tumbuhan bawah serta tiang dan pohon tempat bertengger, dan diameter tiang dan pohon (R2= 0.997, n= 10, p= 0.018). Keberadaan kangkareng perut-putih untuk makan dipengaruhi oleh kerapatan jenis tiang tempat makan dan strata pohon (R2= 0.996, n= 5, p= 0.021).
Keyword: habitat, kangkareng perut-putih, populasi

Judul: Studi Habitat Kangkareng Perut Putih (Anthracoceros coronatus convexus Temminck 1832) di taman wisata dan cagar alam Pnanjung Pangandaran Ciamis Jawa Barat
Abstrak: Kangkareng merupakan satwa liar dilindungi yang berstatus langka tetapi belum ditentukan katagorinya. Di Pulau Jawa khususnya, dengan semakin meningkatnya pembukaan wilayah hutan akibat pertambahan penduduk dan kebutuhan hidupnya, akan mengakibatkan semakin terdesaknya habitat burung liar tersebut. Tujuan penelitian adalah untuk mengetahui dan mempelajari habitat Kangkareng Perut Putih, khususnya yang berada di dalam kawasan Taman Wisata dan Cagar Alam Pananjung Pangandaran, terutama fungsi habitat sebagai tempat mencari makanan, tidur dan beristirahat. Diharapkan dari penelitian ini, didapatkan informasi yang bermanfaat bagi pengelolaan habitat Kangkareng. Penelitian ini meliputi pengamatan terhadap daerah penyebaran Kangkareng Perut Putih; tipe-tipe hutan yang digunakan Kangkareng sebagai habitat; keadaan, struktur dan komposisi habitat serta aktivitas. harian yang dilakukan Kangkareng pada masing-masing fungsi habitat (tempat mencari makanan, tidur dan istirahat). Dilakukan pengamatan selama dua bulan, mulai 15 Oktober 1989 sampai 16 Desember 1989. ...
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