Judul: Jumlah eritrosit, kadar hemoglobin dan nilai hematokrit pada ayam yang diinfeksi Eimeria tenella dengan pemberian rebusan daun jambu biji(Psidium guajava L.)
Abstrak: Penelitian ini dilakukan untuk melihat jumlah eritrosit, kadar hemoglobin dan nilai hematokrit ayam yang diinfeksi Eimeria tenella dan diberi rebusan daun jambu biji (Psidium guajava L) dengan berbagai konsentrasi sebagai pencegahnya. Sembilan puluh ekor ayam jantan petelur dari galur Hysex Brown yang berumur dua minggu dibagi dalam enam kelompok. Kelompok tersebut yaitu kontrol positif (K+), kontrol negatif (K-), kontrol obat (KO), kelompok perlakuan jambu biji dengan konsentrasi (g/100ml) 1.25%, 12.5% dan 125%. Pengambilan dan penghitungan terhadap jumlah eritrosit, kadar hemoglobin dan nilai hematokrit darah dilakukan pada hari ke-0, 4, 7, 11 dan 14 setelah infeksi. Hasil penelitian menunjukkan bahwa pada kontrol positif jumlah eritrosit, kadar hemoglobin dan nilai hematokrit menurun secara signifikan (P<0.05) pada hari ke-7 setelah infeksi dan nilainya berada dibawah kisaran normal. Pada kelompok jambu biji 125% jumlah eritrosit, kadar hemoglobin mengalami penurunan yang signifikan (P<0.05) pada hari ke-11 setelah infeksi, nilai hematokritnya juga menurun namun tidak signifikan.
Keyword: 

Judul: Jumlah eritrosit, kadar hemoglobin dan nilai hematokrit ayam yang diinfeksi Eimeria tenella dengan pemberian rebusan rimpang bangle(Zingiber purpureum Roxb.)
Abstrak: Penelitian ini dilakukan untuk mengetahui pengaruh pemberian rebusan rimpang bangle (Zingiber purpureum Roxb.) dengan berbagai konsentrasi (1.25%, 12.5% dan 125%) terhadap jumlah eritrosit, kadar hemoglobin dan nilai hematokrit ayam yang diinfeksi Eimeria tenella. Sebanyak 90 ekor ayam petelur jantan galur Hysex Brown berumur 2 minggu dibagi menjadi enam kelompok yaitu kelompok kontrol positif (K+), kontrol negatif (K-), Kontrol obat (KO), dan kelompok perlakuan rebusan rimpang bangle dengan konsentrasi (g/100 ml) 1,25%, 12,5% dan 125%. Pada hari ke-0, 4, 7, 11 dan 14 setelah infeksi dilakukan pengambilan sampel darah dan selanjutnya dilakukan penghitungan jumlah eritrosit, kadar hemoglobin dan nilai hematokrit. Hasil penelitian menunjukkan bahwa rata-rata jumlah eritrosit, kadar hemoglobin dan nilai hematokrit kelompok kontrol positif pada hari ke-7 adalah paling rendah. Rata-rata jumlah eritrosit pada kelompok B 1,25% dan B 12,5% menurun secara signifikan pada hari ke-11 (P<0,05). Secara keseluruhan rata- rata jumlah eritrosit dan kadar hemoglobin cenderung mulai menurun pada hari ke-14
Keyword: 

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