Judul: Bioremediasi Diazinon Secara Ex Situ Menggunakan Mikrob Indigenous Isolat B3
Abstrak: Diazinon merupakan insektisida goIongan organofosfat yang dapat digunakan untuk memberantas atau mengendalikan hama-hama tanaman dan banyak digunakan dalam pertanian. Akibat buruk dari penggunaan pestis ida yang tidak proporsionai akan menimbulkan residu. Residu ini akan terse bar secara tidak terkendali dan menumpuk dalam rantai makanan.
Keyword: 

Judul: Bioremediasi Tanah Tercemar Diazinon Secara Ex Situ dengan Menggunakan Kompos Limbah Media Jamur (Spent Mushroom Compost)
Abstrak: Pesticide is a xenobiotic compound and rexalcytran which should be handled seriously in order to prevent human and environment from those negative effects. One of the methods which can be utilized is bioremediation technique which is utilizing fresh spent mushroom compost (SMC). The diazinon contaminated soil whith the concentration of 500 ppm, 1000 ppm and1500 ppm, was added with SMC of 10%, 20% and 30%, then incubated for 28 days. The reduction of diazinon concentrate was analyzed every week through extracted sample with etyl acetat and measured by spectrophotometer. The data processing was conducted by using respon surface method (RSM). Based on this analysis, the maximum point of diazinon concentrate reduction was 88% with the treatment of combination of 30% compost and 1000 ppm diazinon, it was obatined on the 14th. On the 21st day the diazinon concentration reduction was 91.8%. It was the result from combination of 25% compost and 1000 ppm diazinon. On 28th day, the diazinon concentration reduction was 97.5%, result from the treatment of 26% compost and 1000 ppm diazinon. The diazinon degradation process can be effectively ferformed by adding 15-30% compost, with 1000 ppm of diazinon within 21 days incubation. Some of bacteria have been isolated from SMC. that were, Bacillus mycoides, Bacillus cereus, Bacillus brevis, Pseudomonas stutzeri, dan Chromobacterium spp. Those bacteria were able to growth in solid medium which contains diazinon up to 500 ppm, except Bacillus brevis. The ability of bacteria to degrade diazinon based on their properties is forming a clear zone around the colony which is growth in solid medium of mineral salt peptone yeast (MSPY). Apparently, it is only Bacillus cereus is able to degrade diazinon up to 1700 ppm.
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