Judul: Karakterisasi Sifat Fisikokimia dan Jumlah Kelompok Bakteri Tahan Garam (Halofilik) pada Tauco Kering Khas Cianjur
Abstrak: Tauco kering merupakan salah satu olahan pangan fermentasi kedelai yang berasal dari Indonesia. Salah satu tauco tertua yang masih eksis di Indonesia yaitu tauco kering Cianjur. Penelitian mengenai tauco kering ini bertujuan mengetahui karakteristik fisikokimia dan jumlah kelompok mikroba (terutama bakteri halofilik) yang bertahan pada tauco kering selama umur simpan 0 hingga 8 minggu setelah produksi pada penyimpanan suhu ruang dan kulkas. Analisis yang dilakukan dalam penelitian ini meliputi analisis fisikokimia (Aw, pH, kadar air, kadar abu, dan kadar garam) dan mikrobiologi (Angka Lempeng Total (ALT), total bakteri dan total bakteri halofilik, isolasi koloni, morfologi koloni, morfologi sel, pewarnaan Gram dan endospora, serta uji katalase). Analisis fisikokimia tauco kering menunjukkan adanya pengaruh lama penyimpanan tauco kering terhadap Aw dan pH yang disimpan pada suhu kulkas, serta Aw yang disimpan pada suhu ruang. Analisis fisikokimia tauco kering dengan pengaruh suhu penyimpanan menunjukkan adanya pengaruh terhadap pH tauco kering yang disimpan selama 4 minggu, serta Aw dan pH yang disimpan selama 8 minggu. Analisis total mikroba secara keseluruhan menunjukkan tidak adanya pengaruh lama penyimpanan dan tidak adanya pengaruh perbedaan suhu penyimpanan tauco kering dengan berbagai suhu dan waktu inkubasi., Semisolid tauco is a fermented soybean food from Indonesia. One of the oldest tauco that still exist is semisolid tauco from Cianjur. This research aims to determine the physicochemical characteristics and total of microbial groups (especially halophilic bacteria) that survive on semisolid tauco during the storage at room and refrigerator temperature. The analyzes carried out in this study included physicochemical (Aw, pH, water, ash, and salt content) and microbiology analysis (Total Plate Count (TPC), total bacteria and total halophilic bacteria, colony isolation, colony and cell morphology, Gram and endospores staining, also catalase test). Physicochemical analysis of semisolid tauco showed that there was an influence of storage time on the Aw and pH stored at refrigerator temperature, as well as the Aw stored at room temperature. Physicochemical analysis with the influence of storage temperature showed that there was an influence on the pH that stored for 4 weeks, as well as Aw and pH stored for 8 weeks. Analysis of total microbial counts showed that there was no influence on storage time and no influence on differences in storage temperature of semisolid tauco at various temperatures and incubation times.
Keyword: tauco kering, tauco Cianjur, bakteri halofilik, analisis fiiskokimia, total bakteri

Judul: Effect of Storage on Physicochemical Properties and Halophilic Bacteria of Liquid Tauco from Cianjur
Abstrak: Liquid tauco is a viscous yellow-to-brown fermented food product with a distinctive taste and texture. Because of its salt content, liquid tauco has a shelf life of 7 days at room temperature and 2–3 months in the refrigerator. Liquid tauco is a popular seasoning for Indonesian dishes and is mainly produced in Cianjur. There has not been much research related to the physicochemical properties of liquid tauco after it is distributed. Halophilic bacteria research has also never been done. This research aimed to determine the effect of storage time (0, 4, and 8 weeks) and temperature (room and refrigerator temperature) on the physicochemical properties and halophilic bacteria of a liquid tauco from Cianjur. Research data was analyzed using one-way ANOVA and Duncan's test. The results showed that storage time affects the water activity, viscosity, and moisture content of liquid tauco stored at room and refrigerator temperatures. Storage temperatures affect the liquid tauco’s water activity stored at week 4, viscosity stored at week 4 and 8, and moisture content stored at week 8. There was no effect of storage time and temperature on the microbial loads of the liquid tauco. This research discovered 10 bacterial isolates, 8 of which were presumed halophiles.
Keyword: Halophilic bacteria, Physicochemical properties, Tauco

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