• Journal of the Korea Safety Management & Science
• /
• v.11 no.4
• /
• pp.213-220
• /
• 2009

The minimum latency problem, also known as the traveling repairman problem and the deliveryman problem is to minimize the overall waiting times of customers, not to minimize their routing times. In this research, a genetic algorithm, a clonal selection algorithm and a population management genetic algorithm are introduced. The computational experiment shows the objective value of the clonal selection algorithm is the best among the three algorithms and the calculating time of the population management genetic algorithm is the best among the three algorithms.

• The Journal of Information Technology
• /
• v.4 no.1
• /
• pp.71-79
• /
• 2001

This paper presents an adaptive back propagation algorithm that update the learning parameter by the generated error, adaptively and configuration of the range for the initial connecting weight according to the different maximum target value from minimum target value. This algorithm is expected to escaping from the local minimum and make the best environment for the convergence. On the simulation tested this algorithm on three learning pattern. The first was 3-parity problem learning, the second was $7{\times}5$ dot alphabetic font learning and the third was handwritten primitive strokes learning. In three examples, the probability of becoming trapped in local minimum was reduce. Furthermore, in the alphabetic font and handwritten primitive strokes learning, the neural network enhanced to loaming efficient about 27%~57.2% for the standard back propagation(SBP).

• Journal of the Korean Society of Food Science and Nutrition
• /
• v.28 no.4
• /
• pp.810-815
• /
• 1999

The pectinase treatment conditions for clarification of persimmon vinegar were optimized and monitored by response surface methodology. In clarification of persimmon vinegar by pectinase treatment with variations in temperature, time and concentration, coefficients of determinations(R2) of the models were above 0.91(p<0.05) in turbidity, browning color intensity and tannin content. The turbidity of persimmon vinegar was decreased along with an increase of pectinase treatment temperature. The minimum value of turbidity by pectinase treatment was 0.0021(absorbance at 660nm) in 49.38oC of pectinase treatment temperature, 73.08min of pectinase treatment time and 55.57ppm of pectinase concentration. The minimum value of browning color intensity by pectinase treatment was 0.27(absorbance at 660nm) in 48.39oC, 71.74min and 65.69ppm. The minimum value of total tannin contents by pectinase treatment was 43.72mg/100 ml in 40.05oC, 66.02min and 65.26ppm. The optimum conditions of pectinase treatment that satisfies the least common multiple of turbidity, browning color and tannin content were 40~50oC, 60~70min and 55~70ppm.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.49 no.6
• /
• pp.93-101
• /
• 2007

In general, geotechnical properties have many uncertain aspects, thus probabilistic analysis have been used to consider these aspects. It is, however, quite difficult to select an appropriate target probability for a certain structure or construction process. In this study, minimum expected cost design method based on probabilistic analysis is suggested for design of vertical drains generally used to accelerate consolidation in soft clayey soils. A sensitivity analysis is performed to select the most important uncertain parameters for the design of vertical drains. Monte Carlo simulation is used in sensitivity analysis and probabilistic analysis. Total expected cost, defined as the sum of initial cost and expected additive cost, varies widely with variation of input parameters used in design of vertical drain systems. And probability of failure to get the minimum total expected cost varies under the different design conditions. A minimum value of total expected cost is suggested as a design value in this study. The proposed design concept is applicable to unit construction process because this approach is to consider the uncertainties using probabilistic analysis and uncertainties of geotechnical properties.

• Journal of Korean Critical Care Nursing
• /
• v.12 no.1
• /
• pp.46-56
• /
• 2019

Purpose : The purpose of this study was to identify minimum data sets for oral mucous integrity-related documentation and to analyze nursing records for oral care. Methods: To identify minimum data sets for oral status, the authors reviewed 26 assessment tools and a practical guideline for oral care. The content validity of the minimum data sets was assessed by three nurse specialists. To map the minimum data sets to nursing records, the authors examined 107 nursing records derived from 44 patients who received chemotherapy or hematopoietic stem cell transplantation in one tertiary hospital. Results: The minimum data sets were 10 elements such as location, mucositis grade, pain, hygiene, dysphagia, exudate, inflammation, difficulty speaking, and moisture. Inflammation contained two value sets: type and color. Mucositis grade, pain, dysphagia and inflammation were recorded well, accounting for a complete mapping rate of 100%. Hygiene (100%) was incompletely mapped, and there were no records for exudate (83.2%), difficulty speaking (99.1%), or moisture (88.8%). Conclusion: This study found that nursing records on oral mucous integrity were not sufficient and could be improved by adopting minimum data sets as identified in this study.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.143-152
• /
• 2013

Given weighted graph G=(V,E), n=|V|, m=|E|, the minimum cut problem is classified with source s and sink t or without s and t. Given undirected weighted graph without s and t, Stoer-Wagner algorithm is most popular. This algorithm fixes arbitrary vertex, and arranges maximum adjacency (MA)-ordering. In the last, the sum of weights of the incident edges for last ordered vertex is computed by cut value, and the last 2 vertices are merged. Therefore, this algorithm runs $\frac{n(n-1)}{2}$ times. Given graph with s and t, Ford-Fulkerson algorithm determines the bottleneck edges in the arbitrary augmenting path from s to t. If the augmenting path is no more exist, we determine the minimum cut value by combine the all of the bottleneck edges. This paper suggests minimum cut algorithm for undirected weighted graph with s and t. This algorithm suggests MA-merging and computes cut value simultaneously. This algorithm runs n-1 times and successfully divides V into disjoint S and V sets on the basis of minimum cut, but the Stoer-Wagner is fails sometimes. The proposed algorithm runs more than Ford-Fulkerson algorithm, but finds the minimum cut value within n-1 processing times.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.69-72
• /
• 1996

This paper considers a global resolution of kinematic redundancy under inequality constraints as a constrained optimal control. In this formulation, joint limits and obstacles are regarded as state variable inequality constraints, and joint velocity limits as control variable inequality constraints. Necessary and sufficient conditions are derived by using Pontryagin's minimum principle and penalty function method. These conditions leads to a two-point boundary-value problem (TPBVP) with natural, periodic and inequality boundary conditions. In order to solve the TPBVP and to find a global minimum, a numerical algorithm, named two-stage algorithm, is presented. Given initial joint pose, the first stage finds the optimal joint trajectory and its corresponding minimum performance cost. The second stage searches for the optimal initial joint pose with globally minimum cost in the self-motion manifold. The effectiveness of the proposed algorithm is demonstrated through a simulation with a 3-dof planar redundant manipulator.

• Communications for Statistical Applications and Methods
• /
• v.20 no.4
• /
• pp.311-319
• /
• 2013

Cooray and Ananda (2005) proposed a composite lognormal-Pareto model to analyze loss payment data in the actuarial and insurance industries. Their model is based on a lognormal density up to an unknown threshold value and a two-parameter Pareto density. In this paper, we implement the minimum density power divergence estimation for the composite lognormal-Pareto density. We compare the performances of the minimum density power divergence estimator (MDPDE) and the maximum likelihood estimator (MLE) by simulations and an example. The minimum density power divergence estimator performs reasonably well against various violations in the distribution. The minimum density power divergence estimator better fits small observations and better resists against extraordinary large observations than the maximum likelihood estimator.

• International Journal of Air-Conditioning and Refrigeration
• /
• v.14 no.3
• /
• pp.94-101
• /
• 2006

A theoretical investigation to find thermodynamically optimum design conditions of conduction-cooled Peltier current leads is performed. A Peltier current lead (PCL) is composed of a thermoelectric element (TE), a metallic lead and a high temperature superconductor (HTS) lead in the order of decreasing temperature. Mathematical expressions for the minimum heat flow per unit current crossing the TE-metal interface and the minimum heat flow per unit current from the metal lead to the joint of the metal and the HTS leads are obtained. It is shown that the temperature at the TE -metal interface possesses a unique optimal value that minimizes the heat flow to the joint and that this optimal value depends on the material properties of the TE and the metallic lead but not the joint temperature nor electric current. It is also shown that there exists a unique optimal value for the joint temperature between the metal and the HTS leads that minimizes the sum of the power dissipated by ohmic heating in the current leads and the refrigerator power consumed to cool the lead, for a given length of the HTS.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.366-366
• /
• 2002

Cloud-to ground lightning and total precipitation over Korean peninsula during the summer monsoon season are studied extensively with a special emphasis on the characteristics of convective precipitation. Ten years (1988-1997) lightning and rainfall data and a temporal and spatial scale of one month and 10$^2$ km$^2$ respectively are used to calculate the monthly number of CG lightning flash count. Monsoonal convective activity is higher over the west coast with maxima at two different regions, one in the northern part which increases nortwestward and the other is at the middle west coast of Korea increasing towards the west coast. East coast represents the minimum value of monsoonal convective activity. In the east coast of Korean peninsula, particularly in the region east of Tae-back mountain, the value of Rain yield, (which is defined as the ratio of total precipitation to CG flash count over a common area), is maximum with an average value of 3$\times$10$^{8}$ kg fl$^{-1}$, while the minimum value of rain yield is occurred in the west of Tae-back mountain, with an average value of 0.8$\times$10$^{8}$ kg fl$^{-1}$. Results show in the west coast stations, nearly 82% of the total rainfall is convective in nature, at the middle of the peninsula 53% of the total rain is convective while in the east coast stations 46% contribution from the convective rain is seen. Kanghwa receives the maximum convective rain while at Ulsan the convective rain is minimum. Correlation coefficient between the total precipitation and CG lightning during the summer monsoon season is 0.54.