• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.30 no.2
• /
• pp.44-50
• /
• 2007

This paper deals with the problem of scheduling jobs and rate-modifying activities on parallel machines. A rate-modifying activity is an activity that changes the production rate of equipment such as maintenance and readjustment. If a job is scheduled after the rate-modifying activity, then the processing time varies depending on the modifying rate of the activity. In this study, we extend the single machine problem to parallel machines problem and propose algorithms is to schedule the rate-modifying activities and jobs to minimize the makespan on parallel machines which is NP-hard. We propose a branch and bound algorithm with three lower bounds to solve medium size problems optimally. Also we develop three heuristics, Modified Longest Processing Time, Modified MULTIFIT and Modified COMBINE algorithms to solve large size problems. The test results show that branch and bound algorithm finds the optimal solution in a reasonable time for medium size problems (up to 15 jobs and 5 machines). For large size problem, Modified COMBINE and Modified MULTIFIT algorithms outperform Modified LPT algorithm in terms of solution quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6C
• /
• pp.541-550
• /
• 2005

In this paper, we address the derivation of joint distributions and correlation coefficients for four pairs of statistics used commonly in a number of signal detection schemes. The upper and lower bounds of the correlation coefficients are obtained, and interesting relationships between the correlation coefficients are derived. Explicit values of the correlation coefficients are given in the form of tables and figures for easy reference. The results in this paper should be useful in comparing various detection statistics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7C
• /
• pp.534-539
• /
• 2008

For an odd prime p, n=4k, and $d=((p^{2k}+1)/2)^2$, Seo, Kim, No, and Shin derived the correlation distribution of p-ary m-sequence of period $p^n-1$ and its decimated sequences by d. In this paper, two new families of p-ary sequences with family size $p^{2k}$ and maximum correlation magnitude $[2]sqrt{p^n}-1$ are constructed. The linear complexity of new p-ary sequences in the families are derived in the some cases and the upper and lower bounds of their linear complexity for general cases are presented.

• Structural Engineering and Mechanics
• /
• v.29 no.5
• /
• pp.469-488
• /
• 2008

Finite element methods have often been used for structural analyses of various mechanical problems. When finite element analyses are utilized to resolve mechanical systems, numerical uncertainties in the initial data such as structural parameters and loading conditions may result in uncertainties in the structural responses. Therefore the initial data have to be as accurate as possible in order to obtain reliable structural analysis results. The typical finite element method may not properly represent discrete systems when using uncertain data, since all input data of material properties and applied loads are defined by nominal values. An interval finite element analysis, which uses the interval arithmetic as introduced by Moore (1966) is proposed as a non-stochastic method in this study and serves a new numerical tool for evaluating the uncertainties of the initial data in structural analyses. According to this method, the element stiffness matrix includes interval terms of the lower and upper bounds of the structural parameters, and interval change functions are devised. Numerical uncertainties in the initial data are described as a tolerance error and tree graphs of uncertain data are constructed by numerical uncertainty combinations of each parameter. The structural responses calculated by all uncertainty cases can be easily estimated so that structural safety can be included in the design. Numerical applications of truss and frame structures demonstrate the efficiency of the present method with respect to numerical analyses of structural uncertainties.

• Proceedings of the KSME Conference
• /
• 2008.11b
• /
• pp.2744-2749
• /
• 2008

Numerical calculations are carried out for the natural convection induced by temperature difference between a cold outer square cylinder and a hot inner circular cylinder for Rayleigh number of $Ra=10^7$. This study investigates the effect of the inner cylinder location on the heat transfer and fluid flow. The location of inner circular cylinder ($\delta$) is changed vertically along the center-line of square enclosure. The natural convection bifurcates from unsteady to steady state according to $\delta$. Two critical positions of ${\delta}_{C,L}$ and ${\delta}_{C,U}$ as a lower bound and an upper bound are ${\delta}_{C,L}=0.05$ and ${\delta}_{C,U}=0.18$, respectively. Within the defined bounds, the thermal and flow fields are steady state. When the inner cylinder locates at ${\delta}{\geq}{\delta}_{C,U}$, the space between the upper surface of inner cylinder and the top surface of the enclosure forms a relatively shallow layer where the natural convection characterized as the pure Rayleigh-Benard convection forms alternately the upwelling and downwelling plums, as a result that a series of cells known as Benard cells is derived.

