• 제목/요약/키워드: Worst case

검색결과 794건 처리시간 0.027초

최악의 대기 조건 하의 공기조력 비행선 운전 (Aeroassisted Orbital Maneuvering in a Worst-Case Atmosphere)

  • 이병수
    • 제어로봇시스템학회논문지
    • /
    • 제6권10호
    • /
    • pp.936-941
    • /
    • 2000
  • Advanced space transportation systems, such as the National Aerospace Plane or an Orbital Transfer Vehicle, have atmospheric maneuvering capabilities. For such vehicles the use of aeroassisted orbital transfer from a high Earth orbit to a low Earth orbit, with unpowered flight in the atmosphere, has the potential for significant fuel savings compared to exoatmospheric Hohmann transfer. However, to exploit the fuel savings that can be achieved by using the Earths atmosphere to reduce the vehicles energy, a guidance law is required, and it must be able to handle large unpredictable fluctuations in atmospheric density, on the order of ${\pm}$50% relative to the 1962 US Standard Atmosphere. In this paper aeroassisted orbital transfer is considered as a differential game, with Nature controlling the atmosphere density to yield a worst case (min-max fuel required) atmosphere, from which the guaranteed playable set boundary are achieved. Inside the playable set, it is guaranteed that the vehicle achieves the optimal atmospheric exit condition for the minimum fuel consumption regardless of the atmospheric density variations.

  • PDF

두단계 조립시스템에서의 일정계획문제에 관한 소고 (A Note on the Scheduling Problem in the Two-stage Assembly-type Flowshop)

  • 윤상흠;김호준;권수태
    • 산업경영시스템학회지
    • /
    • 제27권2호
    • /
    • pp.24-28
    • /
    • 2004
  • This paper considers a scheduling problem concerned with an assembly system where two components are first treated In their own parallel machines and then pulled to be assembled into a final product at a single assembly machine. The objective measure is the mean completion time of jobs(a finite number of products). Through characterizing solution properties, we obtain the worst case error bounds of an arbitrary permutation and a SPT based heuristic.

차량용 볼조인트의 최악 조건을 고려한 강건 설계 (Robust Design of an Automobile Ball Joint Considering the Worst-Case Analysis)

  • 신봉수;김성욱;김종규;이권희
    • 한국기계가공학회지
    • /
    • 제16권1호
    • /
    • pp.102-111
    • /
    • 2017
  • An automobile ball joint is the element for connecting the control arm and the knuckle arm, allowing rotational motion. The ball joint consists of the stud, plug, socket, and seat. These components are assembled through the caulking process that consists of plugging and spinning. In the existing research, the pull-out strength and gap stiffness were calculated, but we did not consider the uncertainties due to the numerical analysis and production. In this study, the uncertainties of material property and tolerance are considered to predict the distributions of pull-out strength and gap stiffness. Also, pull-out strength and gap stiffness are predicted as the a distribution rather than one deterministic value. Furthermore, a robust design applying the Taguchi method is suggested.

효율적인 ESD(ElectroStatic Discharge) test를 위한 Stress mode 제안 (Stress mode proposal for an efficient ESD test)

  • 강지웅;장석원;곽계달
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2008년도 추계학술대회A
    • /
    • pp.1289-1294
    • /
    • 2008
  • Electrostatic discharge(ESD) phenomenon is a serious reliability concern. It causes approximately most of all field failures of IC. To quality the ESD immunity of IC product, there are some test methods and standards developed. ESD events have been classified into 3 models, which are HBM, MM and CDM. All the test methods are designed to evaluate the ESD immunity of IC products. This study provides an overview among ESD test methods on ICs and an efficient ESD stress method. We have estimated on all pin combination about the positive and negative ESD stress. We make out the weakest stress mode. This mode called a worst-case mode. We proposed that positive supply voltage pin and I/O pin combination is efficient because it is a worst-case mode.

  • PDF

FLOW SHOP SCHEDULING JOBS WITH POSITION-DEPENDENT PROCESSING TIMES

  • WANG JI-BO
    • Journal of applied mathematics & informatics
    • /
    • 제18권1_2호
    • /
    • pp.383-391
    • /
    • 2005
  • The paper is devoted to some flow shop scheduling problems, where job processing times are defined by functions dependent on their positions in the schedule. An example is constructed to show that the classical Johnson's rule is not the optimal solution for two different models of the two-machine flow shop scheduling to minimize makespan. In order to solve the makespan minimization problem in the two-machine flow shop scheduling, we suggest Johnson's rule as a heuristic algorithm, for which the worst-case bound is calculated. We find polynomial time solutions to some special cases of the considered problems for the following optimization criteria: the weighted sum of completion times and maximum lateness. Some furthermore extensions of the problems are also shown.

