Judul: Pengaruh stres kurang air dan pemberian nitrogen terhadap pertumbuhan vegetatif tanaman mangga (Mangifera indica L.)
Abstrak: Tujuan percobaan ini adalah untuk mengetahui pengaruh stres kekurangan air terhadap pertumbuhan vegetatif tanaman mangga, serta pengaruh pemberian nitrogen terhadap tanaman mangga yang telah mengalami stres kekurangan air. Percobaan dilaksanakan di Rumah Kaca Kebun Percobaan IPB Tajur, berlangsung dari bulan Juni 1993 sampai Januari 1994. Percobaan terbagi atas 2 periode dengan perlakuan yang sama pada masing-masing periode. Rancangan percobaan yang digunakan adalah Rancangan Acak Kelompok dengan dua faktor. Faktor pertama adalah kondisi stres kekurangan air (W) yang meliputi 4 taraf, yaitu kontrol, pengairan setiap hari sebanyak 1 liter air (Wo); pengairan setiap 4 hari dengan 500 ml air, berlangsung selama sebulan (W3); pengairan setiap 7 hari dengan 500 ml air, berlangsung selama sebulan (W); dan pengairan setiap 10 hari dengan 500 ml air, berlangsung selama sebulan (W). Perlakuan stres kekurangan air periode I berlangsung pada 21 Juli sampai 21 Agustus 1993, dan pada 4 November sampai 4 Desember 1993 pada periode II. Setelah perlakuan stres kekurangan air selesai, tanaman diairi dengan menggunakan 1 liter air per tanaman per hari.
Keyword: 

Judul: Pengaruh stres air dan pemupukan nitrogen terhadap pertumbuhan jagung
Abstrak: Tujuan penelitian ini yaitu mempelajari interaksi stres air dan pemupukan nitrogen ,dan pengaruh stres air serta pemupukan nitrogen pada pertumbuhan dan hasil jagung. Dilakukan percobaan faktorial 4 x 4 dengan menggunakan pot dalam rumah kaca. Pemupukan nitrogen menekan pengaruh stres air terhadap pertumbuhan tanaman. Pemupukan nitrogen, meningkatkan ukuran biji pada kadar air tanah tersedia yang tinggi. Efisiensi penggunaan air meningkat dengan meningkatnya pemupukan nitrogen. Produksi tanaman meningkat dengan meningkatnya evapotranspirasi. Luas daun total dan luas daun aktip saat silking, bobot kering daun dan bobot kering akar saat silking, dan evapotranspirasi, rneningkat dengan meningkatnya kadar air tanah tersedia. Kadar klorofil, dan kadar nitrogen - total daun, meningkat dengan meningka1.nya dosis pemltpukan nitrogen. Disarankan agar program pemupukan nitrogen didasar - kan pada ketersediaan air tanah.
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