Judul: Pengaruh kapur terhadap pelepasan gas H2S da unsur hara pada manur ayam petelur
Abstrak: fencemaran udara yang ditimbulkan oleh manur ayam merupakan rnasalah lingkungan yang cukup rnengganggu. Bau yang ditimbulkan oleh manur tersebuc dapat dikurangi oleh kapur jenis tohor yang berbentuk bubuk. Manur yang diuji berasd dari jenis ayam peteiur yang diberi empat konsentrasi kapur, yaitu 0% (kontrol), 1% 396, dan 5%. Pengamatan yang dilakukan adalah perubahan kadar air, pH, dan gas HzS yang keluar dari manur ayam tersebut seiama f 4 hari dengan pengukuran setiap 2 hari sekali. . Unsur hara nitrogen, fosforus, dan kaliurn yang terkandung dalarn manur ayam diukur pada hari pertama dan hari ke-30. Pemberian kapur pada manur berpengaruh pada perubahan kadar air, pH, dan pelepasan gas H2S. Hasil analisis ragarn dan uji Duncan secara keseluruhan menunjukkan bahwa kapw dengan konsentrasi ON, 1%, 3%, dm 5% berpengaruh secara nyata bagi pcnurunan kadar air pada pengamafan hari ke-4 dm hari ke-8, perubahan pH pada pengamatan hari ke-10, dm penurunan kadar gas H2S efektif bekerja pada pengamatan hari ke-4. Radar nitrogen, fosforus, dan kalium terbesar hari pertama dalam manur ayam terdapat pada konsenmi kapur 5% berturut-tumt adafdl sebesar 2.69%, O.BO%, dm 0.22%. Kadar nitrogen, fosforus, dan kalium terbesar hari ke-30 juga terdapat pada konsentrastsi 5% berturut-turut adalah sebesar 1. .77%, 0.57%, dan 0.20%.
Keyword: 

Judul: Pengaruh penambahn kapur terhadap pelepasan gas NH3 pada manur ayam petelur
Abstrak: Jumlah manur, sebagai produk samping peternakan, sudah tidak terkendali sehingga menyebabkan pencemaran tanah, air, dan udara. Salah satu cara untuk mengatasi masalah ini adalah melalui penambahan kapur dan manur. Pada penelitian ini, dianalisis pengaruh penambahan kapur terhadap pelepasan gas NH3 pada manur ayam petelur dan hubungannya dengan kadar air, pH, konsentrasi kapur yang digunakan, serta konsentrasi protein manur.
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