Judul: Aktivitas Antioksidan Ekstrak Buah Takokak (Solanum torvum Swartz.)
Abstrak: Turkey berry fruit (Solanum torvum Swartz.) is one of indigenous fruit vegetables that widely used in traditional medicine. Because, it has some functional properties such as antioxidant, antibacterial, antifungal, and antiviral. The functional properties come from the activity of some phytochemicals compound that Turkey berry fruit contents, such as phenolics and non phenolics. This research was designed to identify the chemical content of Turkey berry fruit, change content, and antioxidant activity of crushed form. The research method consisted of treatment phase of fresh Turkey berry fruit through the destruction process and extraction phase of Turkey berry fruit powder with organic solvents (methanol, etil acetat, and hexane). The results showed that methanol extract of both whole and crushed Turkey berry fruit, contains alkaloids, flavons, tannins, and saponins. The etil acetat and hexan extracts of both whole and crushed form, contains alkaloids, flavons, terpenoids, and saponins. Thus, the presence of phenolic compounds in Turkey berry fruit can be affected by Phenylalanin Ammonia Lyase (PAL) activity, but not always influenced by the total anthocyanin. In addition, the antioxidant activity (DPPH assay) between whole and crushed Turkey berry fruit extracts is not significantly different (p>0.05) by t-test. It was demonstrated that the destruction process has a little affecting to the presence of phenolic compounds that act as antioxidants, such as anthocyanin. However, the antioxidant activity of extracts is not always determined from total phenolic, but depending on the ability of -OH group to donate H atoms and to bind with free radicals rapidly. The antioxidant activity of Turkey berry fruit extract was slightly be affected by ascorbic acid (vitamin C) compound.
Keyword: 

Judul: Identifikasi Komponen Antibakteri pada Ekstrak Buah Takokak (Solanum torvum Swartz) dengan Kromatografi Lapis Tipis
Abstrak: Turkey berry (Solanum torvum Swartz) is one of medicinal plants and indigenous vegetables which grows abundantly in Indonesia. It has been known to have antibacterial activity againts some pathogen bacterias, including Bacillus cereus. The aim of this study is to determine turkey berry’s metabolites that have antibacterial activity by TLC method. The dried turkey berry was extracted by eight different combinations of methanol and water. These extracts were then divided into two parts: for antibacterial activity analysis and for TLC analysis. Extract with good antibacterial activity and showed more spots in TLC was further identified by two-dimentional TLC. The Rf score of this extract was also compared with reference compounds. F1 extract which was extracted by methanol:water (1:0) showed the highest diameter of inhibition. It also had more TLC spots than other extracts. F1 extract was then chosen to be identified by two-dimentional TLC. It showed 14 sub-spots which have maximum absorption at 200-400 nm. Some sub-spots of F1 extract also showed similar Rf score with reference compounds. Based on its TLC profile, F1 extract may contain saponin, gallic acid, quercetin, myricetin, kaempferol, and apigenin. However, since TLC has limited resolution, it is possible that F1 contains other flavonoids and phenolic acids that may also responsible for its antibacterial activity.
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