Judul: Analysis of Anticancer Properties and Secondary Metabolite Profile of Commercial Dadih Extracts with Different Fermentation Durations
Abstrak: Dadih merupakan makanan tradisional asal Minangkabau yang dibuat dari fermentasi susu kerbau melalui penyimpanan suhu ruang di dalam tabung bambu. Susu kerbau mengandung peptida bioaktif yang bersifat antimikroba, imunomodulator, antikanker, antidiabetik, antihipertensi, dan antioksidan. Penelitian ini bertujuan menganalisis sifat antikanker dan profil metabolit sekunder dadih komersial. Metode MTT Assay digunakan untuk mengetahui tingkat toksisitas senyawa ekstrak dadih (5%, 10%, 20%, dan 40%) terhadap pertumbuhan sel MCF-7. Hasil pengujian menunjukkan bahwa sampel A1, E1, A7, dan E7 memiliki nilai IC50 = 4,7-17 µg mL-1 dengan tingkat aktivitas antikanker yang kuat. Profil metabolit sekunder dianalisis menggunakan Liquid chromatography-mass spectrometry dan metode PCA, dengan nilai eigenvalue dan eigenvectors dari dua komponen utama minimal 84,2%. Beberapa senyawa metabolit sekunder ekstrak dadih memiliki peran fungsional terhadap akivitas biologis serta farmakologis, salah satunya antikanker., Dadih is a traditional Minangkabau cuisine made from fermented buffalo milk, stored at room temperature in bamboo tubes. Buffalo milk contains bioactive peptides with antimicrobial, immunomodulatory, anticancer, antidiabetic, antihypertensive, and antioxidant properties. This study aims to analyze the anticancer properties and secondary metabolite profile of commercial dadih. The MTT Assay method was used to determine the toxicity levels of dadih extract compounds (5%, 10%, 20%, and 40%) on the growth of MCF-7 cells. The test results showed that samples A1, E1, A7, and E7 had IC50 = 4,7-17 µg mL-1 , indicating strong anticancer activity. The secondary metabolite profile was analyzed using Liquid chromatography-mass spectrometry and PCA methods, with the eigenvalues and eigenvectors of the two main components at least 84.2%. Several secondary metabolite compounds in dadih extract have functional roles in biological and pharmacological activities, one of which is anticancer.
Keyword: Antikanker, dadih, sel MCF-7, LC-MS

Judul: The Characteristics, Antioxidant Activity as Well as ACE (Angiotensin Converting Enzyme) Inhibition in Dadih with Addition of Lactiplantibacillus plantarum subsp. plantarum strain IIA-1A5.
Abstrak: Dadih adalah makanan tradisional Minangkabau di Sumatera Barat, Indonesia, berasal dari susu kerbau dan mengalami fermentasi spontan alami dalam tabung bambu, terutama oleh bakteri asam laktat. Produk ini berfungsi sebagai sumber nutrisi yang kaya, tetapi juga menunjukkan berbagai sifat fungsional, termasuk aktivitas antioksidan dan antihipertensi. Studi ini bertujuan untuk menilai dampak penambahan probiotik Indonesia L. plantarum subsp. plantarum strain IIA-1A5 terhadap sifat nutrisi, mikroba, dan fungsional dadih, terutama aktivitas antioksidan dan antihipertensinya. Dadih diproduksi menggunakan susu kerbau dengan penambahan strain L. plantarum subsp. plantarum strain IIA-1A5 pada konsentrasi 0%, 5%, dan 10%. Hasil uji fisikokimia menunjukkan perbedaan signifikan dalam pH, kandungan protein, lemak, air, dan abu. ACE-Inhibitor menunjukkan peningkatan bertahap pada dadih dengan penambahan Lactobacillus plantarum sebesar 5% dan 10%, dengan nilai masing-masing sebesar 20,6±3,67, 26,6±2,55, dan 32,6±0,78. Konsentrasi 10% terbukti lebih efektif dalam meningkatkan ACE-Inhibitor, menjadikan kondisi antihipertensi yang optimal. Selain itu, sifat mikroba dadih dengan penambahan strain L. plantarum subsp. plantarum strain IIA-1A5 menunjukkan populasi BAL yang lebih tinggi dan tingkat bakteri patogen yang lebih rendah seperti E. coli dan S. aureus. Hal ini menunjukkan bahwa penggunaan L. plantarum IIA-1A5 sebagai starter fermentasi tambahan dalam dadih menguntungkan untuk keseluruhan sifatnya.
Keyword: antioxidants, dadih, fermentation, L. plantarum subsp. plantarum strain
IIA-1A5, probiotics

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