• Food Science and Preservation
• /
• v.30 no.6
• /
• pp.905-917
• /
• 2023

The optimal fermentation conditions for producing fermented black soybeans rich in sulfur-containing amino acids were investigated. Response surface methodology monitored fermentation conditions. A central composite design examined the effect of independent variables: enzyme concentration (X₁) and fermentation time (X₂) on yield and methionine content. Both factors significantly influenced these dependent variables. Enzyme concentration more profoundly affected amino nitrogen content than fermentation time. β-Glucan content and cystine level were primarily affected by fermentation time. We elicited each variable's regression formula and identified optimal fermentation conditions for functional compounds. The predicted optimum conditions were an enzyme concentration of 0.28-0.32% and a fermentation time of 58.0-62.0 min. Under these optimal conditions, each black soybean variety's sulfur amino acid content ranged from 818.62 to 922.62 mg/100 g, demonstrating significant variety differences.

• Journal of Embryo Transfer
• /
• v.32 no.3
• /
• pp.153-157
• /
• 2017

This study was conducted to investigate the optimal artificial insemination (AI) time with diagnostic kit at ovulation time. We already applied the patent about the protein in the cow heat mucose in external reproductive tract. And we would examine the accuracy for detection of cow heat by the kit produced with the protein. Evaluation of optimal heat detection was tried two time at 12 hrs and 24 hrs after the heat. And then, AI service also performed two times with no relation to the results of heat diagnosis by heat detection kit and pregnancy rates were checked with rectal palpation on $60^{th}$ day after AI. Heat diagnostic results by kit in natural heat after 12 hrs in Hanwoo cows were showed 31.3~75.0% on positive in first heat detection and 33.3~100.0% on positve in second heat detection. In the $1^{st}$ positive results were significant different (p<0.05), but $2^{nd}$ positive were not. The results of heat detection showed different result on regional influence and individual cow effects. The pregnancy rates of first trial of heat detection were showed 34.4~78.7% on positive and 21.3~68.8% on negative after the diagnosis by heat detection kit. And the pregnancy rates of next trial of heat detection were showed 33.3~85.7% on positive and 14.3~66.6% on negative after the heat diagnosis. Both positive results of first trial and next trial also were showed significant different (p<0.05), but negative results were not. In positive result, first trial of total pregnancy rates was higher than the next trial of pregnancy, but there showed opposite results on negative results. In conclusion, the optimal heat detection kit is suitable to ordinary Hanwoo cows and it suggested that we have to improve the kit's accuracy by detecting the materials like proteins related optimal AI time.

• Proceedings of the KIEE Conference
• /
• 1995.11a
• /
• pp.569-571
• /
• 1995

This paper compares the simulated annealing and the Hopfield neural network method for an optimal routing in a multistage interconnection network(MIN). The MIN provides a multiple number of paths for ATM cells to avoid cell conflict. Exhaustive search always finds the optimal path, but with heavy computation. Although greedy method sets up a path quickly, the path found need not be optimal. The simulated annealing can find an sub optimal path in time comparable with the greedy method.

• Journal of the Korean Mathematical Society
• /
• v.39 no.5
• /
• pp.745-764
• /
• 2002

In this paper we Study a time-optimal model of pursuit in which the players move on a plane with bounded velocities. This game is supposed to be a nonzero-sum group pursuit game. The main point of the work is to construct and compare cooperative and non-cooperative solutions in the game and make a conclusion about cooperation possibility in differential pursuit games. We consider all possible cooperations of the players in the game. For that purpose for every game $\Gamma(x_0,y_0,z_0)$ we construct the corresponding game in characteristic function form $\Gamma_v(x_0,y_0,z_0)$. We show that in this game there exists the nonempty core for any initial positions of the players. The core can take four various forms depending on initial positions of the players. We study how the core changes when the game is proceeding. For the original agreement (an imputation from the original core) to remain in force at each current instant t it is necessary for the core to be time-consistent. Nonemptiness of the core in any current subgame constructing along a cooperative trajectory and its time-consistency are shown. Finally, we discuss advantages and disadvantages of choosing this or that imputation from the core.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.37 no.1
• /
• pp.96-103
• /
• 2014

A steady-state controllable M/G/1 queueing model operating under the (TN) policy is considered where the (TN) policy is defined as the next busy period will be initiated either after T time units elapsed from the end of the previous busy period if at least one customer arrives at the system during that time period, or the time instant when Nth customer arrives at the system after T time units elapsed without customers' arrivals during that time period. After deriving the necessary system characteristics such as the expected number of customers in the system, the expected length of busy period and so on, the total expected cost function per unit time in the system operation is constructed to determine the optimal operating policy. To do so, the cost elements associated with such system characteristics including the customers' waiting cost in the system and the server's removal and activating cost are defined. Then, the optimal values of the decision variables included in the operating policies are determined by minimizing the total expected cost function per unit time to operate the system under consideration.

• The Journal of the Korea Contents Association
• /
• v.16 no.7
• /
• pp.146-153
• /
• 2016

This work studies the equilibrium behavior of customers and optimal pricing strategies of the sever in a continuous-time M/M/1 queueing system. In this work, we consider two pricing models. The first one is called the ex-ante payment scheme where the server charges a flat price for all services, and the second one is called the ex-post payment scheme where the server charges a price that is proportional to the time a customer spends in the system. In each pricing model, the departing customer receives the reward that is inversely proportional to his/her sojourn time. The server should make the optimal pricing decisions in order to maximize its expected profit per unit time in each payment scheme. This work also investigates customer's equilibrium joining or balking behaviors under server's optimal pricing strategies. Numerical experiments are conducted to help the server best select one between two pricing models.

• Journal of Korean Society on Water Environment
• /
• v.23 no.2
• /
• pp.206-215
• /
• 2007

The objective of this study was to establish the optimal system operating strategies for nitrogen and phosphorus removal through model simulation system built for advanced wastewater treatment targeting on simultaneous temporal/special phase isolation BNR process. The simulation system was built with unit process modules using object modules in GPS-X code. The system was well verified by field experiment data. Simulation study was carried out to investigate performance response to design and operation parameters, i.e. hydraulic retention time (HRT), solids retention time (SRT), and cycle time. The process operated at HRTs of 10~15 hours, longer SRTs, and cycle time of 2 hours showed optimal removal of nitrogen. The HRTs of 10~15 hours, SRTs of 20~25 days, and longer cycle time was optimal for phosphorus removal. Both simulation and field studies showed that optimal operating strategies satisfying both the best nitrogen and phosphorus removals include HRTs ranged 10~15 hours, SRTs ranged 20~25 days, and cycle times of 4~8 hours. The simulation system with modularization of generalized components in BNR processes was, therefore, believed to be a powerful tool for establishing optimal strategies of advanced wastewater treatment.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2003.05a
• /
• pp.283-287
• /
• 2003

In recent years, design of an optimal blank shape is very important for sheet metal forming process in the automobile industry because the raw material cost rate is significant part in the automobile industry. With the design of an optimal blank shape, the engineer can protect a blank from an excessive holding force to improve the quality and reduce the ratio of material scrap. Therefore design of an optimal blank shape is inevitable in sheet metal forming process. However, if it causes a complicated shape of blank, it may be difficult to do the blank layout optimally. In this study, we developed software of optimal blank layout connected with the software of optimal blank shape design which was created in the past by the present authors. And by using these softwares, we would like to present the method in order to get optimal utilization ratio easily and precisely within short time for the sequence of works from design to blank layout.

• Korean Journal of Community Nutrition
• /
• v.21 no.4
• /
• pp.332-343
• /
• 2016

Objectives: Study purpose was to investigate perception on diet, diet problems and related factors among young adult women using focus group interviews (FGI) based on the Social Cognitive Theory (SCT). Methods: Eight groups of FGI were conducted with 47 female undergraduate or graduate students. Guide for FGI included questions regarding perception on optimal diet, diet problems and cognitive, behavioral, and environmental factors of SCT. FGI were video, audio-taped, transcribed and analyzed by themes and sub-themes. Results: Subjects showed irregular eating habits (skipping breakfast, irregular meal time) and selection of unhealthy foods as the main diet problems. Regarding cognitive factors related to optimal diet, subjects mentioned positive outcome expectations (e.g., health promotion, skin health, improvement in eating habits, etc.) and negative outcome expectations (e.g., annoying, hungry, expensive, taste). Factors that promoted optimal diet were mainly received from information from mobile or internet and access to menu or recipes. Factors that prevented optimal diet included influence from friends, lack of time and cooking skills. Behavioral factors for optimal diet included behavioral capability regarding snacks, healthy eating and smart food selection. Subjects mentioned mass media (mobile, internet, TV) as the influential physical environment, and significant others (parents, friends, grandparents) as the influential social environment in optimal diet. For education topics, subjects wanted to learn about healthy meals, basic nutrition, disease and nutrition, and weight control. They wanted to learn those aspects by using mobile or internet, lectures (cooking classes), campaign and events. Conclusions: Study results might be used for planning education regarding optimal diet for young adult women. Education programs need to focus on increasing positive outcome expectations (e.g., health) and behavioral capability for healthy eating and food selection, reducing negative outcome expectations (e.g., cost, taste) and barriers, making supportive environments for optimal diet, and incorporating topics and methods found in this study.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.12
• /
• pp.5015-5022
• /
• 2010

Most of the existing pattern mining techniques are capable of searching patterns according to the continuous change of the spatial information of an object but there is no constraint on the spatial information that must be included in the extracted pattern. Thus, the existing techniques are not applicable to the optimal path search between specific nodes or path prediction considering the nodes that a moving object is required to round during a unit time. In this paper, the precision of the path search according to the spatial hierarchy is analyzed using the Spatial-Temporal Optimal Moving Pattern(with Frequency & Weight) (STOPM(FW)) algorithm which searches for the optimal moving path by considering the most frequent pattern and other weighted factors such as time and cost. The result of analysis shows that the database retrieval time is minimized through the reduction of retrieval range applying with the spatial constraints. Also, the optimal moving pattern is efficiently obtained by considering whether the moving pattern is included in each hierarchical spatial scope of the spatial hierarchy or not.