Judul: Dampak Pencemaran Air Sungai Cikijing terhadap Strategi Nafkah Rumah tangga Petani
Abstrak: Pencemaran air merupakan dampak dari krisis ekologi yang dapat mempengaruhi produktivitas pertanian, dan menyebabkan gagal panen sehingga petani perlu menerapkan strategi nafkah untuk menghadapi berbagai situasi ekonomi. Secara umum tujuan dari penelitian ini adalah: (1) mendeskripsikan dampak pencemaran air Sungai Cikijing terhadap kehidupan masyarakat, (2) menganalisis modal nafkah yang dimanfaatkan rumah tangga petani, (3) menganalisis strategi nafkah yang diterapkan rumah tangga petani saat terjadinya krisis akibat pencemaran air, (4) menganalisis tingkat kemiskinan rumah tangga petani. Penelitian ini menggunakan pendekatan kuantitatif dan didukung oleh data kualitatif. Hasil penelitian terhadap 30 responden adalah dampak pencemaran air Sungai Cikijing ternyata mempengaruhi kehidupan rumah tangga petani. Strategi nafkah yang banyak diterapkan antara lain intensifikasi dan ekstensifikasi, serta diversifikasi mata pencaharian. Modal nafkah diperlukan untuk menerapkan strategi nafkah, namun modal nafkah tidak berhubungan dengan keberagaman strategi nafkah. Strategi nafkah yang diterapkan oleh para petani ternyata mampu mengurangi jumlah rumah tangga petani yang berada di bawah garis kemiskinan saat krisis ekologi terjadi.
Keyword: Krisis ekologi, pencemaran air, strategi nafkah, modal nafkah

Judul: Dampak Krisis Ekologi terhadap Strategi Nafkah Rumahtangga Petani di Desa Ciganjeng, Kecamatan Padaherang, Kabupaten Pangandaran
Abstrak: The phenomenon of ecological crisis that occured in Ciganjeng Village is the flood stricken rice fields and settlement every year. Flooding caused the existence of farm households as the main actors in the ecology are threatened and to maintain the sustainability of their lives, they have livelihood strategies. This study was conducted to analyze the impact of the ecological crisis on livelihood strategies of farm household. This research method is a survey research using quetionnaires and qualitative approach using case studies and observations as supporting quantitative data. Based on a study of 35 respondents farm households, it was found that the ecological crisis caused farm households should have livelihood strategies, which are: human resource allocation strategy, multiple livelihood strategy, migration strategy, agricultural intensification strategy, dept strategy and non agricultural invesment strategy. Livelihood strategis are made by playing five livelihood assets. In addition, although the ecological crisis rocked farm households but they still survive because they have a high livelihood resiliency.
Keyword: livelihood resiliency, farm household, livelihood strategy, ecology crisis

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