Judul: Penambahan Ekstrak Peppermint (Mentha spicata L) dan Kemangi (Ocimum americanum L) pada Susu Fermentasi untuk Menghambat Enzim Penyebab Hipertensi dan Diabetes Tipe 2
Abstrak: Inclusion of Peppermint (Mentha spicata L) and Basil (Ocimum americanum L) Extract in Fermented Milk on the Inhibition of Hypertension and Type 2 Diabetes Enzyme
Keyword: 

Judul: Karakteristik Keju Lunak Probiotik dari Susu Kambing dengan Penambahan Ekstrak Herbal dan Pengaruhnya dalam Penghambatan Aktivitas Enzim α-amilase
Abstrak: Herbs are widely used in culinary and as traditional medicine. Previous study investigated mint, dill and basil extract inhibition on enzim correlated with type 2 diabetes, was α-amylase. The objective of this research is to identify the physical, chemical, microbiological and sensory quality of mint, dill and basil cheeses. The result of this study showed that herb extract reduced pH of cheese during fermentation faster than plain cheese. The yield of mint and basil cheese were not very significantly different with plain cheese, but lower in dill cheese (P<0.01). The highest total phenolic content (TPC) was found in basil cheese (316.14 ± 12.72 μg GAE/g cheese DW). Herbs cheeses very significantly (P<0.01) inhibited DPPH (1,1-diphenyl-2-picrylhydrazyl) and α-amylase activity, with the highest activity for each assay respectively were dill and mint cheese, 0.23 ± 0.02 % and 2.89 ± 0.17 % per mg cheese DW respectively. DPPH inhibition of plain and mint cheese was dose-independent, but otherwise in dill cheese. Herbs extract increased total LABs of cheese. Regression equations of DPPH inhibition (Y), TPC (X) and total LABs (Z) were Y = 5.467 + 0.1555X; (R2 = 35%; P <0.05), Y= 1.931Z – 8.209 (R2 = 44.8%; P<0.05) and X = 7.186 + 0.06965Z (R2 = 58.4%; P <0.01) respectively. The best formula of herbs cheese based on sensory quality is dill cheese. This study indicated the therapeutic potentiality of mint, dill or basil extract included-probiotic soft cheese produced from goat milk as functional food for people with type 2 diabetes.
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