• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.663-665
• /
• 2004

Ethernet-based passive optical network(EPON) technology is being considered as a promising solution for next-generation broadband access network. It must have the property of high efficiency, low cost, and support quality of service(QoS). A major feature for this new architecture is the use of a shared transmission media between all connected optical network unit(ONU). Hence, medium access control(MAC) arbitration mechanisms are essential for the successful implementation of EPON. In this paper we propose a simple dynamic bandwidth allocation(DBA) algorithm that improves the performance of network and supports IP-based multimedia applications with the bursty data traffic. In addition, we introduce analytic models of proposed algorithms and prove the system based on our algorithm to be asymptotically stable. Simulation results show the new DBA algorithm provides high bandwidth efficiency and low queueing delay of ONU in EPON.

• 한국정밀공학회지
• /
• 제16권4호통권97호
• /
• pp.138-147
• /
• 1999

For autonomous navigation, a legged robot should be able to walk over irregular terrain and adapt itself to variation of supporting surface. Walking through slope is one of the typical tasks for such case. Robot needs not only to change foot trajectory but also to adjust its configuration to the slope angle for maintaining stability against gravity. This paper suggests such adaptation algorithm for stable walking which uses feedback of reaction forces at feet. Adjusting algorithm of foot trajectory was studied with the estimated angel of slope without visual feedback. A concept of virtual slope angle was introduced to adjust body configuration against slope change of the supporting terrain. Regeneration of foot trajectory also used this concept for maintaining its stable walking against unexpected landing point.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -2
• /
• pp.1041-1044
• /
• 2000

The enhancement to the back-propagation algorithm presented in this paper has resulted from the need to extract sparsely connected networks from networks employing product terms. The enhancement works in conjunction with the back-propagation weight update process, so that the actions of weight zeroing and weight stimulation enhance each other. It is shown that the error measure, can also be interpreted as rate of weight change (as opposed to ${\Delta}W_{ij}$), and consequently used to determine when weights have reached a stable state. Weights judged to be stable are then compared to a zero weight threshold. Should they fall below this threshold, then the weight in question is zeroed. Simulation of such a system is shown to return improved learning rates and reduce network connection requirements, with respect to the optimal network solution, trained using the normal back-propagation algorithm for Multi-Layer Perceptron (MLP), Higher Order Neural Network (HONN) and Sigma-Pi networks.

• Journal of Communications and Networks
• /
• 제9권2호
• /
• pp.185-191
• /
• 2007

Alpha stable distribution is better for modeling impulsive noises than Gaussian distribution in signal processing. This class of process has no closed form of probability density function and finite second order moments. In general, Wiener filter theory is not meaningful in S$\alpha$SG environments because the expectations may be unbounded. We proposed a new adaptive recursive least p-norm Kalman filtering algorithm based on least p-norm of innovation process with infinite variances, and a new robust multiuser detection method based on least p-norm Kalman filtering. The simulation experiments show that the proposed new algorithm is more robust than the conventional Kalman filtering multiuser detection algorithm.

• 한국지능시스템학회논문지
• /
• 제20권4호
• /
• pp.455-462
• /
• 2010

단순하고 스테이블한 머징알고리즘의 비교횟수와 관련된 worst case 복잡도를 분석한다. 복잡도 분석을 통해 소개되는 알고리즘이 m 과 n, $m{\leq}n$ 사이즈의 두 수열에 대해 O(mlog(n/m))의 비교횟수를 요구하는 사실을 증명한다. 그래서 병합에 있어서의 하계가 $\Omega$(mlog(n/m))이라는 사실로부터 우리의 알고리즘이 비교횟수와 관련해 점근적 최적 알고리즘에 해당함 을 추론가능하다. worst case 복잡도 증명을 위해 모든 입력수열로 구성된 정의구역을 두개의 서로소인 집합으로 나눈다. 그런 후 서로소인 각각의 집합으로 부터 특수한 subcase를 구별한 후 이들 subcase 각각에 대해 점근적 최적성을 증명한다. 이 증명을 바탕으로 나머지 모든 경우에 대한 최적성 또한 추론 또는 증명 가능함을 소개한다. 이로써 우리는 복잡도 분석이 까다로운 알고리즘에 대해 투명한 하나의 해를 제시한다.

• 전력전자학회:학술대회논문집
• /
• 전력전자학회 2003년도 춘계전력전자학술대회 논문집(1)
• /
• pp.410-414
• /
• 2003

In this paper, the virtual-reality system is tried to developed, which controls not only the sense of sight and hearing but also the sense of touch, In order to develope the sense of touch in this study, the stable tactual transaction-system, based on summing up the basic algorithm and theory, is embodied. The hardware of this system consists of the 6DOF haptic interface, a controller and a driver In the case of the software, the proxy algorithm is applied for the force-transaction and the mopping algorithm is used for graphic transaction. In addition to this, the imaginary-device driver is utilized for controlling the system and manager-class is also included in this system to manage the position-change and the like. Consequently, the proxy algorithm Is applied, which makes the system possible to be more stable and prompt with and imaginary object. Moreover, the impulse-algorithm is applied to work out a problem which the tactual transaction-period is different from the graphic transaction-period.

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

본 논문은 안정된 결혼문제의 최적 해를 쉽고 빠르게 찾는 알고리즘을 제안하였다. 첫 번째로, 남성의 여성선호도와 여성의 남성 선호도 합 $p_{ij}$의 $n{\times}n$ 정방행렬 할당문제로 변환시킨다. 두 번째로, 행렬에서 최대 선호도 합(최소 값)인 $_{min}p_{ij}$를 선택하고 i행과 j열을 삭제한다. 이 과정을 $i=0{\cap}j=0$일 때까지 수행한다. 세 번째로, 가능한 최초 또는 마지막 선택 $_{min}p_{ij}$에 대해 다른 값으로 변경시 선호도를 증가시킬 수 있으면 상호 교환하는 검증 절차를 수행한다. 제안된 알고리즘을 7개의 안정된 결혼문제에 적용한 결과 기존 알고리즘의 해를 개선하는 효과를 얻었다.

• International Journal of Computer Science & Network Security
• /
• 제23권1호
• /
• pp.140-146
• /
• 2023

Resource allocation is one of the top challenges in Internet of Things (IoT) networks. This is due to the scarcity of computing, energy and communication resources in IoT devices. As a result, IoT devices that are not using efficient algorithms for resource allocation may cause applications to fail and devices to get shut down. Owing to this challenge, this paper proposes a novel algorithm for managing computing resources in IoT network. The fog computing devices are placed near the network edge and IoT devices send their large tasks to them for computing. The goal of the algorithm is to conserve energy of both IoT nodes and the fog nodes such that all tasks are computed within a deadline. A bi-partite graph-based algorithm is proposed for stable matching of tasks and fog node computing units. The output of the algorithm is a stable mapping between the IoT tasks and fog computing units. Simulation results are conducted to evaluate the performance of the proposed algorithm which proves the improvement in terms of energy efficiency and task delay.

• 한국통신학회논문지
• /
• 제19권1호
• /
• pp.131-142
• /
• 1994

본 논문에서는 스칼라 인수 ${\alpha}1,\;{\alpha}2$를 매개변수화하여 갱신항을 첨가한 비선형 적응 알고리즘의 특성을 분석한다. 수렴 특성의 해석에서 평균 필터계수 벡터에 대하여 전이행열의 고유치가 기술된다. 그 알고리즘이 안정하기 위한 범위도 증명된다. 본 알고리즘의 시정수도 유도되고, sign 알고리즘, 기존의 LSM 알고리즘, LFG 알고리즘의 계산량도 비교해 본다. 평균자승의 수렴특성을 해석하고 평균자승 순환식과 초과 평균자승 오차(excess mean square error) 표현식을 유도하고 본 알고리즘이 안정하기 위한 조건도 정한다. 컴퓨터 모의실험(simulation)에서 채널 등화기를 이용하여 QFG 알고리즘의 성능 특성을 보여준다. QFG 알고리즘이 부드러운(smooth) 수렴특성을 가지기 때문에 버스트 오차(error bursting)가 문제가 되는 경우에 유용하다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(4)
• /
• pp.223-226
• /
• 2000

In this paper, we report detects system algorithm, adapted a perimetric mask and a generalized symmetry system, to detect a transformable material and find out a minute error cannot be noticed by a naked eye. In this thesis, supposed a stable detecting system applied a general image processing theory and perimetric mash algorithm to detect badness. And finally, detected some vague errors with the application of symmetry transform algorithm that accumulate a symmetry of minute error and put stress on it.