Judul: Pengaruh metode pengolahan terhadap kandungan mineral keong ipong-ipong (Fasciolaria salmo)
Abstrak: Indonesia telah mencapai berbagai kemajuan dalam memerangi masalah gizi buruk, namun dibalik itu kasus kekurangan gizi mikro (terutama mineral) masih banyak ditemukan seperti osteoporosis dan anemia. Kekurangan gizi mineral ini dapat diatasi dengan cara mengkonsumsi makanan hasil laut. Makanan hasil laut merupakan sumber pangan yang kaya akan komponen mineral. Salah satu hewan avertebrata laut yang berpotensial memiliki kandungan mineral tinggi adalah keong ipong-ipong. Masyarakat kota Cirebon umumnya mengkonsumsi keong ipong-ipong setelah dilakukan proses perebusan sehingga perlu dilakukannya penelitian mengenai pengaruh metode pengolahan terhadap kandungan dan kelarutan mineral keong ipong-ipong.
Keyword: 

Judul: Aktivitas antioksidan dan komponen bioaktif keong ipong-ipong (Fasciolaria salmo)
Abstrak: Keong ipong-ipong (Fasciolaria salmo) merupakan salah satu jenis Gastropoda air laut. Sebagai Gastropoda air laut, sampai saat ini keong ipong-ipong hanya dimanfaatkan sebagai bahan pangan. Masyarakat meyakini bahwa keong ipong-ipong ini bermanfaat untuk meningkatkan stamina tubuh dan vitalitas. Akan tetapi fakta ilmiah yang mendukung manfaat dari keong tersebut belum ada. Sehingga perlu dilakukan pengkajian atau penelitian mengenai komponen bioaktif yang terkandung pada keong ipong-ipong, yang mungkin memiliki aktivitas sebagai antioksidan. Pengkajian ini dilakukan sebagai salah satu langkah untuk mengetahui pamanfaatan keong ipong-ipong dimasa mendatang. Tujuan dari penelitian ini adalah untuk menentukan rendemen, kandungan zat gizi (air, lemak, protein, abu dan abu tidak larut asam), aktivitas antioksidan dan komponen bioaktif yang terkandung dalam keong ipong-ipong. Pengujian yang digunakan meliputi analisis proksimat, uji kuantitatif aktivitas antioksidan dengan metode DPPH, dan uji fitokimia. Keong ipong-ipong pada penelitian ini berasal dari Desa Gebang, Kota Cirebon, Jawa Barat. Rendemen cangkang, isi dan jeroan keong ipong-ipong berturut-turut sebesar 69,69%, 22,08% dan 8,22%, sangat potensial dan ekonomis untuk dimanfaatkan lebih lanjut. Keong ipong-ipong mengandung air sebesar 73,07%, protein sebesar 18,28%, lemak sebesar 0,57%, abu sebesar 2,77%, abu tidak larut asam sebesar 0,15% dan karbohidrat sebesar 5,2%.
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