• 제목/요약/키워드: Time

검색결과 185,384건 처리시간 0.106초

이중 시간전진법과 Preconditioning을 이용한 저속의 압축성유동에 대한 비정상 해석기법 (Time accurate method for low speed compressible flows using dual time stepping and preconditioning procedure)

  • 최윤호;강신형
    • 대한기계학회논문집B
    • /
    • 제22권6호
    • /
    • pp.788-802
    • /
    • 1998
  • A numerical method using dual time stepping and preconditioning procedure for efficient computations of unsteady low speed compressible flow problems is developed. The time-derivative preconditioning method which is valid at low speed flow conditions cannot maintain temporal accuracy because of the modification of the time-derivative term in Navier-Stokes equations. The dual time stepping procedure is incorporated to enable the time accurate computations and this procedure introduces a pseudo-time derivative in addition to the physical time derivative. At a given physical time, an inner iteration can be carried out until a steady state in pseudo-time is achieved. This will effectively yield a time accurate solution. Computational capabilities of the above algorithm are demonstrated through computation of a variety of practical fluid flows and it is shown that the algorithms is efficient in the essentially incompressible flows and low Mach number compressible flows with heat source.

실행시간 예측가능한 실시간 메카니즘 제어언어의 구현기법 (Implementation technique of execution time predictable real-time mechanism control language)

  • 백정현;원유헌
    • 한국통신학회논문지
    • /
    • 제22권6호
    • /
    • pp.1365-1376
    • /
    • 1997
  • In this paper, we designed real time mechanism control language and proposed execution time analysis technique. It was impossible to handle real-time mechanism control programs like programmable controller, numerical controller, distributed control system and robot controller with general purpose programming languages and operating systems because they have to process electric signals generated by thousands of sensors at the same at the same time and in real time. So we made it possible to predict plausibility of time constraint constructs of tiem constraint construct of a real time application program at compilation time by adding time constraint constructs and mechanism synchronization structure to conditional statement and iteration statement of a programming language and developing execution time analysis technique.

  • PDF

IoT Device Testing for Efficient IoT Device Framework

  • Gong, Dong-Hwan
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제12권2호
    • /
    • pp.77-82
    • /
    • 2020
  • IoT devices frequently require input resources to communicate with various sensors or IoT platforms. IoT device wastes a lot of time as idle time or waiting time to check the data of the input resource and use the input resource. In addition, IoT devices use various input resources. We compares and analyzes input idle time and input waiting time generated from hardware serial input resource, software serial input resource, digital port input resource, and analog port input resource using Arduino widely used as IoT device. In order to design the IoT device framework, it is necessary to understand the characteristics of input resources and to design them to minimize unnecessary input idle time and input waiting time. The analog input wait time has a much larger input wait time than the digital input wait time, so it must be designed to receive analog information periodically at the appropriate timing. The characteristics of the input resources analyzed in this way help to design an efficient IoT device.

가변시간간격을 갖는 Newmark 시간적분법의 사다리꼴법칙에 대한 안정성과 정확도 (Stability and accuracy for the trapezoidal rule of the Newmark time integration method with variable time step sizes)

  • 노용수;정진태;배대성
    • 대한기계학회논문집A
    • /
    • 제21권10호
    • /
    • pp.1712-1717
    • /
    • 1997
  • Stability and accuracy for the trapezoidal rule of the Newmark time integration method are analyzed when variable time step sizes are adopted. A new analytic approach to stability and accuracy analysis is also proposed for time integration methods with variable time step sizes. The trapezoidal rule with variable time step sizes has the "actual" unconditional stability which is the same as that of the method with constant time step sizes. However, the method with variable time step sizes is first-order accurate while the method with constant time step sizes is second-order accurate. accurate.

유도 초음파 신호 분석을 위한 적응 단시간 푸리에 변환 (Adaptive Short-time Fourier Transform for Guided-wave Analysis)

  • 홍진철;선경호;김윤영
    • 한국소음진동공학회논문집
    • /
    • 제15권3호
    • /
    • pp.266-271
    • /
    • 2005
  • Although time-frequency analysis is useful for dispersive wave analysis, conventional methods such as the short-time Fourier transform do not take the dispersion phenomenon into consideration in the tiling of the time-frequency domain. The objective of this paper is to develop an adaptive time-frequency analysis method whose time-frequency tiling is determined with the consideration of signal dispersion characteristics. To achieve the adaptive time-frequency tiling, each of time-frequency atoms is rotated in the time-frequency plane depending on the local wave dispersion. To carry out this adaptive time-frequency transform, dispersion characteristics hidden in a signal are first estimated by an iterative scheme. To examine the effectiveness of the present method, the flexural wave signals measured in a plate were analyzed.

