• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.63-66
• /
• 1998

In the implementation of the simplex method program, the representation and the maintenance of basis matrix is very important, In the experimental study, we investigates Suhl's idea in the LU factorization and LU update of basis matrix. First, the triangularization of basis matrix is implemented and its efficiency is shown. Second, various technique in the dynamic Markowitz's ordering and threshold pivoting are presented. Third, modified Forrest-Tomlin LU update method exploiting sparsity is presented. Fourth, as a storage scheme of LU factors, Gustavson data structure is explained. Fifth, efficient timing of reinversion is developed. Finally, we show that modified Forrest-Tomlin method with Gustavson data structure is superior more than 30% to the Reid method with linked list data structure.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.11
• /
• pp.753-761
• /
• 1988

Partial Matrix Refactorization (PR) has been available for refactorization repeatedly. But this paper aims to present Modified PR(MPR), which is faster in (re) factorization speed and simpler in program than PR, but storage is almost as big as that of PR. MPR substitutes refactorization process of PR1 for Modifide Trifactortzation (MT) and, instead of PR 2, adds to PR1 the algoritm that calculates modified element values of modified row / cols. MT, which is subalgorithm for MPR, simplifies the algorithm by applying information vectors to currently used Trifactorization, and trifactorizes and refactorizes in high speed. The test results of Fast Decoupled Load Flow (FDLF) and Contingency Analysis useing Indexing Scheme and Optimal Ordering also prove that MPR is faster than PR.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.6 no.4
• /
• pp.252-256
• /
• 2006

A low-power ECC check bit generator is presented with competent DRAM implementation with minimal speed loss, area overhead and power consumption. The ECC used in the proposed scheme is a variant form of the minimum weight column code. The spatial and temporal correlations of input data are analyzed and the input paths of the check bit generator are ordered for the on-line adaptable power savings up to 24.4% in the benchmarked cases. The chip size overhead is estimated to be under 0.3% for a 80nm 1Gb DRAM implementation.

• Proceedings of the KIEE Conference
• /
• 1997.11a
• /
• pp.174-176
• /
• 1997

This paper proposes a unit commitment scheduling method based on hybrid genetic algorithm(GA). When the systems are scaled up, conventional genetic algorithms suffer from computational time limitations because of the growth of the search space. So greatly reduce the search space of the GA and to efficiently deal with the constraints of the problem, priority list unit ordering scheme are incorporated as the initial solution and the minimum up and down time constraints of the units are included. The violations of other constraints are handled by integrating penalty factors. To show the effectiveness of the proposed method. test results for system of 10 units is compared with results obtained using other methods.

• Water for future
• /
• v.23 no.4
• /
• pp.421-434
• /
• 1990

The problems of hydrologic similarity among river basins was analyzed by a geomorphologic response model using Hortons*s ordering scheme. The Nash model was used for deriving the geomorphologic response function, and for the optimization of the responsefunction, imcomplete gamma function andRosso*s regression equation were used. The application of this method was tested on some observed flood data of Pyungchang river basin and Wi Stream basin and Bocheong stream, and predictions of hydrologic response were compared with that of the Moment method. The results show that the proposed model and dimensionless instantaneous unit hydrograph can be used for the runoff analysis of an ungauged basin and the analysis of hydrologic similarity.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.745-746
• /
• 2006

In this paper, we propose a new predictive coding scheme for color data of three-dimensional (3-D) mesh models. We exploit connectivity and geometry information to improve coding efficiency. After ordering all vertices in a 3-D mesh model with a vertex traversal technique, we employ a geometry predictor to compress the color data. The predicted color can be acquired by a weighted sum of reconstructed colors for adjacent vertices using both angles and distances between the current vertex and adjacent vertices.

• Journal of Korean Institute of Industrial Engineers
• /
• v.18 no.1
• /
• pp.81-89
• /
• 1992

After much research on qualitative reasoning, the problem of ambiguities still hampers the practicality of this important AI tool. In this paper, the sources of ambiguities are examined in depth with a systems engineering point of view and possible directions to disambiguation are suggested. This includes some modeling strategies and an architecture of temporal inference for building unambiguous qualitative models of practical complexity. It is argued that knowledge of multiple levels in abstraction hierarchy must be reflected in the modeling to resolve ambiguities by introducing the designer's decisions. The inference engine must be able to integrate two different types of temporal knowledge representation to determine the partial ordering of future events. As an independent quantity management system that supports the suggested modeling approach, LIQUIDS(Linear Quantity-Information Deriving System) is described. The inference scheme can be conjoined with ordinary rule-based reasoning systems and hence generalized into many different domains.

• Journal of Information Technology Services
• /
• v.9 no.2
• /
• pp.163-177
• /
• 2010

In this paper, we consider a channel ordering problem that seeks to maximize the service quality in mobile radio communication systems. If a base station receives a connection request from a mobile user, one of the empty channels belonging to the base station is assigned to the mobile user. In case multiple empty channels are available, we can choose one that incurs least interference with other channels assigned to adjacent base stations. However, note that a pair of channels that are not separated enough generates interference only if both channels are assigned to mobile users. That is, interference between channels may vary depending on the channel assignment sequence for each base station and on the distribution of mobile users. To find a channel assignment sequence that seems to generate minimum interference, we develop an optimization model considering various scenarios of mobile user distribution. Simulation results show that channel assignment sequence determined by the scenario based optimization model significantly reduces the interference provided that scenarios and interference cost are properly generated.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.9
• /
• pp.1654-1662
• /
• 2006

An ad hoc network is multi-hop network composed of radio links. and the transmission quality of a radio link is more unstable than that of a wired circuit. Packet loss thus occurs frequently in an ad hoc network, and the consequent connection failure results in a severe deterioration of TCP performance. TCP performance also deteriorates because of the collision of data packets and ACK packets in the radio channel. In this paper we study to improve the performance of the Mobile Ad-hoc network by using Delayed ACK algorithm with our proposed ODA(Ordering-Delayed ACK) method. The proposed ODA algorithm increases the number of the data packets orderly at the receiver side which is going to be applied for the Mobile Ad-hoc network. We accomplished a computer simulation using NS-2. From the simulation results, we find the proposed ODA algorithm obviously enlarge the channel capacity and improve the network performance at the situation of multi-hop of ad-hoc network than the existing Delayed ACK algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.4
• /
• pp.350-359
• /
• 2013

In this paper, Inter user interference elimination algorithm based on Block Diagonal Geometric Mean Decomposition(BD-GMD) for eliminating inter user interference apply to Zero-Forcing in the Successive Signal to Leakage plus Noise Ratio(SSLNR) in Coordinated Multi-Point Coordinated Beamforming system(CoMP CB). As a result, the leakage power is eliminated. The inter user interference elimination algorithm, however, cannot guarantee the enough desired signal power therefore we perform the channel ordering to overcome this disadvantage and increase the desired signal power. The simulation results show that the proposed scheme provides the improved Bit Error Rate(BER) performance compared with existing SSLNR-Zero-Forcing-Tomlinson Harashima precoding(SSLNR-ZF-THP).