Judul: Aktivitas Antibakteri dan Antikhamir pada Putih Telur dengan Penambahan Ekstrak Nanas (Ananas comosus L. Merr).
Abstrak: Putih telur memiliki sifat antibakteri dikarenakan putih telur mengandung enzim lisozim yang memiliki aktivitas antibakteri. Ekstrak nanas memiliki Enzim bromelin yang dapat menghidrolisis protein putih telur menjadi hidrolisat yang memiliki aktivitas antibakteri. Penelitian ini bertujuan untuk menganalisis aktivitas antibakteri dari putih telur ayam kampung dan putih telur itik dengan penambahan ekstrak nanas. Pada bakteri E. coli aktivitas antibakteri telur ayam kampung memiliki rataan zona hambat 3,61 mm dan itik sebesar 2,53 mm, pada bakteri S. aureus telur ayam kampung memiliki rataan zona hambat sebesar 2,10 mm dan telur itik sebesar 2,58 mm, pada bakteri Salmonella sp, rataan zona hambat telur ayam kampung sebesar 2,10 mm dan telur itik sebesar 2,37 mm, pada khamir S. cerevisae telur ayam kampung memiliki rataan zona hambat sebesar 2,26 mm dan pada telur itik sebesar 2,44 mm. Sampel telur yang ditambahkan dengan ekstrak nanas memilki zona hambat yang lebih besar dibandingkan dengan sampel telur tanpa penambahan ekstrak nanas, hal ini menunjukkan bahwa hidrolisis protein putih telur dengan menggunakan enzim bromelin dari ekstrak nanas berhasil meningkatkan aktivitas antibakteri telur tersebut.
Keyword: antibacterial, bromelain, egg white, hydrolysis

Judul: Antioxidant and Antibacterial Activity of Bioactive Peptides from IPB-D1 Chicken Egg White Hydrolyzed with Pepsin Enzyme
Abstrak: Putih telur diketahui memiliki aktivitas bioaktif seperti antioksidan dan antibakteri yang terletak pada peptida penyusun protein yang dikandungnya. Ayam IPB-D1 merupakan rumpun ayam baru yang memiliki keunggulan genetik berupa ketahanan penyakit, adaptif, dan performa pertumbuhan yang lebih baik dari ayam kampung, serta kualitas telur yang dihasilkan tergolong sangat baik. Penelitian ini bertujuan menganalisis aktivitas antioksidan dan antibakteri peptida bioaktif putih telur ayam IPB-D1 melalui hidrolisis dengan enzim pepsin. Filtrat putih telur menunjukkan aktivitas penghambatan DPPH lebih tinggi sebesar 14,97% dan kapasitas antioksidan sebesar 86,78 mg EVC 100 g-1. Pengujian antibakteri dengan metode cakram menunjukkan aktivitas penghambatan baik terhadap bakteri Gram-positif maupun Gram-negatif. Filtrat putih telur juga menunjukkan aktivitas antibakteri yang lebih baik dibandingkan putih telur sebelum dihidrolisis., Egg whites are known to have bioactive activities such as antioxidants and antibacterials located in the peptides of its protein contain. IPB-D1 chicken is a new chicken strain that has genetic advantages in the form of disease resistance, adaptive, and better growth performance than native chickens, and very good quality of the eggs production. This study aims to analyze the antioxidant and antibacterial activity of IPB-D1 chicken egg white bioactive peptides through hydrolysis with pepsin enzymes. Egg white filtrate showed DPPH inhibitory activity of 14.97% and antioxidant capacity of 86.78 mg EVC 100 g -1 . Antibacterial testing by disc method shows inhibitory activity. Antibacterial testing using the disc method showed inhibitory activity against both Grampositive and Gram-negative bacteria. The egg white filtrate also demonstrated better antibacterial activity compared to egg white before hydrolysis.
Keyword: Antioksidan, antibakteri, ayam IPB-D1, Peptida bioaktif, Telur, pepsin

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