• Title/Summary/Keyword: Assignment

Search Result 2,551, Processing Time 0.027 seconds

Overlapping Decentralized Robust EA Control Design for an Active Suspension System of a Full Car Model (전차량의 능동 현가 장치 제어를 위한 중복 분산형 견실 고유구조지정 제어기 설계)

  • 정용하;최재원;김영호
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.217-217
    • /
    • 2000
  • A decentralized robust EA(eigensoucture assignment) controller is designed for an active suspension system of a vehicle based on a full car model with 7-degree of freedom. Using overlapping decomposition, the full car model is decentralized by two half car models. For each half car model, a robust eigenstructure assignment controller can be obtained by using optimization approach. The performance of the decentralized robust EA controller is compared with that of a conventional centralized EA controller through computer simulations.

  • PDF

Dynamic Channel Reservation for Mobility Prediction Handover

  • Kim, Hoon-ki;Jung, Jae-il
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1463-1466
    • /
    • 2002
  • This paper suggests the effective channel assignment scheme for mobility prediction handover. For maintaining required quality of service (QoS) during handover, there are handover algorithms these reserve the channel where the movement is predicted. But channel assignment schemes these have been studied are not considered mobility prediction handover. This paper suggests the channel assignment scheme that considers mobility predicted handover. The suggested algorithm maintains dropping probability of handover calls, decreases blocking probability of new calls and increases channel utilization.

  • PDF

An Integer Programming Model for the Rolling Stock Assignment Plan (철도차량 할당계획을 위한 정수계획법모형)

  • 김성호;홍순흠
    • Proceedings of the KSR Conference
    • /
    • 2002.10a
    • /
    • pp.349-356
    • /
    • 2002
  • This paper describes a mathematical programming model for constructing the rolling stock assignment plan. This plan is a schedule which assigns daily routings, maintenance activities, and other tasks to trainsets. A generalized set partitioning model which is a kind of integer programming model is suggested as a model for constructing the assignment plan. And a column generation method are suggested as a solution method.

  • PDF

A Modified Hopfield Network and It's application to the Layer Assignment (Hopfield 신경 회로망의 개선과 Layer Assignment 문제에의 응용)

  • 김규현;황희영;이종호
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.40 no.2
    • /
    • pp.234-237
    • /
    • 1991
  • A new neural network model, based on the Hopfield crossbar associative network, is presented and shown to be an effective tool for the NP-Complete problems. This model is applied to a class of layer assignment problems for VLSI routing. The results indicate that this modified Hopfield model, improves stability and accuracy.

  • PDF

A Dynamic Channel Allocation Algorithm Based on Time Constraints in Cellular Mobile Networks

  • Lee Seong-Hoon
    • International Journal of Contents
    • /
    • v.1 no.2
    • /
    • pp.31-34
    • /
    • 2005
  • The new realtime applications like multimedia and realtime services in a wireless network will be dramatically increased. However, many realtime services of mobile hosts in a cell cannot be continued because of insufficiency of useful channels. Conventional channel assignment approaches didn't properly consider the problem to serve realtime applications in a cell. This paper proposes a new realtime channel assignment algorithm based on time constraint analysis of channel requests. The proposed algorithm dynamically borrows available channels from neighboring cells. It also supports a smooth handoff which continuously serves realtime applications of the mobile hosts.

  • PDF

Assignment of the Redox Potentials of Cytochrome c₃of Desulfovibrio vulgaris Hildenborough by ¹H NMR

  • 박장수;강신원;신정휴
    • Bulletin of the Korean Chemical Society
    • /
    • v.16 no.10
    • /
    • pp.968-971
    • /
    • 1995
  • The heme assignment of the 1H NMR spectrum of cytochrome c3 of Desulfovibrio vulgaris Hildenborough within the X-ray structure were fully cross established according to their redox potential. The major reduction of the heme turned out to take place in the order of hemes Ⅳ,Ⅰ,Ⅱ and Ⅲ(the heme numbers indicating the order of bonding to the primary sequence). This assignment can provide the physicochemical basis for the elucidation of electron transfer of this protein.

A Real-Time Algorithm for Timeslot Assignment in ISM System with DVB-RCS

  • Lee, Ik-Sun;Sung, Chang-Sup;Jin, Gwang-Ja;Han, Ki-Seop
    • ETRI Journal
    • /
    • v.29 no.3
    • /
    • pp.329-335
    • /
    • 2007
  • This paper considers a timeslot assignment problem in an interactive satellite multimedia (ISM) system with digital video broadcast-return channel via satellite (DVB-RCS). The timeslot assignment problem is formulated as a binary integer programming to maximize the overall weighted throughput and is shown to be NP-hard. Thus, three real-time heuristic algorithms including ratio-based, packet-size (PS)-based, and transmission gain (TG)-based are derived, and some computational experiments are made. Considering the results, the ratio-based heuristic algorithm is demonstrated to be the most effective and efficient. We propose adapting the ratio-based heuristic algorithm to the timeslot assignment problem to greatly improve the ISM system utilization.

  • PDF

A Concept on Seat Assignment Systems

  • Premasathian, Nol;Tantipisankul, Tasanee;Sinapiromsaran, Charoen
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.458-461
    • /
    • 2003
  • This paper presents a concept on seat assignment systems. The concept is based on the assumption that customers or passengers prefer to select seats at their own choosing and allowing them to do so would fragment remaining seats. This undesirable condition may make a group of people intending to be seated together unable to find a sufficient number of consecutive seats. The concept proposed is to set aside a number of seats when the map of available seats is shown for customer's selection. A number of functions are created to allot seats to be visible for choosing according to the number and locations of the remaining seats and the number in the group of the passengers. Passengers' preferences such as window or aisle seating, front seating are taken into accounts. A primitive example of seat assignment system of a Boeing 717 aircraft, assuming the number of passengers in a group being 1, 2 or 3, is given based on the concept.

  • PDF

Neural Network Method for Efficient channel Assignment of Cellular Mobile Radio Network (셀룰러 이동 통신망의 효율적인 채널할당을 위한 신경회로망 방식의 적용)

  • 김태선;곽성식;이종호
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.10
    • /
    • pp.86-94
    • /
    • 1993
  • This paper presents the two-stage neural network method for efficient channel assignment of cellular mobile radio network. The first stage decomposes the region into non-adjacent groups of cells and the second stage assigns channels to the decomposed groups. The neural network model is tested with an experimental system of eighteen channels dedicated for nineteen hexagonal-cell region. When radom call requests of average density of 2 Erl/Cell to 8 Erl/Cell are presented, the real-time channel assignment method reduces the call-blocking rate up to 16% against the existing SCA(Static Channel Assignment) method.

  • PDF

Parametric Approaches for Eigenstructure Assignment in High-order Linear Systems

  • Duan Guang-Ren
    • International Journal of Control, Automation, and Systems
    • /
    • v.3 no.3
    • /
    • pp.419-429
    • /
    • 2005
  • This paper considers eigenstructure assignment in high-order linear systems via proportional plus derivative feedback. It is shown that the problem is closely related with a type of so-called high-order Sylvester matrix equations. Through establishing two general parametric solutions to this type of matrix equations, two complete parametric methods for the proposed eigenstructure assignment problem are presented. Both methods give simple complete parametric expressions for the feedback gains and the closed-loop eigenvector matrices. The first one mainly depends on a series of singular value decompositions, and is thus numerically very simple and reliable; the second one utilizes the right factorization of the system, and allows the closed-loop eigenvalues to be set undetermined and sought via certain optimization procedures. An example shows the effect of the proposed approaches.