• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.51-61
• /
• 2012

This paper suggests an algorithm that obtains Directed Graph Minimum Spanning Tree (DMST), using Prim MST algorithm which is Minimum Spanning Tree (MST) of undirected graph. At first, I suggested the Prim DMST algorithm that chooses Minimum Weight Arc(MWA) from out-going nodes from each node, considering differences between undirected graph and directed graph. Next, I proved a disadvantage of Prim DMST algorithm and Chu-Liu/Edmonds DMST (typical representative DMST) of not being able to find DMST, applying them to 3 real graphs. Last, as an algorithm that can always find DMST, an advanced Prim DMST is suggested. The Prim DMST algorithm uses a method of choosing MWA among out-going arcs of each node. On the other hand, the advanced Prim DMST algorithm uses a method of choosing a coinciding arc from the out-going and in-going arcs of each node. And if there is no coinciding arc, it chooses MWA from the out-going arcs from each node. Applying the suggested algorithm to 17 different graphs, it succeeded in finding the same DMST as that found by Chu-Liu/Edmonds DMST algorithm. Also, it does not require such a complicated calculation as that of Chu-Liu/Edmonds DMST algorithm to delete the cycle, and it takes less time for process than Prim DMST algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.5
• /
• pp.159-171
• /
• 2011

This paper suggests an algorithm that obtains the Minimum Spanning Tree for directed graph (DMST). The existing Chu-Liu/Edmonds DMST algorithm has chances of the algorithm not being able to find DMST or of the sum of ST not being the least. The suggested algorithm is made in such a way that it always finds DMST, rectifying the disadvantage of Chu-Liu/Edmonds DMST algorithm. Firstly, it chooses the Minimum-Weight Arc (MWA) from all the nodes including a root node, and gets rid of the nodes in which cycle occurs after sorting them in an ascending order. In this process, Minimum Spanning Forest (MST) is obtained. If there is only one MSF, DMST is obtained. And if there are more than 2 MSFs, to determine MWA among all MST nodes, it chooses a method of directly calculating the sum of all the weights, and hence simplifies the emendation process for solving a cycle problem of Chu-Liu/Edmonds DMST algorithm. The suggested Sulee DMST algorithm can always obtain DMST that minimizes the weight of the arcs no matter if the root node is set or not, and it is also capable to find the root node of a graph with minimized weight.

• Anxiety and mood
• /
• v.18 no.1
• /
• pp.32-37
• /
• 2022

Objective : Impaired working memory has been known to play an important role in the pathophysiology of obsessive-compulsive disorder (OCD) with growing evidence. Delayed matching-to-sample task (DMST) is a working memory task which have an advantage in analyzing several different working memory processes in one task. However, most of the studies have failed to reveal the working memory impairment with the DMST. The aim of this study was to identify whether working memory deficit in OCD can be evaluated with the DMST. Methods : The participants included 20 OCD patients and 20 healthy volunteers. Working memory was evaluated with the DMST with two different working memory loads. Accuracy of response and mean response time were measured. Results : OCD patients showed a significantly longer reaction time and lower accuracy in DMST compared to healthy controls in the task with high working memory loads. Moreover, the difference in accuracy showed interaction with the working memory load. Conclusion : The present results indicate that working memory deficit in patients with OCD can be evaluated with the DMST. The findings also suggest that previous negative behavioral results using the DMST were from low working memory load of the task.

• Journal of Microbiology and Biotechnology
• /
• v.32 no.10
• /
• pp.1315-1324
• /
• 2022

Fermentation is an effective process for providing various beneficial effects in functional beverages. Lactic acid bacteria and yeast fermentation-based biotransformation contribute to enhancement of nutritional value and digestibility, including lactose intolerance reduction and control of infections. In this study, the probiotic fermented fruit juice (PFJ) was produced by Lactobacillus plantarum TISTR 1465, Lactobacillus salivarius TISTR 1112, and Saccharomyces boulardii CNCM I-745 while mixed fruit juice (MFJ) was used as the basic medium for microorganism growth. The potential function, the anti-salmonella activity of PFJ, was found to be effective at 250 mg/ml of MIC and 500 mg/ml of MBC. Biofilm inhibition was performed using the PFJ samples and showed at least 70% reduction in cell attachment at the MIC concentration of Salmonella Typhi DMST 22842. The antioxidant activities of PFJ were determined and the results revealed that FSB.25 exhibited 78.40 ± 0.51 mM TE/ml by FRAP assay, while FPSB.25 exhibited 3.44 ± 0.10 mM TE/ml by DPPH assay. The volatile compounds of PFJ were characterized by GC-MS, which identified alcohol, aldehyde, acid, ester, ketone, phenol, and terpene. The most abundant organic acid and alcohol detected in PFJ were acetic acid and 2-phenylethanol, and the most represented terpene was β-damascenone. The sensory attributes showed scores higher than 7 on a 9-point hedonic scale for the FPB.25, illustrating that it was well accepted by panelists. Taken together, our results showed that PFJ could meet current consumer demand regarding natural and functional, fruit-based fermented beverages.