• 한국정보디스플레이학회:학술대회논문집
• /
• 2008.10a
• /
• pp.1487-1490
• /
• 2008

mSilica developed a scalable integrated circuit solution for driving multiple arrays of LEDs to backlight TFT-LCD panels. The drivers incorporate adaptive power control of the DC-DC power supply powering the LEDs to improve the efficiency while synchronizing PWM dimming with video timing signals VSYNC and HSYNC to reduce motion blur.

• IE interfaces
• /
• v.13 no.2
• /
• pp.204-210
• /
• 2000

This paper deals with the problem of mixed-model sequencing on an assembly line. In this sequencing problem we want to minimize the risk of the conveyor stoppage and the total utility work. This paper applies genetic algorithm to solve the mixed-model sequencing problem which is formulated as an integer programming. The solution we get from this algorithm is compared with the solution of Tsai(1995)'s.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.3
• /
• pp.358-367
• /
• 2003

We consider discrete-time factorial Markov Decision Processes (MDPs) in multiple decision-makers environment for infinite horizon average reward criterion with a general joint reward structure but a factorial joint state transition structure. We introduce the "localization" concept that a global MDP is localized for each agent such that each agent needs to consider a local MDP defined only with its own state and action spaces. Based on that, we present a gradient-ascent like iterative distributed algorithm that converges to a local optimal solution of the global MDP. The solution is an autonomous joint policy in that each agent's decision is based on only its local state.cal state.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.11a
• /
• pp.81-84
• /
• 2003

The ability to determine the optimal frequencies and offsets for independent and unrestricted ordering cycles for multiple items can be very valuable for managing storage capacity constrained facilities in a supply chain. The complexity of this problem has resulted in researchers focusing on more tractable surrogate problems that are special cases of the base problem. Murthy et al. (European Journal of Operation Research 2003) developed insights leading to solution of the original problem and present a heuristic for offsetting independent and unrestricted ordering cycles for items to minimize their joint storage requirements. However, their study cannot find optimal solution due to the Greedy Heuristic solution procedure. In this paper, we present a complete procedure to find the optimal solution for the model with a integer programming optimization approach and genetic algorithm. Numerical examples are included to compare each model with that of Murthy et at. Research of this type may prove useful in solving the more general problem of selecting order policies to minimize combined holding, ordering, and storage costs.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.1
• /
• pp.75-94
• /
• 2005

Research in the decision sciences has continued to develop a variety of mathematical models as well as software tools supporting corporate decision-making. Yet. in spite of their potential usefulness, the models are little used in real-world decision making since the model solution processes are too complex for ordinary users to get accustomed. This paper proposes an intelligent and flexible model-solver integration framework that enables the user to solve decision problems using multiple models and solvers without having precise knowledge of the model-solution processes. Specifically, for intuitive model-solution, the framework enables a decision support system to suggest the compatible solvers of a model autonomously without direct user intervention and to solve the model by matching the model and solver parameters intelligently without any serious conflicts. Thus, the framework would improve the productivity of institutional model solving tasks by relieving the user from the burden of leaning model and solver semantics requiring considerable time and efforts.

• Journal of Magnetics
• /
• v.16 no.4
• /
• pp.444-448
• /
• 2011

In the present study, we separated the marker particles from the suspending particle mixture solution using isotacho-electrophoresis technique, a novel quantitative ionic particle separation method, in the microchannel. A multiple stacking zone of the suspending particle was visualized with variations in electric field strength, pH value and concentration of the ionic solution. In particular, the electrophoretic mobility of ionic particle (fluorescein) was estimated based on the electrophoretic velocity value measured by the particle image velocimetry. As a result, isotacho-electrophoresis zones were clearly visualized as going downstream in the electric field. The particle migration velocity increased proportional to the applied voltage increase; it was also affected by the pH value variations in the ionic solution.

• Journal of Korean Institute of Industrial Engineers
• /
• v.38 no.1
• /
• pp.25-30
• /
• 2012

Desirability approaches have been proposed to find an optimum of multiple response problem. The existing desirability approaches use either of mean or min of individual desirability in aggregation of multiple responses. However, in order to find an optimum having high mean and low dispersion among individual desirability, the dispersion needs to be simultaneously considered with its mean. This study proposes bias and variance (BV) method which aggregates bias (ideal target-mean) and variance of individual desirability in multiple response optimization. The proposed BV method was applied to an example to evaluate its usefulness by comparing with existing methods. Evaluation results showed that the solution of BV method was a fairly good compared with DS (Derringer and Suich, 1980) and KL (Kim and Lin, 2000) methods. The BV method can be utilized to multiple response surface problems when decision makers want to find an optimum having high mean and low variance among responses.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.3054-3067
• /
• 2015

The phenomena of higher channel cross polarization discrimination (XPD) is mainly observed for future wireless technologies such as small cell network and massive multiple-input multiple-output (MIMO) system. Therefore, utilization of high XPD is very important and space-polarization division multiple access (SPDMA) with dual-polarized MIMO system could be a suitable solution to high-speed transmission in high XPD environment as well as reduction of array size at base station (BS). By SPDMA with dual-polarized MIMO system, two parallel data signals can be transmitted by both vertically and horizontally polarized antennas to serve different mobile stations (MSs) simultaneously compare to conventional space division multiple access (SDMA) with single-polarized MIMO system. This paper analyzes the performance of SPDMA for maximum ratio transmission (MRT) in time division duplexing (TDD) system by proposed dual-polarized MIMO spatial channel model (SCM) compare to conventional SDMA. Simulation results indicate that how SPDMA utilizes the high XPD as the number of MS increases and SPDMA performs very close to conventional SDMA for same number of antenna elements but half size of the array at BS.

• Computational Structural Engineering
• /
• v.9 no.3
• /
• pp.179-186
• /
• 1996

A simple nonlinear programming(NLP) formulation for the optimal topology problem of structures is developed and examined. The NLP formulation is general, and can handle arbitrary objective functions and arbitrary stress, displacement constraints under multiple loading conditions. The formulation is based on simultaneous analysis and design approach to avoid stiffness matrix singularity resulting from zero sizing variables. By embedding the equilibrium equations as equality constraints in the nonlinear programming problem, we avoid constructing and factoring a system stiffness matrix, and hence avoid its singularity. The examples demonstrate that the formulation is effective for finding an optimal solution, and shown to be robust under a variety of constraints.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.2
• /
• pp.57-63
• /
• 2012

Software release planning model of software product lines was formulated as a precedence-constrained multiple 0-1 knapsack problem. The purpose of the model was to maximize the total profit of an entire set of selected features in a software product line over a multi-release planning horizon. The solution approach is a dynamic programming procedure. Feasible solutions at each stage in dynamic programming are determined by using backward dynamic programming approach while dynamic programming for multi-release planning is forward approach. The pre-processing procedure with a heuristic and reduction algorithm was applied to the single-release problems corresponding to each stage in multi-release dynamic programming in order to reduce the problem size. The heuristic algorithm is used to find a lower bound to the problem. The reduction method makes use of the lower bound to fix a number of variables at either 0 or 1. Then the reduced problem can be solved easily by the dynamic programming approaches. These procedures keep on going until release t = T. A numerical example was developed to show how well the solution procedures in this research works on it. Future work in this area could include the development of a heuristic to obtain lower bounds closer to the optimal solution to the model in this article, as well as computational test of the heuristic algorithm and the exact solution approach developed in this paper. Also, more constraints reflecting the characteristics of software product lines may be added to the model. For instance, other resources such as multiple teams, each developing one product or a platform in a software product line could be added to the model.