• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.1C
• /
• pp.46-54
• /
• 2006

The design method of synthetic aperture radar processor (SARP) in the critical design stage is to describe the processing algorithm, to estimate the fractional errors, and to set out the software (SW) and hardware (HW) mapping. The previous design methods for SARP are complex and depend on HW. Therefore, this paper proposes a critical design method that is of more general and independent of HW. This methodology can be applied for developing the space-based SARP using range-Doppler algorithm (RDA).

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.620-623
• /
• 1996

POSCO has been developed a general purpose dynamic simulator of the hot strip steel mill. The simulator is a tool for developing the process control system in an industrial system solution business, by making the most use of control and simulation techniques fostered in steelmaking business. This simulator has, not only a powerful numerical analysis function, but an easy-to-use graphic user interface which readily enables to simulate dynamic system. This paper presents the features of the simulator and steel rolling process simulator as its application.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1999.08a
• /
• pp.69-77
• /
• 1999

Roll profile design in spape rolling with a complex-shaped part depends on the designer's experience, which is general, is acquired through costly trial-and-error process. As a prerequisite for developing a scientific approach to roll profile design, we present a finite element model to simulate 3-D deformation of complex-shaped parts occuring in multi-pass sequence. Demonstrated is the process model's capability to deal with rolling of a complex-shaped part.

• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2399-2401
• /
• 1998

For a medium/small scale DAS, which using the PCS network as the system communication network, we developed the scheme of communication protocol of DAS between master and remote terminal. This paper presents advanced protocol which has basic frame format and data flow for the medium/small scale DAS, and the procedure of the developing sequence.

• Proceedings of the Safety Management and Science Conference
• /
• 2003.05a
• /
• pp.285-290
• /
• 2003

There is only one server available and arriving work require services from this server. Job are processed by the machine one at a time. The most common objective is to sequence jobs on the severs so as to minimize the penalty for being late, commonly called tardiness penalty Based on other objectives, many criteria may serve as s basis for developing job schedules. Therefore, this study tries to proposed that Scheduling by customer needs group for minimizing the problem and reducing inventory, product development time, cycle time, and order lead time.

• Transactions of Materials Processing
• /
• v.15 no.6 s.87
• /
• pp.459-466
• /
• 2006

Trimming line design plays an important role in obtaining accurate edge profile after flanging. Compared to the traditional section-based method, simulation-based method can produce more accurate trimming line by considering deformation mechanics. Recently, the use of a finite element inverse method is proposed to obtain optimal trimming line. By analyzing flanging inversely from the final mesh after flanging, trimming line can be obtained from initial mesh on the drawing die surface. Initial guess generation fer finite element inverse method is obtained by developing the final mesh onto drawing tool mesh. Incremental development method is adopted to handle irregular mesh with various size and undercut. In this study, improved incremental development algorithm to handle complex shape is suggested. When developing the final mesh layer by layer, the algorithm which can define the development sequence and the position of developing nodes is thoroughly described. Flanging of front fender is analyzed to demonstrate the effectiveness of the present method. By using section-based trimming line and simulation-based trimming line, incremental finite element simulations are carried out. In comparison with experiment, it is clearly shown that the present method yields more accurate edge profile than section-based method.

• Bioinformatics and Biosystems
• /
• v.1 no.1
• /
• pp.82-87
• /
• 2006

The most popular protein structure prediction method is comparative modeling. To guarantee accurate comparative modeling, the sequence alignment between a query protein and a template should be accurate. Although choosing the best template based on the protein sequence alignments is most critical to perform more accurate fold-recognition in comparative modeling, even more critical is the sequence alignment quality. Contrast to a lot of attention to developing a method for choosing the best template, prediction of alignment accuracy has not gained much interest. Here, we develop a method for prediction of the shift score, a recently proposed measure for alignment quality. We apply support vector regression (SVR) to predict shift score. The alignment between a query protein and a template protein of length n in our own library is transformed into an input vector of length n +2. Structural alignments are assumed to be the best alignment, and SVR is trained to predict the shift score between structural alignment and profile-profile alignment of a query protein to a template protein. The performance is assessed by Pearson correlation coefficient. The trained SVR predicts shift score with the correlation between observed and predicted shift score of 0.80.

