Judul: Karakteristik Dan Pengelolaan Lahan Budidaya Tanaman Krisan (Chrysanthemum Sp.) Di PT. Agrobumi Puspa Sari Sukabumi
Abstrak: Study was carried out at PT. Agrobumi Puspa Sari Selabinta Sukabumi. Aim of this study were to foccused on chrysanthemum land management and different characteristics of grass field, ex-paddy field, ex-unirrigated field and exchrysanthemum plantation in order to improve cultivation system of chrysanthemum. Oral and written information about land management of chrysanthemum cultivation including propagation, land preparation, planting, maintenance (dead seedlings replacing, watering, fertilizing, radiation addition, pest and disease controlling, bud elimination) and harvesting were recuperated. Soil characteristics in this study were pH, exchangeable AI, K, Ca, Mg, Na, Cation Exchange Capacity (CEC), organic-C, total N, available P and micro elements (Fe, Mn, Zn, and Cu).
Keyword: 

Judul: Penyakit Pada Tanaman Krisan (Chrysanthemum morifolium) di PT Natalia Nursery Bogor
Abstrak: Krisan merupakan tanaman hias yang banyak diminati karena keindahannya. Penurunan produksi bunga krisan di Indonesia, khususnya di Jawa Barat, disebabkan oleh beberapa faktor termasuk patogen. Penelitian ini bertujuan untuk mendapatkan informasi mengenai intensitas penyakit dan mengidentifikasi patogen yang menginfeksi tanaman krisan di PT Natalia Nursery Bogor. Pengamatan meliputi jenis gejala, insidensi penyakit dan tingkat keparahan, serta hasil produksi. Pengamatan dilakukan setiap minggu selama lima kali pada tiga petak tanaman yang berbeda. Identifikasi patogen penyebab dilakukan dengan pengamatan mikroskopis dan dikonfirmasi dengan studi literatur. Berdasarkan hasil penelitian, ada lima penyakit yang ditemukan yaitu karat putih (Puccinia horiana), layu fusarium (Fusarium oxysporum), bercak daun (Septoria sp.), diduga virus/viroid dan nematoda puru akar (Meloidogyne spp.). Secara umum, insidensi dan keparahan penyakit mengalami peningkatan setiap minggunya. P. horiana adalah patogen dominan yang menginfeksi tanaman krisan dengan tingkat keparahan penyakit hingga 40,81% pada varietas rentan. Varietas krisan yang paling tahan terhadap infeksi patogen adalah Puspita Nusantara. Terdapat adanya korelasi antara insidensi dan keparahan penyakit karat putih dengan hasil produksi bunga krisan., Chrysanthemum is a highly demanded ornamental plant due to its beauty. The reduction of chrysanthemum production in Indonesia, especially in West Java, might be caused by several factors including pathogen infections. The field investigation aimed to obtain the disease intensity and to identify the pathogen infecting chrysanthemum plants at PT Natalia Nursery Bogor. The type of symptoms, disease incidence and severity, as well as yield were measured. The observations were conducted every week for five times at three different plots. Identification of the causal pathogens were carried out by microscopic observation and confirmed by literature studies. Five diseases were found, namely white rust (Puccinia horiana), fusarium wilt (Fusarium oxysporum), leaf spot (Septoria sp.), suspected virus/viroid, and root-knot nematode (Meloidogyne spp.). The disease incidence and severity was increasing every week. The P. horiana was the dominant pathogen infecting chrysanthemum in the nursery with disease severity up to 40,81%. The most susceptible chrysanthemum variety against pathogen infection was Puspita Nusantara. The disease incidence and severity white rust can affect the yield of chrysanthemum flowers.
Keyword: chrysanthemum, pest, incidence, severity

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: