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

In this paper the Local Weighted Regression LWR technique is applied to the estimation of aircrcraft parameters. The method consists In improving the Local Weighted Regression LWR technique by adding a data Retention-and-Deletion RD strategy. The improvement comes with reduced computational effort since the two techniques can share their main computational procedures. The purpose of the study was to establish if the proposed algorithm could provide fast and reliable real-time estimations, with accuracy comparable to other well-known off-line identification schemes. The algorithm was tested using specific parameter estimation maneuvers and flight data of the NASA F/A-18 HARV. The results were compared with both the estimation obtained from ...

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.1219-1219
• /
• 1991

This paper proposes the model order reduction with pass band error reduction in the frequency domain of discrete time linear systems. The algorithm is the new method of reduced order model which reduces passband error by changing controllability and observability gramian used with weighted functions. A numerical example shows that this algorithm has lower passband error than balanced w&l and weighted function characteristics in frequency domain.

• 품질경영학회지
• /
• 제19권2호
• /
• pp.125-132
• /
• 1991

This paper is concerned with the flow shop scheduling problems considering different weighted penalty costs for earliness and lateness, and a common due date. The objective of the paper is to develop an efficient heuristic scheduling algorithm for minimizing total penalty costs and for determining the optimal common due date. The positional weight index and, the product sum method are used. A numerical example is given for illustrating the proposed algorithm.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(1)
• /
• pp.347-350
• /
• 2002

In the input buffer switch system, VOQ(Virtual Output Queue) archives 100% throughput. The VOQ with the systolic architecture maintains an uniform performance regardless of a number of Packet class and output port, so that it doesn't have a limitation of scalability. In spite of these advantages, the systolic architecture VOQ is difficult to change sorting order In this paper, we Proposed a systolic architecture VOQ which support weighted round robin(WRR) algorithm to provide with flow control service.

• 한국항해학회지
• /
• 제20권4호
• /
• pp.99-109
• /
• 1996

Though median filter is used for removing noise and smoothing image. But, the result of it has distortion around edge. And then, this paper proposes new noise removing algorithm by recursive morphological processing. Basic operation is same each other, but there is some different processing method between recursive morphology and general morphology theory. This recursive morphological filter can be viewed as the weighted order static filter, and then it has a weighted SE(structuring element). Especially using this algorithm to remove the 10% gaussian noise, this paper confirmed that PSNR is improved about 0.642~1.5757 db reserving edge well better than the results of the traditional median filter.

• 한국인터넷방송통신학회논문지
• /
• 제14권4호
• /
• pp.233-241
• /
• 2014

본 논문은 원 그래프를 2-간선 연결 그래프로 단순화하고, 사이클 속성을 적용하여 최소신장트리를 빠르게 얻는 알고리즘을 제안하였다. Borůvka 알고리즘은 정점 (v) 당 최소 가중치 간선 (v) 을 1개씩 선택하는 1-간선 연결 그래프에 대해 사이클 속성을 적용하여 부분신장트리를 얻는다. 추가적으로 절단속성을 적용하여 부분신장트리를 연결하는 최소 가중치 간선을 선택한다. Kruskal 알고리즘은 그래프의 모든 간선을 대상으로 오름차순으로 절단 속성을 적용한다. 역-삭제 알고리즘은 내림차순으로 사이클 속성을 적용한다. Borůvka, Kruskal과 역-삭제 알고리즘은 모든 간선들을 대상으로 하기 때문에 항상 |e| 회 수행된다. 제안된 알고리즘은 첫 번째로, 정점 당 최소 가중치 간선을 2개씩 선택하는 2-간선 연결 그래프를 얻는다. 두 번째로, 2-간선 연결 그래프에 대해 사이클 속성을 적용하여 |e|=|v|-1 일 때 알고리즘을 종료시켰다. 제안된 방법들을 10개의 실제 그래프들에 적용한 결과 모두 최소신장트리를 얻는데 성공하였다. 또한, Borůvka, Kruskal과 역-삭제 알고리즘에 비해 수행 횟수를 60% 단축시켰다.

• 디지털산업정보학회논문지
• /
• 제5권2호
• /
• pp.1-11
• /
• 2009

This study presents HCWS algorithm for researcher grouping on a weighted researcher network. The weights represent intensity of connections among researchers based on the number of co-authors and the number of co-authored research papers. To confirm the validity of the proposed technique, this study conducted an experimentation on about 80 research papers. As a consequence, it is proved that HCWS algorithm is able to bring about more realistic clustering compared with HCS algorithm which presents semantic relations among researchers in simple connections. In addition, it is found that HCWS algorithm can address the problems of existing HCS algorithm; researchers are disconnected since their connections are classified as weak even though they are strong, and vise versa. The technique described in this research paper can be applied to efficiently establish social networks of researchers considering relations such as collaboration histories among researchers or to create communities of researchers.

• 대한수학회논문집
• /
• 제32권3호
• /
• pp.765-778
• /
• 2017

Finding an initial feasible solution on the central path is the main difficulty of feasible interior-point methods. Although, some algorithms have been suggested to remedy this difficulty, many practical implementations often do not use perfectly centered starting points. Therefore, it is worth to analyze the case that the starting point is not exactly on the central path. In this paper, we propose a weighted-path following interior-point algorithm for solving the Cartesian $P_{\ast}({\kappa})$-linear complementarity problems (LCPs) over symmetric cones. The convergence analysis of the algorithm is shown and it is proved that the algorithm terminates after at most $O\((1+4{\kappa}){\sqrt{r}}{\log}{\frac{x^0{\diamond}s^0}{\varepsilon}}\)$ iterations.

• 한국정보처리학회논문지
• /
• 제6권1호
• /
• pp.42-48
• /
• 1999

최단경로를 포함한 어떤 문제를 해결하는데 필요한 정보가 네트워상의 프로세서에 분산되어 있는 상황에서 그들 정보를 교환하면서, 그 문제를 해결하는 알고리즘을 분산알고리즘(Distributed Algorithm)이라고 한다. 본 논문에서는 비동기식 네트워크에서 최단경로문제를 해결하는 분산 알고리즘을 제안한다. 일반적으로 분산 알고리즘은 메시지 복잡도와 이상시간 복잡도로 평가되는데, 본 논문에서 제안하는 분산 알고리즘이 메시지 복잡도와 이상 시간 복잡도는 각각 O(n53)와 O(nln)이다. 여기서, n은 네트상에 있는 프로세서 수를 나타낸다.

• 전기전자학회논문지
• /
• 제26권1호
• /
• pp.67-76
• /
• 2022

In this paper, we propose a new algorithm to improve the accuracy of the Wi-Fi access point (AP) positioning technique. The proposed algorithm based on evaluating the trustworthiness of the signal strength quality of each measurement node is superior to other existing AP positioning algorithms, such as the centroid, weighted centroid, multilateration, and radio distance ratio methods, owing to advantages such as reduction of distance errors during positioning, reduction of complexity, and ease of implementation. To validate the performance of the proposed algorithm, we conducted experiments in a complex indoor environment with multiple walls and obstacles, multiple office rooms, corridors, and lobby, and measured the corresponding AP signal strength value at several specific points based on their coordinates. Using the proposed algorithm, we can obtain more accurate positioning results of the APs for use in research or industrial applications, such as finding rogue APs, creating radio maps, or estimating the radio frequency propagation properties in an area.