Judul: Pengaruh Pemberian Tetrasikllin dan Kopi dalam Ransum Berenergi Metabolis 2.600 kkal/kg Terhadap Persentase Karkas, Potongan Komersial dan Organ Dalam Ayam Kampung
Abstrak: Penelitian ini bertujuan untuk mengetahui pengaruh penambahan tetrasiklin dan kopi dalam ransum ayam Kampung yang berenergi metabolis 2.600 kkallkg terhadap bobot potong, persentase bobo! karkas, potongan komersial, organ dalam dan panjang relatif bagian usus (duodenum, jejenum, ileum dan sekum). Penelitian ini telah dilaksanakan dari bulan April sampai dengan Juni 2003 di Laboratorium Ilmu Nutrisi Temak Unggas, Departemen Ilmu Nutrisi dan Makanan Temak, Fakultas Peternakan, IPB. Ternak yang digunakan pada penelitian adalah ayam Kampung umur 6 minggu sebanyak 72 ekor yang dipelihara selanm 8 minggu. Ransum percobaan yang diberikan ada 4 macam yaitu ransum basal, ransum basal yang ditambahkan kopi 0,4%, ransum basal yang ditambahkan tetrasiklin 0,003% dan ransum basal yang ditambahkan kopi 0,4% dan tetrasiklin 0,003%. Ransum dan air minum diberikan ad libitum. Di akhir pemeliharaan, 24 ekor ayam dipotong untuk diukur persentase bobot karkas, potongan komersial, organ dalam dan panjang relatif bagian usus (duodenum, jejenum, ileum dan seka).
Keyword: 

Judul: Pengaruh Pemberian Tetrasiklin dan Kopi dalam Ransum Berenergi Metabolis 3.000 Kkal/kg terhadap Persentase Karkas, Organ Dalam dan Potongan KomersiaI Ayam Kampung
Abstrak: Penelitian ini dilakukan untuk mengetahui pengaruh pemberian tetrasiklin dan kopi dalam ransum yang mengandung energi metabolis sebesar 3.000 kkal/kg terhadap bobot potong, persentase bobot karkas, potongan komersial, organ dalam dan panjang bagian-bagian usus halus serta seka ayam Kampung. Penelitian ini dilaksanakan di Laboratorium Ilmu Nutrisi Ternak Unggas, Departemen Ilmu Nutrisi dan Makanan Ternak, Fakultas Peternakan, Institut Pertanian Bogor dari bulan April hingga bulan Juni 2003. Penelitian ini menggunakan 72 ekor ayam Kampung yang berumur 6 minggu dan dipelihara selama 8 minggu. Ransum percobaan yang diberikan ada empat macam, yaitu ransum yang tidak mengandung tetrasiklin dan kopi sebagai ransum basal, ransum yang hanya mengandung kopi 0,4%, ransum yang hanya mengandung tetrasiklin 0,003% dan ransum yang mengandung tetrasiklin 0,003% dan kopi 0,4%. Diakhir pemeliharaan, 24 ekor ayam dipotong untuk mengetahui persentase bobot karkas dan bobot organ dalamnya.
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