• 한국CDE학회논문집
• /
• 제10권3호
• /
• pp.168-178
• /
• 2005

The Delaunay triangular net is primarily characterized by a balance of the whole by improving divided triangular patches into a regular triangle, which closely resembles an equiangular triangle. A triangular net occurring in certain, point-clustered, data is unique and can always create the same triangular net. Due to such unique characteristics, Delaunay triangulation is used in various fields., such as shape reconstruction, solid modeling and volume rendering. There are many algorithms available for Delaunay triangulation but, efficient sequential algorithms are rare. When these grids involve a set of points whose distribution are not well proportioned, the execution speed becomes slower than in a well-proportioned grid. In order to make up for this weakness, the ids are divided into sub-grids when the sets are integrated inside the grid. A method for finding a mate in an incremental construction algorithm is to first search the area with a higher possibility of forming a regular triangular net, while the existing method is to find a set of points inside the grid that includes the circumscribed sphere, increasing the radius of the circumscribed sphere to a certain extent. Therefore, due to its more efficient searching performance, it takes a shorer time to form a triangular net than general incremental algorithms.

• International Journal of Contents
• /
• 제6권1호
• /
• pp.47-52
• /
• 2010

Skyline queries are an important new search capability for multi-dimensional databases. Most of the previous works have focused on processing skyline queries over static data set. However, most of the real applications deal with the dynamic data set. Since dynamic data set constantly changes as time passes, the continuous skyline computation over dynamic data set becomes ever more complicated. In this paper, we propose a multiple layer grids method for continuous skyline computation (MLGCS) that maintains multiple layer grids to manage the dynamic data set. The proposed method divides the work space into multiple layer grids and creates the skyline influence region in the grid of each layer. In the continuous environment, the continuous skyline queries are only handled when the updating data points are in the skyline influence region of each layer grid. Experiments based on various data distributions show that our proposed method outperforms the existing methods.

• 한국국방경영분석학회지
• /
• 제30권1호
• /
• pp.30-47
• /
• 2004

This research considers a Network Diversion Problem (NDP) in the directed graph, which is to identify a minimum cost set of links to cut so that any communication paths from a designated source node to a destination node must include at least one link from a specified set of arcs which is called the diversion arcs. We identify a redundant constraint from an earlier formulation. The problem is known to be NP-hard, however a detailed proof has not been given. We provide the proof of the NP-hardness of this problem. We develop a tabu search algorithm that includes a preprocessing procedure with two steps for removing diversion arcs as well as reducing the problem size. Computational results of the algorithm on instances of general graphs and grid graphs are reported.

• 한국통신학회논문지
• /
• 제18권3호
• /
• pp.360-371
• /
• 1993

Flooding 탐색 알고리즘은 고도의 생존성과 신뢰성이 있으므로 전술응용을 위한 효과적 라우팅 메커니즘이라고 알려져 있다. 그러나 망 효율성 측면에서는 큰 결점을 갖고 있다. 본 논문에서는 음성 트래픽에 대하여 최대 4개의 링크와 2개의 우선순위클래스를 갖는 전술 회선교환 격자망을 MFDL 경로기법을 사용하여 호설정시간 증가 및 알고리즘의 프로세서로딩없이 회선교환망의 블로킹 확률에 대한 성능개선 방법을 제안하였다.

• 전자공학회논문지A
• /
• 제31A권12호
• /
• pp.1-8
• /
• 1994

In this paper, we hve compare the performance of DAR(Dynamic Adaptive Routing) with that of FSR(Flooding Search Routing) to select an adequate routing protocol in circuit-switched networs. As a performance factor, we have considered call setup time, which is the key factor of performance evaluation in circuit switched networks. We have evaluated the performance of two methods in grid topology circuit-switched networks using a commn channel signaling scheme, as application examples. As results, FSR method shows better performance than DAR method under light traffic load, when the number of links by which call has passed increases, but DAR method represents better performance than FSR method under heavy traffic load or large networks because of redundant packets.