Robust Capacity Planning in Network Coding under Demand Uncertainty

  • Ghasvari, Hossien;Raayatpanah, Mohammad Ali
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권8호
    • /
    • pp.2840-2853
    • /
    • 2015
  • A major challenge in network service providers is to provide adequate resources in service level agreements based on forecasts of future demands. In this paper, we address the problem of capacity provisioning in a network subject to demand uncertainty such that a network coded multicast is applied as the data delivery mechanism with limited budget to purchase extra capacity. We address some particular type of uncertainty sets that obtain a tractable constrained capacity provisioning problem. For this reason, we first formulate a mathematical model for the problem under uncertain demand. Then, a robust optimization model is proposed for the problem to optimize the worst-case system performance. The robustness and effectiveness of the developed model are demonstrated by numerical results. The robust solution achieves more than 10% reduction and is better than the deterministic solution in the worst case.

Improving Memory Efficiency of Dynamic Memory Allocators for Real-Time Embedded Systems

  • Lee, Jung-Hee;Yi, Joon-Hwan
    • ETRI Journal
    • /
    • 제33권2호
    • /
    • pp.230-239
    • /
    • 2011
  • Dynamic memory allocators for real-time embedded systems need to fulfill three fundamental requirements: bounded worst-case execution time, fast average execution time, and minimal fragmentation. Since embedded systems generally run continuously during their whole lifetime, fragmentation is one of the most important factors in designing the memory allocator. This paper focuses on minimizing fragmentation while other requirements are still satisfied. To minimize fragmentation, a part of a memory region is segregated by the proposed budgeting method that exploits the memory profile of the given application. The budgeting method can be applied for any existing memory allocators. Experimental results show that the memory efficiency of allocators can be improved by up to 18.85% by using the budgeting method. Its worst-case execution time is analyzed to be bounded.

ATM 기반의 HDSL 정합기능 구현 및 성능평가 (Implementation and performance assessment of high-rate digital subscriber lind(HDSL) interface function under ATM)

  • 양충렬;장재득;김진태;강석열;김환우
    • 한국통신학회논문지
    • /
    • 제22권5호
    • /
    • pp.990-1006
    • /
    • 1997
  • This paper describes an interface function and its performance assessment for high-bit-rate digital subscriber line (HDSL) under ATM. The interface of HDSL function of ATM system was achieved by HDSL subscriber physical layer board assembly(HSPA) which was modeled as design standard for ATM. We have presented a new worst case of subscriber line conditions from existing results of investigations on impairments such as crosstalk, impulse noise, longitudinal, power line noise and others. We have measured the maximum service loop length available by HDSL, and found that HSPA, at a 2.048Mbps data transmission, is possible within a carrier serving area(CSA) under the worst case loop noise conditions at an error rate or 10$^{-7}$ on a two coordinated unshielded twisted pairs in the presense of impairments. We conclude tht, in terms of a performance-per-lin simulator, the HSPA is an excellent candidate for HDSL implementation under ATM.

  • PDF

최악조건을 고려한 태양전지 어레이 션트 전압조절기 (A Solar Array Shunt Switching Unit Considering Worst Case Analysis)

  • 최재동
    • 전력전자학회논문지
    • /
    • 제10권4호
    • /
    • pp.403-410
    • /
    • 2005
  • 본 논문은 정지궤도 위성을 위한 완전조절방식을 갖는 태양전지 어레이 션트 전압조절기를 나타낸다. 스위칭 션트 전압조절기는 태양전지 어레이 전력을 조절하는 어레이 스위치 모듈들로 구성된다. 이러한 태양전지 어레이 션트 모듈들은 스위칭을 통해 버스에 태양전지 회로가 접속되거나 분리되며, 단지 FPGA 로직변경 만을 통해 이전의 회로설계로부터 간단하게 확장이 가능하다. 제안된 설계회로를 검증하기위해 제어로직 및 최악조건해석이 수행되었으며, 시뮬레이션 및 실험결과를 보여준다.

통신방송위성 전력시스템의 Energy Balance 해석 (Energy Balance Analysis of Electrical Power System for Communication Satellite)

  • 최재동;구철회
    • 전력전자학회:학술대회논문집
    • /
    • 전력전자학회 2001년도 전력전자학술대회 논문집
    • /
    • pp.81-84
    • /
    • 2001
  • In the power system of a satellite, solar array and a battery have directly impact on the life time of the satellite, and their stable operation is decided by whether their states are in the steady state operation or not. In this study, solar array capacity and battery characteristics of proposed communication satellite are designed and simulation is conducted according to the operation mode. Each operation mode is classified as the normal and worst case modes, respectively. The normal mode is analyzed under daylight and the eclipse with the EHT burn, and the worst case modes which have solar cell circuit failure, and battery cell failure are analyzed too.

  • PDF