Judul: Pengujian efikasi campuran insektisida stedfast 15 ec dan fungisida folpet terhadap jamur blue stain
Abstrak: Kenyataan menunjukkan bahwa penurunan mutu kayu karena serangan jamur pewarna terutama jamur blue stain, di Indonesia cukup menonjol. Kayu-kayu yang terserang oleh jamur blue stain akan berwarna kotor kehitam-hitaman atau kebiru-biruan. Hal ini jelas menurunkan mutu kayu dan menimbulkan kerugian. Dalam kaitan ini peranan pengawetan kayu menjadi semakin penting. Suatu penelitian telah dilakukan untuk mengetahui keampuhan (efikasi) komposisi campuran fungisida Folpet dan insektisida Stedfast 15 EC yang diumpankan terhadap jamur blue stain yang diaplikasikan pada kayu gergajian dengan cara pencelupan (dipping) dan pelaburan (brush on). Dalam penelitian ini digunakan kayu karet (Hevea bra- siliensis Muell Arg.). Sedangkan jenis jamur blue stain yang digunakan adalah Hormodendron sp.
Keyword: fungisida Folpet

Judul: Studi pertumbuhan jamur blue stain terhadap perlakuan trichoderma viride Pers. ex S.F.Gray. pada kayu karet (Hevea brasilliensis Muell Arg.)
Abstrak: cipta Kayu karet termasuk salah satu jenis kayu yang potensial sebagai bahan baku industri yang relatif murah. Akan tetapi kayu karet mempunyai kelemahan yaitu waktu masih segar mudah sekali diserang oleh jamur perusak kayu, khususnya jamur blue stain yang merusak warna kayu aslinya (discoloration), menjadi kotor kehitam-hitaman sehingga nilai kayu menjadi turun. Terjadinya perubahan warna pada kayu disebabkan oleh pigmen melamin dalam hifa yang berwarna biru (Tapa Darma, 1986). Berbagai usaha telah dilakukan untuk pencegahan serangan jamur blue stain, tetapi hasilnya belum memadai, antara lain dengan cara perlakuan fisik, kimia dan biologi. Perlakuan fisik dan kimia sering memberi dampak negatif pada lingkungan (seperti pencemaran), selain sulit dilakukan juga membutuhkan biaya yang besar. Dalam usaha dengan perlakuan secara biologi ini sering dampak negatif terhadap lingkungan dapat diatasi. Perlakuan biologi dengan menggunakan musuh alaminya dapat memberikan keuntungan yang besar bagi lingkungan. Menurut Umbreit (1962) bahwa T. viride merupakan salah satu species yang dapat bersifat antagonis terhadap jamur patogen yang paling banyak dijumpai, serta didapatkan secara luas didalam tanah dan bersifat antagonis terhadap beberapa jenis jamur tanah (Campbell, 1985). Tujuan penelitian ini untuk mengetahui pengaruh jamur antagonis Trichoderma viride terhadap pertumbuhan jamur blue stain (Botryodiplodia theobromae Pat.) pada kayu karet...
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