Judul: Kandungan Timah Hitam (Pb) pada Sayuran Bayam (Amaranthus tricolor), Kangkung Air (Ipomoea aquatic Forsk) dan Sawi Hijau (Brassica juncea)
Abstrak: Pengembangan industri, disamping membawa dampak positif dengan akselerasi ekonominya juga dapat membawa dampak negatif karena karena pencemaran limbahnya ke perairan (sungai). Bersamaan dengan peningkatan industri tersebut, di daerah ini juga banyak dijumpai petani sayuran yang menggunakan air sungai tercemar untuk menyirami sayuran. Penggunaan air sungai yang tercemar oleh logam berat terutama timah hitam (Pb) akan menyebabkan peningkatan timah hitam dalam jaringan tanaman sayuran. Sayuran yang tercemar apabila dikonsumsi maka timah hitam yang akan membahayakan kesehatan jika melebihi ambang batas yang tidak dapat ditoleransi oleh tubuh.
Keyword: 

Judul: Pengaruh media tanam terhadap kadar timah hitam (Pb) dalam sayuran bayam (Amaranthus tricolor), kangkung darat (Ipomoea reptans poir), dan caisin (Brassica chinensis)
Abstrak: Tujuan penelitian ini adalah untuk mengetahui pengaruh media tanam terhadap kadar timah hitam (Pb) dalam sayuran bayam, kangkung dan caisin, dengan (1) mengukur kadar logam berat Pb dalam kompos dan tanah biasa, (2) mengukur kadar logam berat Pb pada air siraman di Lokasi Pembuangan Akhir (LPA) Sampah Jakarta dan di Kebun Percobaan dan (3) mengukur kadar logam berat Pb dalam sayuran yang ditanam pada media kompos dan tanah biasa. Penelitian ini terdiri dari dua tahap kegiatan yaitu, lapang dan laboratorium. Kegiatan lapang mencakup pengambilan media tanam kompos di LPA Sampah Cakung-Cilincing dan media tanam tanah biasa di kebun Percobaan IPB Tajur, begitu pula air siraman dan sayuran diambil dari dua lokasi tersebut. Kegiatan analisis laboratorium dilakukan di Laboratorium Kimia Gizi, Jurusan Gizi Masyarakat dan Sumberdaya Keluarga, Laboratorium Terpadu Kimia Analitik, Jurusan Kimia dan Laboratorium Tanah, Institut Pertanian Bogor. Pemilihan lokasi Kompos Blok I dan II di LPA tersebut dilakukan secara purposif dengan pertimbangan bahwa blok-blok kompos tersebut jauh dari jalan raya yang ramai, untuk menghindari pengaruh sumber Pb dari asap kendaraan dan pada setiap blok tersebut terdapat tiga jenis sayuran uji yaitu bayam, kangkung darat dan caisin. Untuk di Kebun Percobaan IPB sayuran ditanam dalam poly- back dengan media tanam tanah biasa, masing-masing jenis sayuran dengan tiga ulangan.
Keyword: media tanam

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