Judul: Deteksi Keberadaan Antibodi Anti Diare (Escherichia coli dan Salmonella Enteritidis) Dan Anti Flu Burung (H5N1) Pada Kuning Telur Ayam Isa Brown Yang Diberi Perlakuan Pemanasan Bertingkat
Abstrak: This study was aimed to detect the existence of antibodies (immunoglobulin Y) specific to Escherichia coli, Salmonella Enteritidis, and Avian influenza (H5N1) in eggs after heating/boiling process. The treatment is by heating or boiling the whole eggs complete with shells at a temperature of 60°C, 70°C, 80°C, 90°C and 100°C for 5 minutes. The Eggs were tested that containing antibodies of anti-diarrhea and anti-avian influenza. This research used Agar Gel Precipitation Test (AGPT) method to detect antibodies of anti-diarrhea and hemagglutination inhibition (HI) test to detect antibodies of avian influenza. The results showed that the presence of antibodies (IgY) can still be detected by using AGPT and HI method in the eggs which be heated at 60°C, 70°C and 80°C for 5 minutes. Antibodies specific for Escherichia coli, Salmonella Enteritidis, and avian influenza (H5N1) could survive in the eggs complete with eggshells which be heated in the range of temperature 60–80°C. While on heating 90°C and 100°C has not detected the presence of antibodies specific because antibodies which is consist of protein was denatured. It could be concluded that the higher of egg heating temperature, IgY biological activity were decrease.
Keyword: 

Judul: Deteksi Imunoglobulin Y Pada Telur Asin Anti Diare Dan Flu Burung Dengan Metode Agar Gel Precipitation Test (AGPT) Dan Hemagglutination Inhibition Test (Hi Test)
Abstrak: This study was conducted to detect specific IgY (anti Enteropathogenic Escherichia coli (EPEC), anti Salmonella Enteritidis, and anti Avian Influenza Virus H5N1) in salted egg. The laying hens were vaccinated with EPEC and Salmonella Enteritidis inactive-vaccine and AI H5N1 vaccine (IPB-Shigeta). Nine eggs were salted by NaCl solution (1:2). The eggs were salted by three times of long-term salting (10 days, 15 days, and 20 days). The IgY was detected using AGPT and haemagglutination inhibition (HI) test. The AGPT result showed that specific IgY of EPEC and Salmonella Enteritidis detected at 10 days and 15 days long-term salting. The mean titer of anti AI-IgY (over 24) was detected using by HI at all long-term salting. In conclusion, salted egg yolk still have specific IgY which is potential for production functional salted egg.
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