Judul: Profil Sel Darah Merah dan Mineral Makro pada Sapi Perah Penderita Endometritis di Jawa Barat
Abstrak: Endometritis adalah peradangan pada selaput lendir uterus, yang pada umumnya disebabkan oleh infeksi bakteri. Penelitian ini bertujuan untuk mengetahui profil sel darah merah dan mineral makro sapi perah penderita endometritis di Jawa Barat. Sapi perah 1-5 bulan postpatus diperiksa menggunakan ultrasonografi (USG) untuk mendeteksi kondisi endometritis. Pengambilan sampel darah dilakukan melalui vena coccygea kemudian disimpan dalam vacutainer EDTA dan vacutainer plain. Pemeriksaan hematologi yang dilakukan meliputi jumlah sel darah merah, kadar hemoglobin, nilai hematokrit dan indeks sel darah merah, sedangkan pemeriksaan mineral makro meliputi kadar kalsium, kadar fosfor dan kadar magnesium. Hasil menunjukkan bahwa sapi perah positif endometritis 30.77% anemia normositik hipokromik yang ditandai dengan penurunan jumlah sel darah merah, kadar hemoglobin, nilai hematokrit, dan indeks sel darah merah. Sapi perah penderita endometritis postpartus sebanyak 55.56% menunjukkan hipokalsemia subklinis, 5% menunjukkan hipofosfatemia, dan 58.83% menunjukkan hipermagnesemia.
Keyword: Endometritis, Mineral Makro, Sapi Perah, Sel Darah Merah

Judul: Profil Leukosit Sapi Friesian Holstein Penderita Endometritis.
Abstrak: Pendekatan manajemen kesehatan ternak merupakan aspek penting untuk menjamin produktivitas susu sapi perah. Penelitian ini bertujuan untuk mengetahui leukosit sapi Friesian Holstein (FH) penderita endometritis di Lembang dan Pangalengan Jawa Barat. Parameter penelitian meliputi jumlah leukosit dan diferensiasi leukosit yang meliputi neutrofil, eosinofil, basofil, limfosit, dan monosit. Sampel darah diambil dari vena coccygeal dari 20 ekor sapi FH 1-5 bulan dari partus. Sampel darah dibagi menjadi 2 bagian, 1 bagian untuk perhitungan total leukosit dan 1 bagian untuk pembuatan apus darah. Parameter leukosit dianalisis secara deskriptif kemudian dilanjutkan dengan uji independent T-test untuk menunjukkan bahwa hasilnya berbeda nyata (P<0.05). Berdasarkan hasil, 85% sapi endometritis menunjukkan total leukosit dan neutrofil lebih tinggi dan berbeda nyata (P<0.05) dibandingkan sapi negatif endometritis. Rata-rata eosinofil, basofil, limfosit, dan monosit sapi endometritis lebih tinggi dibandingkan sapi negatif endometritis. Secara umum total leukosit dan diferensiasi leukosit sapi endometritis lebih tinggi dibanding sapi negatif endometritis. Sapi endometritis mengalami infeksi secara kronis.
Keyword: Leukosit, endometritis, diferensiasi leukosit, sapi perah

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