Judul: Faktor Penyebab dan Upaya Pengendalian Kebakaran Hutan di Perhutani KPH Indramayu
Abstrak: Forest fire is one of the obstacle in forest which often occurred in Indonesia. Cause of forest fire consist two factors: natural and human factors. Efforts of forest fire control nowadays more emphasized with community involvement. The objective of this research was to examine the causes of forest fire also the efforts of forest fire in KPH Indramayu. This research was done by filling the questionnaire based on the results of the interview. The results of this research revealed that one of the factor which caused forest. Land clearing by the community with the burning system still contain risk which caused forest fire although the community use the controlled burning system, and it should be emphasized to all parties that cigarette is not the main cause of forest fire. Efforts of forest fire control in BKPH Sanca includes prevention, suppression, and extinguishing, but the implementation is not optimal yet.
Keyword: Bogor Agricultural University (IPB), the role of the community, forest fire control, forest fires

Judul: Faktor Penyebab dan Upaya Pengendalian Kebakaran Hutan di KPH Malang Perum Perhutani Divisi Regional II Jawa Timur
Abstrak: Kebakaran hutan merupakan salah satu gangguan hutan yang sering terjadi di Indonesia dan dapat menimbulkan banyak kerugian dari berbagai aspek sumberdaya hutan. Upaya pengendalian kebakaran hutan saat ini telah banyak dilakukan dan ditekankan dengan melibatkan masyarakat sekitar hutan. Tujuan penelitian ini adalah untuk mengkaji faktor penyebab dan upaya pengendalian kebakaran hutan di KPH Malang. Penelitian ini dilakukan dengan pengisian kuisioner dan wawancara kepada masyarakat. Setelah itu data di analisis secara deskriptif. Berdasarkan hasil penelitian diketahui bahwa kebakaran hutan di KPH Malang sebagian besar disebabkan oleh kegiatan masyarakat dalam melakukan pembersihan lahan. Tindakan pencegahan kebakaran hutan yang telah dilakukan berupa sosialisasi/penyuluhan, pemasangan papan peringatan, dan pembuatan sekat bakar. Sarana dan prasarana dalam kegiatan pemadaman kebakaran masih sangat minim. Penanganan pasca kebakaran yang dilakukan dalam penegakan hukum masih terkendala dalam penangkapan pelaku pembakaran hutan.
Keyword: Kebakaran hutan, pengendalian kebakaran hutan, penyebab kebakaran hutan, tindakan pencegahan

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