Judul: Potensi Kebakaran di Kawasan Hutan Taman Nasional Gunung Ciremai, Kabupaten Kuningan, Jawa Barat
Abstrak: Kebakaran di kawasan hutan Blok Pajaten TNGC telah menjadi tren yang terus berulang hampir setiap tahunnya. Kebakaran hutan dan lahan menjadi ancaman serius bagi keberlanjutan kelestarian keanekaragaman hayati dan ekosistemnya, serta berbagai aspek kehidupan lainnya. Penelitian ini bertujuan menganalisis tingkat kerawanan kebakaran hutan berdasarkan curah hujan selama 5 tahun terakhir (2014-2018) dan potensi bahan bakar yang ada. Hasil menunjukan rata-rata jumlah curah hujan dalam 5 tahun terakhir (2014-2018) di Blok Pajaten TNGC sebesar 1 703 mm/tahun yang termasuk ke dalam kelas kerawanan kebakaran rendah. Kebakaran di kawasan Blok Pajaten disebabkan karena faktor manusia yang didukung oleh faktor cuaca yang ekstrim. Terdapat hubungan yang cukup nyata antara jumlah curah hujan per tahun dengan luas kebakaran yang terjadi. Nilai kadar air daun, ranting, serasah daun, maupun serasah ranting secara keseluruhan berturut-turut tergolong sangat basah (>50%), agak kering (20-30%), basah (30-50%) dan sangat basah (>50%). Upaya pengendalian yang telah dilakukan oleh pihak Blok Pajaten TNGC meliputi upaya pencegahan, pemadaman, dan penanganan pasca kebakaran.
Keyword: bahan bakar, kadar air, kebakaran hutan, potensi, TNGC

Judul: Forest Fire Control in the Pajaten Block Forest Area, Mount Ciremai National Park, Kuningan Regency, West Java.
Abstrak: Kebakaran hutan menimbulkan dampak negatif dalam segi ekologis, ekonomi dan sosial. Cara untuk melakukan pengendalian kebakaran hutan adalah dengan mengetahui penyebab kebakaran hutan. Penelitian ini bertujuan mengkaji penyebab kebakaran dan upaya pengendalian kebakaran hutan di Blok Pajaten TNGC. Pengumpulan data menggunakan metode triangulasi data. Analisis data menggunakan metode deskriptif kualitatif. Kebakaran hutan di Blok Pajaten TNGC disebabkan oleh aktivitas manusia, yaitu kelalaian manusia, pembersihan lahan, pencarian madu dan pembakaran secara sengaja. Upaya pengendalian kebakaran hutan serta sarana dan prasarana pengendalian kebakaran hutan di Blok Pajaten TNGC sudah sesuai standar peraturan yang berlaku. Teknik pemadaman kebakaran yang dilakukan sudah mampu mengatasi kebakaran yang terjadi. Pihak BTNGC melakukan koordinasi dengan instansi-instansi yang terkait dengan bencana. Perlu dilakukan sosialisasi dan penyadarhutanan yang lebih intensif serta pelibatan masyarakat untuk mencegah terjadinya kebakaran hutan dan konflik. Penegakan hukum terhadap oknum yang melanggar perlu dilakukan oleh KLHK (Direktorat Jenderal Penegakan Hukum).
Keyword: human activities, law enforcement, triangulation methods

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