Judul: Gambaran eritrosit ayam terinfeksi Eimeria spp. secara alami yang diberi ekstrak daun johar (Cassia siamea Lamk.)
Abstrak: Koksidiosis merupakan satu penyakit yang menyerang ayam terutama pada umur 4-16 minggu yang dapat menimbulkan kerugian ekonomi. Penelitian ini dilakukan untuk mengetahui pengaruh pemberian ekstrak daun johar (Cassia siamea Lamk.) pada ayam terinfeksi alami Eimeria spp. yang mengandung 8,1 x 103-23,6 x 103 ookista terhadap gambaran darah merah yang meliputi jumlah eritrosit, kadar hemoglobin dan nilai hematokrit. Sebanyak 90 ekor ayam dibagi menjadi 6 kelompok yaitu kelompok kontrol negatif K(−), kontrol positif K(+), kontrol obat (KO), johar dosis 4,09 mg/0,5 cc (J1), johar dosis 8,18 mg/0,5 cc (J2) dan johar 16,36 mg/0,5 cc (J3). Pengambilan darah dilakukan sebanyak 8 kali dari semua kelompok ayam untuk memperoleh gambaran jumlah eritrosit, kadar hemoglobin dan nilai hematokrit. Hasil penelitian menunjukkan bahwa jumlah eritrosit ayam terinfeksi 8,1 x 103-23,6 x 103 ookista tidak terpengaruh. Kadar hemoglobin dan nilai hematokrit menunjukkan adanya penurunan pada semua kelompok terinfeksi bila dibandingkan dengan K(−). Kesimpulan dari penelitian ini adalah johar dengan dosis 16,36 mg/0,5 cc (J3) dapat mempertahankan jumlah eritrosit, kadar hemoglobin dan nilai hematokrit pada ayam yang terinfeksi. Jumlah eritrosit, kadar hemoglobin dan nilai hematokrit pada kelompok J3 cenderung lebih tinggi daripada kelompok J1 dan J2.
Keyword: Eimeria spp, Eritrosit, Daun johar, Ayam, Bogor Agricultural University

Judul: Gambaran diferensiasi leukosit pada ayam yang terinfeksi Eimeria spp. secara alami dan telah diberi ekstrak daun johar (Cassia siamea Lamk.)
Abstrak: Penelitian ini bertujuan untuk mengetahui pengaruh pemberian ekstrak daun johar dengan berbagai konsentrasi (dosis 4.09 mg/0.5 ml, dosis 8.18 mg/0.5 ml, dan dosis 16.38 mg/0.5 ml) terhadap jumlah dan jenis leukosit ayam yang terinfeksi Eimeria spp. Penelitian ini menggunakan ayam petelur jantan berumur 2 bulan dan dibagi dalam 6 kelompok yaitu kelompok kontrol negatif (K-), kelompok kontrol positif (K+), kelompok obat (KO), kelompok johar dosis 1 (J1), kelompok johar dosis 2 (J2), dan kelompok johar dosis 3 (J3). Darah diambil dari vena axillaris dan dibuat preparat ulas. Berdasarkan hasil pengamatan dapat disimpulkan bahwa ekstrak daun johar dengan dosis 4.09 mg/0.5 ml dapat mengembalikan persentase jumlah heterofil dan monosit ke nilai normal. Sedangkan jumlah total leukosit dan persentase ratarata limfosit, eosinofil, dan basofil tidak mengalami perubahan.
Keyword: Leucocyte, Eimeria spp, The layer cock, Bogor Agricultural University

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