• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 B
• /
• pp.546-549
• /
• 1999

For the safty driving of an automobile which is become individual requisites, a new Neural Network algorithm which recognized the load vehicles in real time is proposed. The proposed neural network technique is the real time computation method through the inter-node diffusion. In the network, a node corresponds to a state in the quantized input space. Each node is composed of a processing unit and fixed weights from its neighbor nodes as well as its input terminal. The most reliable algorithm derived for real time recognition of vehicles, is a dynamic programming based algorithm based on sequence matching techniques that would process the data as it arrives and could therefore provide continuously updated neighbor information estimates. Through several simulation experiments, real time reconstruction of the nonlinear image information is processed 1-D LIPN hardware has been composed and various experiments with static and dynamic signals have been implmented.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 2001년도 추계학술대회 논문집 Vol.14 No.1
• /
• pp.46-51
• /
• 2001

For Fast Real-time Recognition of Nonlinear Error Data, a new Neural Network algorithm which recognized the map in real time is proposed. The proposed neural network technique is the real time computation method through the inter-node diffusion, In the network, a node corresponds to a state in the quantized input space. Each node is composed of a processing unit and fixed weights from its neighbor nodes as well as its input terminal. The most reliable algorithm derived for real time recognition of map, is a dynamic programming based algorithm based on sequence matching techniques that would process the data as it arrives and could therefore provide continuously updated neighbor information estimates. Through several simulation experiments, real time reconstruction of the nonlinear map information is processed,

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 2001년도 추계학술대회 논문집
• /
• pp.46-51
• /
• 2001

For Fast Real-time Recognition of Nonlinear Error Data, a new Neural Network algorithm which recognized the map in real time is proposed. The proposed neural network technique is the real time computation method through the inter-node diffusion. In the network, a node corresponds to a state in the quantized input space. Each node is composed of a processing unit and fixed weights from its neighbor nodes as well as its input terminal. The most reliable algorithm derived for real time recognition of map, is a dynamic programming based algorithm based on sequence matching techniques that would process the data as it arrives and could therefore provide continuously updated neighbor information estimates. Through several simulation experiments, real time reconstruction of the nonlinear map information is processed.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(3)
• /
• pp.117-120
• /
• 2001

In this paper, we designed and implemented a preliminary system of web-based real-time interactive courseware on a RealServer System by using webcasting streaming technology and Javascript language to increase of learning effects and its efficiency. From the experiments, it is known that internet service suppliers and client users could interact with each other efficiently in real-time through the implemented courseware.

• Bulletin of the Korean Chemical Society
• /
• 제29권10호
• /
• pp.2017-2022
• /
• 2008

Of the experiments to shorten NMR measuring time by sparse sampling, non-uniform sampling (NUS) is advantageous. NUS miminizes systematic errors which arise due to the lack of samplings by randomization. In this study, I report the real-time acquisition of 3D NMR data using NUS and maximum-entropy (MaxEnt) data processing. The real-time acquisition combined with NUS can reduce NMR measuring time much more. Compared with multidimensional decomposition (MDD) method, which was originally suggested by Jaravine and Orekhov (JACS 2006, 13421-13426), MaxEnt is faster at least several times and more suitable for the realtime acquisition. The designed sampling schedule of current study makes all the spectra during acquisition have the comparable resulting resolutions by MaxEnt. Therefore, one can judge the quality of spectra easily by examining the intensities of peaks. I report two cases of 3D experiments as examples with the simulated subdataset from experimental data. In both cases, the spectra having good qualitie for data analysis could be obtained only with 3% of original data. Its corresponding NMR measuring time was 8 minutes for 3D HNCO of ubiquitin.

• 융합신호처리학회논문지
• /
• 제4권1호
• /
• pp.27-35
• /
• 2003

기존의 웨이블릿 임계치를 이용한 잡음제거 방법은 기저함수가 천이 불변이 되지 않아 불연속점 주위에 의사 깁스 현상을 발생시킨다. 또 논문에서는, 이러한 의사 깁스 현상을 감소시키기 위해 웨이블릿 임치 기법으로 재생성된 웨이블릿 계수의 전변분을 준경도 강화법을 이용하여 최소화하는 방향으로 구현하였다 객관적인 평가는 비실시간상에서 실험하였고 실시간 적용여부는 주위환경의 영향을 고려하여 실시간 신호 획득 보드를 사용하여 확인하였다. 비실 시간의 경우 블록 신호를 예를 들면 기존의 강성 임계치 기법보다 SNR이 2.794dB정도 개선되었고 시각적으로도 불연속점 주위의 의사 깁스 현상이 현격히 감소됨을 확인하였다. 실시간 실험의 경우, 수행시간을 고려하여 반복 횟수를 60번으로 제한한 결과 0.49초의 수행시간이 소요되었고 불연속점 주위의 의사 깁스 현상 역시 제거됨을 확인 할 수 있었다.

• International Journal of Internet, Broadcasting and Communication
• /
• 제13권1호
• /
• pp.134-142
• /
• 2021

This paper proposes a probabilistic method in analyzing timing measurements to determine the periodicity of real-time tasks. The proposed method fills a gap in existing techniques, which either concentrate on the estimation of worst-case execution times, or do not consider the stochastic behavior of the real-time scheduler. Our method is based on the Z-test statistical analysis which calculates the probability of the measured period to fall within a user-defined standard deviation limit. The distribution of the measured period should satisfy two conditions: its center (statistical mean) should be equal to the scheduled period of the real-time task, and that it should be symmetrical with most of the samples focused on the center. To ensure that these requirements are met, a data adjustment process, which omits any outliers in the expense of accuracy, is presented. Then, the Z-score of the distribution according to the user-defined deviation limit provides a probability which determines the periodicity of the real-time task. Experiments are conducted to analyze the timing measurements of real-time tasks based on real-time Linux extensions of Xenomai and RT-Preempt. The results indicate that the proposed method is able to provide easier interpretation of the periodicity of real-time tasks which are valuable especially in comparing the performance of various real-time systems.

• Smart Structures and Systems
• /
• 제4권6호
• /
• pp.809-828
• /
• 2008

Real-time hybrid testing is an attractive method to evaluate the response of structures under earthquake loads. The method is a variation of the pseudodynamic testing technique in which the experiment is executed in real time, thus allowing investigation of structural systems with time-dependent components. Real-time hybrid testing is challenging because it requires performance of all calculations, application of displacements, and acquisition of measured forces, within a very small increment of time. Furthermore, unless appropriate compensation for time delays and actuator time lag is implemented, stability problems are likely to occur during the experiment. This paper presents an approach for real-time hybrid testing in which time delay/lag compensation is implemented using model-based response prediction. The efficacy of the proposed strategy is verified by conducting substructure real-time hybrid testing of a steel frame under earthquake loads. For the initial set of experiments, a specimen with linear-elastic behavior is used. Experimental results agree well with the analytical solution and show that the proposed approach and testing system are capable of achieving a time-scale expansion factor of one (i.e., real time). Additionally, the proposed method allows accurate testing of structures with larger frequencies than when using conventional time delay compensation methods, thus extending the capabilities of the real-time hybrid testing technique. The method is then used to test a structure with a rate-dependent energy dissipation device, a magnetorheological damper. Results show good agreement with the predicted responses, demonstrating the effectiveness of the method to test rate-dependent components.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.1036-1039
• /
• 1996

The performance of real-time systems depends upon how well the tasks are scheduled within a cycle time and how fastly the response is made according to the occurrence of an external event. This paper presents the design of an effective real-time data acquisition system in order to gather the data from an automobile engine. This paper investigates an estimation and a restriction method of execution for aperiodic data. Also, the guarantee problem of real-time constraint is presented for periodic data. Through the experiments, the hard real-time guarantee problem of periodic data is studied and the damage problem of periodic data according to the increase of aperiodic tasks is analyzed.

• International journal of advanced smart convergence
• /
• 제8권1호
• /
• pp.9-17
• /
• 2019

In this article, we present a performance enhancement scheme for mobile applications by adopting persistent memory. The proposed scheme supports the deadline guarantee of real-time applications like a video player, and also provides reasonable performances for non-real-time applications. To do so, we analyze the program execution path of mobile software platforms and find two sources of unpredictable time delays that make the deadline-guarantee of real-time applications difficult. The first is the irregular activation of garbage collection in flash storage and the second is the blocking and time-slice based scheduling used in mobile platforms. We resolve these two issues by adopting high performance persistent memory as the storage of real-time applications. By maintaining real-time applications and their data in persistent memory, I/O latency can become predictable because persistent memory does not need garbage collection. Also, we present a new scheduler that exclusively allocates a processor core to a real-time application. Although processor cycles can be wasted while a real-time application performs I/O, we depict that the processor utilization is not degraded significantly due to the acceleration of I/O by adopting persistent memory. Simulation experiments show that the proposed scheme improves the deadline misses of real-time applications by 90% in comparison with the legacy I/O scheme used in mobile systems.