• Industrial Engineering and Management Systems
• /
• v.3 no.2
• /
• pp.100-115
• /
• 2004

The network representation and branch and bound algorithm with efficient lower and upper bounding procedures are developed to determine a global optimal production schedule on a machine that minimizes sequence-dependent setup cost and earliness/tardiness penalties. Lower bounds are obtained based on heuristic and Lagrangian relaxation. Priority dispatching rule with local improvement procedure is used to derive an initial upper bound. Two dominance criteria are incorporated in a branch and bound procedure to reduce the search space and enhance computational efficiency. The computational results indicate that the proposed procedure could optimally solve the problem with up to 40 jobs in a reasonable time using a personal computer.

• Bulletin of the Korean Mathematical Society
• /
• v.22 no.2
• /
• pp.117-119
• /
• 1985

Let R be a commutative noetherian ring with 1.neq.0, denoting by .nu.(I) the cardinality of a minimal basis of the ideal I. Let A be a polynomial ring in n>0 variables with coefficients in R, and let M be a maximal ideal of A. Generally it is shown that .nu.(M $A_{M}$).leq..nu.(M).leq..nu.(M $A_{M}$)+1. It is well known that the lower bound is not always satisfied, and the most classical examples occur in nonfactional Dedekind domains. But in many cases, (e.g., A is a polynomial ring whose coefficient ring is a field) the lower bound is attained. In [2] and [3], the conditions when the lower bound is satisfied is investigated. Especially in [3], it is shown that .nu.(M)=.nu.(M $A_{M}$) if M.cap.R=p is a maximal ideal or $A_{M}$ (equivalently $R_{p}$) is not regular or n>1. Hence the problem of determining whether .nu.(M)=.nu.(M $A_{M}$) can be studied when p is not maximal, $A_{M}$ is regular and n=1. The purpose of this note is to provide some conditions in which the lower bound is satisfied, when n=1 and R is a regular local ring (hence $A_{M}$ is regular)./ is regular).

• Electrical & Electronic Materials
• /
• v.10 no.4
• /
• pp.349-354
• /
• 1997

This paper aims at studying the improvement of test method for t-weight sensitive fault (t-wsf) detect. The development of RAM fabrication technology results in not only the increase at device density on chips but also the decrease in line widths in VLSI. But, the chip size that was large and complex is shortened and simplified while the cost of chips remains at the present level, in many cases, even lowering. First of all, The testing patterns for RAM fault detect, which is apt to be complicated , need to be simplified. This new testing method made use of Local Lower Bound (L.L.B) which has the memory with the beginning pattern of 0(l) and the finishing pattern of 0(1). The proposed testing patterns can detect all of RAM faults which contain stuck-at faults, coupling faults. The number of operation is 6N at 1-weight sensitive fault, 9,5N at 2-weight sensitive fault, 7N at 3-weight sensitive fault, and 3N at 4-weight sensitive fault. This test techniques can reduce the number of test pattern in memory cells, saving much more time in test, This testing patterns can detect all static weight sensitive faults and pattern sensitive faults in RAM.

• Journal of Korea Multimedia Society
• /
• v.23 no.7
• /
• pp.883-890
• /
• 2020

In this paper, we propose a variational expectation-maximization algorithm that computes posterior probabilities from Latent Dirichlet Allocation (LDA) model. The algorithm approximates the intractable posterior distribution of a document term matrix generated from a corpus made up by 50 papers. It approximates the posterior by searching the local optima using lower bound of the true posterior distribution. Moreover, it maximizes the lower bound of the log-likelihood of the true posterior by minimizing the relative entropy of the prior and the posterior distribution known as KL-Divergence. The experimental results indicate that documents clustered to image classification and segmentation are correlated at 0.79 while those clustered to object detection and image segmentation are highly correlated at 0.96. The proposed variational inference algorithm performs efficiently and faster than Gibbs sampling at a computational time of 0.029s.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.6
• /
• pp.791-798
• /
• 2004

Fatigue crack initiation lives of round cylindrical notch specimen were investigated. Firstly, local strain approximation methods, such as the modified incremental Neuber's rule and the modified incremental Glinka's equivalent strain energy density(ESED) rule, were used to get multiaxial stress and strain state components at the notch tip. Based on the history of local stress and strain, multiaxial fatigue models were used to obtain fatigue crack initiation lives. Because the solution of Neuber's rule and Glinka's ESED rule make the upper and lower bound of local strain approximations, fatigue crack initiation lives are expected to place between life predictions by two local strain approximations. Experimental data were compared with the fatigue crack initiation life prediction results.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.2
• /
• pp.157-167
• /
• 2005

