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: Kajian Efektifitas Pemberian Kunyit, Bawang Putih Dan Mineral Zink terhadap Performa, Kadar Lemak, Kolesterol Dan Status Kesehatan Broiler
Abstrak: Konsumen produk ayam kini semakin selektif dalam memilih karkas khususnya karkas dengan kadar lemak dan kolesterol rendah. Kadar lemak dan kolesterol dalam daging ayam broiler dapat memberikan dampak negatif bagi kesehatan manusia seperti menyebabkan jantung koroner, obesitas dan hipertensi. Bawang putih dan kunyit merupakan tanaman obat tradisional yang memiliki zat aktif yaitu allisin dan kurkumin yang dapat digunakan sebagai penurun kolesterol dan lemak, memperbaiki performa dan status kesehatan pada broiler. Mineral zink (ZnO) ditambahkan seiring dengan fungsinya sebagai metaloenzim dan memberi respon imun terhadap broiler. Penelitian dilakukan untuk melihat pengaruh dari pemberian kunyit (1.5%), bawang putih (2.5%) dan mineral zink dalam bentuk ZnO terhadap performa, kadar lemak dan kolesterol karkas, dan status kesehatan ayam broiler. Kunyit dan bawang putih dibuat dalam bentuk serbuk. Data yang diperoleh dianalisis statistik dengan mengggunakan Rancangan Acak Lengkap (RAL) dan diuji lanjut bila antara perlakuan terdapat perbedaan. DOC (day old chicken) sebanyak 100 ekor dibagi kedalam 5 perlakuan dan 4 ulangan yang setiap perlakuan terdiri atas 5 ekor. Pakan yang disusun mengandung 23.5% protein kasar dan 3 215.04 kkal/kg Energi Metabolisme.
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