Judul: Studi pemupukan terhadap tembakau (Nicotiana tabacum L.) varietas coker 86 pada tanah berasal dari Bali dan Lombok
Abstrak: Usaha peningkatan produksi dan kualitas tembakau "fluecured" melalui pemupukan masih memerlukan pengujian-pengujian untuk memperoleh pemupukan yang optimal. ...
Keyword: Nicotiana tabacum, Fertilizers

Judul: Pengaruh Pemupukan N, P, K, Mg, dan B terhadap Produksi dan Kadar Hara Daun Tembakau (Nicotiana tabacum L.) Muntilan V arietas Bligen pada Vertisol Bojonegoro
Abstrak: Kualitas daun tembakau Jawa/Muntilan atau tembakau rajangan yang diusahakan di daerah Bojonegoro kurang memuaskan terutama berkaitan dengan kualitasnya antara lain: kandungan klor yang cukup tinggi, warna daun buram, dan aroma yang tidak seperti yang diharapkan. Qleh karena itu, dibutuhkan usaha untuk meningkatkan produksi dan mutu tembakau tersebut. Salah satu upaya yang dapat dilakukan adalah dengan perbaikan metode dan dosis pemupukan. Penelitian ini bertujuan untuk mengetahui pengaruh pemberian pupuk potassium nitrate, kieserit, dan boronat 3 8% terhadap produksi tanaman tembakau Muntilan. Selain itu juga ditujukan untuk mengetahui pengaruh pupuk tersebut terhadap kandungan unsur dalam daun tembakau tersebut. Penelitian dilakukan dalam 2 tahap, yaitu: 1) budidaya tembakau Muntilan di lahan petani binaan PT. Gudang Garam dari awal bulan Mei hingga awal Oktober 2003; 2) analisis kandungan unsur dalam daun rajangan tembakau Muntilan, dari bulan Februari sampai Juli 2004. Penelitian ini menggunakan rancangan acak kelompok dengan 1 7 perlakuan, 3 ulangan tiap lokasi, dan 5 formulasi unsur yaitu N, P, K, Mg, B dan pupuk kandang. Masing-masing perlakuan dicobakan pada 3 lokasi, yaitu kecamatan Cekalang, Tluwe, dan Njajar. Secara umum pemupukan tidak berpengaruh nyata terhadap produksi baik bobot daun basah, bobot daun rajangan basah, dan bobot daun rajangan kering. Pemupukan juga tidak meningkatkan kandungan N, P, K, Ca, Mg, B, dan Cl dalam tanaman tembakau. Kandungan N dalam daun tanaman tembakau Muntilan di Kecamatan Cekalang dan Njajar sudah memenuhi kriteria kadar N dalam daun tembakau yang berkualitas baik (Hawks dan Collins, 1983) kecuali perlakuan 10 di Kecamatan Cekalang, sedangkan kadar N di Kecamatan Tluwe belum memenuhi kriteria tersebut kecuali perlakuan 1, 2, dan 3. Kandungan Ca dalam daun tembakau Muntilan kebih tinggi dari kriteria kandungan Ca dalam daun….dst
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