순차적 가변시간할당 추력방식 최적성능 분석 (Time Optimal Performance of a Varying-Time Sharing Sequential Paired Thrusting Logic)

  • 오화석;이병훈;이봉운
    • 제어로봇시스템학회논문지
    • /
    • 제11권3호
    • /
    • pp.254-261
    • /
    • 2005
  • Time-optimal performances are analyzed in the sense of inner loop. A varying-time sharing thrusting logic is suggested as a new sequential paired thrusting logic for fast maneuvers of satellites with coupled thruster configuration. Its time-optimal maneuvering performance is compared with two conventional thrusting logics: separate thrusting logic and constant-time sharing sequential paired thrusting logic. It is found that the newly suggested varying-time sharing thrusting logic can be easily implemented by adjusting the conventional constant-time logic with its thrust on-time, while it can reduce the maneuvering time enormously as much as the separate thrusting logic. The performance of the logic is simulated on the agile maneuvering spacecraft model KOMPSAT-II.

용융성장시 서냉시간과 후열처리시간에 따른 임계특성 (The Critical Characteristics Attributed to the Slow Cooling and Annealing Time in the Melting Growth)

  • 임성훈;최명호;강형곤;정동철;박종광;한병성
    • 한국전기전자재료학회논문지
    • /
    • 제11권4호
    • /
    • pp.327-333
    • /
    • 1998
  • The influence of slow cooling and annealing time in $O_2$in MPEG process on $J_c$ was investigated. From the measurement of $J_c$,SEM and XRD, it was observed that the critical current density was related with the slow cooling time and annealing time in $O_2$. The value of $J_c$ was the highest at slow cooling time of 40 hour. And also, the value of $J_c$ along the annealing time in $O_2$in the case of the slow cooling time of 40 hours was inclined to increase with annealing time. Consequently, it can be suggested that proper slow cooling time and annealing time after slow cooling in MPMG process be important to improve the critical characteristics.

  • PDF

CPU Scheduling with a Round Robin Algorithm Based on an Effective Time Slice

  • Tajwar, Mohammad M.;Pathan, Md. Nuruddin;Hussaini, Latifa;Abubakar, Adamu
    • Journal of Information Processing Systems
    • /
    • 제13권4호
    • /
    • pp.941-950
    • /
    • 2017
  • The round robin algorithm is regarded as one of the most efficient and effective CPU scheduling techniques in computing. It centres on the processing time required for a CPU to execute available jobs. Although there are other CPU scheduling algorithms based on processing time which use different criteria, the round robin algorithm has gained much popularity due to its optimal time-shared environment. The effectiveness of this algorithm depends strongly on the choice of time quantum. This paper presents a new effective round robin CPU scheduling algorithm. The effectiveness here lies in the fact that the proposed algorithm depends on a dynamically allocated time quantum in each round. Its performance is compared with both traditional and enhanced round robin algorithms, and the findings demonstrate an improved performance in terms of average waiting time, average turnaround time and context switching.

유도 초음파 신호 분석을 위한 적응 단시간 푸리에 변환 (Adaptive Short-time Fourier Transform for Guided-wave Analysis)

  • 선경호;홍진철;김윤영
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2004년도 추계학술대회논문집
    • /
    • pp.606-610
    • /
    • 2004
  • Although time-frequency analysis is useful for dispersive wave analysis, conventional methods such as the short-time Fourier transform do not take the dispersion phenomenon into consideration in the tiling of the time-frequency domain. The objective of this paper is to develop an adaptive time-frequency analysis method whose time-frequency tiling is determined with the consideration of signal dispersion characteristics. To achieve the adaptive time-frequency tiling, each of time-frequency atoms is rotated in the time-frequency plane depending on the local wave dispersion. To carry out this adaptive time-frequency transform, dispersion characteristics hidden in a signal are first estimated by an iterative scheme. To examine the effectiveness of the proposed method, the flexural wave signals measured in a plate were analyzed.

  • PDF

Modeling in System Engineering: Conceptual Time Representation

  • Al-Fedaghi, Sabah
    • International Journal of Computer Science & Network Security
    • /
    • 제21권3호
    • /
    • pp.153-164
    • /
    • 2021
  • The increasing importance of such fields as embedded systems, pervasive computing, and hybrid systems control is increasing attention to the time-dependent aspects of system modeling. In this paper, we focus on modeling conceptual time. Conceptual time is time represented in conceptual modeling, where the notion of time does not always play a major role. Time modeling in computing is far from exhibiting a unified and comprehensive framework, and is often handled in an ad hoc manner. This paper contributes to the establishment of a broader understanding of time in conceptual modeling based on a software and system engineering model denoted thinging machine (TM). TM modeling is founded on a one-category ontology called a thimac (thing/machine) that is used to elaborate the design and analysis of ontological presumptions. The issue under study is a sample of abstract modeling domains as exemplified by time. The goal is to provide better understanding of the TM model by supplementing it with a conceptualization of time aspects. The results reveal new characteristics of time and related notions such as space, events, and system behavior.