Judul: Etnobotani Pewarna Alami pada Batik di Surakarta dan Yogyakarta
Abstrak: Kampung Laweyan dan Desa Tancep merupakan sentra batik yang sudah dikenal secara luas. Tumbuhan pewarna alami pada batik masih digunakan masyarakat tetapi kesadaran akan pentingnya penggunaan pewarna alami di kalangan pembatik semakin hari semakin menurun. Teknik pewarnaan sintetis atau kimia menggeser teknik pewarnaan alami. Tujuan penelitian ini adalah mengetahui jenis-jenis tumbuhan yang digunakan sebagai pewarna alami pada batik dan melestarikan metode pewarnaan alami pada batik yang semakin menurun peminatnya. Metode yang digunakan adalah metode snowball dengan total 32 responden. Total jenis tumbuhan pewarna alami yang dimanfaatkan oleh masyarakat di Kampung Laweyan sebanyak 19 jenis dari 16 famili dan di Desa Tancep sebanyak 37 jenis dari 27 famili. Tumbuhan pewarna alami berdasarkan bagian yang digunakan dikelompokkan menjadi daun, batang, kulit batang, buah, kulit buah, biji, bunga, akar, rimpang dan kulit umbi, sedangkan berdasarkan habitusnya dikelompokkan menjadi perdu, semak, herba dan pohon. Warna yang dihasilkan dikelompokkan menjadi sepuluh macam arah warna yaitu kuning, biru, merah, hijau, cokelat, merah muda, abu-abu, ungu, jingga atau oranye dan hitam. Cara pengolahan yang sering digunakan yaitu direbus. Tumbuhan pewarna alami lebih banyak dibudidayakan oleh masyarakat.
Keyword: batik, ethnobotany, natural dye plants, respondents.

Judul: Ethnobotanical Study of Natural Food and Clothing Dyes in Belitung Regency
Abstrak: Perkembangan zaman serta kemajuan teknologi membuat pengetahuan akan pewarna alami pangan maupun sandang semakin berkurang dan banyak yang beralih menggunakan pewarna sintetis. Penelitian ini bertujuan untuk mengidentifikasi karakteristik responden, pemanfaatan dan status tumbuhan pewarna alami pangan maupun sandang. Metode penelitian ini menggunakan teknik snowball sampling dan purposive sampling. Hasil penelitian menunjukan bahwa responden pewarna alami pangan maupun sandang didominasi oleh perempuan dengan usia produktif. Tingkat pendidikan mayoritas lulusan SMA/SMK dan sumber pengetahuan diperoleh di tempat kerja dan secara otodidak. Terdapat 15 spesies pewarna alami pangan dan 19 spesies pewarna alami sandang yang dimanfaatkan serta sebagian besar diperoleh dengan cara membeli. Bagian dan warna yang dihasilkan pada pangan dan sandang didominasi bagian daun dan warna kuning. Tumbuhan pewarna yang termasuk langka teridentifikasi 12 spesies, yaitu 2 spesies Appendix II CITES, 6 spesies Least Concern IUCN, 1 spesies Near Threatened IUCN, dan 3 spesies Data Deficient IUCN, The development of the times and technological advances have made knowledge of natural food and clothing dyes decrease and many have switched to using synthetic dyes. This research aims to identify the characteristics of respondents, utilization and status of natural coloring plants for food and clothing. This research method uses snowball sampling and purposive sampling techniques. The results showed that respondents of natural food and clothing dyes were dominated by women of productive age. The education level of the majority of SMA/SMK graduates and the source of knowledge obtained at work and self-taught. There are 15 species of food natural dyes and 19 species of clothing natural dyes that are utilized and most of them are obtained by purchasing. The parts and colors produced in food and clothing are dominated by the leaves and yellow color. There are 12 rare coloring plants identified, namely 2 CITES Appendix II species, 6 IUCN Least Concern species, 1 IUCN Near Threatened species, and 3 IUCN Data Deficient species.
Keyword: Batik, ecoprint, natural dyes, plants

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