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: The Exploration of Discrete Logarithm over Finite Field GF(3m)
Abstrak: The security of many public~key algorithms is based on the problem of finding discrete logarithms. The generalized discrete logarithm problem is the following: given a finite cyclic group G of order n, a generator a of G, and an element fl E G, find the integer x, 0 ~ x ~ n - 1, such that 0: = fl. Algorithm for discrete logarithm problem focused on Menezes et al. (1997) that consist of exhaustive search algorithm, the baby-step giant-step algorithm, Pollard's rho algorithm, Pohlig-Hellman algorithm, and index-calculus algorithm. These algorithms are explorated to be used in discrete logarithm problem over finite field GF(3m ). The exploration also produces some algorithms, i.e. naif negative algorithm, baby-step mother-step algorithm, baby-step mother free-step algorithm, and baby-step free-step algorithm. All algorithms implemented using Maple 11. The Pohlig-Hellman and baby-step giant-step algorithms are efficient enough to be used in discrete logarithm problem over finite field GF(3m ) for m < 20.
Keyword: