Judul: Analisis Sanitasi Rumah Tangga di Desa Babakan Raya Kabupaten Bogor
Abstrak: Desa dengan permukiman yang padat menyebabkan sistem sanitasi yang kurang tertata. Penelitian bertujuan untuk menganalisis kualitas air untuk keperluan rumah tangga, mengetahui pola sanitasi rumah tangga, dan mengidentifikasi faktor faktor yang mempengaruhi pola sanitasi rumah tangga di Desa Babakan Raya. Analisis dilakukan pada 80 sampel rumah tangga dan 170 sampel air. Hasil uji kualitas air lalu dibandingkan dengan standar kualitas air yang berlaku di Indonesia. Hasil analisis memperlihatkan bahwa kualitas sumber air baku dan air minum pada 80 rumah responden memiliki kualitas yang kurang baik karena masih terdapat bakteri pada air, serta nilai konduktivitas dan pH tidak sesuai dengan baku mutu. Masyarakat Desa Babakan Raya memiliki profil sanitasi yang kurang memadai karena masih ada responden yang membuang limbah ke badan air. Kualitas air limbah masih dalam klasifikasi yang baik dan memenuhi standar baku mutu untuk parameter pengujian DO dan pH. Menurut responden, pendapatan dan lama tinggal tidak memiliki hubungan yang signifikan terhadap kepemilikan septic tank., Villages with dense settlements caused the sanitation system was not well organized. The objectives of the research were to analyze the quality of water for household use, to determine the pattern of household sanitation, and to identify the factors that influence the pattern of household sanitation in Babakan Raya Village. The analysis was carried out on 80 household samples and 170 water samples. The results of the water quality test were compared with the applicable water quality standards in Indonesia. The analysis results showed that the quality of raw water sources and drinking water of 80 respondents had poor quality because there were still bacteria in the water, and the conductivity and pH values did not meet the quality standards. The habitants of Babakan Raya Village have an inadequate sanitation profile because there were still respondents who dispose the waste into water bodies. The quality of the wastewater was still in a good classification and meets the quality standards for DO and pH testing parameters. According to respondents, income and length of stay did not have a significant relationship with the ownership of a septic tank.
Keyword: sanitation, septic tank, water quality

Judul: Status Kualitas Lingkungan Sekitar Kampus Institut Pertanian Bogor (Studi Kasus Desa Babakan Raya, Darmaga).
Abstrak: Desa Babakan Darmaga memiliki jumlah penduduk yang padat dan tidak diiringi oleh upaya peningkatan daya dukung lingkungan secara memadai sehingga mengakibatkan penurunan kualitas lingkungan. Tujuan penelitian ini adalah untuk memetakan status dan kualitas lingkungan berdasarkan parameter perairan, kebersihan, serta kondisi permukiman masyarakat di kawasan desa sekitar kampus Institut Pertanian Bogor, Darmaga. Penelitian dilakukan pada bulan Januari 2017. Analisis data terdiri dari analisis kualitas lingkungan, analisis spasial, dan analisis statistik regresi parsial. Hasil dari penelitian ini menunjukkan desa Babakan Raya sangat padat sehingga ditemukan parameter yang tidak sesuai dengan baku mutu diantaranya Escherichia coli dan pH setiap lokasi. Masyarakat melakukan kegiatan pengelolaan sampah meliputi kerja bakti, biopori, dan membersihkan halaman. Analisis kualitas lingkungan menggunakan lima parameter meliputi Escherichia coli, pH, BOD, suhu, dan TSS menghasilkan mutu lingkungan perairan dengan status sedang.
Keyword: Babakan Raya, kualitas air, pemetaan, pengelolaan sampah

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