Judul: Analisis Pemborosan Pangan pada Pasien Rawat Inap di Rumah Sakit PMI Bogor dan Pengaruhnya terhadap Tingkat Kecukupan Gizi
Abstrak: This study was aimed to analize food waste on patients at pmi bogor hospital and it relation with their nutrition and adequency level. A cross sectional study was used in this study. The amount of sample was 38 patients. Data were collected through food recall and interview using a questions. The use 20 patients receiving gastric diet and 18 patients receiving normal diet. Energy and fat adequency level of all respond was above 100%, while for protein and carbohydrate level was abive 50%, while meant that for food provided by the nutrition unit has met for requirement. There was no many food wasted by the patients in PMI hospital. The percentage of left for stapple food 12.4%, animal food 4.8%, vegetable side dish 6.1% and vegetable 7.9%. The food waste in patients of PMI hospital and it relation with their nutrition and adequency level was low.
Keyword: 

Judul: Analysis of the Satisfaction Level with Nutrition Services, Food Waste, and Lost Costs for Inpatients at Al Islam Hospital Bandung
Abstrak: Penelitian ini bertujuan menganalisis sisa makanan, biaya sisa makanan, zat gizi sisa makanan, dan tingkat kepuasan pelayanan gizi pada pasien rawat inap dewasa di Rumah Sakit Al Islam (RSAI) Bandung. Desain penelitian yang digunakan yaitu cross-sectional dengan jumlah subjek 42 subjek. Data tingkat kepuasan diperoleh melalui kuesioner The Acute Care Hospital Foodservice Patient Satisfaction, data sisa makanan diperoleh melalui penimbangan, dan biaya sisa makanan serta zat gizi sisa makanan diperoleh dengan perhitungan. . Penilaian tingkat kepuasan berdasarkan aspek kualitas makanan, pramusaji, dan lingkungan fisik. Hasil menunjukkan bahwa sisa makanan tertinggi diperoleh pada makan pagi (28,7%) dengan menu sayur (30,9%). Besarnya biaya sisa makanan dan zat gizi sisa makanan berbanding lurus dengan banyaknya sisa makanan. Tingkat kepuasan pasien terhadap pelayanan gizi tergolong puas. Tidak terdapat hubungan yang signifikan antara tingkat kepuasan pelayanan gizi dengan sisa makanan dan kehilangan biayanya (p>0,05)., This study aims to analyze food waste, food waste costs, food waste nutrients, and the level of satisfaction with nutritional services for adult inpatients at Al Islam Hospital Bandung. This research used a cross-sectional design with 42 subjects. Satisfaction level data was obtained through The Acute Care Hospital Foodservice Patient Satisfaction Questionnaire, food waste data was obtained through weighing method, and the cost of food waste and food waste nutrients were obtained by calculation. Assessment of satisfaction level based on aspects of food quality, waiters and physical environment. The results showed that the highest food waste was obtained from breakfast (28.7%) with a vegetable menu (30.9%). The highest lost cost of food waste and food waste nutrients is directly proportional to the amount of food waste. The level of patient satisfaction with nutrition services was classified as satisfied. There is no significant association between satisfaction level of nutritional services with food waste and lost costs (p>0.05).
Keyword: kepuasan, pasien dewasa, pelayanan gizi, sisa makanan

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