Judul: Hama dan Penyakit Jambu Air (Syzygium samarangense (Blume) Merr. & L.M. Perry) di Kabupaten Demak, Jawa Tengah.
Abstrak: Water apple is a fruit icon of Demak Regency. Pests and diseases are major problems in water apple cultivation. This research aims to inventory the main pests and diseases of water apple in Demak Regency, Central Java. Research was conducted in three steps: field observation and collection, species identification in the laboratory, and interview water apple farmers. Field observation was conducted in four water apple plantations in Bintoro district. Ten water apple trees were sampled diagonally from each plantation and observation was conducted on four twigs that were determinated based on cardinal direction: west, east, north, and south. Interview farmer was based on questionaire specially designed to reveal farmer’s identity, cultivation techniques, pests and diseases management in water apple plantation. There were some pests found such as spiralling white fly (Aleurodicus dispersus), white moth cicada (Sanurus indecora), fruit flies (Bactrocera albistrigata), leaf-roller weevils (Apoderus trinotatus), leaf borer (Lepidoptera: Gracillaridae), leaf folder (Lepidoptera: Tortricidae), and shoot roller (Lepidoptera: Tortricidae). The diseases were found such as red rust (Cephaleuros sp.), sooty mold (Capnodium sp.), pink disease (Corticium salmonicolor), and anthracnose (Gloeosporium sp.).
Keyword: Density, identification, inventory, plant damage, severity

Judul: Keefektifan Pembungkusan Buah Untuk Pengendalian Penyakit Antraknosa Dan Lalat Buah Pada Tanaman Jambu Air (Syzygium Samarangense)
Abstrak: Jambu air (Syzygium samarangense) merupakan buah yang memiliki kandungan air yang melimpah dan dapat dikonsumsi dalam bentuk buah segar. Masalah pada tanaman jambu air adalah adanya serangan hama dan penyakit. Penyakit yang paling sering menyerang buah jambu air adalah penyakit antraknosa dan hama yang menyebabkan busuk adalah lalat buah. Penelitian ini bertujuan untuk mengetahui pengaruh pembungkusan buah dan perawatan lahan terhadap perkembangan penyakit antraknosa dan lalat buah pada tanaman jambu air di Desa Betokan, Tempuran dan Bintoro, Kecamatan Bintoro, Kabupaten Demak. Pengujian menggunakan metode rancangan acak lengkap dua faktorial dengan enam perlakuan dan 10 ulangan. Analisis data menggunakan program SAS untuk Windows versi 9.1 dengan uji lanjut Duncan pada taraf 5%. Hasil dari penelitian ini yaitu pembungkusan dan perawatan lahan yang dilakukan pada keenam lahan tidak berpengaruh terhadap kejadian dan keparahan penyakit. Perawatan lahan yang dilakukan pada keenam lahan tidak berpengaruh terhadap tingkat serangan lalat buah, namun pembungkusan buah cukup efektif untuk mengendalikan serangan lalat buah.
Keyword: Bactrocera, cendawan, Demak, kejadian penyakit, keparahan penyakit.

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