Judul: Gambaran Sel Darah Merah Ayam Pedaging yang Diinfeksi Eimeria tenella dengan Dosis Bertingkat
Abstrak: Kondisi fisiologis seekor hewan dapat terganggu saat hewan terserang penyakit. Dampak gangguan ini akan mengakibatkan performa hewan menjadi menurun. Salah satu parameter fisiologis yang dapat berubah adalah gambaran sel darah merah. Penelitian ini bertujuan mengetahui jumlah sel darah merah, kadar hemoglobin, nilai hematokrit, dan indeks eritrosit ayam pedaging selama terinfeksi Eimeria tenella dengan paparan dosis yang berbeda. Ayam pedaging sebanyak 108 ekor dibagi menjadi empat kelompok dan diinfeksikan dengan empat dosis berbeda, yaitu 0, 50, 5000, dan 50 000 ookista/ekor. Sampel darah diambil selama 9 hari sejak diinfeksi kemudian diperiksa jumlah sel darah merah, kadar hemoglobin, nilai hematokrit, dan indeks sel darah merahnya. Hasil penelitian menunjukkan rataan total jumlah sel darah merah, kadar hemoglobin dan nilai hematokrit kelompok ayam yang diinfeksi memiliki nilai lebih rendah dibandingkan dengan kelompok kontrol. Indeks sel darah merah menunjukkan MCH dan MCHC juga menurun seiring dengan bertambahnya dosis Eimeria yang diberikan.
Keyword: E. tenella, hematokri, hemoglobin, indeks sel darah merah, sel darah merah

Judul: Gambaran Bobot Badan Ayam Pedaging yang diinfeksi Eimeria tenella dengan Dosis Bertingkat.
Abstrak: Koksidiosis merupakan suatu penyakit yang umum terjadi pada ayam yang disebabkan oleh genus Eimeria sp. Eimeria tenella merupakan salah satu spesies yang menyerang bagian sekum serta menyebabkan hemoragi. Penyakit ini mengakibatkan terhambatnya pertumbuhan ayam. Pertumbuhan ayam dapat diketahui dengan menimbang bobot badan. Penimbangan bobot badan dilakukan pada U1 (ayam berumur 1 hari), H4si (ayam berumur 11 hari), H10si (ayam berumur 17 hari), dan H17si (ayam berumur 24 hari). Penelitian ini dilakukan untuk mengetahui gambaran bobot badan ayam pedaging yang diinfeksi E.tenella dengan dosis bertingkat. Penelitian ini menggunakan 80 ayam pedaging galur cobb berumur 7 hari. Ayam dibagi menjadi 4 kelompok perlakuan: KN (kontrol negatif), D1 (diinfeksi dengan dosis 500 ookista/ekor), D2 (diinfeksi dengan dosis 5.000 ookista/ekor), dan D3 (diinfeksi dengan dosis 50.000 ookista/ekor). Hasil penelitian ini melaporkan bahwa berbagai dosis infeksi E.tenella tidak menunjukkan perbedaan (P>0.05) bobot badan antara perlakuan. Hal ini terjadi karena dosis tersebut belum menyebabkan gangguan terhadap pencernaan sehingga tetap terjadi pertambahan bobot badan.
Keyword: ayam pedaging, bobot badan, Eimeria tenella

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