Judul: Perilaku Harian Rusa Totol (Axis axis) yang Dikembangbiakkan di Padang Rumput Halaman Istana Negara Bogor
Abstrak: Tujuan penelitian ini untuk mendapatkan informasi perilaku aktivitas harian rusa Totol (Axis axis terutama karakteristik perilaku makan rusa Totol serta perkebangan populasi rusa di padang pengembalaan. Pelaksanaan penelitian selama empat bulan yang dimuali bulan Maret sampai dengan bulan Juli tahun 2000 di padang rumput Istana Negara Bogor. Metode intensitas perilaku digunakan, untuk pengamatan perilaku langsung, dan pengamatan karakteristik khusus, terutama pada komposisi umur rusa dalam populasi dan pengamatan perilaku makan rusa. Peubah yamg dianalisis antara lain karakteristik populasi, perilaku harian, perilaku makan, daerah jelajah, penggunaan gerak beserta tanaman diatasnya.
Keyword: 

Judul: Kajian Kesejahteraan Rusa Totol (Axis axis) di Kawasan Wisata Alam Kampung Batu Malakasari Baleendah Kabupaten Bandung
Abstrak: Penelitian ini bertujuan untuk mempelajari kesejahteraan hewan pada rusa totol (Axis axis) di kawasan wisata alam Kampung Batu Malakasari Baleendah Kabupaten Bandung. Data diperoleh dengan melihat kondisi kawasan wisata mengukur area wisata, mengukur area kandang rusa, menghitung jumlah populasi rusa dan menghitung takaran nutrisi pakan rusa. Parameter penilaian kesejahteraan hewan diamati menggunakan penilaian checklist kesejahteraan hewan. Pemeriksaan feses dilakukan pada semua populasi rusa untuk mengamati kondisi kesehatan terkait dengan kesejahteraan hewan. Hasil pengamatan menunjukan bahwa wisata alam memiliki luas area 5.5 Ha dan luas area pemeliharaan rusa 1827 m² dengan fasilitas tempat pakan, tempat minum dan area berlindung. Jumlah populasi rusa sebanyak 19 ekor pada musim kemarau dan 20 ekor pada musim hujan. Jenis pakan yang diberikan ubi, ampas tahu dan rumput. Rata - rata jumlah pakan yang diberikan setiap harinya 50 kg ubi, 20 kg ampas tahu dan 50 kg rumput. Berdasarkan penilaian checklist kesejahteran hewan maka kesejahteraan rusa di kawasan wisata alam Kampung Batu Malakasari dalam kondisi belum baik. Berdasarkan pemeriksaan feses pada musim kemarau diperoleh 2 ekor rusa terinfeksi cacing nematoda dan 10 ekor terinfeksi cacing trematoda dan pada musim hujan diperoleh 5 ekor terinfeksi trematoda. Dengan demikian perlu penanganan kesehatan pada rusa untuk mencegah terjadinya infeksi penyakit.
Keyword: Axis axis, Natural touris park, Animal welfare, Natural touris park, Spotted deer, Deer cage, Deer population, Feeding program, Feed compatition, Totu, Grass, Potato

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