Judul: Pendugaan Potensi Simpanan Biomasa dan Karbon dari Tegakan Jati (Tectona grandis) Tidak Terbakar dan Pasca Kebakaran Permukaan di KPH Indramayu
Abstrak: Global warming is the one of forest fires impact in environments. Global warming have impact to make climate changed because the concentration of carbon have increased in the air. The measurement of carbon storage in the forest is the one of important aspect to know the total of carbon. This research aims to estimate and compare carbon storage in the standing teak that unburned and post fire surface. The measurement of standing biomass used the approach volume method while undergrowth and litter used destructive method. The result show that the biomass potency in surface fires area is 46.34 tons/ha is bigger than unburned area is 41.39 tons/ha. Estimation of potency of carbon storage is proportional to the biomass potency. Carbon storage in surface fires area is 23.17 tonsC/ha and in unburned area is 20.69 tonsC/ha.
Keyword: Bogor Agricultural University (IPB), standing teak, forest fires, carbon storage, biomass

Judul: Pendugaan Potensi Simpanan Karbon Dari Tegakan Pinus (Pinus merkusii) Tidak Terbakar Dan Pasca Terbakar di KPH Malang, Perum Perhutani Unit II Jawa Timur
Abstrak: INTRODUCTION. The forest fires can emmited amount of carbon so that the carbon sink in forest can be decreased. On the other hand, the forest fire can also caused the emmited of carbon that cause an increasing of carbon concentration in the air to cause the global warming as an impact from green-house gases that can harmful for the life existances in this earth. Because of that, the forest must be preserved and managed wisely and also need research of carbon sink potential in forest stand to know the carbon total. MATERIALS AND METHOD. This research was conducted in KPH Malang, Perum Perhtani Unit II East Java from April to Mei 2009. The equipment that are needed; scales, oven, chopping knife, samson paper, plastic bag, digital camera, plastic rope, Minitab 15 program, tally sheet and writing tools. The materials that are required are an unburnt area (on square 82 d) and a post fire area on square 83 i) in KPH Malang, Perum Perhutani Unit II East Java. On unburnt and post fire are made square of 20 m x 20 m, and also small squares of 2 m x 2 m in four amount which is put in every corner to be taken low plant vegetations and manure. The result is processed through biomass estimation which then is converted into carbon storage in ton/ha. To find the effecting factor towards carbon storage, analyzes using ANOVA and Least Significant Difference (LSD) is used. RESULT AND DISCUSSION. The total potential of carbon storage on post fire Pinus stand (on square 82 D) that has planting distance 6 m x 2 m is 358,7263 ton/ha. The total potential of carbon storage on unburnt square (on square 83 I) that has planting distance 3 m x 2 m is 297,1426 ton/ha. It is caused by the forest fire that changed carbon sink potential, so that carbon sink potential on post fire Pinus stand is bigger than on unburnt Pinus stand. The result of statistic analyzes using ANOVA shows that the value of R-sq = 95,2850% for post fire Pinus stand and 99,2559 % for unburnt Pinus stand. Both on post fire Pinus stand and on unburnt Pinus stand, there is the Pinus stand that gives significant difference between manure and below plant in significant level 5 %. CONCLUSION. The total potential of carbon storage on post fire Pinus stand is 358,7263 ton/ha. The total potential of carbon storage on unburnt Pinus stand is 297,1426 ton/ha. The forest stand in Indonesia, especially in KPH Malang have to preserve, especially from the forest disturbance such as forest fire because of the role of forest as carbon sink for the better life process in this earth.
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