• Journal of Korean Society for Quality Management
• /
• v.40 no.2
• /
• pp.117-125
• /
• 2012

For the highly reliable products, an accelerated degradation test (ADT) is a useful tool which has been employed in industry to obtain reliability-related information within an affordable amount of time and cost. In an ADT, as all other reliability tests, it is important to carefully design the ADT beforehand to obtain estimates of the quantities of interest as precisely as possible. In this paper, optimal ADTs are developed assuming that the constant-stress loading method is employed and the degradation characteristic follows a Wiener process. Under the constraint that the total cost does not exceed a pre-specified budget, the stress levels, the number of test units allocated to each stress level and the number of measurement (termination time) are determined such that the asymptotic variance of the maximum likelihood estimator of the q-th quantile of the lifetime distribution at the use condition is minimized.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.65-68
• /
• 2000

It is well-known that the decision rule in the mini-mum mean-squares-error decision feedback equalizer(MMSE-DFE) is biased, and therefore suboptimum with respect to error probability. We present a new family of algorithms that solve the bias problem in the adaptive DFE. A novel constraint, called the constant-norm con-straint, is introduced unifying the quadratic constraint and the monic one. A new cost function based on the constant-norm constraint and Lagrange multiplier is defined. Minimizing the cost function gives birth to a new family of unbiased adaptive DFE. The simula-tion results demonstrate that the proposed method in-deed produce unbiased solution in the presence of noise while keeping very simple both in computation and im-plementation.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.35 no.1
• /
• pp.111-124
• /
• 2010

In the last decade, traveling purchaser problem (TPP) has received some attention of the researchers in the operational research area. TPP is a generalization of the well-known traveling salesman problem (TSP), which has many real-world applications such as purchasing the required raw materials for the manufacturing factories and the scheduling of a set of jobs over some machines, and many others. In this paper we suggest heterogeneous multiple traveling purchaser problem with budget constraint (HMTPP-B) which looks for several cycles starting at and ending to the depot and visiting a subset at a minimum traveling cost and such that the demand for each product is satisfied and the cost spent for purchasing the products does not exceed a given budget threshold. All the past studies of TPP are restricted on a single purchaser. Therefore we randomly generated some instances. CPLEX is used for getting optimal solutions in these experiments.

• Journal of the Society of Disaster Information
• /
• v.7 no.2
• /
• pp.161-171
• /
• 2011

This research puts the purpose in elucidating the effect of participation types of leisure activity and leisure restraints on life quality. To achieve research purpose, questionnaire survey was conducted on 200 subjects who are engaged in private guard companies with ages over 20. Using the collected data, frequency analysis was conducted in order to identify demographic characteristics with SPSS/WIN 17.0V program. In addition, multiple regression analysis was conducted for solving research questions. As a result, sports related participation type had a positive effect on time constraint factor. Meanwhile, hobby related participation type had a positive effect on time and cost constraint, participation type of watching has a positive effect on individual and social constraint. Tour and play related participation type had a positive effect on individual constraint factor. Meanwhile participation type of sociality had a positive effect on individual constraint and hobby factor, but had a negative effect on familial and social constraint. Sports related participation type had a positive effect on social relationship factor. Participation type of watching and play related participation type had a negative effect on family relationship. Finally, time constraint factor had a positive effect on family relationship, and cost constraint factor had a positive effect on entire quality of life. Individual and family constraint factors had a negative effect on leisure relationship factor. Also, social constraint factor had a positive effect on family relationship, but had a negative effect on leisure relationship.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.5
• /
• pp.39-47
• /
• 2010

Constraint satisfaction optimization problem is a kind of optimization problem involving cost minimization as well as complex constraints. Local search and constraint programming respectively have been used for solving such problems. In this paper, I propose a method to integrate local search and constraint programming to improve search performance. Basically, local search is used to solve the given problem. However, it is very difficult to find a feasible neighbor satisfying all the constraints when we use only local search. Therefore, I introduced constraint programming as a tool for neighbor generation. Through the experimental results using weighted N-Queens problems, I confirmed that the proposed method can significantly improve search performance.

• International Journal of Reliability and Applications
• /
• v.6 no.1
• /
• pp.31-39
• /
• 2005

An economic life test sampling plan for products with exponential lifetime distribution is developed. To reduce test time, a test plan with curtailed Type II censoring is considered. A cost model is constructed which involves three cost components; test cost, accept cost, and reject cost. Determination of optimal plan minimizing the expected average cost per lot is discussed with a constraint related to consumer's risk. Some numerical examples are provided.

• Journal of Information Technology Applications and Management
• /
• v.23 no.2
• /
• pp.61-80
• /
• 2016

The wireless mesh network (WMN) is a next-generation technology for data networking that has the advantage in cost and the flexibility in its construction because of not requiring the infra-structure such as the ethernet. This paper focuses on the optimal link scheduling problem under the wireless mesh network to effectuate real-time streaming by using the constraint programming. In particular, Under the limitation of half-duplex transmission in wireless nodes, this paper proposes a solution method to minimize the makespan in scheduling packet transmission from wireless nodes to the gateway in a WMN with no packet transmission conflicts due to the half-duplex transmission. It discusses the conflicts in packet transmission and deduces the condition of feasible schedules, which defines the model for the constraint programming. Finally it comparatively shows and discusses the results using two constraint programming solvers, Gecode and the IBM ILOG CP solver.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.4
• /
• pp.301-311
• /
• 2000

For effective part modifications which is necessary in the design process frequently, variational geometric modeling with constraint management being used in a wide. Most variational geometric modeling methods, however, manage just the constraints about sketch elements used for generation of primitives. Thus, not only constraint propagation but also re-build of various modeling operations stored in the modeling history is necessary iota part geometry modifications. Especially, re-build of high-cost Boolean operations is apt to deteriorate overall modeling efficiency abruptly. Therefore, in this paper we proposed an algorithm that can handle all geometric entities of the part directly. For this purpose, we introduced eight type geometric constraints to the various geometric calculations about all geometric entities in sweepings and Boolean operations as well as the existing constraints of the sketch elements. The algorithm has a merit of rapid part geometric modifications through only constraint propagation without rebuild of modeling operations which are necessary in the existing variational geometric modeling method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.37
• /
• pp.251-261
• /
• 1996

Databases are critical to business information systems and RDBMS is most widely used for the database system. Normalization was designed to control various anomalies(insert, update, and delete anomalies). However normalized database design does not account for the tradeoffs necessary for the performance reason. In this research, we model a database design problem without storage constraint. Given a normalized database design, in this model, we do the denormalization of duplicating columns in order in reduce frequent join processes. In this paper, we consider insert, update, delete, and storage cost, and the anomalies are treated by additional disk I/O cost necessary for each insert, update transaction. We propose a branch and bound method, and show considerable cost reduction.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.574-577
• /
• 1995

The proposed method is described for scheduling their output of thermal power units so as to comply with total emission constraint, area emission constraint and the both of those constraints. Also, by using a trade-off curve, representing all dispatch alternatives and conflict between the emission and the fuel cost, the sensitivity analysis of the emission and the fuel cost is applied to this algorithm. By the way, this proposed method is analyzed how dispatch changes as a function of the total environmental cost, and as a function of the relative weighting of individual environmental insults, e.g, NOx and $SO_{2}$. By applying the proposed method to the system, the usefulness of this method is verified.