Judul: Analisis Anatomi, Struktur Sekretori dan Uji Histokimia Tanaman Kenikir (Cosmos caudatus Kunth.).
Abstrak: Kenikir (Cosmos caudatus Kunth.) merupakan tanaman herba yang dapat tumbuh di wilayah Indonesia. Kenikir memiliki potensi untuk dikembangkan karena mengandung senyawa metabolit yang berfungsi sebagai obat. Penelitian ini bertujuan mempelajari struktur anatomi, dan struktur sekretori, serta mengetahui kandungan senyawa yang terdapat di dalamnya. Pengamatan struktur anatomi, sekretori, dan uji histokimia menggunakan tumbuhan yang ditanam di Tamansari, Kabupaten Bogor. Organ tumbuhan yang diamati meliputi daun, tangkai daun, dan batang. Analisis struktur anatomi daun menunjukkan bentuk sel epidermis tidak beraturan dengan dinding sel berlekuk dan tipe stomata anomositik. Hasil analisis anatomi pada tangkai daun dan batang terdiri atas epidermis, korteks, berkas pembuluh, dan empulur. Struktur sekretori yang ditemukan pada tanaman kenikir berupa trikoma kelenjar multiseluler tipe 1 yang memiliki bagian kepala berbentuk bulat tersusun oleh sekitar 16 – 32 sel, trikoma kelenjar multiseluler tipe 2 yang memiliki bagian kepala berbentuk bulat yang tersusun oleh sekitar 24 – 42 sel, trikoma kelenjar uniseriat tipe 1 berbentuk memanjang tersusun oleh satu sel basal dan 4 – 8 sel, dan trikoma kelenjar uniseriat tipe 2 berbentuk memanjang tersusun oleh satu sel basal dan 15 – 20 sel, serta sel idioblas. Uji histokimia menunjukkan senyawa metabolit sekunder yang terakumulasi pada trikoma berupa fenol, terpenoid, lipofilik, dan flavonoid, sedangkan pada sel idioblas yaitu fenol, terpenoid, dan flavonoid.
Keyword: Cosmos caudatus Kunth., sel idioblas, terpenoid, trikoma kelenjar

Judul: Kemiripan dan Potensi Produksi Aksesi Kenikir (Cosmos caudatus Kunth.) dari Beberapa Tempat di Jawa Barat
Abstrak: Kenikir has the potential to be developed as an alternative vegetable to meet market demand. However, in general, this kind of vegetable has not been widely known by the publican disusually found only in the local market. So far, there has been no research or information on the genetic diversity of this plant. It is, therefore, necessary to conduct the exploration activity to study the morphological characters of the kenikir in several areas in West Java. The objectives of this study were to observe similarity and production potential among the accessions of kenikir (Cosmos caudatus Kunth.) that has the potential to be developed in several places in West Java. This study consisted of two experiments. The first experiment was an exploration and similarity between accession of kenikir (Cosmos caudatus Kunth.) from several places in West Java. Observations were carried out based on the table characteristics of kenikir plant and cluster analysis was also conducted to determine the similarity among the kenikir accessions. The second experiment evaluated the production of several accessions of kenikir (Cosmos caudatus Kunth.) from several places in West Java. This experiment used a Randomized Complete Block Design with a single factor, namely 7 accession as a treatment. The results of the clusters analysis grouped 20 Cosmos accessions into three clusters. Cluster I and II consisted only one accession each which were AK 16 and AK14, respectively. Cluster III consisted of AK 9, AK 11, AK 10, AK 7, AK 8, AK 5, AK 6, AK 3, AK 19, AK 4, AK 3, AK 13, AK 20, AK 1, AK 18, AK 15, AK 2, AK 12 and AK 17. The main characteristic of cluster I were have spreading growth-type, strong stem anthocyanin colouration, ray florets tubular type and secondary color of ray floret distributed in quarter part of the plant. The main characteristic of cluster II were have semi upright growth type, medium stem anthocyanin colouration, ray florets ligulate type, secondary colour of ray floret distributed in the bottom part of the plants. The main characteristic of cluster III were have semi upright growth type, medium stem anthocyanin colouration, ray floret tubular type and secondary color distributed at the quarter part of the plants. In general, Dramaga (AK 14) and Ciaruten (AK16) accession showed that their production characters were better and more superior than those of the other accessions so that they were potential to be developed. Kenikir desired include those which have tall trees, large number of leaves, long and wide leaves, high yields and slow flowering.
Keyword: Characterization, cluster analysis, exploration

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