Judul: Pengaruh efek residu terhadap karakter fisik dan kimiawi serta aktivitas antioksidan kulit buah Manggis (Garcinia mangostana L.)
Abstrak: Komoditas manggis memiliki nilai ekonomi yang tinggi dan sangat potensial untuk dikembangkan menjadi komoditas ekspor unggulan. Potensi manggis tidak hanya terbatas pada buahnya saja, tetapi hampir seluruh bagian tumbuhan manggis menyimpan potensi yang sangat bermanfaat bagi kehidupan manusia. Species Garcinia diketahui kaya akan kandungan senyawa polifenol yang memiliki aktivitas antioksidan tinggi. Adanya pengaruh suatu faktor budidaya terhadap peningkatan sejumlah senyawa kimia tertentu yang terdapat pada buah manggis dan bermanfaat bagi kesehatan, merupakan suatu peluang untuk meningkatkan nilai tambah buah manggis. Penelitian ini bertujuan untuk mengetahui pengaruh hara N, P, dan K terhadap karakter fisik dan kimia buah manggis dan mengetahui pengaruh hara terhadap aktivitas antioksidan kulit manggis. Penelitian dilakukan di Laboratorium Pasca Panen dan Laboratorium Analisis Tanaman dan Kromatografi, Departemen Agronomi dan Hortikultura, Institut Pertanian Bogor. Penelitian dilaksanakan dari bulan Februari – Juli 2010. Penelitian ini merupakan penelitian lanjutan, tanaman manggis yang digunakan merupakan tanaman yang sebelumnya pernah digunakan untuk penelitian pemupukan selama 5 tahun sejak tahun 2004 hingga 2008 dan tanaman tersebut sudah pernah berbuah beberapa kali.
Keyword: 

Judul: Karakter Kulit Manggis, Kadar Polifenol Dan Potensi Antioksidan Kulit Manggis (Garcinia mangostana L.) Pada Berbagai Umur Buah Dan Setelah Buah Dipanen
Abstrak: The objective of this study were to know the character of mangosteen rind during development of the mangosteen fruit, studying the total phenol content and antioxidant potential of mangosteen rind. Research was done at Plant Analysis and Chromatoghrapy Laboratory, Deparment of Agronomy and Horticulture, Bogor Agricultural University. This research used Completely Randomized Desain Group (RKLT) single factor wich is harvesting, with continue test Duncan Multiple Range Test (DMRT) at level 5%. Harvesting one month after anthesis (BSA), 2 BSA, 3 BSA, 4 BSA and the rind storage two and four weeks after harvesting were done separately. Mangosteen fruit was harvested from Leuwiliang, Bogor. The result showed that total phenolic at crude extract mangosteen and antioxidant capacity to reach IC50 of harvesting and storage have negative correlation. Harvesting handling have effect to fruit weight, aril weight, wet weight rind and vitamin C content. Total phenolic of Harvesting and storage handling have a negative correlation with antioxidant capacity to reach IC50 which are value about -0.53 and -0.91. Assumed that total phenolic content will increase antioxidant capacity in mangosteen rind. Antioxidants capacity on harvesting and sorage handling of mangosteen have IC50<50 (capability of antioxidant are very strong).
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