Judul: Study of Cultivation Techniques, Flowering  Phenology, Production and Quality of Essential Oil of Cananga Cananga odorata forma macrophylla and forma fruticosa
Abstrak: Bunga kenanga (Cananga odorata) merupakan salah satu sumber minyak atsiri yang banyak digunakan di industri parfum dan farmasi. Jawa pernah dikenal sebagai penghasil minyak kenanga di dunia dengan Desa Gajahrejo, Kecamatan Purwodadi, Kabupaten Pasuruan sebagai salah satu sentra budidaya kenanga. Praktik budidaya kenanga yang baik sangat penting dalam menjaga kontinuitas produksi dan kualitas bunga. Penelitian yang mengidentifikasi karakter dari berbagai varietas dan aksesi bunga kenanga di Indonesia belum banyak dilakukan. Penelitian ini bertujuan mendapatkan informasi budidaya, karakterisasi tanaman, fenologi pembungaan, dan rendemen minyak dari dua jenis kenanga di Gajahrejo. Kenanga yang dibudidayakan adalah kenanga pohon (Cananga odorata forma macrophylla) dan kenanga perdu (Cananga odorata forma fruticosa). Faktor yang memiliki pengaruh pada produksi bunga kenanga perdu adalah jumlah cabang produktif sehingga kegiatan pemangkasan pucuk pada kenanga memiliki pengaruh yang baik. Bunga kenanga pohon dapat digunakan untuk bunga kuburan dan bahan baku penyulingan minyak serta memiliki helai bunga lebih besar dibandingkan bunga kenanga perdu. Durasi perkembangan bunga kenanga pohon adalah 44 hari sedangkan kenanga perdu 42 hari. Rendemen minyak dari bunga kenanga pohon lebih besar yaitu 1,10% dibandingkan bunga kenanga perdu yaitu 0,61%. Jika dilihat dari warna dan aroma minyak, keduanya berwarna kuning pucat dan harum, tapi minyak bunga kenanga perdu memiliki aroma yang lebih wangi daripada minyak bunga kenanga pohon.
Keyword: budidaya, fenologi bunga, karakterisasi, minyak bunga, rendemen minyak

Judul: Flower Harvesting and Essential Oil Quality of Two Accessions of Cananga (Cananga odorata) in The Two Harvest Seasons.
Abstrak: Bunga kenanga merupakan salah satu bunga yang telah dikenal diberbagai wilayah di Indonesia dan mempunyai arti penting tidak saja sebagai bahan baku minyak atsiri namun juga pada berbagai penggunaan segar lainnya. Penelitian ini bertujuan untuk mendapatkan potensi produksi dan kualitas minyak atsiri dua aksesi kenanga pada dua musim tanam serta mendapatkan potensi produksi dan minyak atsiri pada stadia pertumbuhan yang terbaik. Kedua jenis bunga kenanga ditanam di kebun percobaan IPB Cikabayan. Pengamatan dilakukan terhadap karakter bagian daun, bunga, fenologi pembungaan, pertumbuhan vegetatif, produksi serta minyak atsiri. Hasil penelitian menunjukkan aksesi Kediri memiliki tangkai daun berwarna merah kecoklatan, cabang berwarna merah kecoklatan dan batang berwarna coklat tua; sedangkan aksesi Cipanas memiliki tangkai daun dan cabang berwarna hijau dan batang berwarna coklat muda. Bunga kenanga Aksesi Kediri memiliki ukuran lebih besar dengan jumlah petal yang lebih banyak dibandingkan aksesi Cipanas. Fenologi pembungaan aksesi Kediri dimulai dari munculnya kuncup bunga hingga fase akhir selama 35 hari, sedangkan aksesi Cipanas selama 25 hari. Produksi bobot bunga aksesi Kediri memiliki nilai tertinggi dibandingkan aksesi Cipanas di kedua musim panen. Rendemen minyak atsiri tertinggi aksesi Cipanas pada stadia 50% berbunga penuh sebesar 0,92%, dan menurun hingga pembungaan akhir. Aksesi kediri memghasilkan rendemen minyak tertinggi pada akhir waktu panen mencapai 0.63%. kandungan senyawa tertinggi aksesi Kediri adalah all-trans-Farnesol aceate 14,24%, β-Copaene 12.23% dan Caryophyllene 15.92%. Sedangkan pada aksesi Cipanas adalah linalool 18.74% and Caryophyllene 16.00%., The cananga flower is a flower that is well known in various regions in Indonesia and has importance not only as a raw material for essential oils but also for various other fresh uses. This research aims to obtain the production potential and quality of essential oils of two cananga accessions in two growing seasons and to obtain the production potential and essential oils at the best growth stage. Both types of cananga flowers were planted in the IPB Cikabayan experimental garden. Observations were made on the characteristics of leaves, flowers, flowering phenology, vegetative growth, production and essential oils. The research results showed that the Kediri Accession had brownish red leaf petioles, brownish red branches and dark brown stems; while the Cipanas accession has green leaf stalks and branches and light brown stems. The Kediri accession cananga flower has a larger size with a greater number of petals than the Cipanas accession. The flowering phenology of the Kediri accession starts from the emergence of flower buds until the final phase takes 35 days, while the Cipanas accession lasts 25 days. The flower weight production of the Kediri accession had the highest value compared to the Cipanas accession in both harvest seasons. The highest essential oil yield of the Cipanas accession was at the 50% full flowering stage of 0.92%, and decreased until final flowering. The Kediri accession produced the highest oil yield at the end of the flowering phase, reaching 0.63%. The highest compound content of the Kediri accession was all-trans-Farnesol aceate 14.24%, β-Copaene 12.23% and Caryophyllene 15.92%. Meanwhile, in the Cipanas accession, it was linalool 18.74% and Caryophyllene 16.00%.
Keyword: fenologi pembungaan, linalool, morfologi kenanga, produksi bunga, profil minyak

