Judul: Pengaruh Iradiasi Terhadap Nilai Aktivitas Antioksidan dan Umur Simpan Teh Celup Camellia-Murbei-Stevia
Abstrak: Camellia-Mulberry-Stevia tea is one type of instant bag tea composed by green tea, mulberry leaf, and stevia. The purpose of this study was to determine the effects of storage on the quality of tea bags as well as to determine the shelf life of Camellia-Mulberry-Stevia mixed tea. The research was carried out in several stages, which were the determination of radiation dose, storage, organoleptic products, chemical analysis, and calculationof the shelf life. Based on the analysis, the product has antioxidant activity value of 414-425 mg/100 g AEAC and total microbes as much as 788-3000 colonies/gram sample. The product shelf life was 8345 days (23 years) and 8254 days (23 years) in metalized packaging, 175 days (6 months) and 173 days (6 months) in plastic packaging, and 8-7 days in paperboard packaging.
Keyword: 

Judul: Formulasi Teh Celup Campuran Teh Hijau (Camellia Sinensis)-Murbei (Morus Alba)–Stevia (Stevia Rebaudiana) serta Pengaruhnya Terhadap Aktivitas Antioksidan
Abstrak: Tea is one of the fuctional beverage which has been researched and developed for health benefits. Mixing of Green Tea (Camellia sinensis)-Mulberry (Morus alba)-Stevia (Stevia rebaudiana) into a tea bag has a potential as functional beverage due to phenolics compound which is known can act as antioxidant. The main objective of this research was to study the antioxidant effects of the mixing of green tea-mulberry-stevia tea bag formulation. Factor used in this study was the level of mulberry tea in green tea-mulberry-stevia mixing tea bag which were 13.33% (FA), 23.33% (FB), 33.33% (FC), 43.3% (FD), and 53.33% (FE). The data results showed that the total phenolic content of the five formulas were in the range of 528 to 1216 mg/100 g and the antioxidant were in the range of 563 to 670 mg/100g AEAC (Ascorbic Equivalent Antioxidant Capacity). The highest total phenol content and highest antioxidant was found in formula FA which contain 13.33% of mulberry tea. Analysis also showed that there is a positive correlation (p<0.05, r=0.902) between total phenolic content and antioxidant in green tea-mulberry-stevia mixing tea
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