Judul: Impacts of Climate Change and Forest Community Adaptation Strategy in Southern Central Timor District, East Nusa Tenggara.
Abstrak: Perubahan iklim ditandai dengan adanya perubahan curah hujan, suhu, musim hujan dan kemarau dalam jangka waktu yang lama. Perubahan ini memberikan dampak terhadap sumberdaya alam dan kehidupan masyarakat. Perhatian utama perubahan iklim adalah dampak negatif seperti banjir, tanah longsor, erosi tanah, kekeringan, dan gagal panen yang menyebabkan kerentanan masyarakat. Masyarakat ini harus beradaptasi dengan perubahan di lingkungan sekitar mereka agar dapat bertahan hidup. Penelitian ini bertujuan untuk mendapatkan gambaran dari pemahaman masyarakat terhadap perubahan iklim, mengidentifikasi dan mengklasifikasi dampak perubahan iklim terhadap kehidupan masyarakat, serta untuk mempelajari strategi adaptasi masyarakat terhadap perubahan iklim. Penelitian dilakukan di Desa Nenas dan Desa Bena, Kabupaten Timor Tengah Selatan, Propinsi Nusa Tenggara Timur. Hasil penelitian menunjukkan bahwa sebagian besar masyarakat tidak mengerti apa yang dimaksud dengan perubahan iklim. Apa yang masyarakat pahami adalah bahwa ada perubahan musim (hujan dan kemarau) yang tidak menentu. Perubahan musim yang tidak terduga memberikan kesulitan bagi masyarakat untuk menjadwalkan waktu tanam. Musim yang ekstrim (baik musim hujan dengan curah hujan tinggi dan kemarau panjang) memberikan dampak negatif secara langsung dan tidak langsung, kepada masyarakat dan lingkungan sekitarnya seperti banjir, tanah longsor, kekeringan, ketersedian air yang terbatas, dan akhirnya dapat menurunkan produksi pertanian. Dampak negatif lain dari perubahan iklim adalah masalah kesehatan masyarakat, padang rumput dan semak kering yang rentan kebakaran. Masyarakat telah melakukan beberapa strategi untuk beradaptasi seperti penanaman pohon untuk pengendalian banjir, penyesuaian pola tanam waktu tanam, mengubah spesies tanaman pertanian, membangun sumur, dan dengan bantuan dari Pemerintah Daerah untuk membangun saluran irigasi, serta pembuatan bak penampung air bersih. Strategi adaptasi yang diimplementasikan oleh masyarakat di desa penelitian sebagian besar merupakan adaptasi reaktif dan antisipatif.
Keyword: 

Judul: Tinjauan Hasil Kajian Kerentanan dalam Pengembangan Strategi Adaptasi di Indonesia Terkait Perubahan Iklim
Abstrak: The impact of climate changes going increasingly worrying. It put Indonesia as one of the most vulnerable countries affected by climate change. This study was conducted by reviewing the studies that have been done by DNPI focused on adaptation strategies to climate change in Indonesia. Especially to the vulnerability of food, health, and in coastal areas, which is expected to anticipate losses due to the impact of greater climate change. The development of adaptation strategies is a top priority that must be done, and the role of government in this case is The National Council on Climate Change (NCCC), it is necessary to formulate, coordinate and control the policies that is consistent with climate change adaptation. The cooperation of all parties to participate in controlling climate change makes it especially important considering the process of socialization and adaptation. It requires a synergistic follow-up between the government, private sector, NGOs to the general public. Adaptation strategies of the results of this study is also expected to reduce climate refugees due to climate change.
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