• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.540-540
• /
• 2006

• Journal of applied mathematics & informatics
• /
• v.9 no.2
• /
• pp.607-620
• /
• 2002

In this paper, we consider the updating problems to reconstruct the biconnected-components and to reconstruct the weighted shortest path in response to the topology change of the network. We propose two distributed algorithms. The first algorithm solves the updating problem that reconstructs the biconnected-components after the several processors and links are added and deleted. Its bit complexity is O((n'+a+d)log n'), its message complexity is O(n'+a+d), the ideal time complexity is O(n'), and the space complexity is O(e long n+e' log n'). The second algorithm solves the updating problem that reconstructs the weighted shortest path. Its message complexity and ideal-time complexity are $O(u^2+a+n')$ respectively.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.77-80
• /
• 1999

This paper deals with a design of a symbol timing recovery circuit of QAM using the interpolation in AWGN channel. To reduce timing jitter and the amount of processing data, we employ MGA (Modified Gardner Algorithm) as a symbol timing error detector which is called NDA(Nondecision Directed Algorithm). We show the characteristics (S-curve and the variance) of timing error detector with the roll-off factor of a shaping filter, which are compared with GA. Also, we compare the BER curve of interpolation method with that of ideal case. The performance of the STR is shown to be close to that of ideal case. This result shows that this method can be useful to implement symbol timing recovery circuit for multi-level modulation.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.4
• /
• pp.31-41
• /
• 2003

This paper deals with a cell formation problem for a set of m-machines and n-processing parts. Generally, a cell formation problem is known as NP-completeness. Hence the cell formation problem with multiple objectives is more difficult than single objective problem. The paper considers multiple objectives; minimize number of intercell movements, minimize intracell workload variation and minimize intercell workload variation. We propose a multiple objective genetic algorithms(MOGA) resolving the mentioned three objectives. The MOGA procedure adopted Pareto optimal solution for selection method for next generation and the concept of Euclidean distance from the ideal and negative ideal solution for fitness test of a individual. As we consider several weights, decision maker will be reflected his consideration by adjusting high weights for important objective. A numerical example is given for a comparative analysis with the results of other research.

• Korean Journal of Remote Sensing
• /
• v.26 no.3
• /
• pp.335-346
• /
• 2010

Recently, ESA (European Space Agency) has launched CryoSAT-2 for polar ice observations. CryoSAT-2 is equipped with a SIRAL (SAR/interferometric radar altimeter), which is a high spatial resolution radar altimeter. Conventional altimeters cannot measure a precise three-dimensional ground position because of the large footprint diameter, while SIRAL altimeter system accomplishes a precise three-dimensional ground positioning by means of interferometric synthetic aperture radar technique. In this study, we developed an efficient SIRAL SARIn mode processing technique to measure a precise three-dimensional ground position. We first simulated SIRAL SARIn RAW data for the ideal target by assuming the flat Earth and linear flight track, and second accessed the precision of three-dimensional geopositioning achieved by the proposed algorithm. The proposed algorithm consists of 1) azimuth processing that determines the squint angle from Doppler centroid, and 2) range processing that estimates the look angle from interferometric phase. In the ideal case, the precisions of look and squint angles achieved by the proposed algorithm were about -2.0 ${\mu}deg$ and 98.0 ${\mu}deg$, respectively, and the three-dimensional geopositioning accuracy was about 1.23 m, -0.02 m, and -0.30 m in X, Y and Z directions, respectively. This means that the SIRAL SARIn mode processing technique enables to measure the three-dimensional ground position with the precision of several meters.

• Proceedings of the Korean Society of Medical Physics Conference
• /
• 2002.09a
• /
• pp.146-149
• /
• 2002

