Judul: Identifikasi Status Ketersediaan Boron pada Tanah di Beberapa Daerah di Indonesia.
Abstrak: Pemupukan unsur hara mikro sering diabaikan, sehingga mengakibatkan defisiensi unsur hara mikro. Boron (B) merupakan salah satu unsur hara mikro dengan tingkat kejadian defisiensi yang tinggi. Penelitian ini bertujuan mengevaluasi dan mengidentifikasi status ketersediaan B pada tanah di beberapa daerah di Indonesia. Identifikasi ketersediaan B pada tanah di Indonesia menggunakan contoh tanah yang diambil secara random dari 23 lokasi. Contoh tanah kemudian dikering-udarakan, contoh tanah yang sudah siap kemudian di ekstrak menggunakan dua metode yaitu ekstraksi CaCl2 0,02 M panas dan metode ekstraksi Morgan, dengan metode kolorimetri menggunakan metode kurkumin. Hasil penelitian menunjukkan ketersediaan B dengan ekstrasi CaCl2 0,02 M panas memiliki nilai yang rendah, dan hanya sebagian kecil memiliki nilai ketersediaan B pada kelas sedang, tidak ada tanah dengan ketersedian B > 1 ppm. Lokasi dengan nilai ketersediaan B sangat rendah yaitu Grobogan, Bangli, Karawang, Semarang, dan Garut, sedangkan lokasi dengan nilai ketersediaan B rendah yaitu Subang, Cikabayan, Bandung, Mojokerto, Pesisir Barat, Ngampuang Jombang, Banjar Agung Jombang, pesisir selatan, Lahat, Banten, Bojonegoro, dan Boyolali, dan ketersediaan B pada kelas sedang terdapat pada contoh tanah dari lokasi Pati, Jasinga Bogor, Labuhan Batu Utara, Padaluyu, Cisarua Bogor, dan Sorowako. Jika nilai kelas ketersediaan B disajikan dalam persentase didapatkan hasil, kelas sangat rendah sebesar 21,7 %, kelas rendah sebesar 52,2 % dan kelas sedang sebesar 26,1 %, tidak ada tanah yang tergolong ke dalam kelas tinggi. Hal tersebut menunjukan ketersediaan B pada tanah di beberapa daerah di Indonesia tergolong rendah, hal ini cukup mengindikasikan tanah di Indonesia mengalami masalah ketersediaan B yang serius.
Keyword: Defisiensi Boron, Metode ekstraksi Morgan, Pemupukan Unsur Hara

Judul: Analsis Status Hara Fosfor Pada Berbagai Lahan Pertanian Pangan di Pulau Jawa
Abstrak: Indonesia is an agricultural country that has the fourth largest population in the world with 237,6 million people and growth rate of 1,49%. One program that made by the government to fulfill the demands of food is agricultural intensification program. While using the improved varieties, fertilizing is one of the most important input to succed this program. In Indonesia, P fertilizer is the second most important after N fertilizer, especially on up land. Availability of phosphorus in the soil becomes very important because it has many roles in plants. However, in the soil, their availability relatively low because of binding by Al, Mn and Fe in acid soils, or by Ca, Mg in alkaline soil. Since it is easily fixed and the presence of P in the soil is limited but needed in large quantities, the role of P fertilizer is critical in maintaining the availability of P nutrient for plant growth. The phenomenon levelling off, which is the rate of increase in soil productivity is not in line with the rate of fertilizer is the main reason to evaluate the status of the current P nutrient in agricultural soils in Java. This study aimed to evaluate the status of the current P nutrient (available-P and potential-P) in agricultural lands in Java, and their association with some other soil chemical properties. There are 43 samples (locations) were taken from the island of Java, which consists of 23 samples of paddy field and 20 samples of up land agriculture. The methods that used to measure the potential-P is HCl 25% extraction and the available-P is Bray 1. The results based on the available criteria show that from 23 samples of paddy field, 19 samples have very high status of potential-P, two samples have high status and two other samples have low status of potential-P. In the paddy field available-P there are 21 samples that have very high status and two other samples that have high and low status of available-P. On up land agriculture, from 20 samples, 15 samples have very high status of potential-P, four samples have high status and one other sample have medium status. Available-P in up land agriculture entirely have very high status. For paddy field there are positive correlations between available-P with exch-Ca, and pH, meanwhile on up land agriculture, potential-P has positive correlations with total-C, total-N, and EC. From this study, it is concluded that the status of P in agricultural soil in Java is in general very high. In the future, it is worthed to consider how to harvest especially the potential-P for plant growth.
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