Judul: Pendugaan Umur Simpan Bubuk Cabe Merah (Capsicum annum L.) dalam Berbagai Kemasan Berdasarkan Parameter Warna
Abstrak: Cabe merupakan salah satu komoditas hortikultura penting bagi masyarakat Indonesia, baik untuk memenuhi kebutuhan sehari-harmaupun keperluan industri pang an atau obat-obatan. Konsumsi cabe merah terus meningkat dari tahun ke tahun dimana pada tahun 1990 konsumsi/kapita cabe merah adalah 2,88 kg/tahun, pada tahun 1991 menjadi 2,92 kg/tahun dan meningkat 3,16 kg/tahun pad a tahun 1992. Cabe tergolong sayuran yang mudah rusak, yang disebabkan oleh sifat dari komponen-komponen penyusunnya, terutama kadar air yang tinggi (70-80%) (Hartuti, 1996). Oleh karena itu agak sulit mempertahankan buah cabe dalam bentuk segar, sehingga perlu upaya mengawetkan cabe dalam bentuk olahan misalnya dengan pengeringan. Selain dijual dalam bentuk kering, cabe merah kering juga dapat diolah menjadi bubuk cabe merah.
Keyword: 

Judul: Kajian aspek teknologi produk-produk olahan cabe merah (Capsicum var.longum
Abstrak: Cabe merah (C. annuum L.) merupakan hasil tanaman hortikultura yang penting dalam memenuhi kebutuhan masyarakat sehari-hari, yang dipengaruhi oleh faktor panen (panen raya atau paceklik) yang berdampak terhadap fluktuasi harga jual (murah atau mahal). Penelitian ini bertujuan untuk mengkaji teknologi pengolahan cabe merah yang dapat memberikan alternatif penanganan suplai cabe merah yang berlebihan di saat panen raya, dengan mengolahnya ke dalam bentuk produk olahan berumur simpan lama dan bernilai ekonomi tinggi. Dalam kajian ini dilakukan pembuatan produk olahan cabe merah, yaitu saus cabe, cabe giling dan bubuk cabe merah yang dikemas dalam botol steril dan disimpan pada suhu ruang (+ 28-31°C) dan suhu rendah (± 5-10°C). Selama masa penyimpanan (15 minggu), mutu produk dianalisa secara fisik (3 minggu sekali) dan mutu mikrobiologi (minggu ke-0, 9 dan 15). Selain itu juga dilakukan analisa terhadap produk-produk komersial sejenis sebagai pembanding produk kontrol. ...
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