The aim of stereotactic radiosurgery(SRS) is to deliver a high dose to a target region and a low dose to critical organ through only one or a few irradiation. To satisfy this aim, optimized irradiating conditions must be searched in the planning. Thus, many mathematical methods such as gradient method, simulated annealing and genetic algorithm had been proposed to find out the conditions automatically. There were some limitations using these methods: the long calculation time, and the difficulty of unique solution due to the different shape of tumor. In this study, optimization protocol using ideal models and data base was proposed. Proposed optimization protocol constitutes two steps. First step was a preliminary work. Some possible ideal geometry shapes, such as sphere, cylinder, cone shape or the combination, were assumed to approximate the real tumor shapes. Optimum variables such as isocenter position or collimator size, were determined so that the high dose region could be shaped to fit ideal models with the arrangement of multiple isocenter. Data base were formed with those results. Second, any shaped real targets were approximated to these models using geometry comparison. Then, optimum variables for ideal geometry were chosen from the data base predetermined, and final parameters were obtained by adjusting these data. Although the results of applying the data base to patients were not superior to the result of optimization in each case, it can be acceptable as a starting point of plan.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.12
• /
• pp.1759-1771
• /
• 2017

In this paper, an improved continuous integral variable structure systems(ICIVSS) with the prescribed control performance is designed for simple regulation controls of uncertain general linear systems. An integral sliding surface with an integral state having a special initial condition is adopted for removing the reaching phase and predetermining the ideal sliding trajectory from a given initial state to the origin in the state space. The ideal sliding dynamics of the integral sliding surface is analytically obtained and the solution of the ideal sliding dynamics can predetermine the ideal sliding trajectory(integral sliding surface) from the given initial state to the origin. Provided that the value of the integral sliding surface is bounded by certain value by means of the continuous input, the norm of the state error to the ideal sliding trajectory is analyzed and obtained in Theorem 1. A corresponding discontinuous control input with the exponential stability is proposed to generate the perfect sliding mode on the every point of the pre-selected sliding surface. For practical applications, the discontinuity of the VSS control input is approximated to be continuous based on the proposed modified fixed boundary layer method. The bounded stability by the continuous input is investigated in Theorem 3. With combining the results of Theorem 1 and Theorem 3, as the prescribed control performance, the pre specification on the error to the ideal sliding trajectory is possible by means of the boundary layer continuous input with the integral sliding surface. The suggested algorithm with the continuous input can provide the effective method to increase the control accuracy within the boundary layer by means of the increase of the $G_1$ gain. Through an illustrative design example and simulation study, the usefulness of the main results is verified.

• 한국신재생에너지학회:학술대회논문집
• /
• 2005.06a
• /
• pp.370-373
• /
• 2005

In this research, we presented the regenerative braking algorithms considering fuel economy and charging oftenness, and also analyzed these algorithms. The first algorithm was the regenerative braking algorithm for the ideal recovery of kinetic energy. The HEV using this algorithm had high fuel economy, on the other hand frequent charging was occurred. The second algorithm was the regenerative braking algorithm for reduction of the charging oftenness. Using this algorithm, the HEV had the low charging oftenness and small loss of fuel economy.

• Journal of Korean Society of Transportation
• /
• v.23 no.7 s.85
• /
• pp.149-158
• /
• 2005

The object of this paper is to develop the shortest path algorithm. The existing shortest path algorithm models are developed while considering travel time and travel distance. A few problems occur in these shortest path algorithm models, which have paid no regard to cognition of users, such as when user who doesn't have complete information about the trip meets a strange road or when the route searched from the shortest path algorithm model is not commonly used by users in real network. This paper develops a shortest path algorithm model to provide ideal route that many people actually prefer. In order to provide the ideal shortest path with the consideration of travel time, travel distance and road cognition, travel time is predicted by using Kalman filtering and travel distance is predicted by using GIS attributions. The road cognition is considered by using space data of GIS. Optimal routes provided from this paper are shortest distance path, shortest time path, shortest path considering distance and cognition and shortest path considering time and cognition.

• Bulletin of the Korean Mathematical Society
• /
• v.40 no.3
• /
• pp.425-435
• /
• 2003

In this paper, a new kind of matrices, i.e., $level-{\kappa}$ II-circulant matrices is considered. Algorithms for computing minimal polynomial of this kind of matrices are presented by means of the algorithm for the Grobner basis of the ideal in the polynomial ring. Two algorithms for finding the inverses of such matrices are also presented based on the Buchberger's algorithm.