Judul: Analisa Data Curah Hujan Harian Dalam Meningkatkan Penyediaan Air Bersih Di Daerah Transmigrasi Pasang Surut Air Sugihan Provinsi Sumatera Selatan
Abstrak: Tujuan dari penelitian ini adalah untuk lebih memanfaatkan sumber air bersih di daerah pemukiman transmigrasi pasang surut, yang memenuhi standar kualitas, kuantitas dan sarana penyedia airnya mudah didapat. Kualitas air permukaan daerah pasang surut kurang memenuhi standar kualitas air minum. Ditinjau dari sifat fisi- ka, air daerah pasang surut umumnya berwarna, kekeruhannya tinggi dan berasa payau serta berbau. Ditinjau dari sifat kimia, umumnya airnya masam, salinitas, kesadahan dan kandungan Fe dan Mn-nya tinggi. Pembagian empat buah drum bagi para transmigran untuk penampungan air hujan, tidak terlalu berdaya guna di musim kemarau, karena analisa potensi hujan harian serta distribusinya belum pernah dilakukan, di samping itu transmigran belum menyadari tentang penghematan air. Setelah dilakukan analisa data curah hujan ternyata curah hujan rata-rata tahunannya cukup tinggi (di atas 2 000 mm) tetapi penyebarannya yang tidak merata menyebabkan air meluap pada saat musim penghujan dan mengalami kekeringan di saat musim kemarau. Kenaikkan konsumsi air berpengaruh lebih besar terhadap frekwensi kekeringan dibandingkan frekwensi limpasan. Demikian juga kenaikan kapasitas bak penampung berpengaruh lebih besar terhadap frekwensi kekeringan dibandingkan frekwensi limpasan. ...
Keyword: 

Judul: Studi kualitas air permukaan dan sumur gali dangkal di daerah pemukiman transmigrasi pasang surut dalam rangka usaha penanggulangan masalah penyediaan air bersih
Abstrak: Penelitian ini dilakukan untuk memperoleh gambaran umum tentang kualitas air permukaan dan sumur gali dangkal di daerah pemukiman transmigrasi pasang surut Sumatera dan Kalimantan dengan mempertimbangkan kriteria baku untuk air minum. Selanjutnya ditelaah faktor-faktor lingkungan pasang surut yang mempengaruhi kualitas air di daerah tersebut, akibat-akibat sampingan yang mungkin timbul terhadap kesehatan karena buruknya kualitas air, problema-problema yang dihadapi dalam usaha pengolahannya serta mencari suatu cara sederhana untuk menanggulangi penyediaan air bersih terutama pada musim-musim kemarau. Pengamatan kualitas air permukaan dan sumur gali dangkal dilakukan pada 7 lokasi transmigrasi pasang surut di Sumatera dan 4 lokasi transmigrasi pasang surut di Kalimantan. Lokasi-lokasi yang diamati di Sumatera meliputi Proyek Transmigrasi Rokan dan Rawa Sekip (Propinsi Riau); Lambur, Lagan dan Dendang (Propinsi Jambi); Air Sugihan dan Pulau Rimau (Propinsi Sumatera Selatan) . Untuk Kalimantan meliputi Proyek Transmigrasi Terusan Tengah (Propinsi Kalimantan Tengah); Tabung Anen dan Puntik (Propinsi Kalimantan Selatan). Dari masing­ masing lokasi diambil 2 - 10 contoh air secara acak, dan dianalisis secara langsung dilapangan dengan memakai alat laboratorium lapangan "HACH".
Keyword: Water quality;, Transmigration;

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