• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.2
• /
• pp.129-138
• /
• 2003

The traveling salesman problem (TSP) is an NP-hard problem. As the number of nodes increases, it takes a lot of time to find an optimal solution. Instead of considering all arcs, if we select and consider only some arcs more likely to be included in an optimal solution, we can find efficiently an optimal solution. Arc candidate set is a group of some good arcs. For the Lack of study in the asymmetric TSP. it needs to research arc candidate set for the asymmetric TSP systematically. In this paper, we suggest a regression function determining arc candidate set for the asymmetric TSP. We established the function based on 2100 experiments, and we proved the goodness of fit for the model through various 787problems. The result showed that the optimal solutions obtained from our arc candidate set are equal to the ones of original problems. We expect that this function would be very useful to reduce the complexity of TSP.

• Journal of Information Processing Systems
• /
• v.15 no.1
• /
• pp.7-21
• /
• 2019

In order to improve the edge segmentation effect of the level set image segmentation and avoid the influence of the initial contour on the level set method, a saliency level set image segmentation model based on local Renyi entropy is proposed. Firstly, the saliency map of the original image is extracted by using saliency detection algorithm. And the outline of the saliency map can be used to initialize the level set. Secondly, the local energy and edge energy of the image are obtained by using local Renyi entropy and Canny operator respectively. At the same time, new adaptive weight coefficient and boundary indication function are constructed. Finally, the local binary fitting energy model (LBF) as an external energy term is introduced. In this paper, the contrast experiments are implemented in different image database. The robustness of the proposed model for segmentation of images with intensity inhomogeneity and complicated edges is verified.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.03b
• /
• pp.568-571
• /
• 2008

The computation of moving interface by the level set method typically requires reinitializations of level set function. An inaccurate estimation of level set function ${\phi}$ results in incorrect free-surface capturing and thus errors such as mass gain/loss. Therefore, accurate and robust reinitialization process is essential to the free-surface flows. In the present paper, we pursue further development of the reinitialization process, which evaluates directly level set function ${\phi}$ using a normal vector in the interface without solving the re-distancing equation of hyperbolic type. The Taylor-Galerkin approximation and P1P1splitting FEM are adopted to discretize advection equation of the level set function and the Navier-Stokes equation, respectively. Advection equation of free surface and re-initialization process are validated with benchmark problems, i.e., a broken dam flow and time-reversed single vortex flow. The simulation results are in good agreement with the existing results.

• Medical Lasers
• /
• v.10 no.3
• /
• pp.153-160
• /
• 2021

Background and Objectives This study was conducted to investigate the change of total work and total work ratio for each set, peak heart rate during exercise, and blood lactate for each set during the 5-set bench press exercise at 75% one repetition maximum test (1-RM). Materials and Methods Seven men in their 20s with more than 6 months of experience doing resistance exercises were selected as subjects, and their 1-RM bench press was measured two weeks before the experiment and 75% 1-RM was measured one week before the experiment. In this study, total work was measured for each set, and heart rate was measured during rest and set-by-set exercise. Blood lactate was measured during rest time after each set. The raw data were analyzed by repeated one-way ANOVA. Results Total work and total work ratio decreased from 1 set to 4 sets (p < .05), p < .001), heart rate increased from stable at the start of exercise (p < .001) and decreased between 3 sets and 4 sets (p < .05). Blood lactate increased continuously up to 2 sets (p < .001, p < .01). Conclusion In conclusion, total work and heart rate decreased with muscle fatigue during exercise, and blood lactate continuously increased. The results of this study are expected to be useful references for constructing resistance exercise programs in the future.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.102-111
• /
• 2004

The visibility polygon of a simple polygon P is the set of points which are visible from a visibility source in P such as a point or an edge. Since a visibility polygon is the set of points, the set operations such as intersection, union, or difference can be executed on them. The intersection (resp. union) of two visibility polygons is the set of points which are visible from both (resp. either) of the corresponding two visibility sources. The difference of two visibility polygons is the set of points which are visible from only a visibility source. Previously, the best known algorithm for the set operations of two polygons with total n vertices takes O(nlogn ＋ k) time, where k is the output size. In this paper, we present O(n) time algorithms for computing the intersection, the union, and the difference of given two visibility polygons, which are optimal.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.9
• /
• pp.1069-1080
• /
• 2016

TDOA(Time Difference Of Arrival)-based localization system such as the passive surveillance system performs the time synchronization between the receivers after separated installing multiple receivers to set the same clock for all receivers. And it estimates 2D(or 3D) location of the target by solving intersection of the multiple hyperbola(or hyperboloid) using TDOA. To perform time synchronization, one receiver must be set to the master, and it provide the reference data to compensate the clock of the rest of the slaves. The positioning accuracy of TDOA-based localization system is changed in accordance with the master that is selected among multiple receivers. So, the optimum receiver which is selected among multiple receivers must be set to master to get best performance in the considered deployment of receivers. In this paper, we propose a selection scheme of master receiver for time synchronization using DOP(Dilution Of Precision) which is based on location of the target and the multiple receivers. The proposed scheme has low complexity and short processing time, and it is easy to automate in the TDOA-based localization systems.

