Judul: Studi Pengelolaan Gulma di Perkebunan Kelapa Sawit Sekunyir Estate, PT. Indotruba Tengah, Minamas Plantation, Kalimantan Tengah.
Abstrak: Study of weeds management at oil palm Sekunyir Estate done to study management aspect and technical aspect. Management is done with restrain weeds according to chemistry and mechanical. Weeds control according to chemistry uses herbicide Audit and Starane done in palm circle and result collecting place, inter row and harvesting path, and Imperata cylindrica. Weeds control mechanically done with manual and weeds cutting machine. Weeds control according to chemistry in palm circle and result collecting place where does herbicide use Audit smaller 5 % from estimation, herbicide Starane bigger 47.7 % from estimation, and labour smaller 10 % from estimation. Weeds control in inter row and harvesting path according to where does herbicide use Starane smaller 33.3 % from estimation, and labour smaller 28.9 % from estimation. Labour use in weeds control with manual bigger 89 % from estimation. Weeds control with weeds cutting machine where does bigger labour use 5% from estimation, smaller oil use 33.3 % from estimation and smaller petrol use 33.7 % from estimation. Weeds that grow dominant in the year plant oil palm 1992-1995 is Centotheca lappacea with value Summed Dominance Ratio (SDR) highest 12.06 % in the year plant 1992. While weeds that grow dominant in the year plant 2005 and 2007 is Asystasia intrusa with value SDR highest 16.36 % in the year plant 2007. Labour cost use in weeds control in inter row and palm circle according to lower chemistry 89.4 % than according to manual.
Keyword: 

Judul: Pengelolaan Gulma Kelapa Sawit (Elaeis guineensis Jacq.) di Angsana Estate PT Ladangrumpun Suburabadi Minamas Plantation Kalimantan Selatan
Abstrak: The objective of this apprentice was to improve student’s competance on technical and managerial skill. The apprentice was conducted at Angsana Estate PT Ladangrumpun Suburabadi Minamas Plantation,South Kalimantan from February to June 2011. The method used was direct and indirect. Directly method was performed the steps as field worker, foreman and division assistant. Indirect method to collect and plantation reports. There were two methods on weed control according to weed problem at site, first inter-row and second circle weeding. The vegetation analysis result showed that broadleaves weed species dominance at field. Coefficient weed comunity less than 75% so variable of weed community were not homogen. Weed control in Angsana Estate consisted of manual and chemical control. Manual control performed on young (immature) and productive if rainy weather. Chemical control using systemic herbicides. The use of herbicides was done in accordance with principles and criteria for sustainable palm oil. Chemical weed control in Angsana Estate (ASE) was organized called the Block Spraying System (BSS). Not all weeds were eradicated, some weed species have been maintain for a specific purpose (beneficial plant) as maintain soil moisture, increase organic matter and nutrients in the soil and can be a host for predators of pest and diseases. Example of beneficial plants are Euphorbia heterophylla, Cassia cobanensis, Antigonon leptopus dan Turnera subulata.
Keyword: weed in palm oil, beneficial plant

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: