Judul: Pengusahaan tanaman teh di P.T. Perkebunan XII cianten, bogor
Abstrak: Sejarah menyebutkan bahwa Teh (Camellia sinensis) pada mulanya hanya terdapat didataran Asia perbatasan negara negara Muangtai, Burma, India, Laos, Kamboja, dan Cina yang berupa vegetasi hutan liar di wilayah dengan sifat keadaan tanah dan iklim seragam yang baik bagi pertumbuhan teh secara alami. - Cina merupakan negara yang pertama kali mengguna- kan teh sebagai bahan minuman. Buku "Pen Tsao" di ja- man kerajaan Shen Nung pada tahun 2737 SM antara lain telah menulis mengenai teh sebagai hidangan bagi para raja raja di negeri Cina. Pada tahun 780 seorang pe nulis dan ahli tentang teh bernama Lu Yu dalam bukunya yang berjudul "Cha Ching" telah menguraikan mengenai pertanaman teh, cara pemeliharaan, pemetikan daun, pe- ngolahan dan me amu teh sebagai minuman. - Akhir abad keenam teh telah mulai dikenal di ne geri Jepang. Pada tahun 1738 Soichiro Nagatani menemu kan sistim pengolahan teh hijau, dan sejak itu tanaman teh tumbuh dan berkembang dalam suatu areal perkebunan luas. ...
Keyword: 

Judul: Budidaya dan Pengolahan Teh Hitam di Perkebunan Teh Malabar, PT Perkebunan XIII Bandung
Abstrak: Tanaman teh (Camellia sinensis) berasal dari daerah Cina, India, Burma dan Pegunungan Himalaya, kemudian di- sebar ke daerah lain. Perdagangan internasional bahan tersebut dimulai pada abad ke VI antara pedagang-pedagang bangsa Turki dengan pedagang bangsa Cina dan dalam waktu singkat, perdagangan teh meluas dengan cepat sekali. Sebagian besar negara-negara di Eropa yang pada waktu itu memiliki tanah-tanah jajahan di daerah tropis menaruh per- hatian yang besar untuk memperkebunkan teh di tanah jajah- annya masing-masing. Untuk pertama kalinya tanaman teh dari jenis Bohea dimasukkan ke Indonesia pada tahun 1700 oleh Belanda dari Jepang. Tujuannya ialah sebagai langkah pertama untuk memperkebunkan teh secara besar-besaran. Karena gagal tumbuh maka pada tahun 1826 untuk kedua kalinya tanaman tersebut dimasukkan dan berhasil tumbuh. Kemajuan pesat usaha budidaya teh baru terjadi sesudah tahun 1878 yaitu setelah dimasukkannya varietas Assamica dari India ke pu- lau Jawa.
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