Judul: Anticancer Characterization of Commercial Dadih Peptide Against MCF-7 Cancer Cells by In Vitro
Abstrak: Dadih adalah produk susu fermentasi tradisional yang berasal dari Sumatera Barat, yang diproduksi melalui fermentasi alami susu kerbau dalam tabung bambu. Selama proses fermentasi dadih, bakteri asam laktat (BAL) mendominasi proses proteolisis. Sementara itu sudah banyak penelitian yang dilakukan pada bioaktivitas peptida namun, penelitian masih terbatas mengenai sifat antikanker yang dimilikinya. Penelitian ini bertujuan untuk menganalisis sifat antikanker pada dadih dengan dan tanpa filtrasi dadih terhadap sel kanker MCF-7. Sampel dadih didapatkan dari penjual komersial dari Kota Padang. Filtrasi dilakukan dengan menggunakan filtrasi Amicon dengan 3000 MWCO. Konsentrasi protein dari dadih dengan dan tanpa filtrasi diuji dengan menggunakan metode Lowry yang menunjukkan bahwa dadih yang di filtrasi memiliki konsentrasi protein yang lebih sedikit dibandingkan dengan dadih non filtrasi. Selanjutnya, aktivitas antikanker pada dadih dilakukan secara in vitro dengan MTT Assay yang menunjukkan bahwa nilai IC50 dari kedua sampel dianggap sebagai antikanker yang kuat. Tetapi, dadih non filtrasi menunjukkan aktivitas penghambatan yang lebih baik dibandingkan dengan dadih yang di filtrasi berdasarkan nilai IC50., Dadih is a traditional fermented milk product originating from West Sumatra, produced through the natural fermentation of buffalo milk within bamboo tubes. During fermentation, lactic acid bacteria (LAB) dominated the process by not only producing lactic acid, but also peptides from proteolysis process. While many studies were conducted on bioactivity of these peptides, limited studies were conducted on their anticancer properties. This study aimed to analyze the anticancer properties of dadih with and without peptide filtration against MCF-7 cancer cells. Dadih samples will be collected from commercial vendors in Padang. Filtration was done using Amicon filtration with 3000 MWCO. Concentration of protein from unfiltered and filtered dadih were tasted using Lowry method which indicated that filtered dadih has significant less protein as compared to non-filtered dadih. Further, anticancer activity was also done in vitro with MTT Assay which indicated that IC50 value of both samples were considered to be strong anticancer. But the non-filtered dadih exhibited better inhibition activity as compared to filtered one based on their IC50 values.
Keyword: Antikanker, dadih, sel MCF-7, peptida

Judul: Characterization of Antibacterial Properties in Peptide  Filtrate from Commercial Dadih Collected at Varied bamboo
Abstrak: Dadih adalah produk fermentasi susu tradisional yang berasal dari Sumatera Barat, dibuat dari susu kerbau melalui fermentasi alami dalam bambu. Dadih ber potensi menghasilkan peptida bioaktif, salah satunya peptida antibakteri. Penelitian ini bertujuan untuk karakterisasi sifat antibakteri dari filtrat peptida yang didapat dari dadih komersial dengan ukuran bambu berbeda. Metode yang dilakukan yaitu, filtrasi peptida dengan cutoff 3 kDa, pengukuran pH, total asam teritrasi, kadar protein (Lowry), dan pengujian antibakteri dengan Staphylococcus aureus, Bacillus cereus, Escherichia coli, dan Salmonella typii. Hasil penelitian menunjukkan ukuran bambu berbeda tidak memiliki pengaruh yata (P>0,05) terhadap kadar protein, pH, dan total asam pada dadih. Ukuran bambu berbeda tidak berpengaruh nyata (P>0,05) terhadap daya hambat antibakteri dadih pada bakteri Gram positif. Namun, memiliki pengaruh nyata (P<0,05) terhadap daya hambat antibakteri dadih pada bakteri Gram negatif yaitu E. coli dan S. typii. Hal ini menunjukkan aktivitas antibakteri dadih lebih berpengaruh terhadap bakteri Gram negatif karena produksi senyawa-senyawa antibakteri yang berbeda pada setiap bambu.
Keyword: dadih, antibakteri, bambu, filtrat peptida

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