Judul: Kejadian Penyakit Infeksi Saluran Pernapasan Akut (ISPA) di Provinsi Kalimantan Timur oleh Pengaruh Jumlah Titik Panas (Hotspot) dan Curah Hujan
Abstrak: Forest fires can be related to the disease of ARI/ISPA. ARI is a respiratory disease caused by air pollution and bacterial infections. This study aimed to measure the strength forest fire (hotspot) and rainfall to the incidence of Acute Respiratory Infection (ARI) disease in the province of East Kalimantan. The method used is the analysis of the relationships between hotspot and rainfall variables with ARI. The disease found easier in the condition with or without forest fire. When the hotspot is less than 58 points influence on ARI are not clearly noticed. However, if the points of hotspots is more than 58, influence hotspot more clearly noticed, ie the rise hotspot increases the disease of ARI. In general, more hotspots occurred while negative of rainfall anomalies in the months around August to October, also the months the strong influence, on increasing hotspot ARI 80% for ARI Pneumonia and 52% for ARI Non Pneumonia.
Keyword: 

Judul: Hubungan Antara Hotspot dan Kebakaran Terhadap Timbulnya Penyakit Infeksi Saluran Pernapasan Akut (ISPA) di Kabupaten Kubu Raya, Kalimantan Barat
Abstrak: Pulau Kalimantan merupakan salah satu pulau yang sering terjadi kebakaran hutan dan lahan dimana seluruh Provinsi pernah terbakar dan berdampak negatif terhadap lingkungan hidup dan manusia. Penelitian ini mengukur hubungan antara peningkatan sebaran titik panas (hotspot) sebagai petunjuk adanya kebakaran hutan dan lahan dengan timbulnya penyakit Infeksi Saluran Pernapasan Akut (ISPA) dan dilakukan analisis deskriptif mengenai peningkatan dampak kesehatan yang terbatas pada penyakit Infeksi Saluran Pernapasan Akut (ISPA) dilihat dari kelas umur dan jenis kelamin. Jumlah hotspot tertinggi berada di kecamatan Sungai Raya sebanyak 144 hotspot sedangkan jumlah hotspot terendah pada kecamatan Sungai Kakap sebanyak 8 hotspot. Kecamatan yang yang memiliki luas areal terbakar tertinggi adalah kecamatan Batu Ampar yaitu mencapai angka 5 881.46 hektar, sedangkan luas areal terbakar terendah berada di kecamatan Sungai Kakap sebesar 4.18 hektar. Jumlah pasien penderita ISPA terbanyak berada di Kecamatan Sungai Raya yaitu 11 302 pasien. Sedangkan jumlah pasien penderita ISPA terendah ada pada Kecamatan Teluk Pakedai yaitu sebanyak 1 129 pasien penderita ISPA. Dari hasil analisis statistik jumlah pasien ISPA dengan jumlah Hotspot memiliki korelasi positif (r = 0.507). Nilai korelasi antara jumlah pasien ISPA dengan luas lahan terbakar juga memiliki nilai korelasi positif (r = 0.377), sedangkan untuk hubungan antara jumlah hotspot dengan luas areal terbakar memiliki nilai korelasi positif (r = 0.938). Dari hasil uji R square persamaan regresi Y = 2 240 + 31.1X tidak relevan digunakan dalam menentukan hubungan antara peningkatan pasien ISPA dengan jumlah hotspot. Secara deskriptif kelas umur terbanyak pada pasien ISPA Kubu Raya adalah kelas umur 1-4 tahun dan dari jenis kelamin perbedaan pasien lakilaki dan perempuan tidak menunjukan perbedaan yang signifikan.
Keyword: Hotspot, ISPA, Kalimantan Barat, Kebakaran Hutan dan Lahan

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