Judul: Profil Darah Merah Ayam Broiler Selama Proses Pengangkutan dengan Jarak Tempuh yang Berbeda.
Abstrak: Profil darah merupakan indikator kesehatan ternak selama pengangkutan. Pengangkutan dapat menyebabkan penyusutan bobot dan kematian ternak akibat stres. Studi ini mengkaji profil darah merah ayam broiler yang mengalami pengangkutan dengan jarak tempuh berbeda (20 km, 35 km, dan 60 km). Penelitian menggunakan 45 ekor ayam broiler yang memiliki range bobot 1.4 sampai 1.9 kg dengan umur siap panen (35-40 hari). Parameter profil darah merah meliputi eritrosit, hematokrit, dan hemoglobin yang diambil sebelum dan sesudah pengangkutan. Indeks eritosit (MCV, MCHC dan MCH) dihitung untuk mengetahui jenis dan kondisi anemia ternak. Hasil penelitian menunjukkan bahwa profil darah merah ayam broiler berupa jumlah eritrosit, hematokrit dan hemoglobin dalam kisaran normal. Jarak tempuh 20 km dan 35 km menunjukkan bahwa nilai MCV dan MCH ayam broiler berada di bawah kisaran normal. Jarak tempuh 60 km nilai MCV ayam berada dibawah dan nilai MCHC berada di atas normal. Kesimpulan dari studi ini bahwa ayam broiler yang diangkut dengan jarak tempuh 20 km, 35 km dan 60 km mengalami kondisi anemia dengan jenis anemia yang berbeda sebelum maupun sesudah dilakukannya pengangkutan.
Keyword: ayam broiler, indeks eritrosit, profil darah merah, transportasi

Judul: Profil Darah Merah Ayam Broiler Pasca Pengangkutan dengan Kepadatan Yang Berbeda.
Abstrak: Penelitian ini bertujuan untuk mengevaluasi profil darah merah ayam broiler setelah transportasi dengan tingkat kepadatan krat yang berbeda (54 kg m-2, 58.5 kg m-2, dan 63 kg m-2). Sampel yang digunakan adalah ayam broiler dengan kisaran bobot 1.4 sampai 1.7 kg. Rancangan percobaan yang digunakan adalah rancangan acak lengkap (RAL) pola searah dengan tiga kali ulangan. Peubah yang diamati adalah profil darah merah ayam broiler meliputi jumlah eritrosit, nilai hematokrit, kadar hemoglobin, dan indeks eritrosit (MCV, MCHC, dan MCH). Hasil penelitian menunjukkan bahwa profil darah merah ayam broiler dalam kisaran normal. Perbedaan kepadatan krat pada saat pengangkutan tidak berpengaruh nyata terhadap jumlah eritrosit, nilai hematokrit, kadar hemoglobin, dan indeks eritrosit ayam broiler sehingga memungkinkan untuk melakukan pengangkutan dengan kepadatan krat sampai dengan 63 kg m-2.
Keyword: ayam broiler, indeks eritrosit, kepadatan krat, profil darah merah, transportasi

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