Judul: Survei Penyakit Keriting (Cladosporium cladosporioides) pada Tanaman Pepaya di Bogor
Abstrak: Papaya is one fruit crops which are widely grown and consumed in Indonesia. Some pests and diseases in papaya are known to be limiting factor on the papaya production. Among o the diseases existing, the new disease namely leaf curl disease caused by Cladosporium cladosporioides has been reported since 2011 in Bogor. The objectives of this survey was to determine the status of this disease in the fields and same agricultural practices that may affect its development. The survey was conducted in two subdistricts Rancabungur and Sukaraja where papaya mostly cultivated. The results showed that leaf curl disease is widely spread in those two districts as indicated by the disease incidence, the disease incidence in Rancabungur and Sukaraja was 86.7% and 95.7% respectively. However, the disease severity is still moderate with average ranging from 24.2 to 27.6%. Generally the disease incidence in moderate type (Caliporan) and monoculture cropping system was lower than the large type (Bangkok) and multiple cropping system. Meanwhile, the disease severity did not show much differences due to the fruit type and cropping system. Other cultivated practices did not show much differences effect, both to the disease incidence and severity.
Keyword: 

Judul: Pengamatan penyakit tanaman pepaya (Carica papaya L.) dan usaha pengendaliannya di desa Cicantayan Kecamatan Cibadak, Kabupaten Sukabumi
Abstrak: Tujuan praktek lapang ini dimaksudkan untuk mengetahui penyakit-penyakit yang ada pada tanaman pepaya di Dess Cicantayan. Selain itu dilakukan pula penghitungan intensitas, luas serangan dan dilakukan pula pengendalian terhadap patogen-patogen yang tergolong penting saat pelaksanaan praktek lapang. Selama pelaksanaan praktek lapang, pengamatan dilakukan di lokasi proyek "SEAMEO PILOT PROJECT FOR INTE - GRATED COMMUNITY-BASED ON HUMAN RESOURCE DEVELOPMENT", yang meliputi lima Kemandoran di Desa Cicantayan. Beberapa penyakit yang terdapat pada tanaman pepaya adalah penyakit busuk akar dan busuk batang yang disebabkan oleh Pythium sp., penyakit antraknosis pada buah yang disebabkan oleh Colletotrichum sp., penyakit busuk buah Pythium, penyakit bercak daun coklat disebabkan oleh Corynespora sp., dan penyakit pada daun yang disebabkan oleh Nigrospora sp. Serangan Colletotrichum sp. dijumpai di seluruh lokasi pertanaman pepaya dan paling banyak menimbulkan kerugian bagi petani. Faktor-faktor yang merangsang tingginya intensitas serangan antara lain curah hujan yang cukup tinggi dan sering, sistem drainase yang kurang baik, sanitasi lapang yang kurang baik dan pengetahuan petani tentang budidaya pepaya yang masih kurang. Usaha pengendalian yang sudah dilakukan yaitu mengambil bagian-bagian tanaman yang sakit dan membuangnya ke tempat lain di luar pertanaman pepaya, melakukan sanitasi lapang dengan membersihkan gulma dan bagian-bagian tanaman sakit yang jatuh yang ada di pertanaman dan menyemprot fungisida Dithane M-45 80 WP untuk mengendalikan penyakit bercak daun coklat dan menyiramkannya di sekitar perakaran untuk mengendalikan penyakit busuk akar dan busuk batang. Dilakukan pula penyemprotan fungisida Benlate T-20/20 WP untuk mengendalikan penyakit antraknosis pada buah.
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