Judul: IPB (Bogor Agricultural University)
Abstrak: Kondisi stres menyebabkan jumlah radikal bebas berlebih dan dapat menimbulkan kerusakan sel. Tubuh secara normal mempunyai mekanisme pertahanan terhadap radikal bebas yaitu antioksidan. Antioksidan berfungsi untuk menetralkan radikal bebas. Superoksida dismutase (SOD) adalah salah satu enzin antioksidan intrasel yang melindungi sel dari serangan radikal bebas. Salah satu antioksidan ekstrasel yang dapat melindungi sel dari serangan radikal bebas adalah a[alfa]-tokoferol.
Keyword: 

Judul: Antioksidan: Jenis, Sumber, dan Perannya
Abstrak: Pola hidup yang tidak sehat dan stres dapat mengganggu metabolisme tubuh termasuk keseimbangan antara radikal bebas dan antioksidan di dalam tubuh. Radikal bebas merupakan suatu atom atau molekul yang memiliki elektron yang tidak berpasangan pada orbit terluarnya. Kondisi ketidakseimbangan antara radikal bebas yang lebih banyak dibandingkan dengan antioksidan dapat menyebabkan stres oksidatif. Stres oksidatif dapat dicegah dengan antioksidan. Studi pustaka ini bertujuan untuk mengetahui tentang jenis-jenis antioksidan, sumber antioksidan, serta mempelajari peran dari antioksidan. Informasi studi pustaka yang digunakan berasal dari media ilmiah. Antioksidan merupakan suatu zat yang dapat memperlambat, menunda, dan atau mencegah terjadinya proses oksidasi, serta dapat menetralisir radikal bebas. Jenis antioksidan dibedakan menjadi dua berdasarkan sumbernya, yaitu antioksidan endogen dan antioksidan eksogen. Antioksidan endogen merupakan antioksidan yang dihasilkan dari dalam tubuh yang antara lain berupa antioksidan enzimatik primer, yaitu glutation peroksidase, katalase, dan superoksida dismutase. Antioksidan eksogen merupakan antioksidan yang berasal dari luar tubuh, contohnya senyawa alkaloid, polifenol, isoflavon, saponin, tanin, vitamin C, vitamin E dan lain-lain yang terdapat dalam bahan pangan dan sumber bahan lainnya. Antioksidan berperan penting dalam meningkatkan enzim pertahanan terhadap stres oksidatif, pencegahan pada komplikasi, dan mengontrol kadar glukosa darah., An unhealthy lifestyle and stress can disrupt the body's metabolism, including the balance between free radicals and antioxidants in the body. Free radicals are atoms or molecules that have an unpaired electron in their outer orbit. The condition of an imbalance between free radicals that are more than antioxidants can cause oxidative stress. Oxidative stress can be prevented with antioxidants. This literature study aims to find out about the types of antioxidants, sources of antioxidants, and to study the role of antioxidants. The literature study information used comes from scientific media. Antioxidants are substances that can slow down, delay, and or prevent the oxidation process, and can neutralize free radicals. Types of antioxidants are divided into two based on the source, namely endogenous antioxidants and exogenous antioxidants. Endogenous antioxidants are antioxidants produced from within the body which include primary enzymatic antioxidants, namely glutathione peroxidase, catalase, and superoxide dismutase. Exogenous antioxidants are antioxidants that come from outside the body, for example alkaloid compounds, polyphenols, isoflavones, saponins, tannins, vitamin C, vitamin E and others found in food and other sources of material. Antioxidants play an important role in increasing defense enzymes against oxidative stress, preventing complications, and controlling blood glucose levels.
Keyword: Antioksidan, penyakit degeneratif, radikal bebas

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