Judul: Pemberian Kombinasi Ekstrak Herbal (Kunyit, Temu Putih, Dan Bawang Putih) : Gambaran Morfopatologi Ayam Penderita Chronic Respiratory Disease
Abstrak: Kunyit (Curcuma Domestica), Temu Putih (Curcuma Zedoaria), Dan Bawang Putih (Allium Sativum) Merupakan Tanaman-Tanaman Yang Digunakan Manusia Sebagai Obat Tradisional Untuk Mengobati Berbagai Penyakit. Namun Pengetahuan Efek Obat Tradisional Pada Hewan Terutama Hewan Ternak Masih Sedikit. Penelitian Ini Bertujuan Untuk Memberikan Informasi Tentang Efek Obat Tradisional Dengan Parameter Patologi Anatomi Dan Histopatologi Pada Hewan Ayam Specific Pathogen Free (Spf) Berumur 14 Hari Yang Diinfeksi Mycoplasma Gallisepticum Dan Escherichia Coli . Ayam Yang Digunakan Sebanyak 50 Ekor Yang Dibagi Menjadi 5 Kelompok. Ayam Diinfeksi Pada Umur 14 Hari Dengan Mycoplasma Gallisepticum Dan Umur 17 Hari Dengan Escherichia Coli. Ayam Diterapi Dengan Kombinasi Ekstrak Herbal (8 Mg/Kg Bb) Dan Enrofloksasin (10 Mg/Kg Bb) Selama 14 Hari. Berdasarkan Pengamatan Patologi Anatomi Dan Histopatologi Menunjukkan Adanya Penurunan Derajat Infeksi Pada Ayam Yang Mengalami Airsacculitis, Perihepatitis, Dan Pericarditis Dengan Diberikan Terapi Kombinasi Ekstrak Herbal. Kombinasi Ekstrak Herbal Dapat Menurunkan Derajat Penyakit Crd.
Keyword: Ayam, Chronic Respiratory Disease, Herbal, Morfopatologi

Judul: Gambaran darah ayam yang diberi kunyit, bawang putih, dan temu putih sebagai pengobatan Chronic Respiratory Disease
Abstrak: Tingginya jumlah penduduk Indonesia diiringi dengan meningkatnya kebutuhan akan pangan asal hewan. Penelitian ini bertujuan untuk mengetahui jumlah eritrosit, hemoglobin, hematokrit, dan leukosit ayam yang diinfeksi penyakit Chronic Respiratory Disease yang (CRD) diberi kombinasi obat kunyit (Curcuma longa Linn), bawang putih (Allium sativum) dan temu putih (Curcuma zedoaria). Sebanyak 24 ekor ayam spesific pathogen free (SPF) dibagi menjadi kedalam 4 kelompok yaitu kelompok 1 (sehat), kelompok 2 (diinfeksi CRD tanpa diobati), kelompok 3 (diinfeksi CRD dan diobati dengan kombinasi kunyit, temu putih, dan bawang putih), dan kelompok 4 (diinfeksi CRD dan diobati dengan antibiotik enrofloxacin). Pengambilan sampel darah dilakukan pada hari ke-1, hari ke-7 pascainfeksi dan hari ke-14 pascainfeksi untuk dihitung nilai eritrosit, hemoglobin, hematokrit, dan leukosit. Hasil penelitian menunjukkan bahwa nilai eritrosit, hemoglobin, hematokrit dan leukosit pada semua kelompok tidak menunjukkan nilai yang berbeda. Kata kunci: bawang putih, CRD, darah, kunyit, dan temu putih.
Keyword: Blood, CRD, Garlic, Turmeric, White turmeric, Erythrocyte, Hematocrit, Hemaglobin, Leucocyte, Chicken

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