Judul: Efektifitas Pemberian Kenikir (Cosmos caudatus kunth) terhadap Bobot Karkas, Organ Pencernaan, Hati dan Kolesterol Daging Ayam Kampung (Gallus gallus domesticus
Abstrak: Cholesterol is one of the main causes of the disease as atherosclerosis, the process of calcification and hardening of artery walls, which makes blood vessels to narrow and block blood flow in it. One effort to overcome the high levels of cholesterol in poultry products with the use of natural materials (herbs) as affixes chicken feed. Kenikir contains saponin to reduce cholesterol. Kenikir also contains antioxidants to neutralize free radicals in poultry. The purpose of this experiment was to study effectivity of kenikir (Cosmos caudatus kunth) in diet on final body wight (g), carcass weight (g), relative digesstive organ (%),carcass cholesterol (%), and carcass percentage (%) native chicken. Sixty birds of native chickens (6 week of age) were randomly assigned to four dietary treatment with three replications (5 birds/replication). The treatment diet were P0 as control, P1, P2, and P3 diets contained 1%, 2%, and 3% kenikir. There were significant effect of on average percentage of carcass cholesterol levels compared with control.
Keyword: 

Judul: Efektivity of Kenikir (Cosmos caudatus kunth) to the Performances, Lymphoid Organs and Blood Profile of Native Chicken (Gallus gallus domesticus)
Abstrak: Herbal adalah jenis tanaman yang aman dikonsumsi pada batas normal oleh ternak tanpa mengakibatkan efek samping dalam mengurangi tingkat stress. Kenikir adalah jenis herbal yang dipakai dalam penelitian ini untuk meningkatkan performa ayam kampung yang dipelihara secara intensif. Kenikir mengandung saponin yang dapat merangsang pembentukan imun. Selain itu, kenikir juga mengandung senyawa antioksidan yang berfungsi untuk menetralisir senyawa radikal bebas dalam tubuh ayam kampung. Tujuan penelitian ini adalah untuk mempelajari pengaruh pemberian kenikir yang dicampur pada ransum terhadap performa, aktivitas organ limfoid dan profil darah ayam kampung. Penelitian ini dilakukan di kandang pemuliaan ternak, Fakultas Peternakan, Institut Pertanian Bogor. Penelitian ini menggunakan rancangan acak lengkap (RAL). Sebanyak 60 ekor ayam kampung umur 6 minggu dibagi kedalam 4 perlakuan dan 3 ulangan (5 ekor/kandang). Perlakuan pakannya terdiri atas P0 (kontrol, tanpa kenikir), P1 (pemberian 1% kenikir), P2 (pemberian 2% kenikir) dan P3 (pemberian 3% kenikir). Data yang diperoleh dianalisis dengan menggunakan analisis ragam (analysis of variance, ANOVA). Perlakuan yang memberikan pengaruh nyata terhadap peubah yang diamati akan dilakukan uji lanjut least significance difference (LSD). Hasil penelitian menunjukkan bahwa pemberian perlakuan kenikir tidak berbeda nyata (P>0,05) dengan kontrol pada konsumsi pakan, pertambahan bobot badan, konversi pakan, mortalitas, bobot limpa, bobot timus, bobot bursa fabrisius, jumlah sel darah merah dan diferensial sel darah putih. Pemberian perlakuan kenikir berbeda nyata (P<0,01) dengan kontrol pada jumlah sel darah putih. Dari hasil tersebut dapat disimpulkan bahwa pemberian kenikir sampai level 3% tidak berpengaruh terhadap performa, aktivitas organ limfoid dan jumlah sel darah merah ayam kampung umur 6-9 minggu. Pemberian kenikir sampai level 3% dapat meningkatkan jumlah sel darah putih ayam kampung umur 6-9 minggu, namun dalam kondisi patologis.
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