• Journal of Korean Institute of Industrial Engineers
• /
• v.30 no.4
• /
• pp.317-327
• /
• 2004

In mixed-model production systems, various models of products are produced alternately on the same production line. When the total number of models or the total production quantity is large, it takes a long time to determine the production sequence of the products. In this paper, we will show that in case of product rate variation problem (PRV) problem with nonidentical symmetric convex discrepancy function, an optimum sequence can be obtained by repeating an optimum sequence in a reduced subproblem.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.2
• /
• pp.107-121
• /
• 1996

An optimization procedure is proposed to determine the optimal stacking sequence on the buckling of laminated composite plates with midplane symmetry under various loading conditions. Classical lamination theory is used for the determination of the critical buckling load of simply supported angle-ply laminates. Analysis is performed by the Galerkin method and Rayleigh-Ritz method. The approximate solution of buckling is replaced by the algorithms that produce generalized eigenvalue problem. Direct search technique is employed to solve the optimization problem effectively. A series of computations is carried out for plates having different aspect ratios, different load ratios and different number of lay-ups.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1109-1112
• /
• 2002

A non-coherent synchronous all-optical code-division multiple-access (CDMA) network is proposed. In this network, symmetric codes derived from prime sequence codes are used. We present the construction of symmetric codes and show that the pseudo-orthogonality of the new codes is the same as that of the original prime-sequence codes while the cardinality of the new codes is larger than that of the prime sequence codes and the modified prime codes in the same field GF(p). Therefore, an optical CDMA LAN using symmetric codes can have a larger number of potential subscribers. The new codes allow designing fully programmable serial all-optical transmitter and receiver suitable for low-loss, high-capacity, optical CDMA LANs. It is also shown that compared to systems using modified prime codes the proposed system can achieve better BER performance for low received chip optical power.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.146-149
• /
• 1995

A new method for grouping of relevant and equivalent inputs of a logical circuit was proposed by the authors by making use of pseudorandom M-sequence correlation. The authors show in this paper that it is possible to estimate the input grouping from a part of correlation functions when we admit small percentage of error, whereas it is impossible to reduce the data necessary to estimate the grouping by use of the truth table method. For example in case of 30-input logic circuit, the number of correlation functions necessary to calculate can be reducible from 1.07 * 10$^{9}$ to 465.

• International Journal of Contents
• /
• v.6 no.3
• /
• pp.5-9
• /
• 2010

To manage large database system with video, effective video indexing and retrieval are required. A large number of video retrieval algorithms have been presented for frame-wise user query or video content query, whereas a few video identification algorithms have been proposed for video sequence query. In this paper, we propose an effective video identification algorithm for video sequence query that employs the Cauchy function of histograms between successive frames and the modified Hausdorff distance. To effectively match the video sequences with a low computational load, we make use of the key frames extracted by the cumulative Cauchy function and compare the set of key frames using the modified Hausdorff distance. Experimental results with several color video sequences show that the proposed algorithm for video identification yields remarkably higher performance than conventional algorithms such as Euclidean metric, and directed divergence methods.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.47-57
• /
• 1992

The purpose of this paper is to improve the operation performance of unit-load Automated Guided Vehicles (AGV's) used as a carrier and mobile workstation in a flow-shop type flexible manufacturing system. An algorithm is developed to determine the optimal job sequence which minimizes the vehicle idle time on the line and the production makespan by the use of the entering interval and travel time between workcenters. An entering times of AGV's and the minimum number of AGV's required are calculated by optimal job sequence. When the numbe rof AGV's is limited, enterling times of AGV's are adjusted to maximize the efficient use of vehicles. A numerical example is given to illustrate the application of the algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.192-192
• /
• 2000

In this paper, a platoon merging is considered as a remote-controlled system with the state represented by a stochastic process. In this system, it becomes to encounter situations where a single decision maker controls a large number of subsystems, and observation and control signals are sent over a communication channel with finite capacity and significant transmission delays. Unlike classical estimation problem in which the observation is a continuous process corrupted by additive noise, there is a constraint that the observation must be coded and transmitted over a digital communication channel with finite capaci쇼. A recursive coder-estimator sequence is a state estimation scheme based on observations transmitted with finite communication capacity constraint. Using the coder-estimator sequence, the remote control station designs a feedback controller. In this paper, we introduce a stochastic model for the lead vehicle in a platoon of vehicles considering the angle between a road surface and a horizontal plane as a stochastic process. The simulation results show that the inter-vehicle distance and the deviation from the desired inter-vehicle distance are well regulated.

• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.1
• /
• pp.11-16
• /
• 2006

To manipulate large video databases, effective video indexing and retrieval are required. A large number of video indexing and retrieval algorithms have been presented for frame-w]so user query or video content query whereas a relatively few video sequence matching algorithms have been proposed for video sequence query. In this paper, we propose an efficient algorithm to extract key frames using color histograms and to match the video sequences using edge features. To effectively match video sequences with low computational load, we make use of the key frames extracted by the cumulative measure and the distance between key frames, and compare two sets of key frames using the modified Hausdorff distance. Experimental results with several real sequences show that the proposed video retrieval algorithm using color and edge features yields the higher accuracy and performance than conventional methods such as histogram difference, Euclidean metric, Battachaya distance, and directed divergence methods.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2001.04a
• /
• pp.34-41
• /
• 2001

Most of the eigenvalue analysis methods for the undamped or proportionally damped systems use the well-known Sturm sequence property to check the missed eigenvalues when only a set of the lowest modes is to be used for large structures. However, in the case of the non-proportionally damped systems such as the soil-structure interaction system, the structural control system and the composite structures, no counterpart of the Sturm sequence property for undamped systems has been developed yet. Hence, when some important modes are missed for those systems, it may leads to poor results in dynamic analysis. In this paper, a technique for calculating the number of eigenvalues inside the open disk of arbitrary radius for the eigenproblem with the damping matrix is proposed by applying Chen's algorithm and Gleyse's theorem. To verify the applicability of the proposed method, two numerical examples are considered.

• ETRI Journal
• /
• v.39 no.6
• /
• pp.782-793
• /
• 2017

This paper considers the use of the Partial Transmit Sequence (PTS) technique to reduce the Peak-to-Average Power Ratio (PAPR) of an Orthogonal Frequency Division Multiplexing signal in wireless communication systems. Search complexity is very high in the traditional PTS scheme because it involves an extensive random search over all combinations of allowed phase vectors, and it increases exponentially with the number of phase vectors. In this paper, a suboptimal metaheuristic algorithm for phase optimization based on an improved harmony search (IHS) is applied to explore the optimal combination of phase vectors that provides improved performance compared with existing evolutionary algorithms such as the harmony search algorithm and firefly algorithm. IHS enhances the accuracy and convergence rate of the conventional algorithms with very few parameters to adjust. Simulation results show that an improved harmony search-based PTS algorithm can achieve a significant reduction in PAPR using a simple network structure compared with conventional algorithms.