Judul: Pengamatan Penyakit Cacar Daun cengkeh di Wilayah Kerja Penyuluhan Pertanian Cikalong, Wilayah Kerja Balai Penyuluhan Pertanian Cipeundeuy, kabupaten bandung Provinsi Jawa Barat
Abstrak: Survei Hama dan Penyakit Tumbuhan ini bertujuan untuk IP mengetahui luas dan intensitas serangan patogen cacar daun cengkeh (Phyllosticta sp.) serta mengetahui cara-сага ре- ngendalian yang dilakukan oleh petani di Wilayah tersebut. Pengamatan dilakukan di Desa Cikalong dan Ciptagumati, dari tanggal 12 Pebruari 1986 sampai dengan tanggal 22 Ma- ret 1986. Data primer diperoleh dari pengamatan pada 13 lokasi pertanaman yang tiap lokasi diamati 5-10 persen pohon contoh yang ditentukan secara diagonal. Tiap pohon diamati 120 daun yang terbagi dalam 12 subsektor tajuk. Data penunjang didapatkan dari wawancara dengan petani, petugas Dinas Perkebunan dan catatan tentang keadaan lokasi pengamatan. Hasil pengamatan menunjukkan bahwa patogen cacar daun cengkeh telah menyerang seluruh pertanaman cengkeh rakyat di wilayah pengamatan. Intensitas serangannya relatif tinggi pada pertanaman di daerah lembah dan pada tajuk ba- gian bawah. Pada tajuk yang menghadap ke timur menunjuk- kan intensitas serangan patogen relatif rendah.
Keyword: 

Judul: Penelitian Penyakit Cacar Daun Pada Tanaman Cengkeh (Eugenia caryophyllata Thunb.)
Abstrak: Penelitian ini bertujuan untuk mengetahui penularan penyakit, morfologi gejala serta ketahanan patogen cacar daun cengkeh. Gejala penyakit cacar daun cengkeh mudah dikenal yaitu bagian daun yang terserang tampak seperti tetesan minyak, tembus cahaya, cembung di permukaan atas dan cekung di permukaan bawah daun. Jika yang terserang adalah daun muda, umumnya mengakibatkan daun salah bentuk (bengkok, bergelombang) akibat pertumbuhan daun tidak seimbang, sedang jika yang terserang adalah daun yang relatif tua maka bentuk daun tidak berobah. Pengamatan irisan melintang daun yang terserang CDC, terlihat piknidia cendawan berbentuk bulat, berdinding tebal, berwarna gelap dan berisi dengan spora-spora. Piknidia tersebut berukuran antara 64 x 38 M - 99 x 12 M. Konidia cendawan berbentuk bulat sampai elip, hialin dan berekor. x 8.5 M. Konidia tersebut berukuran 3.4 x 5.1 5.1 M -5.1 Askus cendawan patogen berhasil diamati pada daun sakit yang telah gugur. Askus ini berbentuk tabung, berukuran antara 18.7 x 28.2 M 20.4 x 49.3 M Spora yang terdapat di dalam askus (askospora) berukuran antara 3.4 x 5.1 M - 5.1 x 8.5 M.
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