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: Validation of Microsatellite Markers on Several Water Apple (Syzygium aqueum (Brum.f.) Alston)
Abstrak: Jambu air (Syzygium aqueum (Burm.f.) Alston) merupakan spesies yang masuk ke dalam famili Myrtaceae. Famili ini memiliki jumlah spesies yang banyak sehingga sulit untuk menganalisis perbedaan antar spesies ataupun kultivar. Analisis dengan menggunakan parameter morfologi kurang akurat karena dipengaruhi lingkungan sehingga perlu dilakukan analisis secara molekuler menggunakan marka mikrosatelit. Penelitian ini bertujuan memvalidasi marka mikrosatelit pada beberapa kultivar jambu air. Percobaan ini dilakukan di Laboratorium Seed center, Kebun Percobaan Leuwikopo, Institut Pertanian Bogor, Dramaga, Bogor. Bahan penelitian ini terdiri dari 10 kultivar jambu air dan 10 marka mikrosatelit. Waktu penelitian dimulai dari bulan September 2022 hingga Mei 2023. Penelitian ini dimulai dari proses pengambilan sampel, ekstraksi DNA, Pengujian kualitas dan kuantitas DNA, amplifikasi DNA, hingga elektroforesis hasil amplifikasi. Hasil penelitian menunjukkan bahwa marka mikrosatelit yang digunakan mampu mengamplifikasi 60-100% kultivar jambu air. Semua marka/lokus dapat digunakan untuk analisis molekuler, namun hanya lokus P10 yang mampu membedakan genetik antar kultivar. Lokus P10 diduga merupakan lokus polimorfik., Water Apple (Syzygium aqueum (Burm.f.) Alston) is a species belonging to the family Myrtaceae. This family has a large number of species so it is difficult to analyze differences between species or cultivars. Analysis using morphological parameters is less accurate because it is influenced by the environment, so it is necessary to carry out molecular analysis using microsatellite markers. This study aims to validate microsatellite markers on several water apple. This experiment was conducted at the Seed center Laboratory, Leuwikopo Experimental Garden, Bogor Agricultural University, Dramaga, Bogor. The research material consisted of 10 guava cultivars and 10 microsatellite markers. The study time is from September 2022 to May 2023. This research starts from the sampling process, DNA extraction, DNA quality and quantity testing, DNA amplification, to electrophoresis of amplification results. The results showed that the microsatellite markers used was able to amplify 60-100% of the water apple cultivars. All markers/loci can be used for molecular analysis, but only P10 loci capable of distinguishing genetically between cultivars. The P10 locus is thought to be a polymorphic locus.
Keyword: Amplifikasi, Asam Nukleat, Elektroforesis, Genetik, Myrtaceae

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