Judul: Pengaruh Modal Sosial Terhadap Ketahanan Pangan Rumahtangga Petani di Desa Ciaruteun Ilir Kecamatan Cibungbulang Kabupaten Bogor.
Abstrak: Social capital is an important component in a community. Social capital is used to help each other when in need, such as the need to secure food sufficiency in a household. Social capital consists of trust, networks, and social norms. Household food security is defined as a condition of food suffiency in one household in terms of availability, accesibility and consumability. This study aims to analyze the roles of social capital in household food security in Ciaruteun Ilir village, Cibungbulang subdistrict at Bogor Regency. The data collection was conducted by using a survey on 60 horticultural farmer houselds. The farmer’s household food security is determined by socio economic level, spending level and the number of household members. Farmers use the capital social to get employed to generate income to buy food.
Keyword: horticultural farmer, food security, Social Capital

Judul: Analisis ketahanan pangan rumahtangga petani dan non petani di Desa Petir, Kabupaten Bogor serta faktor-faktor yang mempengaruhinya
Abstrak: Tujuan utama dari penelitian ini adalah untuk menganalisis ketahanan pangan rumah tangga Petani dan Non Petani di Desa Petir Kabupaten Bogor dan Faktor-faktor yang Mempengaruhinya dia. Desain studi cross sectional digunakan dalam penelitian ini. Ukuran sampel dalam penelitian ini berjumlah 30 rumah tangga yang terdiri dari 15 petani dan 15 non petani. Data yang digunakan adalah data primer (pola konsumsi, kepemilikan lahan dan produksi on-farm) dan data sekunder meliputi karakteristik sampel (ukuran rumah tangga, umur, pekerjaan, tahun studi, dan total pengeluaran), data konsumsi makanan, status gizi dan karakteristik lokasi penelitian. Data dianalisis dengan Korelasi Pearson dan regresi linier berganda. Hasil penelitian menunjukkan bahwa produksi pertanian terutama adalah umbi-umbian, jagung dan Pachyrrhizus erosus. Analisis statistik menunjukkan bahwa terdapat hubungan yang signifikan antara ketahanan pangan rumah tangga dengan ukuran rumah tangga (p=0.036). Tapi tidak ada hubungan yang signifikan antara ketahanan pangan rumah tangga dengan umur rumah tangga kepala rumah (p=0,317) dan umur ibu rumah tangga (p=0,527); ketahanan pangan rumah tangga dengan tahun belajar kepala rumah tangga (p=0,674) dan ibu rumah tangga (p=0,535). Pembelajaran juga membuktikan bahwa tidak ada hubungan yang signifikan (p=0,884) antara makanan rumah tangga keamanan dan total pengeluaran. Faktor yang mempengaruhi ketahanan pangan rumah tangga adalah hanya ukuran rumah tangga.
Keyword: Food security, Household, Farmers, Non farmers

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