Judul: Panen dan Pascapanen Umbi Konsumsi Kentang (Solanum tuberosum L.) di Hikmah Farm, Pangalengan, Kabupaten Bandung, Jawa Barat.
Abstrak: Kegiatan magang telah dilaksanakan pada bulan Februari sampai Juni 2017 di Hikmah Farm, Pangalengan, Kabupaten Bandung, Jawa Barat. Kegiatan magang bertujuan untuk meningkatkan kompetensi mahasiswa dalam bidang teknis dan manajerial, khususnya dalam kegiatan panen dan pascapanen. Data primer telah diamati dengan mengikuti praktek kerja sebagai pekerja lapangan, asisten mandor, dan asisten divisi. Data sekunder dikumpulkan dari dokumen kantor. Perlakuan terbaik pascapanen memerlukan koordinasi dan integrasi yang hati-hati dalam semua aktivitas, mulai dari tingkat panen, pemasaran hingga tingkat konsumen. Hasil percobaan aspek khusus menunjukkan bahwa cara panen 1 (penggalian dengan sendok kayu “gala”, penjemuran, sortasi dan grading, pengarungan 1, pengangkutan 2) adalah cara panen yang paling baik dalam perolehan kualitas hasil panen. Cara panen 2 (penggalian dengan cangkul, penjemuran, sortasi dan grading, pengarungan 1, pengangkutan 2) adalah cara panen yang paling baik dalam efisiensi tenaga kerja pemanen. Persentase kehilangan hasil di gudang penyimpanan lebih tinggi dibandingkan dengan persentase kehilangan hasil di lapangan. Kehilangan hasil di lapangan berkisar antara 1-3 % dan kehilangan hasil di gudang penyimpanan berkisar antara 12-36 %.
Keyword: cara panen, efisiensi tenaga kerja, kehilangan hasil

Judul: Panen dan Pascapanen pada Umbi Bibit dan Umbi Konsumsi Kentang (Solanum tuberosum L.) di Hikmah Farm, Pangalengan, Bandung, Jawa Barat.
Abstrak: General purpose of the internship was to study the potato cultivation and to train technical and managerial skills in problem analyzing on field, especially on the purpose harvesting and postharvest handling aspect. The specific purpose was to observe the effect of harvesting time quality of the tuber, the influence of harvesting method efficiency of harvesting labour and losses of product, the influence of the height of fall out tuber on the damage of tuber, and to observe the percent loss that of product in the field and the storage. The results of specific aspect showed that longer harvesting time harder the tuber skin up to 100 %. Plants that harvested too young will produce small tubers percentage higher than large tubers. Acquisition of tuber fresh weight will be low if the harvesting time is less than 90 days and more than 100 days after planting. Method harvest 1 (digging with gala, drying, sorting and grading, rafting step 1, transport step 2 ) is the highest to get the crop quality. Method harvest 2 (digging with a hoe, drying, sorting and grading, rafting step 1, transport step 2) is the best way to get the efficiency of harvesting labour. Damage of tuber for seed is higher than tuber for consumption. The highest tuber damage occurs when the tuber is dropped at a height of 2.5 m. Percentage tuber losses in storage was higher than losses in the field. The range yield loss in the field between 1 % up to 3 % and yield loss in the storage between 9 % up to 52 %.
Keyword: yield loss, post-harvest, potato (Solanum tuberosum L.), method harvest, harvest

Judul: Construction of Strongly Optimal Binary Linear Code with Minimum Distance 9 and 11
Abstrak: A binary linear code of length n over q F is a subspace of n q F . A code has three parameters that attached to it, namely length, dimension, and minimum distance. A code with length n, dimension k and minimum distance d is often called [n, k, d ]-code. Usually, when two parameters are given, then we want to find a code that has the best value for the last parameter. Based on Gilbert- Varshamov bound, if a [n, k, d ]-code exists and can not be expanded, we call it a strongly optimal code. In this paper, we construct strongly optimal code with minimum distance 9 and 11. In constructing the code, we created a theorem and algorithm based on Gilbert-Varshamov bound before we implement the algorithm to MAPLE programming language. Because of computational limitations, the program can only construct up to k = 10 for d = 9 and k = 12 for d = 11.
Keyword: