Judul: Pengelolaan Penangkaran, Keberhasilan Pemeliharaan Papilio memnon dan Media Interpretasi di Panaruban Butterfly Heaven, Subang.
Abstrak: Panaruban Butterfly Heaven merupakan pengelolaan kupu-kupu yang dilakukan secara eksitu melalui usaha pengembangbiakan kupu-kupu. Media interpretasi diperlukan sebagai sarana penghubung antara sumberdaya dan pengunjung dalam fungsi Panaruban Butterfly Heaven sebagai wisata edukasi. Penelitian ini bertujuan untuk mengkaji pengelolaan penangkaran kupu-kupu, keberhasilan pemeliharaan Papilio memnon, serta mengidentifikasi karakteristik dan preferensi pengunjung terhadap media interpretasi untuk merekomendasikan media interpretasi yang sesuai di Panaruban Butterfly Heaven. Data diperoleh pada bulan Agustus – Oktober 2017 melalui pengamatan langsung, percobaan pemeliharaan intensif, wawancara, dan studi literatur. Pengelolaan Panaruban Butterfly Heaven mencakup aktivitas pemeliharaan kupu-kupu secara berkelanjutan, dan kupu-kupu hasil penangkaran digunakan untuk rekreasi, edukasi, penelitian dan pelestarian lingkungan. Tingkat keberhasilan pemeliharaan Papilio memnon adalah sebesar 53.33%. Kartu informasi kupu-kupu dan papan cerita obyek merupakan media interpretasi yang tepat dalam mengakomodasi kebutuhan pengunjung Panaruban Butterfly Heaven.
Keyword: Kupu-kupu, media interpretasi, penangkaran, sistem intensif

Judul: Pengelolaan penangkaran kupu-kupu di PT Ikas Amboina dan Bali Butterfly Park Tabanan Bali
Abstrak: This study aims to determine and analyze the management of the breeding success rate of butterflies in PT Ikas Amboina and the Bali Butterfly Park. It is expected that this research can be an input for the PT Ikas Amboina and the Bali Butterfly Park itself in order to develop cultivation techniques and theutilization of butterflies better yet ,in addition this research also to expected to serve as guidelines for the management and or development of captive breeding butterfly elsewhere in Indonesia. This research was conducted through five stages namely study literature, measurements, observations, and interviews, as well as qualitative data processing. From the research result shows there are 15 species of butterflies that captived, consisting of two families namely Papilionidae and Nymphalidae. Two species of family Papilionidae including a protected butterfly, Ornithoptera priamus and Troides helena. There are five types of cages used during the captive process of butterflies, among other reproductive cage, cage rearing the eggs, the larval rearing, cocoon cage, and cage of butterflies. Plants used in the process of cultivating a butterfly on the basis of its functions can be divided into three, namely feed the larvae, the main plant (nectar-producing), and supporting plants (ornamental). Management conducted in captivity include the procurement of seed, maintenance of egg, larval rearing, maintenance pupa, maintenance of adult butterfly, health care, provision of additional food, and utilization of butterflies through activities of captive offset creation. Butterfly farming techniques are carried out intensively by PT Ikas Amboina able to increase the odds of living butterflies, which average 53.17% of the total eggs produced.
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: