Judul: Isolasi, identifikasi dan evaluasi karakteristik bakteri pembentukan histamin dari pindang ikan tongkol
Abstrak: Pindang merupakan salah satu produk tradisional Indonesia yang sampai saat ini mutu dan keamanannya masih kurang diperhatikan. Salah satu bahaya yang dapat terjadi akibat penanganan dan higienis yang kurang baik selama proses produksi, pengemasan, distribusi, pemasaran atau penyimpanan ikan pindang adalah terjadinya kontaminasi oleh bakteri-bakteri pembentuk histamin, karena umumnya selain membentuk senyawa racun, bakteri-bakteri ini bersifat patogen. Salah satu cara untuk mencegah terjadinya kontaminasi oleh bakteri-bakteri pembentuk histamin adalah mengetahui jenis-jenis dan sifat-sifat bakteri ini sehingga dapat diu- sahakan alternatif untuk perbaikan proses. Dalam penelitian ini dilakukan isolasi, identifikasi dan evaluasi karakteristik bakteri pembentuk histamin dari pindang ikan tongkol. Penelitian ini dilakukan dalam tiga tahap. Tahap per- tama adalah pengamatan terhadap perubahan kualitas pindang ikan tongkol selama penyimpananan (0, 1, 2, 3, 4 hari) yaitu dengan mengamati perubahan kandungan total mikroba, bakteri pembentuk histamin, nilai TVN dari nilai pH. Tahap kedua adalah isolasi dan identifikasi bakteri pembentuk histamin dan tahap ketiga adalah mengamati sifat-sifat pertumbuhan bakteri terhadap suhu, pH dan konsentrasi NaCl. Hasil yang diperoleh menunjukkan bahwa selama penyim panan terjadi penurunan mutu dari pindang ikan tongkol, yaitu dengan meningkatnya total mikroba, bakteri pembentuk histamin, nilai pll dan nilai TVN. Pada hari keempat pindang sudah tampak berlendir dan berkapang…dst
Keyword: 

Judul: Perubahan Kadar Histamin dan Bakteri Penghasil Histamin dari Pindang Badeng Tongkol (Auxis rochei) Selama Penyimpanan
Abstrak: Pindang is an intermediate moisture product which is highly perishable if its handling and processing are not sufficient. The deterioration caused by the activities of microbes and enzyme produce biogenic amine compounds. The compounds creates from decarboxilation of amino acids in fish. One of the biogenic amine compounds is histamine. The high accumulation of histamine in fish is harmfull if consumed. The objective of this research was to analyze the storage effect of the histamine content and histamine-producing bacteria from the boiled tuna (Auxis rochei). This research was conducted in December 2013 to April 2014. Fresh fish tuna obtained from one day fishing by mini purse seine in TPI Cisolok Palabuhanratu. This research was devided into two stages; the first stage was keeping fresh tuna in 0, 8, 16, 24, 32 hours as control and test of organoleptic, TPC, TVB and histamine levels. The second stage of the research composed of three steps. The first step was boling fish in 25% salt addition at different time (2, 5, and 8 hours), then histamine test and determination of bacterial count. The best results of the first step continued to the second step. The second step, boiled fish were storaged at room temperature in 0, 8, 16, 24, 32 hours and its organoleptic value, histamine, TPC and TVB were analyzed. Sample with highest histamine content were analyzed in step 3, in which the histamine-producing bacteria were selected and identified. The influence of pH, temperature and NaCl concentration to the bacterial growth, histamine production were determined. Each species of bacteria was inoculated in boiled fish and its bacterial count analyzed. The results showed that storaging of fresh fish at room temperature caused in increasing of histamine, TVB levels and microbial activity. The histamine level didn’t lose after boiling and its level were increase during storage at room temperature. Histamine level were increase after storage time 8 hours and was haighly different with fish without storage treatment (p<0.05). Its level continued until 32 hours storage time. Bacterial count increased significantly after 24 hours (p<0.05). Its TVB-level increased significantly at 8 hours storage time and continue until 32 hours storage time. Boiled fish at 32 hours storage time shown 6 bacterial isolate and were expected as P. vulgaris, H. alvei, M. morganii, E.aerogenes, K. oxytoca, K. pneumoniae. Test on the abbility of 6 bacterial isolate to form histamine shown that K. pneumoniae produced the highest histamin level (132 mg/kg), while H. Alvei formed the lowest histamine level (78 mg/kg).
Keyword: Histamine, bacterial, pindang tuna (Auxis rochei)

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