Judul: Estimation of Economic Loss due to the Pollution  of Paper Industry Waste (Case study: Tengkurak Village, Tirtayasa Sub district,  Serang, Banten)
Abstrak: Industri kertas merupakan industri andalan baik pasar domestik maupun pasar ekspor dimana industri kertas dapat memberikan kontrubusi PDB. Namun, industri kertas dapat memberikan dampak negatif apabila limbah industri tidak bisa dikelola dengan baik. Penelitian ini bertujuan untuk mengkaji eksternalitas negatif akibat limbah industri kertas dengan menggunakan analisis deskriptif, mengestimasi besarnya biaya eksternal yang ditanggung masyarakat dengan menggunakan cost of illness, replacement cost, dan loss of earnings, mengestimasi besarnya nilai kompensasi yang bersedia diterima masyarakat dengan menggunakan Contingent Valuation Method, dan menganalisis faktor faktor yang memengaruhi besarnya kompensasi masyarakat dengan menggunakan analisis regresi linier berganda. Hasil penelitian menunjukkan bahwa eksternalitas negatif yang dirasakan masyarakat adalah penurunan kualitas air sungai dan kualitas air tanah. Rata-rata biaya eksternal yang harus ditanggung responden sebesar Rp 191 341 182.6/kepala keluarga/tahun. Dugaan nilai rataan willingness to accept responden sebesar Rp 3 645 454.2/kepala keluarga/tahun. Faktor-faktor yang mempengaruhi besarnya nilai willingness to accept responden yaitu usia, pendidikan, pendapatan, jarak dengan sungai, jumlah tanggungan, lama tinggal, total kerugian ekonomi, persepsi kualitas air, dan dummy jenis kelamin.
Keyword: Bogor Agricultural University, Institut Pertanian Bogor, IPB, Compensation, External cost, Paper industry, Export markets, Paper industry waste, Water quality, Total economic loss

Judul: . Value Estimasiton of Public Loss Caused by Batik Pollution in Pekalongan City. (Case Study: Medono Village, Pekalongan Barat District, Pekalongan City).
Abstrak: Subsektor usaha batik telah berkembang pesat di Indonesia, salah satu sentra produksinya di Kota Pekalongan. Namun, peningkatan subsektor usaha ini tidak disertai kesadaran akan pentingnya menjaga lingkungan sehingga menimbulkan eksternalitas negatif bagi masyarakat akibat tercemarnya sungai oleh limbah batik. Penelitian ini mempunyai empat tujuan. Pertama, mengestimasi nilai kerugian ekonomi yang dialami masyarakat dengan metode cost of illness dan replacement cost. Kedua, identifikasi faktor-faktor yang mempengaruhi besaran kerugian ekonomi masyarakat dengan metode analisis regresi linier berganda. Ketiga, estimasi nilai kesediaan menerima kompensasi masyarakat akibat pencemaran dengan metode contingent valuation method (CVM) dan terakhir adalah untuk mengetahui strategi pengelolaan limbah batik terbaik di Kelurahan Medono dengan menggunakan metode analytical hierarchy process (AHP). Hasil yang diperoleh dari penelitian ini yaitu: 1) Total nilai kerugian ekonomi yang harus ditanggung oleh masyarakat Kelurahan Medono sebesar Rp.589 308 362 per tahun; 2) Faktor-faktor yang berpengaruh nyata pada pada besarnya nilai kerugian ekonomi yaitu pendapatan, lama tinggal, usia dan dummy tercemarnya sumur; 3) Nilai dugaan WTA populasi yaitu sebesar Rp.605 622 912 per tahun; 4) Level kriteria, perbaikan kualitas air menjadi prioritas utama dengan nilai 0.499. Sementara pada level alternatif, pembuatan IPAL komunal menjadi prioritas program dengan nilai 0.299.
Keyword: Bogor Agricultural University, Institut Pertanian Bogor, IPB, Analytical hierarchy process, Batik, Economic losses, Eksternalitas, Willingness to accept, Pollutan, Priority prgram, Dummy contamination

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