This paper presents a new perturbation technique for developing efficient iterated local search procedures for the asymmetric traveling salesman problem(ATSP). This perturbation technique uses global information on ATSP instances to speed-up computation and to improve the quality of the tours found by heuristic method. The main idea is to escape from a local optima by introducing perturbations on the out-of-kilter arcs in the problem instance. For a local search heuristic, we use the Kwon which finds optimum or near-optimum solutions by applying the out-of-kilter algorithm to the ATSP. The performance of our algorithm has been tested and compared with known method perturbing on randomly chosen arcs. A number of experiments has been executed both on the well-known TSPLIB instances for which the optimal tour length is known, and on randomly generated Instances. for 27 TSPLIB instances, the presented algorithm has found optimal tours on all instances. And it has effectively found tours near AP lower bound on randomly generated instances.

• Korean Journal of Food Science and Technology
• /
• v.16 no.4
• /
• pp.375-382
• /
• 1984

The fatty acid compositions of lipids from five local varieties and three imported varieties of soybean were determined. Total and free lipids of the samples were extracted with chloroform-methanol mixture (2:1, v/v) and ethyl ether, respectively. The ether-extracted samples were extracted again with water saturated n-butanol to obtain bound lipids. The average percent contents of the lipid fractions were 21% (total), 18% (free), and 3.3% (bound). The results indicated that seven fatty acids (10:0, 12:0, 14:0, 16:0, 17:0, 20:0 and 22:0) were identified as minor fatty acids for all the varieties examined in this study. The relative contents of 18:2 were the highest (50.1-59.7%) in all the lipid fractions, and the contents in total and free lipids were in-fluenced by the local varieties. Little difference in fatty acid composition was noted between the total and free lipids of the samples. Total and free lipids contained more 18:1 (about 10%) and less 16:0 (about 40%) and 14:0 (about 34%) than did the bound lipids. The relative percent contents of 18:3 in the total, free and bound lipids were on average 8.9, 9.0, and 7.3 percents. The content in the total lipids of Gwanggyo varieties showed the highest level (11.1%), and in the bound lipids of Eundaedoo varieties the lowest (6.0%). In case of the total and free lipids, those varieties which showed higher relative contents of 18:1 generally had lower relative contents of 18:2 and 18:3.

• Journal of Digital Contents Society
• /
• v.10 no.2
• /
• pp.279-289
• /
• 2009

As the TCP is the protocol designed for the wired network that packet loss probability is very low, because TCP transmitter takes it for granted that the packet loss by the wireless network characteristics is occurred by the network congestion and lowers the transmitter's transmission rate, the performance is degraded. In this article, we suggest the newly improved algorithm using two parameters, the local retransmission time value and the local retransmission critical value to the BS based on the Snoop. This technique adjusts the base stations local retransmission timer effectively according to the wireless link status to recover the wireless packet loss rapidly. We checked that as a result of the suggested algorithm through various simulations, A-Snoop protocol improve more the wireless TCP transmission rate by recovering the packet loss effectively in the wireless link that the continuous packet loss occur than the Snoop protocol.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2014.10a
• /
• pp.91-93
• /
• 2014

Philippine fisheries code of 1998 (Republic Act 8550), which is enacted to achieve food security by managing, conserving and protecting fishery resources, obliges local governments to designate no less than 15% of jurisdictional municipal water as fisheries resource protection zone. Accordingly, Marine Protected Areas (MPAs) are the most extensively established as fisheries management and conservation tool and over 1,500 MPAs are reported in the Philippines. But there has been debate on the pros and cons of implementing MPAs because of the positive and negative impacts on local communities and fishermen. A dichotomous-choice contingent-valuation survey was conducted in the two municipalities of Guimaras, Philippines to investigate public opinion in debates over MPAs and to estimate willingness to pay (WTP) for MPAs to protect and conserve marine habitats for fishery resources. For the benefits and costs of MPAs, 43.6% of respondents thought the costs would be larger than the benefit, but 91% respondents voted in favor of increasing MPAs for fisheries resources as a protective measure. Finally, the estimated Turnbull lower-bound mean WTP (36.75ha) was php 493.6(US$ 11.3) per household to establish the additional MPA (36.75ha) in their municipality waters.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.4
• /
• pp.1-10
• /
• 2002

The ring routing and wavelength assignment problem arose in the planning of optical communication networks which use WDM rings. Traffic demands are given for each pair of nodes in an ring : each demand must be routed one of the two possible connections round the ring and the wavelength assignments must be made so that there are no conflicts : that is. no two connections whose routes share a link can be assigned the same wavelength along that link. The objective is to minimize the number of used wavelengths. We propose the local optimal routing for the problem and show that there always exists an optimal solution satisfying it. Furthermore we suggest a new lower bound for the problem and show that it is very efficient for the worst case example.