• 한국의학물리학회:학술대회논문집
• /
• 한국의학물리학회 2005년도 제30회 춘계학술대회
• /
• pp.79-82
• /
• 2005

In this study, we have tested the feasibility of the convex non-linear objective model and the line search optimization method for the fluence map optimization (FMO). We've created the convex nonlinear objective function with simple bound constraints and attained the optimal solution using well-known gradient algorithms with an Armijo line search that requires sufficient objective function decrease. The algorithms were applied to 10 head-and-neck cases. The numbers of beamlets were between 900 and 2,100 with a 3 mm isotropic dose grid. Nonlinear optimization methods could efficiently solve the IMRT FMO problem in well under a minute with high quality for clinical cases.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.71.1-71
• /
• 2001

In this paper, an improved method of environment map building and a region search algorithm for mobile robot are presented. For the environment map building of mobile robot, measurement data of ultrasonic sensors and certainty grid representation is usually used. In this case, inaccuracies due to the uncertainty of ultrasonic data are included in the map. In order to solve this problem, an environment map building method using a Bayesian model was proposed previously[5]. In this study, we present an improved method of probability map building that uses infrared sensors and shift division Gaussian probability distribution with the existing Bayesian update method using ultrasonic sensors. Also, a region search algorithm for ...

• Journal of Information Processing Systems
• /
• 제15권1호
• /
• pp.116-126
• /
• 2019

In this paper, an improved one-against-one support vector machine algorithm is used to classify multiple power quality disturbances. To solve the problem of parameter selection, an improved particle swarm optimization algorithm is proposed to optimize the parameters of the support vector machine. By proposing a new inertia weight expression, the particle swarm optimization algorithm can effectively conduct a global search at the outset and effectively search locally later in a study, which improves the overall classification accuracy. The experimental results show that the improved particle swarm optimization method is more accurate than a grid search algorithm optimization and other improved particle swarm optimizations with regard to its classification of multiple power quality disturbances. Furthermore, the number of support vectors is reduced.

• 한국정보통신학회논문지
• /
• 제25권1호
• /
• pp.160-163
• /
• 2021

In this paper, we present a path search scheme for the safe movement of the swarm of unmanned systems in unknown dangerous areas. Some of the swarm searches for the primary and secondary paths before the majority of swarm move through dangerous areas. In terms of rapid movement from the dangerous area and preparation for an accident, the primary path is searched first in the destination's direction. The secondary path is searched by considering the distance between the paths to guarantee a safe distance. The computer simulations show that the proposed scheme is suitable for the swarm of unmanned systems.

• 한국멀티미디어학회논문지
• /
• 제16권5호
• /
• pp.539-548
• /
• 2013

움직임 추정은 비디오 영상 압축에 있어서 중요한 역할을 하지만 최적의 움직임 벡터를 추정하기 위해 많은 계산량을 요구한다. 다시점 비디오는 하나의 3차원 장면을 여러 시점에서 다수의 카메라로 촬영한 동영상으로 다시점 비디오 부호화를 위한 움직임 추정의 계산량은 카메라 수에 비례하여 증가한다. 본 논문에서는 다시점 비디오 부호화를 위한 움직임 추정의 계산량을 줄이면서 영상 화질을 유지하는 저 복잡도 움직임 추정 기법을 제안하였다. 제안한 기법은 계층적인 탐색 기법으로 4-그리드 다이아몬드 탐색 패턴, 2-그리드 다이아몬드 탐색 패턴 그리고 TZ 2 point 탐색 패턴으로 구성되었다. 이들 탐색 패턴들은 움직임 벡터의 분포 특성을 이용하여 탐색 점들을 배치함으로써 적은 계산량으로 움직임 벡터를 추정할 수 있다. 제안한 기법의 성능을 JMVC의 고속 움직임 추정 기법인 TZ 탐색 기법의 성능과 비교하였을 경우, 영상 화질 면에서 약 0.01~0.24(dB) 화질 저하를 보였지만 움직임 추정의 계산량을 약 42%~80% 줄임으로서 약 1.8~4.5배 속도 향상을 보였다.