Judul: The Construction of Greedy SVP LLL Algorithm
Abstrak: A lattice is a set of all integer linear combination of a set of linearly independent vectors in ℝ𝑛���. The independent vectors are called bases of lattice. Any lattice can be generated from many bases, and these bases have the same cardinality. In the lattice, the most fundamental and renowned problem is the Shortest Vector Problem (SVP). SVP is a tracking problem of the shortest nonzero vector in a lattice with equivalent bases. In two dimensions, SVP problem has resolved exactly by Gauss’ algorithm. When the lattice dimension is higher than two, A.K. Lenstra, H.W. Lenstra and L. Lovasz gave a LLL algorithm to compute approximation of nonzero shortest vector in the lattice. Reduced bases solution obtained from LLL algorithm still be an approximation and has polynomial running time of arbitrary dimension which large enough. In 1994, Schnoor and Euchner modified this LLL algorithm as a new variant which later was named deep insertion LLL algorithm. This algorithm is a modified version of the LLL algorithm to the terms of the exchange step to improve the accuracy of output of LLL reduced bases and applying it to the subset sum problem. The purpose of this research are: (1) Reconstruct the LLL algorithm and deep insertion LLL algorithm using a geometric approach. (2) Construct a greedy SVP LLL algorithm. (3) Implement the three algorithms in a symbolic programming language, and evaluate them experimentally. A bases ℬ=[𝐛���1,𝐛���2,…,𝐛���𝑛���] in ℝ𝑚��� is called reduced LLL with parameter 𝛿��� if satisfies: (a) |𝜇���𝑗���𝑖���|≤12, for every integer 𝑖���,𝑗��� with 1≤𝑖���<𝑗���<𝑛���. (b)𝛿���‖𝜋���𝑗���(𝐛���𝑗���)‖2≤‖𝜋���𝑗���(𝐛���𝑗���+1)‖2, for 𝑗���=1,2,…,𝑛���−1,where 𝛿��� is a reduced parameter of real numbers with 14<𝛿���<1. The first requirement is the reduced basis 𝛿��� must “nearly orthogonal” and in its computation case, this requirement can be reached out by using the Gram-Schmidt’s orthogonalization. While the second requirement is called exchange step, or used to called as Lovasz condition. By using both of these requirements, then they establish the LLL algorithm. Then, Schnoor and Euchner modify the LLL algorithm based on the requirements of the exchange step called the deep insertion LLL algorithm, where the exchange step is based on the comparison of the projected vector in orthogonal complement [𝐛���1,𝐛���2,…,𝐛���𝑘���−1]⊥ after j-th reduction. To construct greedy SVP LLL algorithm, the requirements of the exchange step is based on purely by comparing norm of lattice 𝐛���𝑗��� with norm lattice 𝐛���𝑖��� for 𝑖���=1,2,3…,𝑗���−1. The process of insertion reduced vector after the exchange step also has done greedily. Then, we calculate the number of arithmetic operation in greedy SVP LLL algorithm for further analysis. The result of our exprimentation for three algorithms on the certain matrix size shows that the running time of the three algorithms increases propotional to the size of the matrix. The result also shows that by using 𝛿���=34 for the LLL algorithm and the deep insertion LLL algorithm, and the greedy SVP LLL algorithm which is a new variant made by using no parameter of 𝛿���, outperform of the other of two previous algorithm in terms of speed with the same output.
Keyword: LLL algorithm, LLL deep insertion algorithm, greedy SVP LLL algorithm