• ETRI Journal
• /
• v.38 no.1
• /
• pp.70-80
• /
• 2016

This paper addresses the problem of robust waveform design for distributed multiple-radar systems (DMRSs) based on low probability of intercept (LPI), where signal-to-interference-plus-noise ratio (SINR) and mutual information (MI) are utilized as the metrics for target detection and information extraction, respectively. Recognizing that a precise characterization of a target spectrum is impossible to capture in practice, we consider that a target spectrum lies in an uncertainty class bounded by known upper and lower bounds. Based on this model, robust waveform design approaches for the DMRS are developed based on LPI-SINR and LPI-MI criteria, where the total transmitting energy is minimized for a given system performance. Numerical results show the effectiveness of the proposed approaches.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.11
• /
• pp.1445-1454
• /
• 1995

In this study, we have developed a prototype of the automatic defects detection system for capsule inspection using the computer vision techniques. The subjects for inspection are empty hard capsules of various sizes which are made of gelatine. To inspect both sides of a capsule, 2-stage recognition is performed. Features we have used are various lengths of a capsule, area, linearity, symmetricity, head curvature and so on. Decision making is performed based on average value which is computed from 20 good capsules in training and permission bounds in factories. Most of time-consuming process for feature extraction is computed by hardware to meet the inspection speed of more than 20 capsules/sec. The main logic for control and arithmetic computation is implemented using EPLD for the sake of easy change of design and reduction in time for developement. As a result of experiment, defects on size or contour of binary images are detected over 95%. Because of dead zone in imaging system, detection ratio of defects on surface, such as bad joint, chip, speck, etc, is lower than the former case. In this case, detection ratio is 50-85%. Defects such as collet pinch and mashed cap/body seldom appear in binary image, and detection ratio is very low. So we have to process the gray-level image directly in partial region.

• Computational Structural Engineering
• /
• v.3 no.1
• /
• pp.83-95
• /
• 1990

Many structural optimization problems are solved by numerical algorithms since these are complicated and nonlinear. To provide a wider base and popular it to structual design optimization, reliable, accurate and superlinearly convergent nonlinear programming algorithm with active-set strategy have been developed. One of these is RQP(recursive quadratic programming method). This algorithm has several parameters and its performance is influenced by variations of these key parameters. Therefore, an RQP algorithm is selected to enhance its numerical performances by choosing proper parameters. The paper persents these influences on its numerical performance. For comparison of performances, a structural design software for minimum weight of truss subjected to displacement, stress, and lower and upper bounds on design variables is also implemented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5A
• /
• pp.317-324
• /
• 2012

Physical layer network coding (PNC) was first introduce by Zhang et al. for two-way relay channels (TWRCs). By utilizing the PNC, we can complete two-way communications within two time slots, instead of three time slots required in non-PNC systems. Recently, the upper and lower bounds for a bit error rate (BER) of PNC have been analyzed for fading channels. In this paper, we derive an exact BER of the PNC for the TWRC over fading channels. We determine decision regions based on the nearest neighbor rule and partition them into several wedge areas to apply the Craig's polar coordinate form for computing the BER. We confirm that our derived analysis accurately matches with the simulation results.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.2 no.1
• /
• pp.71-78
• /
• 1998

The eigenvalue problem is presented for the building with added viscoelastic dampers by using component mode method. The Lagrange multiplier formulation is used to derive the eigenvalue problem which is expressed with the natural frequencies of the building, the mode components at which the dampers are added, and the viscoelastic property of the damper. The derived eigenvalue problem has a nonstandard form for determining the eigenvalues. Therefore, the problem is examined by the graphical depiction to give new insight into the eigenvalues for the building with added viscoelastic dampers. Using the present approach the exact eigenvalues can be found and also upper and lower bounds of the eigenvalues can be obtained.