• 제어로봇시스템학회논문지
• /
• 제13권1호
• /
• pp.46-51
• /
• 2007

In this paper, we propose a new data clustering method using local probability and hypothesis theory. To cluster the test data set we analyze the local area of the test data set using local probability distribution and decide the candidate class of the data set using mean standard deviation and variance etc. To decide each class of the test data, statistical hypothesis theory is applied to the decided candidate class of the test data set. For evaluating, the proposed classification method is compared to the conventional fuzzy c-mean method, k-means algorithm and Discriminator analysis algorithm. The simulation results show more accuracy than results of fuzzy c-mean method, k-means algorithm and Discriminator analysis algorithm.

• 정보통신설비학회논문지
• /
• 제2권3호
• /
• pp.9-16
• /
• 2003

In this paper, we propose the burst error reduction (BER) algorithm for VoIP service in the wireless LAN network. In end point device, this BER algorithm can be achieved packet loss bounded QoS provisioning using interleaving in buffering and FEC (Forward Error Correction) through transmitting voice packet. BER algorithm can reduced the voice packet loss rate 5.5%-60% in VoIP network using wireless LAN.

• 한국군사과학기술학회지
• /
• 제21권1호
• /
• pp.17-24
• /
• 2018

Polar fomat algorithm (PFA) was derived from medical imaging theory, known as back projection, to process synthetic aperture radar(SAR) data. The difference between the operating condition of SAR and back projection assumption makes two distortions. First, the focusing performance of PFA is degraded in proportion to distances from the scene center. Second, the geometric accuracy in SAR images is distorted. Several methods were introduced to mitigate the distortions, but some disadvantages, such as the geometric discontinuity, are arisen when sub-images are combined. This paper proposes the novel method to compensate the geometric distortion with chirp Z-transform (CZT). This method corrects precisely the geometric errors without any problems, because a whole image can be processed all at once.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 하계학술대회 논문집 D
• /
• pp.3060-3062
• /
• 2000

A fast optimal path planning algorithm using the analog Cellular Nonlinear Circuits (CNC) is proposed. The proposed algorithm compute the optimal path using subgoal-based dynamic programming algorithm. In the algorithm, the optimal paths are computed regardless of the distance between the initial and the goal position. It begins to find subgoals starting from the initial position when the output of the initial cell becomes nonzero value. The suboal is set as the initial position to find the next subgoal until the final goal is reached. Simulations have been done considering the imprecise hardware fabrication and the limitation of the magnitude of input value.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제8권2호
• /
• pp.132-139
• /
• 2008

This paper proposes a scatternet topology formation, self-healing, and self-routing path optimization algorithm based on Relative Neighborhood Graph. The performance of the algorithm using ns-2 and extensible Bluetooth simulator called blueware shows that even though RNG-FHR does not have superior performance, it is simpler and easier to implement in deploying the Ad-Hoc network in the distributed dynamic environments due to the exchange of fewer messages and the only dependency on local information. We realize that our proposed algorithm is more practicable in a reasonable size network than in a large scale.

• 한국정보처리학회논문지
• /
• 제6권10호
• /
• pp.2649-2658
• /
• 1999

This paper proposes a new solution to support Internet Multicast for mobile hosts. The proposed algorithm is based on the remote subscription approach of IETF Mobile IP that mobile node re-subscribes to its desired multicast groups while at a foreign network. In addition, we adopt the bi-directional tunneling to minimize the disruption of multicast service due to movement of a host from network to another. This paper also analyzes the handoff latencies and data packet loss amount of our algorithm and compares to other approaches. Our analysis shows that the proposed algorithm has good robustness, scalability and routing efficiency.

• Journal of Astronomy and Space Sciences
• /
• 제35권4호
• /
• pp.287-293
• /
• 2018

This paper presents a satellite relative navigation strategy for formation flying, which chooses an appropriate navigation algorithm according to the operating environment. Not only global positioning system (GPS) measurements, but laser measurements can also be utilized to determine the relative positions of satellites. Laser data is used solely or together with GPS measurements. Numerical simulations were conducted to compare the relative navigation algorithm using only laser data and laser data combined with GPS data. If an accurate direction of laser pointing is estimated, the relative position of satellites can be determined using only laser measurements. If not, the combined algorithm has better performance, and is irrelevant to the precision of the relative angle data between two satellites in spherical coordinates. Within 10 km relative distance between satellites, relative navigation using double difference GPS data makes more precise relative position estimation results. If the simulation results are applied to the relative navigation strategy, the proper algorithm can be chosen, and the relative position of satellites can be estimated precisely in changing mission environments.

• Journal of Electrical Engineering and Technology
• /
• 제12권6호
• /
• pp.2127-2137
• /
• 2017

A virtual power plant (VPP) is a system that virtually integrates power resources based on the VPP participating customer (VPC) unit and operates as a power plant. When VPP operators manage resources to maximize their benefits, load reduction instructions may focus on more responsive VPCs, or those producing high profitability, by using VPC resources with high operation efficiency. VPCs may thus encounter imbalance problems during operation. This imbalance in operation time would bring more participation for some VPCs, causing potential degradation of their resources. Such an operation strategy would be not preferable for VPP operators in managing the relationship with VPCs. This issue impedes both continual VPC participation and economical and reliable VPP operation in the long term. An operation algorithm is therefore proposed that considers the operation time of VPC generators for mandatory reduction of power resource consumption. The algorithm is based on constraints of daily and annual operation times when VPP operators of local generators perform capacity-market power transactions. The algorithm maximizes the operator benefit through VPP operations. The algorithm implements a penalty parameter for imbalances in operation times spent by VPC generators in fulfilling their obligations. An evaluation was conducted on VPP operational effects by applying the algorithm to the Korean power market.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제49권10호
• /
• pp.582-590
• /
• 2000

A fast optimal path planning algorithm using the analog Cellular Nonlinear Circuits(CNC) is proposed. The analog circuits based optimal path planning is very useful since most of the optimal path planning problems require real time computation. There has already been a previous study to implement the dynamic programming with analog circuits. However, it could not be applied for the practically large size of problems since the algorithm employs the mechanism of reducing its input current/voltage by the amount of cost, which causes outputs of distant cells to become zero. In this study, a subgoal-based dynamic programming algorithm to compute the optimal path is proposed. In the algorithm, the optimal paths are computed regardless of the distance between the starting and the goal points. It finds subgoals starting from the starting point when the output of the starting cell is raised from its initial value. The subgoal is set as the next initial position to find the next subgoal until the final goal is reached. The global optimality of the proposed algorithm is discussed and two different kinds of simulations have been done for the proposed algorithm.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2013년도 춘계학술대회 논문집
• /
• pp.311-312
• /
• 2013