Judul: Studi habitat owa abu-abu (Hylobates moloch audebert, 1798) Di taman nasional gunung gede pangrango Jawa Barat
Abstrak: Owa Abu-abu (H. moloch) adalah salah satu primata yang keberadaannya dimasukkan dalam katagori endangered species oleh IUCN. Pelestarian satwa ini bila tidak secepatnya dilaksanakan, maka di masa yang akan datang keberadaannya dikhawatirkan akan punah. hulaan kary Salah satu upaya pelestarian yang dapat dilakukan adalah dengan cara memahami kondisi dan karakteristik habitat dimana Owa Abu-abu (H. moloch) hidup. butkan sumbe Penelitian ini bertujuan untuk mendapatkan tentang komposisi dan keanekaragaman jenis, data struktur vegetasi, penyebaran dan kelimpahan pohon sumber makanan, penyebaran pohon tempat tidur serta pemanfaatan habitat untuk aktivitas harian. Kesemuanya itu dimaksudkan untuk memberikan sumbangan pemikiran bagi usaha-usaha pelesta- rian Owa Abu-abu (H. moloch) di habitat aslinya. Kawasan hutan Blok Cadas Ngampar, DSK Cibodas adalah lokasi yang dipilih untuk penelitian habitat Owa Abu-abu (H. moloch). Lokasi ini terletak pada ketinggian 1.550 1.620 d.p.1., dengan kondisi kelerengan dari curam sampai sangat curam....
Keyword: 

Judul: Kajian habitat owa abu-abu (hytobates moloch audebert, 1798) di Cagar Alam Gunung Halimun, Propinsi Jawa Barat
Abstrak: Cagar Alam Gunung Halimun adalah salah satu kawasan pelestarian yang relatif utuh komposisi flora faunanya, dan merupakan habitat spesifik primata endemis Jawa Barat Owa Abu-abu (ii. moloch). Cagar Alam yang menempati tiga Kabupaten, yaitu Kabupaten Sukabumi, Kabupaten Bogor, dan Kabupaten Lebak ini memiliki luas ± 40.000 ha dan saat ini masih dibawah pengelolaan Balai Konservasi Sumberdaya Alam III Bogor. Owa Abu-abu (H. moloch) yang menempati beberapa lokasi pegunungan di Jawa Barat (Gunung Honje, Gunung Gede-Pangrango, Gunung Halimun dan Cagar Alam Leuweung Sancang) dengan populasi terbatas, telah dilindungi sejak tahun 1931 berdasarkan Ordonasi dan Peraturan Perlindungan Binatang Liar yang dikeluarkan oleh Pemerintah Kolonial Belanda. Owa Abu-abu (H. moloch) termasuk satwa langka yang dikawatirkan akan punah dengan memiliki status Endangered dalam Red Data Book IUCN dan Appendix I dari CITES.
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