• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1990년도 하계학술대회 논문집
• /
• pp.539-541
• /
• 1990

Hopfield crossbar assosiative network을 기초로한 개선된 Hopfield neural network을 제안하고, 이 network이 NP-complete 문제에 대한 효과적인 tool임을 보였다. 이 모델을 YLSI routing을 위한 layer assignment 문제에 응용하였고, 결과 이 개선된 Hopfield model이 stability와 accuracy를 향상시킴을 보여 주었다.

• 경영과학
• /
• 제26권3호
• /
• pp.117-131
• /
• 2009

Over the last three decades, there are many researches focusing on the practice and theory of RM in airlines. Most of them have dealt with a seat assignment problem for maximizing the total revenue. In this study, we focus on a seat assignment problem in airlines. The seat assignment problem can be modeled as a stochastic programming model which is difficulty to solve optimally. However, with some assumptions on the demand distribution functions and a linear approximation technique, we can transform the complex stochastic programming model to a Linear Programming model. Some computational experiments are performed to evaluate out model with randomly generated data. They show that our model has a good performance comparing to existing models, and can be considered as a basis for further studies on improving existing seat assignment models.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• pp.587-590
• /
• 1988

In the case of VLSI computer system control unit design using PLA, optimal state code assignment algorithm to minimize the PLA area is proposed. An optimal state code assignment algorithm which considers output state and logic minimization simultaneously is proposed, and by means of this, algorithm product term is minimized. Also, by means of this algorithm running time and memory capacitance is decreased as against heuristic state code assignment algorithm which uses matrix calculation and considers the constraint relation only. This algorithm is implemented on VAX 11/750 (UNIX4.3BSD). Through the various test example applied proposed algorithm, the efficiency of this algorithm is shown.

• Journal of Communications and Networks
• /
• 제9권4호
• /
• pp.402-407
• /
• 2007

The network throughput is an important performance criteria for the packet ring networks. Since maximizing the network throughput can lead to severe bias in bandwidth allocation among all flows, fairness should be imposed to prevent bandwidth starvation. The challenge here, therefore, is the joint optimization of the network throughput and fairness. In this paper, we present the optimal bandwidth assignment scheme to decompose this optimization problem into two tasks, one for finding fair bandwidth assignment and the other for finding the optimal routing. The network throughput is maximized under the fairness constraints when these tasks are performed iteratively.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1997년도 하계학술대회 논문집 B
• /
• pp.431-433
• /
• 1997

In this paper, we consider the robust pole assignment inside the circular region for linear systems with time-varing uncertainty. The considered uncertainties are the norm bounded uncertainty and the matrix polytopes type uncertainty. Since the considered uncertainties are time-varying, it should remind that the closed loop system be time-varing system. Therefore, we should consider not only the pole assignment but also the stability. We present new conditions that guarantee the robust pole assignment and the robust stability. Finally, we show the usefulness of our results by an example.

• 한국컴퓨터정보학회논문지
• /
• 제20권12호
• /
• pp.75-82
• /
• 2015

Generally, the optimal solution of assignment problem can be obtained by Hungarian algorithm of two-sided optimization with time complexity $O(n^4)$. This paper suggests one-sided optimal assignment and swap optimization algorithm with time complexity $O(n^2)$ can be achieve the goal of two-sided optimization. This algorithm selects the minimum cost for each row, and reassigns over-assigned to under-assigned cell. Next, that verifies the existence of swap optimization candidates, and swap optimizes with ${\kappa}-opt({\kappa}=2,3)$. For 27 experimental data, the swap-optimization performs only 22% of data, and 78% of data can be get the two-sided optimal result through one-sided optimal result. Also, that can be improves on the solution of best known solution for partial problems.

• 동력기계공학회지
• /
• 제4권4호
• /
• pp.84-91
• /
• 2000

This paper describes a state feedback controller design method of the integral type magnetic levitation servo system which satisfies the design objectives. The design objective is a $H_{\infty}$ performance, asymptotic disturbance rejection and a robust pole assignment in linear matrix inequality(LMI) region. To the end, we investigated the validity of the designed controller which considering a robust pole assignment region, through results of simulation.

• International Journal of Control, Automation, and Systems
• /
• 제3권1호
• /
• pp.56-69
• /
• 2005

In this paper, it is clearly shown that the two well-known necessary and sufficient conditions mp n as generic static output feedback pole-assignment and mp + d(m+p) n+d as generic minimum d-th order dynamic output feedback pole-assignment on complex field, unbelievably, do not match up each other in strictly proper linear systems. For the analysis, a diagram analysis is newly created (which is defined by the analysis of 'convoluted rectangular/dot diagrams' constructed via node-branch conversion of the signal flow graphs of output feedback gain loops). Under this diagram analysis, it is proved that the minimum d-th order dynamic output feedback compensator for pole-assignment in m-input, p-output, n-th order systems is quantitatively decomposed into static output feedback compensator and its associated d number of arbitrary 1st order dynamic elements in augmented (m+d)-input, (p+d)-output, (n+d)-th order systems. Total configuration of the mismatched data is presented in a Table.

• International Journal of Control, Automation, and Systems
• /
• 제4권5호
• /
• pp.653-659
• /
• 2006

The design of $H_2$-optimal control with regional pole assignment via state feedback in linear time-invariant systems is investigated. The aim is to find a state feedback controller such that the closed-loop system has the desired eigenvalues lying in some desired stable regions and attenuates the disturbance between the output vector and the disturbance vector. Based on a proposed result of parametric eigenstructure assignment via state feedback in linear systems, the considered $H_2$-optimal control problem is changed into a minimization problem with certain constraints, and a simple and effective algorithm is proposed for this considered problem. A numerical example and its simulation results show the simplicity and effectiveness of this proposed algorithm.

• 한국조리학회지
• /
• 제13권4호
• /
• pp.31-44
• /
• 2007

The verified results of this study on the selected study assignments are as follows: Brand awareness of the western-style family restaurants in both study assignment One and Two is examined by showing and comparing the restaurants ranked from first to third. The ranking is based on the survey response rate only. And the familiarity of family restaurants' logos is investigated by statistical techniques such as T-test Anova, Duncan's Multiple Range Test, etc. Firstly, the analytical result of study assignment One shows that the brand awareness of the family restaurants can vary depending on how often customers use the restaurants. Secondly, the analytical result of study assignment Two shows that the familiarity and the preference of the restaurants ranked from first to third are identical each other depending on customers' sex, marital status, and income. Besides, the result shows that the brand awareness shows different rankings depending on customers' age, educational background, and occupation. Thirdly, the analytical result of study assignment Three indicates that the familiarity is different depending on customers' age, educational background, occupation, and annual income.