Judul: Pemanfaatan Citra Landsat dan Global Positioning System (GPS) untuk Evaluasi Blok Bekas Tebangan di IUPHHK-HA PT. Mamberamo Alasmandiri Provinsi Papua
Abstrak: Pemanfaatan citra satelit dalam bidang kehutanan adalah untuk memonitor dan mengevaluasi laju deforestasi hutan serta perubahan tutupan lahan. Tujuan dari penelitian ini adalah mendetailkan kondisi tutupan lahan yang ada pada blok bekas tebangan dengan menggunakan citra landsat dan GPS di IUPHHK-HA PT. Mamberamo Alasmandiri. Penelitian ini memiliki 4 tahapan yaitu i) identifikasi citra, ii) identifikasi objek berupa hutan primer dan hutan sekunder, iii) identifikasi tunggak terjauh dari jaringan jalan, dan iv) interpretasi visual untuk evaluasi blok bekas tebangan. Identifikasi citra untuk membandingkan citra landsat belum terkoreksi ortho dengan citra landsat terkoreksi ortho berdasarkan topografi lapangan. Identifikasi objek berupa hutan primer dan hutan sekunder untuk mengetahui perbedaan kenampakan objek pada citra dan di lapangan. Identifikasi tunggak terjauh dari jaringan jalan untuk mempermudah deliniasi tutupan lahan khususnya hutan primer dan hutan sekunder. Tahap terakhir interpretasi visual untuk evaluasi blok bekas tebangan diperoleh dari deliniasi citra terhadap kelas tutupan lahan yang telah diperoleh dari identifikasi objek. Hasil evaluasi blok bekas tebangan adalah kondisi detail dan luas blok bekas tebangan.
Keyword: Citra Landsat, Identifikasi Citra, Interpretasi Visual, Evaluasi Blok Tebangan.

Judul: Identifikasi Perubahan Tutupan Lahan Menggunakan Citra Landsat Multiwaktu dan Teknologi Sistem Informasi Geografis (SIG) di IUPHHK-HA PT. Austral Byna Kalimantan Tengah
Abstrak: The utilization of forest by Forest Concessions (HPH) or now known as The Forest Utilization License Timber-Forest Nature (IUPHHK-HA) brings many benefits but it also brings a downside for the Indonesian forestry. This activity has increased economic and regional development, but also lead to greater rates of deforestation and forest degradation as well. In general degradation that occurs in production forests result in damage or reduction of productive forest area to total forest area that will affect productivity. The negative impact of deforestation and degradation can be minimized through the efforts of a fast and efficient monitoring using remote sensing. Digital imagery or remote sensing data is one of the data to analyze the surface of the earth. Ministry of Forestry using Landsat imagery as one tool in monitoring the condition of Indonesia's forests. Landsat multi-time combined with Geographic Information Systems (GIS) facilitate the monitoring process. Both long-term monitoring and short-term monitoring can be controlled so that the rate of deforestation. This study aims to identify land cover classes as well as changes in the PT. Austral Byna in 1997, 2005 and 2012, and calculate the rate of degradation and reforestation arising from the use of forests in the periode of observations. The experiment was conducted in two phases, field phase in April-May 2012 in PT. Austral Byna, and image processing in June to November 2012 in the Laboratory of Remote Sensing and GIS Department of Forest Management Fahutan IPB. The data used are Landsat TM and ETM+ 30 m resolution coverage in 1997, 2005 and 2012 as well as other supporting digital maps. The tools used in the form of PC with the software ArcView 3.2, ArcGIS 9.1, Erdas 9.1, GPS, Camera and stationery. The result showed that successfully classified land cover both digital and visual consists of forests, fields, bushes, farm, vacant land and clouds. Degradation of the highest in 1997, 2005 and 2012 occurred in the class turned into a forest shrubs. While reforestation occurred in the highest class of the field and forest shrubs that turned into a forest.
Keyword: 

Judul: Construction of Strongly Optimal Binary Linear Code with Minimum Distance 9 and 11
Abstrak: A binary linear code of length n over q F is a subspace of n q F . A code has three parameters that attached to it, namely length, dimension, and minimum distance. A code with length n, dimension k and minimum distance d is often called [n, k, d ]-code. Usually, when two parameters are given, then we want to find a code that has the best value for the last parameter. Based on Gilbert- Varshamov bound, if a [n, k, d ]-code exists and can not be expanded, we call it a strongly optimal code. In this paper, we construct strongly optimal code with minimum distance 9 and 11. In constructing the code, we created a theorem and algorithm based on Gilbert-Varshamov bound before we implement the algorithm to MAPLE programming language. Because of computational limitations, the program can only construct up to k = 10 for d = 9 and k = 12 for d = 11.
Keyword: