Judul: Antioxidant Activity and Matrix Metalloproteinase-1 Inhibition by Curcuminoids from the Ethanol Fraction of Temulawak
Abstrak: Temulawak (Curcuma xanthorrrhiza Roxb.) merupakan tanaman yang memiliki senyawa kurkuminoid yang dapat berperan dalam menginhibisi aktivitas dari matriks metalloproteinase-1. Penelitian ini bertujuan untuk mengetahui aktivitas antioksidan dan penghambatan enzim MMP-1 dari fraksi etanol kurkuminoid temulawak. Metode yang digunakan pada penelitian adalah maserasi, fraksinasi etanol, KCKT, uji inhibisi MMP-1, dan uji aktivitas antioksidan dengan metode CUPRAC dan ABTS. Hasil menunjukkan kadar air dari fraksi etanol temulawak sebesar 9,21 dan rendemen sebesar 5,89%. Kadar total kurkuminoid didapatkan sebanyak 183,47 mg/g. Hasil uji inhibisi MMP-1 didapatkan nilai IC50 33,42 µg/mL dan uji antioksidan menggunakan metode CUPRAC didapat aktivitas antioksidan 870,52±4,87 µmol AAE/g fraksi dan metode ABTS sebesar 647,15±32,02 µmol AAE/g fraksi. Hasil ini menunjukkan bahwa temulawak dapat menginhibisi MMP-1 dengan baik dan merupakan antioksidan yang baik., Temulawak (Curcuma xanthorrhiza Roxb.) is a plant that contains curcuminoid compounds capable of inhibiting the activity of matrix metalloproteinase-1 (MMP-1). This study aimed to determine the antioxidant activity and MMP-1 enzyme inhibition of the ethanol fraction of temulawak curcuminoids. The methods used in the research include maceration, ethanol fractionation, HPLC, MMP-1 inhibition assay, and antioxidant activity assay using the CUPRAC and ABTS methods. The results showed that the moisture content of the ethanol fraction of temulawak was 9.21% and the yield was 5.89%. The total curcuminoid content obtained from HPLC was 183.47 mg/g. The MMP-1 inhibition assay results showed an IC50 value of 33.42 µg/mL. The antioxidant activity assay using the CUPRAC method showed an antioxidant activity of 870.52±4.87 µmol AAE/g fraction, and the ABTS method showed an activity of 647.15±32.02 µmol AAE/g fraction. These results indicate that temulawak can effectively inhibit MMP1 and is a good antioxidant.
Keyword: Curcuma xanthorriza, Antioxidant, matrix metalloproteinase-1, inhibition

Judul: Aktivitas Inhibisi Terhadap Siklooksigenase, Kadar Pati dan Fenolik Temulawak (Curcuma xanthorriza Roxb.) Aksesi Sukabumi
Abstrak: Curcuma xanthorrhiza Roxb. known as temulawak is widely used as herbal medicinal plant that has many benefits, including antiinflammation. The objectives of this research were to evaluate inhibitory activity of temulawak Sukabumi accession toward cyclooxygenase-2 (COX-2) and to analyze its correlation with starch and phenolic level. The extraction method used maseration with ethanol 70%. The starch level was analyzed using Luff-scohrl’s method, and the phenolic level was determined using the Folin-Ciocalteu’s. The starch level is relatively higher (P>0.05) on temulawak Cursina variety were 23.05%±3.49, while the phenolic level is relatively higher (P>0.05) on temulawak Sukabumi accession were 81.16 mg/g±19.68. Both of temulawak extracts showed inhibitory activity against COX-2. The highest activity (P>0.05) on temulawak Sukabumi accession with inhibition value of 55.35%. Based on analysis of corelation, the phenolic compound has antiinflammation activity, while starch will reduce antiinflammation activity.
Keyword: 

Judul: Construction of Strongly Optimal Binary Linear Code with Minimum Distance 9 and 11
Abstrak: A binary linear code of length n over q F is a subspace of n q F . A code has three parameters that attached to it, namely length, dimension, and minimum distance. A code with length n, dimension k and minimum distance d is often called [n, k, d ]-code. Usually, when two parameters are given, then we want to find a code that has the best value for the last parameter. Based on Gilbert- Varshamov bound, if a [n, k, d ]-code exists and can not be expanded, we call it a strongly optimal code. In this paper, we construct strongly optimal code with minimum distance 9 and 11. In constructing the code, we created a theorem and algorithm based on Gilbert-Varshamov bound before we implement the algorithm to MAPLE programming language. Because of computational limitations, the program can only construct up to k = 10 for d = 9 and k = 12 for d = 11.
Keyword: