Judul: Keefektifan Trichoderma koningii dan PGPR terhadap Patogen pada Benih Melon (Cucumis melo. L).
Abstrak: Melon (Cucumis melo L.) memiliki banyak manfaat diantaranya sebagai anti kanker dan menurunkan resiko stroke. Kesadaran masyarakat mengenai pola hidup sehat menyebabkan permintaan melon meningkat. Berdasarkan data statistik dari Kementrian Pertanian melon mengalami penurunan produksi akibat perubahan kondisi lingkungan serta perkembangan hama dan penyakit. Metode pengendalian yang berwawasan lingkungan, efektif dan murah diperlukan sebagai pengganti pestisida dalam pengendalian penyakit benih melon. Tujuan penelitian ini adalah menguji dan mengetahui efektivitas agens hayati dalam mengendalikan penyakit pada benih melon. Agens hayati yang digunakan pada penelitian ini yaitu Plant Growth Promoting Rhizobacteria (PGPR) dan Trichoderma koningii. Metode penelitian ini meliputi isolasi cendawan patogen pada benih melon, uji patogenesitas cendawan dan bakteri patogen, pengujian daya hambat pada media PDA secara in-vitro dengan perlakuan T. koningii, PGPR, fungisida 0.5 ml/l, bakterisida, dan kontrol, serta pengujian perendaman benih pada masing-masing uji perlakuan. Hasil dari isolasi benih melon didapatkan cendawan patogen Aspergillus niger dan Trichoderma sp. dan bakteri patogen B1. PGPR dapat menghambat patogen A. niger pada benih melon secara in-vitro sebesar 68.2%, sedangkan T. koningii dapat menghambat pertumbuhan cendawan patogen Trichoderma sp. secara in-vitro sebesar 64.5% serta dapat menekan infeksi patogen pada benih melon setelah perlakuan perendaman benih. T. koningii dalam menghambat cendawan patogen pada uji antogonisme berupa kompetisi ruang, antibiosis dan parasitisme.
Keyword: Agens hayati, Aspergillus niger, uji patogenesitas

Judul: Effectiveness of Bacteria Again Important Pests on Melon Plants Supervised
Abstrak: MERI ELIZA. Keefektifan Bakteri Agens Hayati terhadap Hama Penting pada Melon. Dibimbing oleh SURYO WIYONO dan BONJOK ISTIAJI. Penggunaan bakteri sebagai agen biokontrol termasuk upaya mengurangi dampak negatif penggunaan pestisida sintetik. Penelitian ini bertujuan untuk mengetahui efektivitas bakteri P14 dan J8 dalam mengendalikan hama. Penelitian ini dilakukan di perkebunan melon di Desa Jembayat, Kabupaten Tegal, Jawa Tengah pada bulan September hingga November 2021. Pengambilan data dilakukan secara langsung dengan mengamati gejala, tingkat kerusakan hama, serta menghitung populasi hama. Studi ini dilakukan denngan melihat pengaruh aplikasi agens biologis bakteri pada hama utama melon, yaitu kutu daun, kutu putih, lalat buah, dan kumbang daun. Percobaan disusun dalam Rancangan Acak Kelompok (RAK). Daerah penelitian terdiri dari lima blok sebagai ulangan, setiap blok berisi enam perlakuan yang ditandai dengan label.Hasil penelitian menunjukkan bakteri agens hayati P14 dan J8 menekan populasi kutu putih secara nyata pada umur 4 -7 minggu setelah tanam. Selain itu, bakteri P14 dan J8 juga berpengaruh terhadap peningkatan daya kecambah biji melon., MERI ELIZA. Effectiveness of Bacteria Agains Important Pests on Melon Plants. Supervised by SURYO WIYONO and BONJOK ISTIAJI. The use of bacteria as biocontrol agents includes efforts to minimize the negative impact of using synthetic pesticides. This study aims to determine the effectiveness of P14 and J8 bacteria to control pests. This research was conducted on a melon plantation in Jembayat Village, Tegal Regency, Central Java from October 2021 to November 2021. Data collection was carried out directly by observing the symptoms and the damage rate of pests, and calculating the population of pests. This study looked at the effect of the application of bacterial biological agents on major melon pests including aphids, mealybugs, fruit flies and leaf beetles. The experiments were arranged in a Randomized Block Design. The research area consists of five blocks as replicates, each block contains six treatments marked with the label. Research result show treatment of P14 and J8 bacteria agens hayati suppresses the population of mealybugs at some observation date In addition, P14 and J8 bacteria also had an effect on increasing the germination of melon seeds.
Keyword: induced resistance,, mealybugs, Plant Growth Promoting Rhizobacteria (PGPR)

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