Judul: Penentuan tingkat kerentanan dan karakteristik curah hujan pada penyakit diare (Studi Kasus: Kabupaten Bogor)
Abstrak: Diarrheal disease remains a public health problem in developing countries such as Indonesia because of its morbidity and mortality are still high. Determination and mapping the vulnerability of the region and precipitation characteristics are important to be analyse in order to determine the vulnarable areas and rainfall condition so that it can be used to anticipate the incidence of diarrheal diseases. Determination category of normal rate of diarrhea IR is based on diarrhea IR by DINKES Bogor in the amount of 20-25 / 1000 population per year, whereas the determination of precipitation category is based on consideration of Oldeman climate classification. The results of the analysis based on the value of the average annual IR, there are two districts with very high levels of vulnerability, namely districts Cisarua and Cijeruk, while for other regions, diarrheal disease vulnerablity rates are at a moderate level. The correlation of the precipitation is significant negative linear to the incidence of diarrhea in the district Cisarua, Cibinong, Jonggol, and Jasinga. In districts Cibinong, Jonggol, and Jasinga, precipitation should be anticipated as the high incidence of diarrhea that is in the range of 100-200 mm/month, while in the district Cisarua, is in the range of 300-400 mm/month.
Keyword: the level of vulnerability, IR category, precipitation category, incidence rate, precipitation, Bogor Agricultural University (IPB)

Judul: Potensi Kejadian Penyakit Diare Berdasarkan Kondisi Iklim dan Ketinggian Wilayah (Studi Kasus : Tanjung Priok, Dramaga, Lembang).
Abstrak: Dinamika iklim akan diikuti oleh perubahan ekosistem yang akhirnya merubah pola hubungan antara lingkungan dan manusia yang berdampak pada derajat kesehatan masyarakat. Keragaman iklim secara tidak langsung dapat memicu kejadian penyakit, seperti diare. Penelitian ini bertujuan untuk mengetahui pengaruh kondisi iklim dan ketinggian wilayah terhadap potensi angka kejadian penyakit atau Incidence Rate (IR) diare pada wilayah kajian, yaitu Kecamatan Tanjung Priok, Dramaga, dan Lembang. Pengaruh curah hujan (CH), suhu udara (T), kelembaban relatif (RH), surplus/defisit air (SD), dan defisit tekanan uap (VPD) terhadap IR diare ditentukan berdasarkan nilai koefisien korelasi (r), dan kesesuaian hasil plotting. Data ketinggian wilayah diperoleh dengan analisis data citra satelit (SRTM) Digital Elevation Model (DEM) 90 untuk mengetahui pengaruh ketinggian wilayah terhadap rata-rata IR pada wilayah kajian. Semakin bertambah ketinggian suatu wilayah maka semakin rendah suhu, sehingga potensi IR kasus diare juga berkurang. Kecenderungan berkurangnya IR diare dengan bertambahnya ketinggian wilayah terjadi pada ketinggian wilayah > 600 mdpl (R2 = 0.308). Antara IR diare dengan curah hujan dan surplus/defisit berkorelasi nyata di Tanjung Priok dan Lembang, tetapi dengan sifat korelasi yang berbeda. Pada kondisi curah hujan tinggi dan surplus air, IR di wilayah dataran rendah (Tanjung Priok) cenderung meningkat dan IR diare di wilayah dataran tinggi (Lembang) cenderung menurun. Aliran air permukaan membawa bahan-bahan penyebab diare dari daerah dataran tinggi ke dataran rendah bila curah hujan atau surplus tinggi, diduga menjadi penyebabnya. Wilayah Dramaga menunjukkan pola kejadian penyakit diare yang relatif konstan tinggi di sepanjang tahun namun tidak memperlihatkan tren secara nyata terhadap curah hujan dan surplus/defisit air.
Keyword: Curah Hujan, Defisit/Surplus Air, Diare, IR, Ketinggian Wilayah

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