• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1996년도 추계학술대회발표논문집; 고려대학교, 서울; 26 Oct. 1996
• /
• pp.285-288
• /
• 1996

Generally MPS, standardized by IBM, is the input type of large scale linear programming problems, and there may be unnecessary variables or constraints. These can be discarded by preprocessing. As the size of a problem is reduced by preprocessing, the running time is reduced. And more, the infeasibility of a problem may be detected before using solution methods. When the preprocessing implemented by this paper is used in NETLIB problems, it removes unnecessary variables and constraints by 21%, 15%, respectively. The use of preprocessing gives in the average 21% reduction in running time by applying the interior point method. Preprocessing can detect 10 out of 30 infeasible NETLIB problems.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 C
• /
• pp.1054-1056
• /
• 1999

It is the most important in small signal stability analysis of large scale Power systems to compute only the dominant eigenvalues selectively with numerical stability and efficiency. In this Paper evoluted linear analysis program, transformed state matrix using Inverse transformation with complex shift and then Hessenberg process and iterative scheme are used to accelerate Hessenberg process, can calculate dominant eigenvalues. In this Paper, The accuracy of this Program has been validated against 4-machines 11-bus system and New England 10-machines 39-bus system. Also applied to KEPCO system - about 791-bus 250-machines 2500-branches, got 2568 order state matrix, and calculated two dominant modes. This analysis result equaled to result of EPRI's SSSP program to use commonly, and calculating time is faster.

• 대한산업공학회지
• /
• 제26권2호
• /
• pp.117-127
• /
• 2000

In this paper, we propose a new convex combination weight rule for the cross decomposition method which is known to be one of the most reliable and promising strategies for the large scale optimization problems. It is called generalized cross decomposition, a modification of linear mean value cross decomposition for specially structured linear programming problems. This scheme puts more weights on the recent subproblem solutions other than the average. With this strategy, we are having more room for selecting convex combination weights depending on the problem structure and the convergence behavior, and then, we may choose a rule for either faster convergence for getting quick bounds or more accurate solution. Also, we can improve the slow end-tail behavior by using some combined rules. Also, we provide some computational test results that show the superiority of this strategy to the mean value cross decomposition in computational time and the quality of bounds.

• Communications for Statistical Applications and Methods
• /
• 제9권1호
• /
• pp.229-240
• /
• 2002

Whether to use linear or quadratic model in the analysis of regression data is one of the important problems in classical regression model and measurement error model (MEM). In MEM, four goodness of fit test statistics are available In solving that problem. Two are from the derivation of estimators of quadratic MEM, and one is from that of the general $k^{th}$-order polynomial MEM. The fourth one is derived as a variation of goodness of fit test statistic used in linear MEM. The purpose of this paper is to find the most powerful test statistic among them through the small-scale simulation.

• Journal of the Korean Statistical Society
• /
• 제25권3호
• /
• pp.347-358
• /
• 1996

A new test for goodness-of-fit is presented. It is a modification of a test of LaRiccia (1991). These tests are applicable to continuous lo-cation/scale models. The new test statistic is based on a few selected order statistics taken from the sample, while the LaRiccia test is based directly on the full sample. Each test embeds the hypothesized model in a larger linear model and proceeds to test the goodness-of-fit hy-pothesis by testing the coefficients of this linear model appropriately. The general theory is presented. The tests are compared via computer simulation to a related test of Ali and Umbach (1989) for distributions that could be used as lifetime models. An important aspect of all these tests is that only standard $X_2$ tables are used. Selection of the spacings of the order statistics is discussed.

• 천문학회보
• /
• 제36권2호
• /
• pp.112.1-112.1
• /
• 2011

We present numerical simulations of inverse energy cascade and in driven three-dimensional (3D) electron magnetohydrodynamic (EMHD) turbulence. It has been known that inverse energy cascade only occurs in two-dimensional (2D) turbulence. However, we demonstrate that inverse energy cascade occurs in 3D driven EMHD turbulence. When magnetic helicity is injected on a small-scale, magnetic energy goes up to larger scales. The energy spectrum clearly shows inverse energy cascade. At the same time, magetic helicity spectrum also shows that the helicity goes up to larger scales. We obviously confirm inverse energy cascade. Net magnetic helicity for scales larger than the driving scale shows linear growth, and magnetic energy shows non-linear growth. On the other hand, when we drived turbulence without magnetic helicity, we do not observe inverse energy cascade.

• Journal of Communications and Networks
• /
• 제17권5호
• /
• pp.473-481
• /
• 2015

In this study, we propose a clustering algorithm to enhance the performance of wireless sensor and actuator networks (WSANs). In each cluster, a multi-level hierarchical structure can be applied to reduce energy consumption. In addition to the cluster head, some nodes can be selected as intermediate nodes (INs). Each IN manages a subcluster that includes its neighbors. INs aggregate data from members in its subcluster, then send them to the cluster head. The selection of intermediate nodes aiming to optimize energy consumption can be considered high computational complexity mixed-integer linear programming. Therefore, a heuristic lowest energy path searching algorithm is proposed to reduce computational time. Moreover, a channel assignment scheme for subclusters is proposed to minimize interference between neighboring subclusters, thereby increasing aggregated throughput. Simulation results confirm that the proposed scheme can prolong network lifetime in WSANs.

• 대한전자공학회논문지
• /
• 제22권3호
• /
• pp.77-83
• /
• 1985

본 논문에서는 시스템 파라미터가 불확실한 일련의 연속시간 대규모 선청 시스템을 안정화하는 문제가 다루어졌다. 제안된 비집중 적응 제어기는 새로운 적웅궤환 제어와 기존의 선형궤환 제어를 결합한 형태로서, 전체 케루프 시스템의 안정을 보장하기 위한 충분조건이 유도되었다. 또, 제안된 방식의 유용성을 보이기 위하여 컴퓨터 모사를 통한 수치예가 제시 되었다.

• 충청수학회지
• /
• 제25권2호
• /
• pp.367-377
• /
• 2012

The goal of the image restoration is to find a good approximation of the original image for the degraded image, the blurring matrix, and the statistics of the noise vector given. Fast truncated Lagrange (FTL) method has been proposed by G. Landi as a image restoration method for large-scale ill-conditioned BTTB linear systems([3]). We implemented FTL method for the image restoration problem with reflective boundary condition which gives better reconstructions of the unknown, the true image.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 추계학술대회 논문집 학회본부 B
• /
• pp.463-465
• /
• 1998

In this paper, we consider the problem of robust stability of large-scale uncertain linear systems with time-varying delays. The considered uncertainties are both unstructured uncertainty which is only known its norm bound and structured uncertainty which is known its structure. Based on Lyapunov stability theorem and $H_{\infty}$ theory. we present uncertainty upper bound that guarantee the robust stability of systems. Especially, robustness bound are obtained directly without solving the Lyapunov equation. Finally, we show the usefulness of our results by numerical example.