• Title/Summary/Keyword: reasonable time

Search Result 2,038, Processing Time 0.025 seconds

High Resolution Probabilistic Quantitative Precipitation Forecasting in Korea

  • Oh, Jai-Ho;Kim, Ok-Yeon;Yi, Han-Se;Kim, Tae-Kuk
    • The Korean Journal of Quaternary Research
    • /
    • v.19 no.2
    • /
    • pp.74-79
    • /
    • 2005
  • Recently, several attempts have been made to provide reasonable information on unusual severe weather phenomena such as tolerant heavy rains and very wild typhoons. Quantitative precipitation forecasts and probabilistic quantitative precipitation forecasts (QPFs and PQPFs, respectively) might be one of the most promising methodologies for early warning on the flesh floods because those diagnostic precipitation models require less computational resources than fine-mesh full-dynamics non-hydrostatic mesoscale model. The diagnostic rainfall model used in this study is the named QPM(Quantitative Precipitation Model), which calculates the rainfall by considering the effect of small-scale topography which is not treated in the mesoscale model. We examine the capability of probabilistic diagnostic rainfall model in terms of how well represented the observed several rainfall events and what is the most optimistic resolution of the mesoscale model in which diagnostic rainfall model is nested. Also, we examine the integration time to provide reasonable fine-mesh rainfall information. When we apply this QPM directly to 27 km mesh meso-scale model (called as M27-Q3), it takes about 15 min. while it takes about 87 min. to get the same resolution precipitation information with full dynamic downscaling method (called M27-9-3). The quality of precipitation forecast by M27-Q3 is quite comparable with the results of M27-9-3 with reasonable threshold value for precipitation. Based on a series of examination we may conclude that the proosed QPM has a capability to provide fine-mesh rainfall information in terms of time and accuracy compared to full dynamical fine-mesh meso-scale model.

  • PDF

Critical Revision Issue and The Problems Appling in Practical Operation for UCP 600 (UCP 600의 주요개정 내용 및 실무적용상의 문제점에 대한 관한 연구)

  • Yang, Ui-Dong
    • International Commerce and Information Review
    • /
    • v.9 no.1
    • /
    • pp.381-399
    • /
    • 2007
  • UCP 600 will now come into effect on 1 July 2007, giving practitioners more than six months to prepare for the change. The vote on the UCP was also a favourable vote on eUCP Version 1.1 which was amended to bring it into conformity with the new rules. ICC Banking commission unanimeusly approved the revised UCP 600 on 26 October 2006 in paris convention. The most important revision of UCP600 have altered the technical and difficult to understand wording of UCP500 into plain simple precise and concise language, The singuler achievement of UCP600 is its elimination of phrase like "reasonable care" "reasonable time" and "an it's face" from the rule. The introduction of separate articles 2 and 3 on "Definitions" and "Interpretation" which contain the concept of "honour" along with the inclusion of certain ISBP wording in UCP, should bring about far greater clarity and precision than in many of the contentions articles in UCP500. The definition of negotiation should help lay to rest the controversies surrounding the terms of negotiation. The removal of reasonable time and the replacement by five banking days should speed the process and make L/Cs more attractive in the market, nevertheless UCP600 have many problems in appling it in practical field. For example the definition of credit, negotiation and purchase it's accepted or undertaken payment draft by accepting bank or deferred payment bank, the second advising bark's position etc. so, I will introduce in this thesis the important revised articles of UCP600 and investigate the problems in applying it in practicle field with reference to the specialist's opinion of the practical field and ICC opinions of drafting Group.

  • PDF

불교의 연기론에 의한 수학적 무한에 관한 고찰

  • 이승우
    • Journal for History of Mathematics
    • /
    • v.15 no.2
    • /
    • pp.77-82
    • /
    • 2002
  • This paper is concerned with the mathematical concept displayed in Buddhism, which is reasonable enough to consider as a philosophy and encompasses the concept of infinity as scientific as that of mathematics. The purpose of this paper is to examine the changing process of the Buddhism concept of infinity on the basis of time sequence and to combine this with that of mathematics.

  • PDF

AGV travel time estimation for an AGV-based transport system (AGV기반 운반체계에서의 차량이동시간에 관한 연구)

  • 구평회;장재진
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.5-8
    • /
    • 2000
  • Vehicle travel time (empty travel time pius loaded travel time) is a key parameter for designing AGV-based material handling systems. Especially, the determination of empty vehicle travel time is difficult because of the stochastic nature of the empty vehicle locations. This paper presents a method to estimate vehicle travel times for AGV-based material transport systems. The model considers probabilistic aspects for the travel time and vehicle location under random vehicle selection rule and nearest vehicle selection rule. The estimation of empty travel time is of major effort. Simulation experiments are used to verify the proposed travel time model, and the simulation results show that the presented model provides reasonable travel time estimations.

  • PDF

Memory Allocation in Mobile Multitasking Environments with Real-time Constraints

  • Hyokyung, Bahn
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.15 no.1
    • /
    • pp.79-84
    • /
    • 2023
  • Due to the rapid performance improvement of smartphones, multitasking on mobile platforms has become an essential feature. Unlike traditional desktop or server environments, mobile applications are mostly interactive jobs where response time is important, and some applications are classified as real-time jobs with deadlines. When interactive and real-time jobs run concurrently, memory allocation between multitasking applications is a challenging issue as they have different time requirements. In this paper, we study how to allocate memory space when real-time and interactive jobs are simultaneously executed in a smartphone to meet the multitasking requirements between heterogeneous jobs. Specifically, we analyze the memory size required to satisfy the constraints of real-time jobs and present a new model for allocating memory space between heterogeneous multitasking jobs. Trace-driven simulations show that the proposed model provides reasonable performance for interactive jobs while guaranteeing the requirement of real-time jobs.

A Cleaning Policy for Mobile Computers using Flash Memory (플래시메모리를 사용하는 이동컴퓨터에서 클리닝 정책)

  • 민용기;박승규
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.495-498
    • /
    • 1998
  • Mobile computers have restrictions for size, weight, and power consumption that are different from traditional workstations. Storage device must be smaller, lighter. Low power consumed storage devices are needed. At the present time, flash memory device is a reasonable candidate for such device. But flash memory has drawbacks such as bulk erase operation and slow program time. This causes of worse average write performances. This paper suggests a storage method which improves write performance.

  • PDF

Compensation of Discrete-Time Saturating Systems Trough Equilibrium Point Matching Method (평형점 근접 방법을 통한 이산 포화 시스템의 보상)

  • 박종구;최종호
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10a
    • /
    • pp.189-194
    • /
    • 1993
  • This paper presents an ARW(Anti-Reset Windup) method for discrete-time control systems with saturation nonlinearites. The method is motivated by the concept of the equilibrium point. The design parameters of the ARW scheme is explicitly derived by minimizing a reasonable performance index. The proposed method is closely related with the singular perturbed theory. The proposed method is applicable to any open-loop stable plants with saturation nonlinearities whose controllers are determined a priori by some design technique.

  • PDF

Efficient Genetic Algorithm for Channel Assignment (채널할당을 위한 효율적인 유전자 알고리즘)

  • Kim, Sung-Soo;Kim, Kun-Bae
    • Journal of Industrial Technology
    • /
    • v.22 no.B
    • /
    • pp.71-78
    • /
    • 2002
  • The objective of this paper is to develop an efficient genetic algorithm (GA) to find a channel assignment method for minimum interference among the channels within reasonable time. The series of specific channel number is used as a representation of chromosome. We use minimum-channel-distance encoding scheme within the same cell to consider cosite channel interference (CSI) when chromosomes are generated. The cell base crossover is also used. This proposed method improves solution quality within limited time.

  • PDF

A Study on the Performance Analysis of Service Control Point (서비스제어시스템의 성능분석에 관한 연구)

  • 조한벽;권순준;임덕빈;김재련
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.13 no.22
    • /
    • pp.87-98
    • /
    • 1990
  • The performance analysis and capacity planning of Service Control Point which is real time response system is studied. The system is modeled by multiclass open queueing network. The analytical method is used to solve the queueing network. The solution of the model has product form solution. The focus of this paper is to investigate the capacity of system under the restriction of response time. To get the reasonable capacities, nonlinear programming problem is formulated and is solved by GINO. And the simulation model using SLAM II is formulated.

  • PDF

A Dynamic Programming Approach to PCB Assembly Optimization for Surface Mounters

  • Park, Tae-Hyoung;Kim, Nam
    • International Journal of Control, Automation, and Systems
    • /
    • v.5 no.2
    • /
    • pp.192-199
    • /
    • 2007
  • This paper proposes a new printed circuit board (PCB) assembly planning method for multi-head surface mounters. We present an integer programming formulation for the optimization problem, and propose a heuristic method to solve the large NP-complete problem within a reasonable time. A dynamic programming technique is then applied to the feeder arrangement optimization and placement sequence optimization to reduce the overall assembly time. Comparative simulation results are finally presented to verify the usefulness of the proposed method.