• Title/Summary/Keyword: Dynamic Link

Search Result 712, Processing Time 0.024 seconds

Optimal Controller Design of One Link Inverted Pendulum Using Dynamic Programming and Discrete Cosine Transform

  • Kim, Namryul;Lee, Bumjoo
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.5
    • /
    • pp.2074-2079
    • /
    • 2018
  • Global state space's optimal policy is used for offline controller in the form of table by using Dynamic Programming. If an optimal policy table has a large amount of control data, it is difficult to use the system in a low capacity system. To resolve these problem, controller using the compressed optimal policy table is proposed in this paper. A DCT is used for compression method and the cosine function is used as a basis. The size of cosine function decreased as the frequency increased. In other words, an essential information which is used for restoration is concentrated in the low frequency band and a value of small size that belong to a high frequency band could be discarded by quantization because high frequency's information doesn't have a big effect on restoration. Therefore, memory could be largely reduced by removing the information. The compressed output is stored in memory of embedded system in offline and optimal control input which correspond to state of plant is computed by interpolation with Inverse DCT in online. To verify the performance of the proposed controller, computer simulation was accomplished with a one link inverted pendulum.

A study on link-efficiency and Traffic analysis for Packet-switching using the link state algorithm (링크상태 알고리즘을 이용한 패킷스위칭의 트래픽분석과 링크효율에 관한 연구)

  • 황민호;고남영
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.1
    • /
    • pp.30-35
    • /
    • 2002
  • Dynamic routing uses routing protocols to select the best routes and to update the routing table. RP (Routing Information Protocol)using a distance-vector algorithm becomes generally known a routing protocol on the network. RIP selects the route with the lowest "hop count" (metric) as the best route. but RIP has a serious shortcoming. a mP router cannot maintain a complete routing table for a network that has destinations more than 15 hops away. To overcome this defect, It uses the OSPF (Open Shortest Path First) of link -state protocols developed for TCP/IP. It is suitable for very large networks and provides several advantages over RIP. This paper analyzes the traffic and the link efficiency between two protocols such as message delivery and delay, link utilization, message counts on the same network.e network.

Experimental investigation of a new steel friction device with link element for seismic strengthening of structures

  • Papadopoulos, Panikos K.;Salonikios, Thomas N.;Dimitrakis, Stergios A.;Papadopoulos, Alkis P.
    • Structural Engineering and Mechanics
    • /
    • v.46 no.4
    • /
    • pp.487-504
    • /
    • 2013
  • In the present work a new friction device, with a set of single or double rotational friction flanges and a link element, is described and tested. The mechanism may be applied for the strengthening of existing r/c or steel buildings as well as in new constructed buildings. The device has selectable variable behavior in different levels of displacement and an interlock mechanism that is provided by the link element. The link element may be designed to lock at preselected level of displacement, offering in this way an extra safety reserve against strong earthquakes. A summary of the existing literature about other similar mechanisms is initially presented in this paper. The proposed mechanism is presented and described in details. Laboratory experiments are presented in detail and the resulted response that proves the efficiency of the mechanism at selectable levels of strength capacity is discussed. Drawings of the mechanism attached to a r/c frame with connection details are also included. Finally a dynamic analysis of two r/c frames, with and without the proposed mechanism attached, is performed and the resulted response is given. The main conclusion is that the proposed mechanism is a cheap and efficient devise for the improvement of the performance of new or existing framed buildings to seismic loads.

Dynamic Channel Allocation Algorithm for TD-SCDMA Smart Antenna System with Inter-cell Interference (인접 셀 간섭영향을 고려한 TD-SCDMA 스마트 안테나 시스템의 동적 채널 할당 알고리즘)

  • Jang, Min-Seok;Hong, Een-Kee
    • Journal of Advanced Navigation Technology
    • /
    • v.11 no.4
    • /
    • pp.415-422
    • /
    • 2007
  • In this paper, we proposed a new dynamic channel allocation algorithm for TD-SCDMA with cross time slots. In order to reduce the interference in cross time slot, the mobile stations (MSs) are divided into two groups: the Near Group consisting of MSs near by the base station(BS) and the Far Group including the MSs far from the BS. The reverse link for MSs in the Near Group and forward link for MSs in the Far Group are allocated to the cross time slot. In cellular systems, a BS has multiple neighbor BSs. Some of neighbor BSs can operate in the same direction link while the others have cross time slot. Thus, it is required to determine which BS has the most significant impact in terms of interference. We divide each cell into 6 areas based on the direction of arrival of smart antenna and the most significant neighbor sector is determined with this division. The proposed allocation method and area division method can avoid the severe interference in cross time slots and increase the system capacity about 2%~9% compared to FCA, and 0.5%~1.3% compared to RCA.

  • PDF

Performance Evaluation of Multiservice Network Switch for Dynamic Constant-and Adaptive-rate Services (동적인 고정 및 가변 전송을 서비스를 위한 다중 서비스 네트워크 스위치의 성능 분석)

  • Lee, Tae-Jin
    • The KIPS Transactions:PartC
    • /
    • v.9C no.3
    • /
    • pp.399-406
    • /
    • 2002
  • We consider design of multiservice network link, in which connections of constant- and adaptive-rate services arrive and leave dynamically. We propose performance analysis and design methods of these dynamic multiservice networks. A multiservice network link is modeled by a Markov chain, and data rates for adaptive-rate connections are derived using QBD (Quasi-Birth-Death) processes and matrix-geometric equations. We estimate average number of adaptive-rate connections, average data rate and average connection delay. The performance of constant-rate connections is determined from the blocking probability of the connections. Based on the performance of constant-and adaptive- rate connections, we propose a design methods of a network link to satisfy performance requirements of constant- and adaptive-rate connections (data rates, delay, blocking probability). Our methods can be used for the analysis and design of network switch supporting dynamic data and voice (video) traffic simultaneously.

Dynamic Routing and Wavelength Assignment Algorithm to Improve Energy Efficiency in IP over WDM Network with Multifiber (다중 광섬유 링크를 갖는 IP over WDM 망에서 에너지 효율 향상을 위한 동적 경로 배정 및 파장 할당 알고리즘)

  • Lee, Ki-Beom;Kang, Keun-Young;Kim, Do Young;Kim, Young-Chon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.4
    • /
    • pp.370-379
    • /
    • 2014
  • Recently, the interest in optical network with multifiber link is continuing to rise since the network traffic has been growing exponentially. However, growing traffic in network leads to increasing the energy consumption of the network equipment. In this paper, we propose a dynamic routing and wavelength assignment (RWA) algorithm based on V-like cost function and layered graph to improve energy efficiency in IP over WDM network with multifiber link. The V-like cost function is used to decide the fiber cost according to the number of used wavelengths. The layered graph with multifiber link is used to select the energy efficient route and wavelength. The proposed RWA algorithm is compared and analyzed with conventional algorithm in view of average power consumption and blocking probability through OPNET modeler.

Solution Methods for OD Trip Estimation in Stochastic Assignment (확률적 통행배정하에서 기종점 통행량추정 모형의 개발)

  • Im, Yong-Taek
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.4 s.90
    • /
    • pp.149-159
    • /
    • 2006
  • Traditional trip tables are estimated through large-scale surveys such as household survey, roadside interviews, and license Plate matching. These methods are, however, expensive and time consuming. This paper presents two origin-destination (OD) trip matrix estimation methods from link traffic counts in stochastic assignment, which contains perceived errors of drivers for alternatives. The methods are formulated based on the relation between link flows and OD demands in logit formula. The first method can be expressed to minimize the difference between observed link flows and estimated flows, derived from traffic assignment and be solved by gradient method. The second method can be formulated based on dynamic process, which nay describe the daily movement patterns of drivers and be solved by a recursive equation. A numerical example is used for assessing the methods, and shows the performances and properties of the models.

Implementation of a Adaptive Learning System Supporting Dynamic Link (동적 링크를 지원하는 적응형 학습시스템의 구현)

  • Lee, Jaemu;Kim, Dugyu
    • Journal of The Korean Association of Information Education
    • /
    • v.16 no.3
    • /
    • pp.275-282
    • /
    • 2012
  • Existing web based learning system provides various instruction paths. However, learners are provided with the same instruction content with little consideration of each learner's learning style. Therefore, Current Web based learning is lacking as a system that encourages individual learning, by failing to provide for proper instruction methods for each learner. This prototype system can find the most effective way of learning for each learner by analyzing a learner's learning. It also provides content based on the most effective instruction method for the learner taking into consideration learning style. Especially, this proposed adaptive learning system supporting dynamic link by learning style by evaluation for each steps of leaning process.

  • PDF

Multi-layer restoration strategy to restore the multi-link and node failures in DCS mesh networks (DCS mesh 네트워크에서 다중 선로 장애와 노드 장애를 복구하기 위한 다중 계층 복구 전략)

  • 김호진;조규섭;이원문
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.12
    • /
    • pp.2744-2754
    • /
    • 1997
  • Recently, the Multi-Layer Restoration(MLR) algorithm was proposed by British Telecom(BT) to restore the network failures in Digital Cross-connect System(DCS) mesh survival network[1, 2]. This algorithm has multi restoration stage which is composed of the pre-planned and dynamic restoration. This algorithm is effective its ability in link or node failures. This reason is that it does not restore in the pre-planned rstoration stage but in dynamic restoration stage. In this paper, we propose the MLR with pre-planned Multi-Chooser(PMC) and successive restoration ratio algorithm. This proposed algorithm has a excellent performance for restortion time and ratio, spare channel availability and fast restoration from multiple link failure or node failure. This paper proposed the modeling and restoration algorithm, and analyzed the performance of the algorithm by simulation using OPNET(OPtimized Network Engineering Tools).

  • PDF

Adaptive Link Quality Estimation in Wireless Sensor Networks (무선 센서 네트워크에서 가변주기를 이용한 적응적인 전송파워 제어 기법)

  • Lee, Jung-Wook;Chung, Kwang-Sue
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.11
    • /
    • pp.1081-1085
    • /
    • 2010
  • In the wireless sensor networks, power consumption and interference among the nodes can be reduced by using the transmission power control. Because link quality is changed by spatial and temporal effect, link failures are frequently occurred. In order to adapt to link quality variation, existing transmission power control schemes broadcast beacon messages periodically to neighbor nodes and control the transmission power dynamically. However, it can effect on the time and energy overhead according to period of transmission power control. In this paper, the dynamic method of transmission power control by the link quality variation and variable period are proposed. When a link quality is unstable, the control duty cycle is reduced and the link quality is agilely maintained. In contrast, when link quality is stable, the control period is increased and control overhead is decreased.