• 한국통신학회논문지
• /
• 제25권9A호
• /
• pp.1405-1412
• /
• 2000

In this paper, we propose an efficient dynamic wavelength assignment algorithm in distributed WDM (Wavelength-Division Multiplexing) networks without wavelength conversion. The algorithm tries to assign a locally-most-used wavelength distributedly on a fixed routing path. We first formulate our algorithm by using the concept of a sample space which consists of optical fibers connected to nodes on a routing path of a lightpath to be assigned a wavelength. In particular, we analyze the blocking performance mathematically as compared with that of the most-used (MU) wavelength assignment algorithm previously proposed for WDM networks under centralized control. We also obtain numerical results by simulation on the blocking performance of other centralized/distributed wavelength assignment algorithms as well as our algorithm using the M/M/c/c dynamic traffic model. Consequently, we show that analytical results match simulation results and that our algorithm is efficient in distributed WDM networks in terms of blocking performance, control traffic overhead and computation complexity.

• 한국산학기술학회논문지
• /
• 제11권4호
• /
• pp.1248-1253
• /
• 2010

본 논문은 SDS-TWR(Symmetric Double-Sided Two-Way Ranging)의 Ranging 오차를 보정하기 위하여 균등거리비율 개념을 적용한 위치인식 보정 알고리즘인 AEDR(Algorithm for localization using the concept of Equivalent Distance Rate)을 제안하고, 위치인식 실험을 통해 위치인식 측정 성능을 분석하였다. SDS-TWR의 Ranging 오차는 실험에 의하면 비콘노드와 이동노드의 특정 거리구간에서 평균 1m~8m로 측정되었다. 그러나 제안한 AEDR에 의한 위치인식 성능은 실험을 통해 전체적으로 교내 강당과 복도 모두에서 SDS-TWR 보다 4배 정도 우수하였으며, 측정된 3~10m 이상의 위치인식 오차를 평균 2m 내외로, 3m 이내의 위치인식 오차를 평균 1m 내외로 각각 감소시킬 수 있음을 확인하였다. 특히 AEDR은 LOS(Line Of Sight) 보다 NLOS(Non Line Of Sight)에서 훨씬 더 위치인식 보정 성능이 우수함을 나타내며, 대부분의 센서 네트워크의 환경이 NLOS임을 고려할 때 AEDR이 실제환경에서의 위치인식에 큰 도움을 줄 수 있다고 판단된다.

• Journal of Information Processing Systems
• /
• 제7권2호
• /
• pp.271-286
• /
• 2011

In this paper, we propose efficient algorithms for parallel prefix computation and sorting on a recursive dual-net. The recursive dual-net $RDN^k$(B) for k > 0 has $(2n_o)^{2K}/2$ nodes and $d_0$ + k links per node, where $n_0$ and $d_0$ are the number of nod es and the node-degree of the base-network B, respectively. Assume that each node holds one data item, the communication and computation time complexities of the algorithm for parallel prefix computation on $RDN^k$(B), k > 0, are $2^{k+1}-2+2^kT_{comm}(0)$ and $2^{k+1}-2+2^kT_{comp}(0)$, respectively, where $T_{comm}(0)$ and $T_{comp}(0)$ are the communication and computation time complexities of the algorithm for parallel prefix computation on the base-network B, respectively. The algorithm for parallel sorting on $RDN^k$(B) is restricted on B = $Q_m$ where $Q_m$ is an m-cube. Assume that each node holds a single data item, the sorting algorithm runs in $O((m2^k)^2)$ computation steps and $O((km2^k)^2)$ communication steps, respectively.

• International Journal of Precision Engineering and Manufacturing
• /
• 제5권3호
• /
• pp.62-68
• /
• 2004

Effectiveness of a corrective machining algorithm, which can construct the proper machining information to improve motion errors utilizing measured motion errors, is verified experimentally in this paper, Corrective machining process is practically applied to single and double side hydrostatic bearing tables. Lapping process is applied as a machining method. The machining information is obtained from the measured motion errors by applying the algorithm, without any information on the rail profile. In the case of the single-side table, after 3 times of corrective remachining, linear and angular motion errors are improved up to 0.13 $\mu\textrm{m}$ and 1.40 arcsec from initial error of 1.04 $\mu\textrm{m}$ and 22.71 arcsec, respectively. In the case of the double-side table, linear and angular motion error are improved up to 0.07 /$\mu\textrm{m}$ and 1.42 arcsec from the initial error of 0.32 $\mu\textrm{m}$ and 4.14 arcsec. The practical machining process is performed by an unskilled person after he received a preliminary training in machining. Experimental results show that the corrective machining algorithm is very effective and easy to use to improve the accuracy of hydrostatic tables.

• Transactions on Control, Automation and Systems Engineering
• /
• 제4권3호
• /
• pp.224-230
• /
• 2002