• Journal of Biosystems Engineering
• /
• v.39 no.4
• /
• pp.345-351
• /
• 2014

Purpose: Rapid detection of bacteria is very important in agricultural and food industries to prevent many foodborne illnesses. The objective of this study was to develop a portable nuclear magnetic resonance (NMR)-based system to detect foodborne pathogens (E. coli). This study was focused on developing a method to detect low concentrations of magnetic nanoparticles using NMR techniques. Methods: NMR relaxometry was performed to examine the NMR properties of iron nanoparticle mixtures with different concentrations by using a 1 T permanent magnet magnetic resonance imaging system. Exponential curve fitting (ECF) and inverse Laplace transform (ILT) methods were used to estimate the NMR relaxation time constants, $T_1$ and $T_2$, of guar gum solutions with different iron nanoparticle concentrations (0, $10^{-3}$, $10^{-4}$, $10^{-5}$, $10^{-6}$, and $10^{-7}M$). Results: The ECF and ILT methods did not show much difference in these values. Analysis of the NMR relaxation data showed that the ILT method is comparable to the classical ECF method and is more sensitive to the presence of iron nanoparticles. This study also showed that the spin-spin relaxation time constants acquired by a Carr-Purcell-Meiboom-Gill (CPMG) pulse sequence are more useful for determining the concentration of iron nanoparticle solutions comparwith the spin-lattice relaxation time constants acquired by an inversion recovery pulse sequence. Conclusions: We conclude that NMR relaxometry that utilizes CPMG pulse sequence and ILT analysis is more suitable for detecting foodborne pathogens bound to magnetic nanoparticles in agricultural and food products than using inversion recovery pulse sequence and ECF analysis.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.2
• /
• pp.704-710
• /
• 2017

Our research team is developing a 6-DOF manipulator that is adequate for the narrow workspace of press forming processes. This paper addresses the task sequence optimization methods for the manipulator to minimize the task-finishing time. First, a kinematic model of the manipulator is presented, and the anticipated times for moving among the task locations are computed. Then, a mathematical model of the task sequence optimization problem is presented, followed by a comparison of three meta-heuristic methods to solve the optimization problem: an ant colony system, simulated annealing, and a genetic algorithm. The simulation shows that the genetic algorithm is robust to the parameter settings and has the best performance in both minimizing the task-finishing time and the computing time compared to the other methods. Finally, the algorithms were implemented and validated through a simulation using Mathworks' Matlab and Coppelia Robotics' V-REP (virtual robot experimentation platform).

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.3
• /
• pp.169-180
• /
• 2015

Recently, scheduling problems with position-dependent processing times have received considerable attention in the literature, where the processing times of jobs are dependent on the processing sequences. However, they did not consider cases in which each processed job has different learning or aging ratios. This means that the actual processing time for a job can be determined not only by the processing sequence, but also by the learning/aging ratio, which can reflect the degree of processing difficulties in subsequent jobs. Motivated by these remarks, in this paper, we consider a two-agent single-machine scheduling problem with linear job-dependent position-based learning effects, where two agents compete to use a common single machine and each job has a different learning ratio. Specifically, we take into account two different objective functions for two agents: one agent minimizes the total weighted completion time, and the other restricts the makespan to less than an upper bound. After formally defining the problem by developing a mixed integer non-linear programming formulation, we devise a branch-and-bound (B&B) algorithm to give optimal solutions by developing four dominance properties based on a pairwise interchange comparison and four properties regarding the feasibility of a considered sequence. We suggest a lower bound to speed up the search procedure in the B&B algorithm by fathoming any non-prominent nodes. As this problem is at least NP-hard, we suggest efficient genetic algorithms using different methods to generate the initial population and two crossover operations. Computational results show that the proposed algorithms are efficient to obtain near-optimal solutions.