Judul: Kemampuan Kangkung, Selada, Dan Genjer Untuk Menurunkan Ion Mn2+ Terlarut Dalam Air
Abstrak: Mangan mempakan salah satu logam berat yang berbahaya bagi kesehatan manusia. Keracunan Mn dap8.t mengakibatkan beberapa penyakit. yaitu kemsakan hati, secara almt menyebabkan pneumonitis dan secara kronis menyebabkan ensefalopati. Ambang Mn ulltuk pertanian sebesar 2 mgIL, Di dalam perairan. Mn dapat menyebabkan pakaian yang dicuci dan peralatan kamar mandi berkarat serta menyebabkan kerak di pipa-pipa pada konsentrasi melebihi 0,05 mgIL.
Keyword: 

Judul: Kemampuan Genjer, Kangkung Air, dan Selada Air Untuk Menurunkan Konsentrasi Logam Timbal (pb) Di Dalam Air
Abstrak: sisitasnya dan penangguJangan pencemaran dengan menggunakan tanaman. Tanaman eceng gondok (EichorniQ crassipes) sebagai penjerap logam-Iogam berat telah umum dikenal, namun untuk pengcmbangan lebih lanjut perlu dilakukan penelitian tentang kcmampuan tanaman lain da[am menurunkan kandungan logam di perairan. Penelitian ini bertujuan mengetahui kemampuan genjer (Limnocharis flava), kangkung air (Ipomoea aquatica), dan selada air (Nasturtium officinale) untuk menurunkan konsentrasi logam Pb di dalam air dan membandingkan efisiensi dari ketiga tanaman tersebut. Ketiga tanaman dimasukkan ke dalam ember berboda yang berisi larutan Pb dengan konsentrasi O. I, 5, 10, dan 15 ppm. Pengamatan dan pengukuran kandungan Pb dalam air dan parameter penunjang seperti pH. suhu, daya hantar listrik., kekeruhan, CO2 bebas.oksigen terlarut, dan BODs dilakukan pada minggu ke-I, 2, 3, 4, 5, 6, 7. 8. Pada minggu ke-O, 4. 8 juga dilakukan penentuan kandungan Pb di dalam tanaman. Analisis kandungan Pb dilakukan dengan menggunakan spektrofotometer serapan atom pada panjang gelombang 283,3 nm. Berdasarkan hasil penelitian dapat disimpulkan bahwa tanaman genjer. kangkung air, dan selada air dapat menurunkan konsentrasi Pb di dalam air dengan kemampuan yang berbeda-beda. Penjerapan Pb yang paling baik dilakukan oleh tanaman genjer
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