Judul: Toleransi dan respon fisiologi tanaman Celosia cristata, Gomphrena globosa, dan Catharanthus roseus terhadap zat pencemar udara
Abstrak: Air pollution is an environmental issue that occurs due to change in air composition of its normal state. Plants have been known as bio indicator for air pollution through the growth response. Information capability of herbs plant to absorb pollutant is very limited. The objectives of this research were to determine the tolerance and physiological responses of Celosia cristata, Gomphrena globusa, and Catharanthus roseus due to air pollutant. On the other site, data were also collecyed at green house of IPB Dramaga, which has a relatively low of pollutants. Growth and physiological parameters were recorded include plant height, number of leaf, total leaf area, number of leaf senescence, fresh and dry weight of plant, chlorophyll content, ascorbic acid content (ASA), and the activity of ascorbate peroxidase (APX). Data were analyzed by analysis of variance and Duncan Multiple Range Test (DMRT). This study revealed that plants on location with relatively high of pollutant have plant height, number of leaf, total leaf area, fresh and dry weight lower than those of plants on relatively low of pollutant whereas, total leaf senesence increased. Cataranthus rosesus showed decreasing of chlorophyll content and increasing of APX activity as physiological response due to air pollutant.
Keyword: 

Judul: Respon pertumbuhan dan fisiologi tanaman Asystasia gangetica, Impatiens balsamina, dan Mirabilis jalapa pada tingkat polusi yang berbeda
Abstrak: Air pollution is an environmental issue that causes the changing and decreasing of air quality. The plants have different response to the aerial pollution. The purpose of this research was to analyze growth and physiological responses of Asystasia gangetica, Impatiens balsamina, and Mirabilis jalapa grown under different level of pollution in Bogor. The plants were grown in polybag and during 3 months they were exposed to different conditions: (1) with higher aerial pollution and (2) with lower aerial pollution. Growth responses observed in the experiment were the improvement of relative high, leaf number, leaf area, and the value of roots and shoot fresh weight, dry weight, and ratio of shoot/roots. Physiologycal responses observation was also analysed, including chlorophyll and ascorbic acid content. Different pollutant intentsity caused different in growth of Asystasia gangetica, Impatiens balsamina, and Mirabilis jalapa. The plants grown in higher pollution had lower chlorophyll and lower shoot/roots ratio as compared to those grown in lower pollution. Higher aerial pollution caused the plant underwent stress indicated by the increase of ascorbic acid content. The data showed that the plants were sensitive to the aerial pollution even though the pollutant content was still lower than below the standard threshold.
Keyword: 

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