Judul: Mempelajari Pengaruh Penambahan Sari Buah Jeruk Nipis dan lama Pemeraman terhadap sifat - sifat Cider Jambu Biji (Psidium guajava)
Abstrak: Berdasarkan hasil penelitian pendahuluan diperoleh bahwa minuman cider jambu biji yang paling disukai oleh panelis adalah cider yang dibuat dengan perbandingan jambu biji dan air 1 : 3, konsentrasi gula 15% dan fermentasi selama 3 hari. Hal ini diduga disebabkan karena minuman cider yang dihasilkan tidak terlalu pekat, rasanya cukup manis dan bau alkohol akibat proses fermentasi tidak terlalu tinggi. Produk ini mempunyai skor . rata-rata uji organoleptik 4.07, yaitu antara agak suka dan suka.
Keyword: 

Judul: Pengaruh jenis jambu biji, konsentrasi pengstabil, dan lama penyimpananya terhadap sari buah jambu biji
Abstrak: Penelitian ini bertujuan untuk melihat pengaruh penam- bahan CMC sebagai penstabil terhadap stabilitas suspensi sa- ri buah jambu biji. Jambu biji yang digunakan dalam peneli- tian ini adalah jambu biji Pasar Minggu, dan jambu biji Yogyakarta. Sedangkan tingkat penggunaan CMC terdiri dari tiga taraf yaitu 0.05, 0.10 dan 0.15 persen. Pengamatan dilakukan selama satu bulan dengan selang pengamatan selama seminggu. Untuk pembuatan sari buah jambu biji, mula-mula jambu biji dipotong-potong ujungnya, kemudian dipotong kecil-kecil, dan dihancurkan dalam "waring blendor". Cacahan buah yang diperoleh diencerkan dengan perbandingan air berat buah- 8: 1, kemudian disaring dengan kain saring. Pada sari buah yang diperoleh kemudian ditambahkan penstabil (CMC), gula (13%), asam sitrat (0.15%), dan kemudian dibotolkan. Pas- teurisasi dilakukan pada suhu 80°C selama 30 menit. Pengamatan dilakukan terhadap pH, kadar total asam, kadar vitamin C, kekentalan, pengukuran stabilitas suspen- si, total count mikroba, dan organoleptik. Hasil penelitian menunjukkan bahwa jenis jambu biji berpengaruh terhadap nilai pH, kadar vitamin C dan keken- talan. Sari buah jambu biji Yogyakarta mempunyai pH 4.78 sedangkan sari buah jambu biji Pasar Minggu 4.19. Kadar vitamin C sari buah jambu biji Yogyakarta 4.71 dan sari buah jambu biji Pasar Minggu 5.21 mg per 100 ml sari buah. Kekentalan sari buah jambu biji Yogyakarta 1.30 sentipois, sedangkan sari buah jambu biji Pasar Minggu 1.43 sentipois…dst
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