Judul: Kajian Awal Kandungan Gizi dan Potensi Anti-Asma dari Teripang Getah  (Holothuria vacabunda)
Abstrak: Prevalensi asma pada anak di Indonesia cukup tinggi, terutama di kota-kota besar hingga hampir 17%. Pada tahun 2005 jumlah penderita asma di seluruh dunia telah mencapai 400 juta orang, dengan pertambahan 180.000 setiap tahunnya. Kekayaan bahari Indonesia ibarat butiran pasir di pantai dan bagaikan emas yang terpendam jika kita dapat memanfaatkannya secara tepat dan bijak. Salah satu biota laut yang memiliki nilai ekonomi tinggi adalah teripang atau sea cucumber (mentimun laut). Di dunia terdapat lebih dari 1.200 spesies teripang dan sekitar 53 spesies terdapat di perairan Indonesia. Tujuan dari penelitian ini adalah untuk mengetahui kandungan gizi dari teripang getah yang meliputi kandungan proksimat, asam amino, mineral dan asam lemak serta mengidentifikasi potensi anti-asma dari teripang getah (Holothuria vacabunda) yang berasal dari Pantai Carita Banten. Berdasarkan hasil penelitian ini kandungan gizi dari teripang getah cukup lengkap sehingga dapat dimanfaatkan sebagai makanan kesehatan (health food). Hasil Uji inframerah menunjukkan adanya potensi senyawa anti-asma walaupun belum dapat menunjukkan secara tepat akan senyawa tersebut
Keyword: 

Judul: The Antioxidant Activity of Fresh Meat and Protein Hydrolysate of Black Sea Cucumber (Holothuria atra)
Abstrak: Teripang dari genus Holothuria merupakan salah satu biota laut Indonesia dengan nilai manfaat dan ekonomi yang tinggi. Selain sebagai komoditi pangan penting, teripang juga berpotensi sebagai sumber antioksidan alami. Penelitian ini bertujuan menentukan komposisi kimia, bobot molekul protein dan aktivitas antioksidan dari daging segar dan hidrolisat protein teripang keling (Holothuria atra). Komposisi kimia teripang ditentukan melalui uji proksimat, sementara uji Bradford untuk menentukan bobot molekul proteinnya. Uji aktivitas antioksidan dilakukan dengan metode 2.2-azinobis 3-etilbenzotiazoline-6- zulfonic acid (ABTS). Analisis data terhadap parameter aktivas antioksidan menggunakan uji normalitas dan uji T sampel independen. Hasil pengujian menunjukkan bahwa teripang keling mengandung protein sebesar 64,71 ± 2,74 (%bk) dengan rentang bobot molekul dari sampel daging segar 18 - 300 kDa dan hidrolisat protein ≤12 kDa. Hasil analisis data menunjukkan bahwa terdapat perbedaan nilai aktivitas antioksidan antara daging teripang segar dan hidrolisat protein teripang berbeda nyata. Aktivitas antioksidan sampel daging segar diperoleh nilai IC50 sebesar 60,74 ± 0,02 ppm dan pada sampel hidrolisat protein sebesar 52,45 ± 0,03 ppm.
Keyword: Teripang Keling, antioxidant, black sea cucumber, hydrolysate protein

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