Judul: Studi Tanggapan Petani Terhadap Penghapusan Kredit BIMAS Padi Di Kecamatan Tomo, Kabupaten Sumedang jawa Barat
Abstrak: Program Bimas Padi beserta sistem kreditnya merupa- kan salah satu upaya pemerintahüntuk merangsang 'para petani agar meningkatkan produksi padinya dengan cara intensifikasi. Program pemerintah tersebut selama per- jalanannya telah berhasil, yakni dapat meningkatkan pro- duksi beras dan tingkat pendapatan petani peserta program pemerintah tadi. Atas dasar keberhasilan tersebut di atas, maka pe- merintah memandang bahwa sudah saatnya kredit Bimas Padi dihentikan, karena dengan kenaikan pendapatan tadi, para petani dipandang sudah mampu membiayai usahataninya sen- diri tanpa bantuan modal dari luar. Di kalangan para ahli ekonomi timbul dua pendapat tentang keputusan pemerintah dalam penghapusan kredit Bimas Padi, salah satu golongan menyatakan sependapat, karena sistem kredit tadi hanya bersifat sementara, dan golongan lain mengungkapkan bahwa sistem kredit Bimas Padi itu belum saatnya dihapuskan karena masih banyak kecil yang membutuhkannya....
Keyword: 

Judul: Mempelajari Beberapa Faktor Yang Mempengaruhi Tingkat Pembayaran Kembali Kerdit Bimas Padi Oleh Petani Pada Musim Tanam 1982/1983 : Studi Kasus di Kecamatan Ngoro, Kabupaten Jombang
Abstrak: Dilihat dari segi peningkatan produksi, program inten- sifikasi padi melalui Bimas telah memberikan hasil yang menggembirakan. Namun dipandang dari segi perkreditan ma- sih ada hal yang patut dicemaskan, yakni adanya kecende- rungan bahwa penyaluran kredit Bimas semakin menurun; pe- ngembaliannya kurang lancar, sehingga jumlah tunggakan ma- kin besar. Padahal keberhasilan suatu program perkreditan ditentukan secara bersama oleh peningkatan produksi dan be- sarnya tingkat pembayaran kembali kredit tersebut. Berdasarkan permasalahan tersebut, maka penelitian ini diarahkan untuk; (1) mempelajari faktor-faktor karakteris- tik petani peminjam kredit Bimas padi, (2) mempelajari fak- tor-faktor yang berpengaruh nyata terhadap tingkat pemba- yaran kembali kredit Bimas padi oleh petani, dan (3) mene- mukan berbagai alasan yang menimbulkan adanya tunggakan kredit Bimas padi oleh petani. Adapun faktor-faktor yang diduga berpengaruh terhadap tingkat pembayaran kembali, digolongkan menjadi faktor-fak- tor non ekonomi dan ekonomi. Yang tergolong faktor-faktor non ekonomi adalah umur petani, tingkat pendidikan petani...
Keyword: 

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