• Journal of Astronomy and Space Sciences
• /
• v.30 no.3
• /
• pp.179-185
• /
• 2013

Photometric observation is one of the most effective techniques for determining the physical characteristics of unknown space objects and space debris. In this research, we examine the change in brightness of the Communication, Ocean, Meteorological Satellite-1 (COMS-1) Geostationary Orbit Satellite (GEO), and compare it to our estimate model. First, we calculate the maximum brightness time using our calculation method and then derive the light curve shape using our rendering model. The maximum brightness is then calculated using the induced equation from Pogson's formula. For a comparison with our estimation, we carried out photometric observation using an optical telescope. The variation in brightness and the shape of the light curve are similar to the calculations achieved using our model, but the maximum brightness shows a slightly different value from our calculation result depending on the input parameters. This paper examines the photometric phenomenon of the variation in brightness of a GEO satellite, and the implementation of our approach to understanding the characteristics of space objects.

• International Journal of Control, Automation, and Systems
• /
• v.3 no.2
• /
• pp.236-243
• /
• 2005

This paper presents a new stochastic approach for solving combinatorial optimization problems by using a new selection method, i.e. SA-selection, in genetic algorithm (GA). This approach combines GA with simulated annealing (SA) to improve the performance of GA. GA and SA have complementary strengths and weaknesses. While GA explores the search space by means of population of search points, it suffers from poor convergence properties. SA, by contrast, has good convergence properties, but it cannot explore the search space by means of population. However, SA does employ a completely local selection strategy where the current candidate and the new modification are evaluated and compared. To verify the effectiveness of the proposed method, the optimization of a fuzzy controller for balancing an inverted pendulum on a cart is considered.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.3
• /
• pp.63-69
• /
• 2002

Detailed routing is a problem assigning each net to a track after global routing. The most popular algorithms for detailed routing include left-edge algorithm, dogleg algorithm, and greedy channel routing algorithm. In this paper we propose a genetic algorithm searching solution space for the detailed routing problem. We compare the performance of proposed genetic algorithm(GA) for detailed routing with that of greedy channel routing algorithm by analyzing the results of each implementation.

• Journal of the Korean Society of Industry Convergence
• /
• v.14 no.4
• /
• pp.157-165
• /
• 2011

The study figures out the alternatives of training BIM design experts which is the biggest obstacle in training manpower of professional BIM designer, the largest problem when the plant introduce BIM design about the change in Construction Environment by Equipment Based BIM Design in reality of design followed by equipment based BIM design, education institution plan. BIM is the system which is built to make these information be used easier and technique which enables design construction and maintenance in 3-dimensional virtual space by designing buildings in 3-dimensional space, and by data-basing the generated information of every life-cycle information. As the essential contents of the study, educational institutions with the public authority should invest the opening of educational programs, recruit of experts and development of textbooks from a long-term perspective. And also, the role of public institution is important above all for the development of construction industry.

• The Pure and Applied Mathematics
• /
• v.21 no.1
• /
• pp.51-60
• /
• 2014

In this paper, we construct a complex reproducing kernel space for singular multi-point BVPs, and skillfully obtain reproducing kernel expressions. Then, we transform the problem into an equivalent operator equation, and give a numerical algorithm to provide the approximate solution. The uniform convergence of this algorithm is proved, and complexity analysis is done. Lastly, we show the validity and feasibility of the numerical algorithm by two numerical examples.

• Journal of applied mathematics & informatics
• /
• v.10 no.1_2
• /
• pp.261-275
• /
• 2002

Let T be a local strongly accretive operator from a real uniformly smooth Banach space X into itself. It is proved that Ishikawa iterative schemes with errors converge strongly to a unique solution of the equations T$\_$x/ = f and x + T$\_$x/ = f, respectively, and are almost T$\_$b/-stable. The related results deal with the strong convergence and almost T$\_$b/-stability of Ishikawa iterative schemes with errors for local strongly pseudocontractive operators.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.35 no.7
• /
• pp.586-591
• /
• 2007

The effects of cancellation errors on the convergence characteristics of preconditioned Euler equations at low Mach numbers are analyzed. Flows in a two-dimensional channel with a circular bump are calculated at different Mach numbers. It is shown that the cancellation error in the energy equation grows faster than those in the other equations as the Mach number decreases. It is also shown that the cancellation problem of the energy equation can be alleviated by multiplying the inversion of the preconditioner.

• Communications of the Korean Mathematical Society
• /
• v.12 no.2
• /
• pp.275-285
• /
• 1997

Let E be a uniformly convex Banach space with a uniformly G$\hat{a}teaux differentiable norm, C a nonempty closed convex subset of $E, T : C \to E$ a nonexpansive mapping, and Q a sunny nonexpansive retraction of E onto C. For $u \in C$ and $t \in (0,1)$, let $x_t$ be a unique fixed point of a contraction $R_t : C \to C$, defined by $R_tx = Q(tTx + (1-t)u), x \in C$. It is proved that if ${x_t}$ is bounded, then the strong $lim_{t\to1}x_t$ exists and belongs to the fixed point set of T. Furthermore, the strong convergence of ${x_t}$ in a reflexive and strictly convex Banach space with a uniformly G$\hat{a}$teaux differentiable norm is also given in case that the fixed point set of T is nonempty.

• Journal of the Korean Mathematical Society
• /
• v.46 no.3
• /
• pp.561-576
• /
• 2009

We introduce two iterative algorithms for finding a common element of the set of fixed points of an asymptotically k-strict pseudo-contraction and the set of solutions of a mixed equilibrium problem in a Hilbert space. We obtain some weak and strong convergence theorems by using the proposed iterative algorithms. Our results extend and improve the corresponding results of Tada and Takahashi [16] and Kim and Xu [8, 9].

• Journal of Multimedia Information System
• /
• v.1 no.1
• /
• pp.77-85
• /
• 2014

Usually, the skin pigmentation detection and diagnosis are made by clinicians. In this process it is subjective and non-quantitative. We develop an approach to detect and measure the different pigmentation lesions base on computer vision technology. In the paper we study several usually used skin-detecting color space like HSV, YCbCr and normalized RGB. We compare their performance with illumination influence for detecting the pigmentation lesions better. Base on a relatively stable color space, we propose an approach which is RGB channels vector difference characteristic for the detection. After the object region detection, we also use the difference to measure the difference between the lesion and the surrounding normal skin. From the experiment results, our approach can effectively detect the pigmentation lesion, and perform robustness with different illumination.