Judul: Tinjauan beberapa aspek iklim terhadap budidaya tanaman terong KB ( Solanum khasianum Clarke ) di kebun percobaan Manoko, Lembang
Abstrak: Telaah lapang ini dilakukan selama bulan Juni 1986, dengan tujuan untuk mengetahui interaksi beberapa aspek iklim terhadap pertumbuhan dan perkembangan tanaman obat, dalam hal ini tanaman Terong KB, di Kebun Percobaan Balai Penelitian Tanaman Rempah dan Obat Manoko, Lembang. Dari data iklim di Kebun Percobaan Manoko, didapatkan bahwa curah hujan rata-rata bulanannya cukup bervariasi antara 51 mm - 247 mm, suhu udara rata-rata bulanannya ber- fluktuasi tidak menyolok yaitu 19.4°C 19.9°C, dan kelem- - baban udara rata-rata bulanannya antara 90.5% 96.1%. Se- - dangkan lama penyinaran rata-rata bulanan di Kebun Percoba- an Manoko berkisar antara 3.25 jam 6.29 jam dan intensi- tas radiasi rata-rata bulanannya relatir rendah yaitu 280.1 kal cm2min-1 - 378.9 kal cm-2min-1. Berdasarkan da- ta tersebut, dapatlah diketahui bahwa Kebun Percobaan Mano- ko mempunyai tipe iklim Am menurut sistem Koppen, tipe ik- lim B menurut sistem Schmidt dan Ferguson, serta tipe ik- lim E₂ menurut sistem Oldeman. ...
Keyword: 

Judul: Pengujian pengaruh jarak tanam terhadap pertumbuhan dan hasil buah tanaman Solanum khasianum di kebun percobaan Manoko - Lembang
Abstrak: Tujuan penelitian adalah untuk mengetahui pengaruh penggunaan berbagai macam jarak tanam terhadap pertumbuhan dan hasil buah tanaman Solanum khasianum Clark. Bahan untuk penelitian ini digunakan varietas Less spine. Rancangan yang digunakan adalah rancangan acak kelompok, dengan 10 anak contoh per petak percobaan. Pengujian dilakukan secara serempak terhadap nilai tengah perlakuan jarak tanam. Juga dilakukan penentuan banyak- nya contoh yang dapat diambil dari setiap petak. Pengamatan dilakukan terhadap tinggi tanaman, jumlah bunga, jumlah buah, dan hasil buah (jumlah dan bobot buah segar). Jarak tanam rapat cenderung mempunyai tanaman yang lebih tinggi dibanding jarak tanam renggang. Jumlah bunga dan buah pada jarak tanam renggang lebih banyak dibanding pada jarak tanam rapat. Dari hasil analisa terlihat bahwa macam jarak tanam yang dicobakan tidak mempunyai pengaruh yang nyata terhadap pertumbuhan dan hasil buah S. khasianum. Pada jarak tanam yang semakin rapat, banyaknya tanaman yang diambil sebagai contoh dari setiap petak percobaan dapat diperbesar untuk mendapatkan kete- patan pendugaan yang lebih baik.
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