Judul: Profil Hematologi Monyet Ekor Panjang di Penangkaran Semi-alami Pulau Tinjil Pusat Studi Satwa Primata IPB
Abstrak: Pemeriksaan hematologi penting dilakukan untuk memahami kesehatan dan fisiologis di dalam tubuh hewan. Profil hematologi dapat dipengaruhi oleh latar belakang sumber (origin), genetik hewan, dan lingkungan pemeliharaan. Penelitian ini bertujuan membandingkan profil hematologi monyet ekor panjang di penangkaran semi-alami dengan nilai pada jurnal referensi menggunakan hewan penangkaran buatan. Penelitian dilakukan menggunakan 38 sampel yang berasal dari 30 ekor jantan dan 8 ekor betina dengan rentang umur 0–6 tahun. Sampel darah diperiksa menggunakan automated analyzer dan data dikelompokkan berdasarkan jenis kelamin dan umur. Hasil penelitian menunjukkan profil hematologi monyet ekor panjang yang dikembangbiakkan di penangkaran semi-alami Pulau Tinjil tidak berbeda dengan monyet ekor panjang yang ada di penangkaran buatan, kecuali pada parameter RBC, Hb, dan HCT yang memiliki nilai yang cenderung lebih rendah. Tidak terdapat perbedaan nyata pada profil hematologi berdasarkan jenis kelamin maupun usia, kecuali pada RDW yang menunjukkan nilai lebih tinggi pada kelompok usia 4–6 tahun dibandingkan usia dibawah 3 tahun.
Keyword: anemia, captive, hematology, Macaca fascicularis, Tinjil Island

Judul: Karakteristik kelompok monyet ekor panjang (Macaca fascicularis) di penangkaran semi alami Pulau Tinjil, Banten
Abstrak: Tujuan penelitian ini untuk mendapatkan informasi karakteristik kelompok, seperti ukuran atau besar, laju kelahiran, laju kematian, nisbah jenis kelamin dan komposisi umur monyet ekor panjang di penangkaran semi alami Pulau Tinjil. Selain itu untuk menganalisa perkembangan monyet serta untuk mengetahui faktor-faktor yang mempengaruhi kondisi perkembangan monyet di Pulau Tinjil, Penelitian ini dilakukan mulai tanggal 8 Maret sampai dengan 10 April 2003 bertempat di penangkaran semi alami Pulau Tinjil. Materi yang digunakan delapan kelompok monyet yang wilayah jelajahnya berada di sekitar kandang pakan. Data yang dikumpulkan meliputi: data primer dan sekunder. Data primer diperoleh dari kajian di lapangan, sedangkan data sekunder diperoleh dari studi pustaka melalui sumber terkait seperti kantor dan pengelola Pusat Studi Satwa Primata-Lembaga Penelitian Institut Pertanian Bogor (PSSP-LP IPB). Metode pengambilan data menggunakan metode penghitungan terkonsentrasi, yaitu penghitungan banyaknya komposisi dan ukuran kelompok populasi. Pengolahan data didasarkan hasil pengamatan di lapangan dan studi pustaka.
Keyword: Karakteristik, Monyet Ekor Panjang, Pulau Tinjil, Metode Penghitungan Terkonsentrasi

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