Judul: Perbandingan Pola Penggunaan Pestisida pada Petani Sayuran dan Petani Tanaman Hias di Kecamatan Cipanas, Kabupaten Cianjur
Abstrak: The most common strategy used by farmers to control pests is the application of pesticide. The use of pesticide by farmers is different for each kind of cultivated crops. The use of pesticide on vegetable crops is more intensive than ornamental plant crops. This study aimed to compare pesticide use patterns between vegetable and ornamental plant farmers, and to know the factors that influence. This study was conducted by using direct survey method using structured questionnaires to collect a primary data. The secondary data was obtained from government institution of Cipanas. The survey location was determined by purposive sampling. The number of respondents were 75 for vegetables farmers and 45 for ornamental plant farmers. The result of this study showed that the most dominant strategy used by vegetable and ornamental plant farmers to control pests and deseases was use of synthetic pesticide. Paterns of pesticide use among vegetables and ornamental plant farmers have some simlilarities and differences. The similarities including knowledge of pesticide use, pesticide selection criteria, dose conformity with recommendation dose, the rotation and mixing pesticides, reading label, and post evaluation of pesticide application. The differences including basic consideration to apply pesticides, active ingredients used, intensity of application, pesticide selection, and pre harvest interval. Several factors may influence the patern of pesticides use on vegetable and ornamental plant farmers were level of education, climate and weather, farmer anxiety when their crops attacked by pest and disease, knowledge of pesticide application, and the presence of pesticides store.
Keyword: pattern of use, vegetables and ornamental plant farmers, pesticide

Judul: Pengetahuan, Sikap, dan Tindakan Petani Sayuran dalam Penggunaan Pestisida di Kabupaten Pandeglang, Banten.
Abstrak: Pesticide is common techniques used by farmers to control plant pests and diseases. Improper and excessive uses of pesticides often occur in pesticide application due to low farmer’s knowledge and skill. The aim of this study was to obtain information and analyze of the knowledge, attitude, and practice of vegetable farmers in pesticide use in Pandeglang Regency, Banten. This study has been conducted by using direct survey using structured questionnaires to obtain a primary data, while secondary data was obtained from local government and literature study. The survey location was determined by purposive sampling. The number of respondents were 150 vegetables farmers. The data was presented descriptively and analyzed using the χ2 (chi-square) test to analyze the relationship between each characteristic tested. Knowledge, attitude, and practices of vegetable farmers in Jiput, Pulosari, and Menes districts showed some differences. Generally, the farmers at Pulosari district have low rational attitude in the use of pesticides compared with two other districts. Many factors influence the knowledge, attitude, and practices of vegetable farmers in three districts in the use of pesticides. Based on the analysis and relationship tests, factors of age and income of farmers showed influence unsignificantly compared with two other variables such as education and participation of farmers in farmer groups.
Keyword: knowledge, pesticides types, plant pests and diseases, vegetable farmer

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: