• Journal of the korean Society of Automotive Engineers
• /
• v.15 no.1
• /
• pp.81-88
• /
• 1993

A direct treatment of the min-max type objective function of the dynamic response optimization problem is proposed. Previously, the min-max type objective function was transformed to an artificial design variable and an additional point-wise state variable constraint function was imposed, which increased the complexity of the optimization problem. Especially, the design sensitivity analysis for the augmented Lagrangian functional with the suggested treatment is established by using the adjoint variable method and a computer program to implement the proposed algorithm is developed. The optimization result of the proposed treatment are obtained for three typical problems and compared with those of the previous treatment. It is concluded that the suggested treatment in much more efficient in the computational effort than the previous treatment with giving the similar optimal solutions.

• Water for future
• /
• v.19 no.4
• /
• pp.339-346
• /
• 1986

A real-time single reservoir operation model using the Min-max Dynamic Programming for the flood control of Soyanggang Dam and Choongju Dam is developed. The objective function is to minimize the maximum release from each dam and the constraints are those from ther reservoir and channel characteristics. Control and utilization efficiencies are used to measure the performance of the reservoir operation method (ROM). In comparison with those of simulation models(such as the Rigid ROM, the Technical ROM and the Linear Decision Rule), the efficiencies of the optimization model are superior for all return periods.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.7
• /
• pp.13-23
• /
• 2011

Grid computing is a new generation computing technology which organizes virtual high-performance computing system by connecting and sharing geographically distributed heterogeneous resources, and performing large-scaled computing operations. In order to maximize the performance of grid computing, job scheduling is essential which allocates jobs to resources effectively. Many studies have been performed which minimize total completion times, etc. However, resource costs are also important, and through the minimization of resource costs, the overall performance of grid computing and economic efficiency will be improved. So in this paper, we propose a multi-objective job scheduling model considering both time and cost. This model derives from the optimal scheduling solution using NSGA-II, which is a multi objective genetic algorithm, and guarantees the effectiveness of the proposed model by executing experiments with those of existing scheduling models such as Min-Min and Max-Min models. Through experiments, we prove that the proposed scheduling model minimizes time and cost more efficiently than existing scheduling models.

• ETRI Journal
• /
• v.36 no.3
• /
• pp.385-395
• /
• 2014

In this paper, we consider a resource allocation scheme for millimeter wave-based wireless personal area networks using directional antennas. This scheme involves scheduling the reservation period of medium access control for IEEE 802.15.3c. Objective functions are considered to minimize the average delay and maximize throughput; and two scheduling algorithms-namely, MInMax concurrent transmission and MAxMin concurrent transmission-are proposed to provide a suboptimal solution to each objective function. These are based on an exclusive region and two decision rules that determine the length of reservation times and the transmission order of groups. Each group consists of flows that are concurrently transmittable via spatial reuse. The algorithms appropriately apply two decision rules according to their objectives. A real video trace is used for the numerical results, which show that the proposed algorithms satisfy their objectives. They outperform other schemes on a range of measures, showing the effect of using a directional antenna. The proposed scheme efficiently supports variable bit rate traffic during the reservation period, reducing resource waste.

• Journal of Oral Medicine and Pain
• /
• v.25 no.4
• /
• pp.345-353
• /
• 2000

This study was to investigate normal salivary flow rates and normal indices of Quantitative analysis of salivary scintigraphy. 96 adult volunteers were studied by Questionnaire evaluating salivary conditions and clinical examinations. 35(male 23, female 12, age range 23-31years) that absented subjective and objective symptoms related saliva were classified as normal group. The normal group underwent measurement unstimulated and stimulated salivary flow rates and salivary scintigraphy. The obtained results were as follows: 1. There were not significant in sex differences of unstimulated and stimulated salivary flow rates. The unstimulated salivary flow rate was $0.66{\pm}0.41g/min$, stimulated salivary flow rates was $1.61{\pm}0.69g/min$. 2. As comparing of parameters of salivary scintigraphy, the Uptake ratio(UR), $T_{max}$, $T_{min}$, Maximum accumulation (MA), Maximum secretion(MS) of parotid and submandibular glands were not significant in sex and side-ralated differences. 3. The UR, $T_{max}$, MA, MS of parotid gland were significantly higher than those of submandibular gland; in the parotid gland, UR, $3.67{\pm}0.88$, $T_{max}$, $18.77{\pm}0.43min$, MA, $41.35{\pm}9.22%$, MS, $43.13{\pm}9.13%$; in the submandibular gland, UR, $3.04{\pm}0.10$, $T_{max}$, $18.48{\pm}0.52min$, MA, $36.47{\pm}14.18%$, MS, $36.88{\pm}12.20%$. 4. As classifying of time-activity curve, the most of parotid gland was N-type(97.1%), submandibular gland was observed in order of M-type(67.1%), N-type(21.4%), F-type(11.4%), however, was not observed S-type. 5. As the type of time-activity curve of submandibular gland was more flattened, the UR, $T_{max}$, MA, MS were significantly decresed.

• Korean Management Science Review
• /
• v.26 no.1
• /
• pp.65-76
• /
• 2009

