Judul: Perubahan Karbohidrat Umbi Uwi (Dioscorea alata L) selama Penyimpanan
Abstrak: Tujuan dari penelitian ini ialah untuir mengecahui sifat - sifat umbi uwi dan perubahannya selama penyimpanan sehingga dapat memberikan informasi yang dapat dipergunakan bagi pemanfaatan dan pengembangan potensi penggunaan umbi uwi . Paraaeter yang diamati dalam penelitian ini meliputi morfologi umbi uwi, komposisi kimia, ekstraksi pati dan perubahan fisik dan kimia selama penyimpanan.
Keyword: 

Judul: Perubahan komposisi karbonhidrat umbi ganyong selama penyimpanan
Abstrak: Tujuan dari sifat-sifat penelitian ini adalah untuk mengetahui få sikokimia umbi ganyong dan mengetahui perubahan komposisi karbohidratnya selama penyimpanan. Pengamatan secara fisikokimia terhadap umbi ganyong meliputi panjang dan diameter umbi, berat umbi, umbi, serta jumlah dan lebar ruas umbi, kekerasan pengamatan mikroskopik dan analisa komposisi kimia umbi ganyong. Umbi ganyong tersusun dalam satu rumpu yang terdiri dari induk umbi dan 3 sampai 5 anak umbi. Ukuran rata-rata induk umbi lebih besar dan teksturnya lebih keras daripada induk umbi, namun kulitnya lebih tipis. Tenunan umbi ganyong terdiri dai sel-sel pati dan serat-serrat yang tersebar rata dan terdiri ari pmbuuh- pembuluh angkut. Pada bagian kulit, sel-sel patinya lebih kecil dan serat-seratnya lebih banyak daripada daging umbi. Komposisi IPB kimia umbi ganyong mndekati komposisi kimia dengan kadar air 75% dan karbohidrat 24% yang umbi terdiri dari pati 70% dan total gula 5% dari bahan kering. Komposisi induk dan anak umbi tidak berbeda nyata dan ternyata rendemen dan mutu yang dihasilkan sama. Peyimpanan umbi dalam suhu ruang lebih cepat mengalami perubahan daripada suhu minggu terjadi refrigerasi (2- 10 C) pentgneriputagn kulit dan mulaa dalam terjadi kebusukan pada umbi yang luka. Daya tahan simpan induk umbi tidak berbeda dengan anak umbi. Penyimpanan menyebabkan penurunan kadar air, kadar pati, kadar amilosa, dan menyebabkan kenaikan kadar total padatan terlarut, terutama pada suhu ruang. Umbi ganyong mengandung gula yang terdiri dari sukrosa 1.63%, fruktosa 1.26% dan glukosa 1.12%. Selama peyimpanan 8 minggu glukosa dan fruktosa menurun masing-masing menjadi 0.54% dan 0.70%, sementara itu sukrosa meningkat menjadi 4.19% dari umbi basah. Hal ini memberi petunjuk terjadinya sintesa sukrosa dari fruktosa dan glukosa selama penyimpanan. Pati berwarna ganyong coklat, nilai derajat keputihannya 62.93. Bentuk granulanya bulat lonjong/oval, ukurannya tidak seragam dari 40 sampai 140 mikron. Rendemen rata-ratanya 74.17%, dengan kadar airnya 15.46% dan kadar patinya 83.22%....
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