Judul: Analisis Tingkat Mortalitas Hama Tembakau Myzlls Persicae
Abstrak: Tanaman tembakau adalah salah satu tanaman yang berpotensi sebagai tanaman insektisida, karen a nikotin yang terkandung didalamnya dapat membunuh hama yang menyerangnya. Salah satu hama yang sering mengganggu pertumbuhan tembakau adalah sejenis kutu daun yang bernama Myzus persicae, Pada penelitian ini, ingin diketahui pengaruh dosis ekstrak limbah tembakau terhadap tingkat kematian hama Myzus persicae, dengan data respon berupa peubah biner. Metode ana !isis yang sering digunakan untuk data rancangan percobaan adalah ANOY A. Pada data awal mortalitas Myzus persicae, ANOY A kurang sesuai digunakan sehingga dibutuhkan transformasi data. Setelah ditransformasi arcsin hasil pengujian ANOY A masih belum sesuai, hal ini dikarenakan asumsi yang mendasari ANOY A tidak terpenuhi.
Keyword: 

Judul: Knowledge, Attitude, and Practice of Farmers in  Tobacco Pest and Disease Management in Banyudono, Boyolali Regency
Abstrak: Tembakau memegang peranan penting sebagai komoditas ekspor di Indone sia. Namun demikian, hama dan penyakit seringkali membatasi produksi temba kau. Penelitian ini bertujuan memperoleh informasi mengenai pengetahuan, sikap, dan tindakan petani dalam pengelolaan hama dan penyakit tanaman tembakau di Kecamatan Banyudono, Kabupaten Boyolali. Penelitian dilakukan dengan metode survei langsung kepada 60 petani tembakau dengan menggunakan kuesioner ter struktur untuk mendapatkan data primer. Sementara itu, data sekunder diperoleh dari pemerintah daerah. Data yang diperoleh disajikan secara deskriptif dan diana lisis dengan menggunakan χ2 (chi-square). Pengetahuan petani tentang budi daya tembakau berasal secara turun-temurun dari orang tua. Hama dan penyakit utama budi daya tembakau adalah Spodoptera litura, Myzus persicae, Aphis gosypii, Helicoverpa sp., Bemisia sp., penyakit kerupuk (Tobacco leaf curl virus), lanas (Phytohpthora nicotiane), dan patik daun (Cercospora nicotinae). Serangan hama dan penyakit tersebut dapat menyebabkan penurunan kualitas tembakau. Hub ungan antara usia, pendidikan, pengalaman usaha tani, dan keanggotaan gapoktan menunjukkan bahwa pengetahuan petani berhubungan dengan tingkat pendidikan petani. Sikap petani berhubungan dengan usia dan pendidikan, sedangkan tinda kan petani berhubungan dengan tingkat pengalaman usaha tani dan keanggotaan gapoktan., Tobacco plays role as important export commodity in Indonesia. This re search was aimed to obtain informations about the knowledge, attitude, and prac tice of of tobacco pests and diseases management in Banyudono District, Boyolali Regency. This research was done by conducting direct survey to 60 tobacco farm ers using structured questionnaires to collect primary data, while a data was ob tained from local government. The data obtained were presented descriptively and analyzed using χ2 (chi-square). Farmers' knowledge about tobacco cultivation comes from generation to generation from their parents. Major pests and diseases of tobacco plants were Spodoptera litura, Myzus persicae, Aphis gosypii, Heli coverpa sp., Bemisia sp., leaf curl disease (Tobacco leaf curl virus), black shank (Phytohpthora nicotiane), and frog-eye disease (Cercospora nicotinae). These pests and diseases reduced tobacco quality. The relationship among age, educa tion, farming experience, and the membership of farmer group, showed that the farmers’ knowledge was closely related to their formal education background. Farmers’ attitude was correlated with age and formal education, while farmers’ practice was correlated with farming experience and the membership of farmer group
Keyword: cultivation, farmer characteristics, IPM

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