The undirected Steiner tree problem in graphs is known to be NP-hard. The objective of this problem is to find a shortest tree containing a subset of nodes, called terminal nodes. This paper proposes a method based on a two-step procedure to solve this problem efficiently. In the first step. graph reduction rules eliminate useless nodes and edges which do not contribute to make an optimal solution. In the second step, a max-min ant colony optimization combined with Prim's algorithm is developed to solve the reduced problem. The proposed algorithm is tested in the sets of standard test problems. The results show that the algorithm efficiently presents very correct solutions to the benchmark problems.

• The Journal of Korean Medicine
• /
• v.37 no.2
• /
• pp.1-11
• /
• 2016

Objectives: The objective of this study was to elucidate the effect of Jaeumkanghwatang (JEKHT) on the plasma concentration and pharmacokinetics of tamoxifen in combination therapy as a process of the comprehensive and integrative medicine against breast cancer. Methods: After 50 mg/kg of tamoxifen treatment, JEKHT 100 mg/kg was orally administered within 5 min. The plasma were collected at 30 min before administration, 30min, 1, 2, 3, 4, 6, 8 and 24 hrs after end of JEKHT treatment, and plasma concentrations of tamoxifen were analyzed using LC-MS/MS methods. PK parameters of tamoxifen ($T_{max}$, $C_{max}$, AUC, $t_{1/2}$ and $MRT_{inf}$) were analysis as compared with tamoxifen single administered rats. Results: JEKHT did not influenced on the plasma concentrations and pharmacokinetics of tamoxifen after single oral co-administration, within 5min except for some negligible effects on plasma concentration. The $T_{max}$, $C_{max}$, AUC, $t_{1/2}$ and $MRT_{inf}$ of tamoxifen in co-administered rats were quite similar to those of tamoxifen single treated rats. Conclusions: Based on the results of the present study, JEKHT did not influenced on the oral bioavailability of tamoxifen, when they were single co-administered within 5min. However, more detail pharmacokinetic studies should be tested to conclude the possibilities that can be used as comprehensive and integrative therapy with JEKHT and tamoxifen for breast cancers, when they were co-administered, like the effects on the pretreatment of JEKHT and after repeat co-administrations.

• Journal of the Korean Society of Safety
• /
• v.18 no.1
• /
• pp.94-100
• /
• 2003

Generally, cable-stayed bridges are both statically indeterminate structure with a high degree of redundancy and flexible structure. So it is very important to ensure precision control during both fabrication and construction. In precision control of cable-stayed bridges, precision control under multi-objective programming method is needed, because precision control problem of cable-stayed bridges is a multi-objective programming problem in which many objective functions are regard as variables. In previous studies, it was regarded as a single-objective problem, so it had many problems in respect of usefulness and rationalness. In this study, precision control under multi-objective programming method is proposed considering economy, efficiency, and safety at best in precision control of cable-stayed bridges. Precision control problem of cable-stayed bridges is formulated with satisfying trade-off method which is a kind of multi-objective programming method, then it is optimized with min-max method. A computer program is presented including above process.

• Journal of Oriental Neuropsychiatry
• /
• v.30 no.2
• /
• pp.59-69
• /
• 2019

Objectives: Case report is a description of medical experience that contains a patient's information and treatments. It has been used to determine the effectiveness and side effect of the treatments. Case report can be used for medical, scientific, or educational purposes. The objective of this study was to evaluate the quality of case reports published in Journal of Oriental Neuropsychiatry from 2013 to 2017 using CARE and CARES guideline. Methods: Case reports were selected from Journal of Oriental Neuropsychiatry and their quality assessed using CARE guideline and CARES guideline. The items of CARE and CARES guideline were assessed as 'Sufficient', 'Not sufficient', 'Not reported', 'Not applicable'. The outcome was analyzed using case reports and items. Results: 26 case reports were selected. For CARE guideline, 'Sufficient' percentage was min at 22.2%, max at 46.4% with a median of 39.3%. Sum of 'Sufficient', 'Not sufficient' percentage was min at 59.3%, max at 85.7% with a median of 75.0%. Items 'Timeline', 'Diagnostic assessment', 'Follow up and outcomes', 'Informed consent' were not reported in more than 50% of all case reports. Items 'Keywords', 'Abstract', 'Introduction', 'patient information', 'Diagnostic assessment', 'Therapeutic interventions', 'Follow up and outcomes' were not sufficiently reported in more than 50% of all case reports. For CARES guideline, 'Sufficient' percentage was min at 0%, max at 50% with a median of 0%. Sum of 'Sufficient', 'Not sufficient' percentage was min at 33.3%, max at 100% with a median of 92.9%. Items of herbal prescription 'herb', 'decoction', 'use', items of acupuncture treatment 'materials', 'techniques', items of moxibustion treatment 'materials', 'techniques' were not sufficiently reported in more than 50% of all case reports. Conclusions: The reporting rate of items was good. But the quality of reporting was low. Also, particular items were not reported frequently. Therefore, there is a need to improve the quality of case reports in Journal of Oriental Neuropsychiatry.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.15 no.1
• /
• pp.60-71
• /
• 2015

In this paper, a matrix game is considered in which the elements are represented as Z-numbers. The objective is to formalize the human capability for solving decision-making problems in uncertain situations. A ranking method of Z-numbers is proposed and used to define pure and mixed strategies. These strategies are then applied to find the optimal solution to the game problem with an induced pay off matrix using a min max, max min algorithm and the multi-section technique. Numerical examples are given in support of the proposed method.