Judul: Produksi dan Pengolahan Tandan Buah Segar untuk Benih Kelapa Sawit (Elaeis guineensis Jacq.) di PT. Bina Sawit Makmur, Sumatera Selatan. (
Abstrak: Kegiatan magang ini dilaksanakan pada bulan Februari sampai dengan bulan Mei 2012 di PT. Bina Sawit Makmur, Sumatera Selatan. Tujuan magang secara umum adalah meningkatkan pengetahuan, keterampilan dan profesional mahasiswa mengenai produksi benih kelapa sawit pada keadaan lapangan yang sesungguhnya serta mampu mengidentifikasi permasalahan dan solusi berkaitan dengan proses produksi benih. Tujuan khusus pelaksanaan magang, yaitu: 1) mempelajari produksi dan pengelolaan serbuk sari kelapa sawit, 2) melakukan evaluasi pengaruh viabilitas serbuk sari terhadap jumlah benih per tandan dan pengaruh curah hujan terhadap persentasetandan dipanen, 3) melakukan evaluasi proses produksi benih kelapa sawit. Metodeyang digunakan dalam pelaksanaan kegiatan magang ini, yaitu: 1) kegiatan pelaksanaan magang meliputi kegiatan teknis di lapangan dan kegiatan manajerial, 2) bekerja secara aktif di divisi kebun produksi benih selama satu bulan, kemudian di divisi persiapan benih selama satu bulan, dan di divisi pengolahan benih selama satu bulan, 3) wawancara dan diskusi dengan berbagai pihak untuk menambah pengetahuan dan informasi berkaitan dengan produksi benih. Pada saat magang terjadi penurunan produksi serbuk sari yang disebabkan oleh produksi tandan bunga jantan dari induk pisifera yang menurun. Jumlah benih normal rata-rata cenderung meningkat seiring dengan peningkatan viabilitas serbuk sari. Rata-rata curah hujan per bulan selama perkembangan buah tidak berpengaruh nyata terhadap persentase produksi tandan buah segar calon benih. Proses produksi benih sudah berjalan dengan baik, terlihat dari persentase benih rusak sebesar 0.34%. Diperlukan pengadaan mesin pencacah dan pemipil untuk meningkatkan efektivitas dan efisiensi proses produksi.
Keyword: 

Judul: Pengolahan Tandan Benih Kelapa Sawit (Elaeis Guineensis Jacq.) Menjadi Benih Siap Salur di PT. Bina Sawit Makmur, Sumatera Selatan
Abstrak: The internship has been done at PT. Bina Sawit Makmur , South Sumatera for three months from February 2012 to May 2012. The internship covered activities concerning both technical and managerial aspect such a worker, foreman, and assistant. The purpose of this internship program was to improve technical and managerial skill. Primary data was all information obtained directly from observations in the field. Secondary data were collected from the official report of PT. Bina Sawit Makmur. The data was analyzed using descriptive method. PT. Bina Sawit Makmur was able to produce seeds on average 25,901,563 grains of seed per year. There was no difference in the percentage of white-shelled seed formation harvest bunches of 130-134, 135-139, 140 - 144, 145 to 149, and 150-154 days after pollination, the average percentage of white seed 7.48, 7.12, 7.18, 5.54, and 5.51%. The highest percentage of white seeds are harvested at age <130 days after pollination is 22.01%. White-shelled seed allegedly was not caused by genetic factors but is mainly harvested bunches are still not old enough. The weight of the bunches and seed production reaches its maximum at the age of 145-149 day after pollination. The weight of bunches affects the production of normal seeds. Germination produced by PT. BSM average of 75.79%.
Keyword: 

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: