• Title/Summary/Keyword: Assignment System

Search Result 865, Processing Time 0.032 seconds

Computer automated tolerance assignment system for CAPP (CAPP를 위한 자동 공차 설정에 관한 연구)

  • 김고중;정무영
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10a
    • /
    • pp.901-905
    • /
    • 1992
  • The manual procedure of drafting engineering design is fast becoming obsolete. One of the important areas in CAPP is to automate tolerance assignment which is encountered in mechanical part design. This paper presents an approach for automating tolerance assignment using CAD database and tolerancing database in CAD drawing. The system is consisted of four major functions feasture extraction, feaure inferencing, rule-based tolerance allocation, and automatic upating. Auto CAD R.II is employed as CAD system and a computer progran is developed by using Auto LISP on PC-386.

  • PDF

A Study on Multi-agent based Task Assignment Systems for Virtual Enterprise (가상기업을 위한 멀티에이전트 기반 태스크할당시스템에 관한 연구)

  • 허준규;최경현;이석희
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.12 no.3
    • /
    • pp.31-37
    • /
    • 2003
  • With the paradigm shifting from the principal of manufacturing efficiency to business globalism and rapid adaptation to its environments, more and more enterprises are being virtually organized as manufacturing network of different units in web. The formation of these enterprise called as Virtual Enterprise(VE) is becoming a growing trend as enterprises concentrating on core competence and economic benefit. 13us paper proposes multi-agent based task assignment system for VE, which attempts to address the selection of individually managed partners and the task assignment to them A case example is presented to illustrate how the proposed system can assign the task to partners.

Duplication with Task Assignment in Mesh Distributed System

  • Sharma, Rashmi;Nitin, Nitin
    • Journal of Information Processing Systems
    • /
    • v.10 no.2
    • /
    • pp.193-214
    • /
    • 2014
  • Load balancing is the major benefit of any distributed system. To facilitate this advantage, task duplication and migration methodologies are employed. As this paper deals with dependent tasks (DAG), we used duplication. Task duplication reduces the overall schedule length of DAG along-with load balancing. This paper proposes a new task duplication algorithm at the time of tasks assignment on various processors. With the intention of conducting proposed algorithm performance computation; simulation has been done on the Netbeans IDE. The mesh topology of a distributed system is simulated at this juncture. For task duplication, overall schedule length of DAG is the main parameter that decides the performance of a proposed duplication algorithm. After obtaining the results we compared our performance with arbitrary task assignment, CAWF and HEFT-TD algorithms. Additionally, we also compared the complexity of the proposed algorithm with the Duplication Based Bottom Up scheduling (DBUS) and Heterogeneous Earliest Finish Time with Task Duplication (HEFT-TD).

A Method for Optimal Power Assignment of the Transponder Input Carriers in the Multi-level & Multi-bandwidth System (Multi-level & Multi-bandwidth 시스템에서 위성중계기 입력반송파 전력의 최적 할당 기법)

  • 김병균;최형진
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.9
    • /
    • pp.1167-1176
    • /
    • 1995
  • This paper suggests a method for optimal power assignment of the satellite transponder input carriers in the Multi-level & Multi-bandwidth system. The interference and the noise effects analyzed for the optimal power assignment are intermodulation product caused by the nonlinear transponder characteristics, adjacent channel interference, co-channel interference, and thermal noise in the satellite link. The Fletcher- Powell algorithm is used to determine the optimal input carrier power. The performance criteria for optimal power assignment is classified into 4 categories according to the CNR of destination receiver earth station to meet the requirement for various satellite link environment. We have performed mathematical analysis of objective functions and their derivatives for use in the Fletcher-Powell algorithm, and presented various simulation results based on mathematical analysis. Since the satellite link, it is meaningful to model and analyze these effects in a unified manner and present the method for optimal power assignment of transponder input carriers.

  • PDF

A Study on the Optimal Gate Assignment with Transit Passenger in Hub Airport (허브 공항의 환승객을 고려한 최적 주기장 배정에 관한 연구)

  • Lee Hui Nam;Lee Chang Ho
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.402-408
    • /
    • 2003
  • Now many major airports in the world which operate strategic alliance or Hub & Spoke system have met capacity restriction and confusion problems. And the time and the walking distance for boarding to flight are important standard to measure customer convenience. And the effective gate assignment guarantees customers convenience as well as increasing airport capacity without expanding established airport equipments. So it can be a major concern to manage airports. So this paper formulate gate assignment problem in the hub airport not quadratic assignment problem but a improved single-period integer problem which is minimize local and transit passengers I walking distance. As a result, this study will present a method producing optimal gate assignment result using optimization software. We use real flights and gates data in the national airport, so we will compare a assignment results with a real airport assignment results and previous researches and analyze those results.

  • PDF

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

Frequency domain properties of EALQR with indefinite Q (비한정 Q를 갖는 EALQR의 주파수역 특성 해석)

  • Seo, Yeong-Bong;Choe, Jae-Won
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.5 no.6
    • /
    • pp.676-682
    • /
    • 1999
  • A study which develops a controller design methodology that has flexibility of eigenstructure assignment within the stability-robustness contraints of LQR is requried and has been performed. The previously developd control design methodology, namely, EALQR(Eigenstructure Assignment/LQR) has better performance than that of conventional LQR or eigenstructure assignment but has a constraint for the weitgting matrix in LQR, which could be indefinite for high-order system. In this paper, the effects of the indefinite Q in EALQR on the frequency domain properties are analyzed. The robustness criterion and quantitative frequency domain properties are also resented. Finally, the frequency domain properties of EALQR has been analyzed by applying to a flight control system design example.

  • PDF

Robust pole assignment inside a disk of uncertain linear system (불확정성 선형시스템의 원판내 강인 극점배치)

  • Park, Sang-Min;Kim, Jin-Hoon;Ryu, Jeong-Woong
    • Proceedings of the KIEE Conference
    • /
    • 1997.07b
    • /
    • pp.431-433
    • /
    • 1997
  • In this paper, we consider the robust pole assignment inside the circular region for linear systems with time-varing uncertainty. The considered uncertainties are the norm bounded uncertainty and the matrix polytopes type uncertainty. Since the considered uncertainties are time-varying, it should remind that the closed loop system be time-varing system. Therefore, we should consider not only the pole assignment but also the stability. We present new conditions that guarantee the robust pole assignment and the robust stability. Finally, we show the usefulness of our results by an example.

  • PDF

A pole assignment method in a specified disk

  • Nguyen, van-Giap;Kim, Sang-Bong
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.601-604
    • /
    • 1997
  • In this paper, a pole assignment problem in the unit disk for a linear discrete system is discussed. The analysis is based on the Luenberger's canonical form and Gershgorin's disk. The proposed method for pole assignment is convenient for a linear time invariant discrete system.

  • PDF

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