In this paper, a counting algorithm hybridized with an adaptive automatic thresholding method based on Otsu's method and the algorithm that elongates markers obtained by the well-known watershed algorithm is proposed to enhance the exactness of the microcell counting in microscopic images. The proposed counting algorithm can be stated as follows. The transformed full image captured by CCD camera set up at microscope is divided into cropped images of m$\times$n blocks with an appropriate size. The thresholding value of the cropped image is obtained by Otsu's method and the image is transformed into binary image. The microbial cell images below prespecified pixels are regarded as noise and are removed in tile binary image. The smoothing procedure is done by the area opening and the morphological filter. Watershed algorithm and the elongating marker algorithm are applied. By repeating the above stated procedure for m$\times$n blocks, the m$\times$n segmented images are obtained. A superposed image with the size of 640$\times$480 pixels as same as original image is obtained from the m$\times$n segmented block images. By labeling the superposed image, the counting result on the image of microbial cells is achieved. To prove the effectiveness of the proposed mettled in counting the microbial cell on the image, we used Acinetobacter sp., a kind of ammonia-oxidizing bacteria, and compared the proposed method with the global Otsu's method the traditional watershed algorithm based on global thresholding value and human visual method. The result counted by the proposed method shows more approximated result to the human visual counting method than the result counted by any other method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권10호
• /
• pp.3789-3809
• /
• 2015

In this paper, we deal with the problem of M2M gateways' network selection for different types of M2M traffic in heterogeneous wireless networks. Based on the difference in traffic's quality of service (QoS) requirements, the M2M traffic produced by various applications is mainly classified as two categories: flexible traffic and rigid traffic. Then, game theory is adopted to solve the problem of network-channel selection with the coexistence of flexible and rigid traffic, named as flexible network access (FNA). We prove the formulated discrete game is a potential game. The existence and feasibility of the Nash equilibrium (NE) of the proposed game are also analyzed. Then, an iterative algorithm based on optimal reaction criterion and a distributed algorithm with limited feedback based on learning automata are presented to obtain the NE of the proposed game. In simulations, the proposed iterative algorithm can achieve a near optimal sum utility of whole network with low complexity compared to the exhaustive search. In addition, the simulation results show that our proposed algorithms outperform existing methods in terms of sum utility and load balance.

• 대한산업공학회지
• /
• 제30권3호
• /
• pp.250-260
• /
• 2004

This study considers a linear connected-(r,s)-out-of-(m,n):F lattice system whose components are ordered like the elements of a linear (m,n )-matrix. We assume that all components are in the state 1 (operating) or 0 (failed) and identical and s-independent. The system fails whenever at least one connected (r,s)-submatrix of failed components occurs. The purpose of this paper is to present an optimization scheme that aims at minimizing the expected cost per unit time. To find the optimal threshold of maintenance intervention, we use a genetic algorithm for the cost optimization procedure. The expected cost per unit time is obtained by Monte Carlo simulation. The sensitivity analysis to the different cost parameters has also been made.

• ETRI Journal
• /
• 제29권6호
• /
• pp.769-778
• /
• 2007

This paper proposes a multiplication algorithm for $F_{p^m}$, which can be efficiently applied to many pairs of characteristic p and extension degree m except for the case that 8p divides m(p-1). It uses a special class of type- Gauss period normal bases. This algorithm has several advantages: it is easily parallelized; Frobenius mapping is easily carried out since its basis is a normal basis; its calculation cost is clearly given; and it is sufficiently practical and useful when parameters k and m are small.

• 한국산학기술학회논문지
• /
• 제11권9호
• /
• pp.3571-3577
• /
• 2010

본 논문에서는 예상 위치좌표 탐색기법과 이를 균등거리비율 개념인 AEDR(Algorithm for localization using the concept of Equivalent Distance Rate)에 적용한 위치인식 보정 알고리즘인 E&E(Equivalent distance rate & Estimated location coordinator exploration)를 제안 한 후 실험을 통해 성능을 분석하였다. 실험결과, E&E는 4개의 시나리오에서 SDS-TWR의 위치인식 보정성능을 0.60m에서 0.34m로 0.26m 만큼 향상시켰고, E&E는 설정된 시나리오에 따라 기존에 제안된 AEDR과 비교한 결과 위치인식 보정 성능비율이 최대 15% 만큼 우수함을 확인하였다. 또한 E&E의 전체 성능실험 중 99%에서 위치인식 오차가 1m 이내로 측정되었는데 이 정도의 위치인식 보정 성능이라면 제안하는 알고리즘인 E&E는 다양한 위치인식 응용분야에 충분히 적용 가능 할 것으로 판단된다.

• 한국인터넷방송통신학회논문지
• /
• 제15권2호
• /
• pp.23-29
• /
• 2015

$a^b{\equiv}c$(mod p)에서 a,c,p가 주어졌을 때 b를 구하는 이산대수 문제를 푸는 아기걸음-거인걸음 알고리즘은 p를 $m={\lceil}{\sqrt{p}}{\rceil}$개의 원소를 가진 m개의 블록으로 분할하고 거인 1명이 보폭 m으로 단방향으로만 $a^0$로 걸어가면서 찾는 방법이다. 본 논문은 기본적으로 p를 p/l, $a^l$ > p로 분할하고, 성인 1명이 보폭 l로 단방향으로 걸어가는 방법으로 변형시켰다. 또한, 성인 $2^k$명이 동시에 걸어가면서 b를 빠르게 찾는 방법으로 확장시켰다. 제안된 알고리즘을 $1{\leq}b{\leq}p-1$의 범위에서 $2^k$, (k=2)를 적용한 결과 기본적인 성인걸음수의 1/4로 감소시키는 효과를 얻었다. 결론적으로, 제안된 알고리즘은 아기걸음-거인걸음 알고리즘의 보폭 수를 획기적으로 단축시킬 수 있었다.