Judul: Pengaruh Pemberian Ekstrak Daun Mengkudu (Morinda Citrifollia) pada Air Minum terhadap Profil Darah, Kadar Kreatinin dan Nitrogen Urea pada Itik Lokal Jantan Umur 6-12 Minggu
Abstrak: Penelitian ini bertujuan untuk mengetahui efek penambahan ekstrak daun mengkudu (Morinda citrifolia Lignosae) dengan taraf yang berbeda pada air minum terhadap profil darah, kreatinin dan nitrogen urea dalam darah dari itik lokal jantan umur 6-12 minggu. Penelitian ini menggunakan 24 itik dari 84 itik lokal jantan dan dipelihara selama 6 minggu. Pakan itik mengandung 18% protein kasar dan 3000 kkal kg-1 energi metabolis. Perlakuan yang digunakan di penelitian ini adalah: P0 (kontrol), P1 (penambahan 2.5 ml ekor-1 ekstrak daun mengkudu), P2 (penambahan 5 ml ekor-1 ekstrak daun mengkudu), dan P3 (penambahan 7.5 ml ekor-1 ekstrak daun mengkudu). Rancangan penelitian menggunakan rancangan acak lengkap dengan 4 perlakuan dan 3 ulangan. Pemberian ekstrak daun mengkudu (Morinda Citrifolia) dengan taraf 2.5 ml ekor-1 hari-1 hingga 7.5 ml ekor-1 hari-1 tidak mempengaruhi profil darah. Kreatinin darah berada dalam standar normal dan nitrogen urea dalam darah itik lebih tinggi dari normal.
Keyword: profil darah, nitrogen urea, kreatinin, itik lokal, daun mengkudu

Judul: Pemberian Tepung Daun Mengkudu (Morinda citrifolia Linn) terhadap Profil Darah, Kadar Kreatinin dan Urea Nitrogen Darah Itik Lokal Jantan Umur 12 Minggu.
Abstrak: Penelitian ini bertujuan untuk mengkaji pengaruh pemberian tepung daun mengkudu (Morinda citrifolia Linn) yang dicampur ke dalam ransum pada level yang berbeda terhadap profil darah, kadar kreatinin dan urea nitrogen darah itik lokal jantan umur 12 minggu. Ternak yang digunakan dalam penelitian sebanyak 24 ekor dari total 84 ekor itik dan dipelihara selama 6 minggu, ransum itik yang diberikan mengandung PK 18% dan energi metabolisme 3000 kkal kg-1. Perlakuan ransum yang digunakan pada penelitian ini adalah tepung daun mengkudu yang ditambahkan dalam ransum sebanyak 0% (P0), 2.5% (P1), 5% (P2) dan 7.5% (P3). Rancangan yang digunakan adalah Rancangan Acak Lengkap (RAL) dengan 4 perlakuan dan 3 ulangan. Data dianalisis menggunakan ANOVA dan hasil signifikan (P<0.05) diuji lanjut menggunakan uji Duncan. Hasil penelitian menunjukkan bahwa pemberian tepung daun mengkudu dalam ransum tidak memberikan perubahan terhadap profil darah yaitu jumlah eritrosit, hematokrit, hemoglobin, leukosit dan kreatinin darah itik yang masing-masing berkisar antara 2.71-2.88 juta mm-3, 32.80 %-37.20 %, 12.85-13.88 g %, 5.37-10.20 ribu mm-3 dan 0.08-0.12 mg dl-1 serta dapat menurunkan kadar urea nitrogen darah (BUN) itik.
Keyword: daun mengkudu, itik lokal jantan, profil darah, kreatinin, urea nitrogen darah

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