• The Korean Journal of Mycology
• /
• v.46 no.4
• /
• pp.467-477
• /
• 2018

Colletotrichum circinans, an anthracnose pathogen, causes serious damage to onions worldwide. In this study, specific molecular markers were developed to detect C. circinans accurately and quickly with both conventional and real-time PCR methods. The cirTef-F/cirTef-R and cirTu-F/cirTu-R primer sets, which are specific for C. circinans, were constructed by analyzing $tef-1{\alpha}$ and ${\beta}-tubulin$ genes in the fungus. Using the conventional PCR method, 100 pg and 1 ng of fungal DNA could be detected using the cirTef-F/cirTef-R and cirTu-F/cirTu-R sets, respectively. Using the real-time PCR method, 10 pg and 100 pg of fungal DNA could be detected more sensitively with the cirTef-F/cirTef-R and cirTu-F/cirTu-R sets, respectively. Detection of C. circinans from the artificially infected onion seeds was possible by using both conventional and real-time PCR methods and the developed cirTef-F/cirTef-R primer set. The PCR markers specific for C. circinans developed in this study may enhance the efficiency of fungal pathogen detection in imported vegetables and seeds.

• Journal of the Korea Computer Graphics Society
• /
• v.26 no.1
• /
• pp.7-15
• /
• 2020

In the process of visualizing a point set representing a smooth manifold surface, global illumination techniques can be used to render a realistic scene with various effects of lighting. Thanks to the continuous demand for ray tracing and the development of graphics hardware, dedicated GPUs and programmable pipeline for ray tracing have been introduced in recent years. In this paper, real-time global illumination rendering is studied for a point-set model using ray-tracing GPUs. We apply the moving least-squares (MLS) method to approximate the point set to a smooth implicit surface and render it using global illumination by performing massive ray-intersection tests with the surface and generating shading effects at the intersection point. As a result, a complicated point-set scene consisting of more than 0.5M points can be generated in real-time.

• Journal of Intelligence and Information Systems
• /
• v.4 no.1
• /
• pp.133-147
• /
• 1998

Recently, many researchers have been involved in finding deterministic equations which can accurately predict future event, based on chaotic theory, or fractal theory. The theory says that some events which seem very random but internally deterministic can be accurately predicted by fractal equations. In contrast to the conventional methods, such as AR model, MA, model, or ARIMA model, the fractal equation attempts to discover a deterministic order inherent in time series data set. In discovering deterministic order, researchers have found that neural networks are much more effective than the conventional statistical models. Even though prediction accuracy of the network can be different depending on the topological structure and modification of the algorithms, many researchers asserted that the neural network systems outperforms other systems, because of non-linear behaviour of the network models, mechanisms of massive parallel processing, generalization capability based on adaptive learning. However, recent survey shows that prediction accuracy of the forecasting models can be determined by the model structure and data structures. In the experiments based on actual economic data sets, it was found that the prediction accuracy of the neural network model is similar to the performance level of the conventional forecasting model. Especially, for the data set which is deterministically chaotic, the AR model, a conventional statistical model, was not significantly different from the MLP model, a neural network model. This result shows that the forecasting model. This result shows that the forecasting model a, pp.opriate to a prediction task should be selected based on characteristics of the time series data set. Analysis of the characteristics of the data set was performed by fractal analysis, measurement of Hurst index, and measurement of Lyapunov exponents. As a conclusion, a significant difference was not found in forecasting future events for the time series data which is deterministically chaotic, between a conventional forecasting model and a typical neural network model.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.2
• /
• pp.63-70
• /
• 2015

In the absence of a polynomial time algorithm capable of obtaining the exact solutions to it, the domatic number problem (DNP) of dominating set (DS) has been regarded as NP-complete. This paper suggests polynomial-time complexity algorithm about DNP. In this paper, I select a vertex $v_i$ of the maximum degree ${\Delta}(G)$ as an element of a dominating set $D_i,i=1,2,{\cdots},k$, compute $D_{i+1}$ from a simplified graph of $V_{i+1}=V_i{\backslash}D_i$, and verify that $D_i$ is indeed a dominating set through $V{\backslash}D_i=N_G(D_i)$. When applied to 15 various graphs, the proposed algorithm has succeeded in bringing about exact solutions with polynomial-time complexity O(kn). Therefore, the proposed domatic number algorithm shows that the domatic number problem is in fact a P-problem.