Judul: Deteksi Kemurnian Air Zamzam melalui Uji Konduktivitas Listrik.
Abstrak: Air zamzam merupakan air yang dianggap suci oleh umat Islam. Air zamzam dapat diperoleh dari keran air zamzam yang terletak di Masjidilharam, Kota Mekah, Arab Saudi. Tingginya permintaan serta larangan ekspor air zamzam untuk kepentingan komersial oleh pemerintah Arab Saudi menyebabkan banyaknya peredaran air zamzam yang tidak murni. Tujuan dari penelitian ini adalah menguji nilai konduktivitas listrik air zamzam, air baku lain, dan air campuran antara keduanya untuk mengetahui tingkat kemurnian air zamzam. Setelah diuji menggunakan alat konduktimeter, nilai konduktivitas listrik air zamzam berada pada rentang 800 μS/cm. Air baku lain nilai konduktivitas listriknya dibawah 150 μS/cm sedangkan air campuran nilainya tergantung oleh konsentrasi masingmasing air.
Keyword: air zamzam, air baku, kemurnian, konduktivitas listrik, konduktimeter

Judul: Penentuan Nilai Konduktivitas Hidrolik, Koefisien Storage dan Efisiensi Sumur di Pondok Pesantren Wadil Mubarak, Parung, Kabupaten Bogor.
Abstrak: Kebutuhan air bersih merupakan kebutuhan pokok yang tidak dapat ditinggalkan oleh sebab itu pengolahan dan pelestarian air merupakan hal yang mutlak diperlukan. Tujuan penelitian ini adalah untuk mengetahui pengaruh debit terhadap besarnya penurunan muka air tanah dari akuifer di sumur di Pondok Pesantren Wadil Mubarak dan mengetahui nilai konduktivitas hidrolik, koefisien storage dan efisiensi sumur dengan metode Thiem dan metode Neuman serta membandingkan hasil keduanya. Uji pemompaan merupakan suatu metode yang digunakan untuk mengetahui karakteristik teknis akuifer. Uji pemompaan mencakup tiga tahap, yaitu uji pemompaan bertingkat, uji pemompaan kambuh, dan uji pemompaan menerus. Karakteristik akuifer yang diperoleh dengan metode Neuman yaitu transmisivitas sebesar 3.02 m2/hari dan konduktivitas hidrolik sebesar 0.0803 m/hari. Dengan metode Thiem, diperoleh transmisivitas sebesar 6.46 m2/hari dan konduktivitas hidrolik sebesar 0.202 m/hari. Besarnya debit yang paling efisien untuk digunakan saat pemompaan adalah 42.211 m3/hari.
Keyword: efisiensi sumur, koefisien storage, konduktivitas hidrolik, metode Neuman, metode Thiem

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