Judul: Penyelesaian Stacker Crane Problem dengan Algoritme Largearcs dan Smallarcs
Abstrak: In graph theory, the Rural Postman Problem (RPP) aims to determine the shortest route with minimum cost, in which only certain edges or arcs are necessarily traversed. One type of RPP is Stacker Crane Problem (SCP) which deals with a mixed graph but only arcs are necessarily traversed. SCP can be solved by using two heuristic algorithms, i.e. Largearcs and Smallarcs algorithms, which include other algorithms in their steps, such as: Dijkstra algorithm to determine shortest route, Hungaria method to determine minimum bipartite matching, Prim algorithm to determine minimum spanning tree, and van Aardenne-Ehrenfest & de-Bruijn algorithm and Fleury algorithm to determine Euler circuits. The shortest Euler circuit resulted from two heuristic algorithms can be used to find a solution of SCP. The application of SCP is illustrated in establishing the minimum distance route of catering delivery.
Keyword: 

Judul: Penyelesaian Directed Rural Postman Problem
Abstrak: Rural Postman Problem (RPP) merupakan masalah penentuan rute optimal dengan syarat ada rute-rute tertentu yang harus dilewati, sedangkan rute lainnya boleh dilewati. Jika suatu rute dilewati, maka haruslah dilewati tepat satu kali. Dalam karya ilmiah ini akan dibahas penyelesaian RPP pada graf berarah atau Directed Rural Postman Problem (DRPP) dengan menggunakan dua algoritme heuristik, yaitu algoritme Balance & Connect (B&C) dan algoritme Connect & Balance (C&B). Formulasi masalah transportasi digunakan untuk mengubah graf takbalans menjadi graf balans. Penentuan path terpendek diselesaikan dengan menggunakan algoritme Dijkstra, dan penentuan minimum spanning tree diselesaiakan dengan menggunakan Algoritme Prim. Solusi DRPP dengan menggunakan algoritme B&C dan algoritme C&B berupa sirkuit Euler yang bisa ditentukan dengan menggunakan algoritme van Aardenne−Ehrenfest & de Bruijn. Contoh aplikasi yang digunakan dalam karya ilmiah ini adalah penentuan rute optimal antar-jemput padi gilingan
Keyword: Graph algorithm, Branch and bound, Minimum spanning tree, Bogor Agricultural University, Institut Pertanian Bogor, IPB

Judul: Durability of Specific Immunoglobulin (Ig) Y Againts Influenza and Covid-19 in Sunscreen
Abstrak: The benefit of specific immunoglobulin Y (Ig Y) as an active ingredient in personal care products such as sunscreen has not been properly studied. Our study aims to evaluate the reliability of specific IgY against influenza and the COVID-19 virus in a sample sunscreen product. Specific IgY influenza and COVID-19 viruses were inserted in the sample sunscreen at two concentrations of 0.1% and 0.25%. Three treatments were observed: control (C) sunscreen without IgY, treatment 1 (T1) sunscreen with 0.1% IgY, and treatment 2 (T2) sunscreen with 0.25% IgY. Organoleptic observations were carried out to monitor changes in aroma, color, and texture, and sunscreen sampling was done every week for 6 weeks. The durability of IgY was evaluated using an enzyme-linked immunosorbent assay (ELISA) and a neutralization assay. Organoleptic observation from weeks 1 to 6 showed consistency in its aroma, color, and texture. Enzyme-linked immunosorbent assay and neutralization assay (NA) results of the T1 and T2 groups showed negative results except for sample T1 at week 5, which showed a positive result in the Influenza A ELISA. Based on the results, it seems that IgY concentrations of 0.1% or 0.25% were not optimal. However, this negative result might be due to low concentration of the IgY and the presence of beeswax, which inhibits IgY and causes it to dissolve in distilled water, thus preventing it from being detected in the assay.
Keyword: Immunoglobulin Y, Sunscreen, Influenza, COVID-19, Biological Activity