• 반도체디스플레이기술학회지
• /
• 제20권3호
• /
• pp.125-130
• /
• 2021

Scaffold is used to produce bio sensor. Scaffold is required high dimensional accuracy. 3D printer is used to manufacture scaffold. 3D printer can't detect defect during printing. Defect detection is very important in scaffold printing. Real-time defect detection is very necessary on industry. In this paper, we proposed the method for real-time scaffold defect detection. Real-time defect detection model is produced using CNN(Convolution Neural Network) algorithm. Performance of the proposed model has been verified through evaluation. Real-time defect detection system are manufactured on hardware. Experiments were conducted to detect scaffold defects in real-time. As result of verification, the defect detection system detected scaffold defect well in real-time.

• Journal of Electrical Engineering and Technology
• /
• 제12권1호
• /
• pp.110-116
• /
• 2017

This paper proposed a new real-time parameter tracking algorithm. Unlike the convenience algorithms, the proposed real-time parameter tracking algorithm can estimate parameters through three-phase voltage and electric current without coordination transformation, and does not need information on magnetic flux. Therefore, it can estimate parameters regardless of the change according to operation point and cross-saturation effect. In addition, as the quasi-real-time parameter tracking technique can estimate parameters through the four fundamental arithmetic operations instead of complicated algorithms such as numerical value analysis technique and observer design, it can be applied to low-performance DSP. In this paper, a new real-time parameter tracking algorithm is derived from three phase equation. The validity and usefulness of the proposed inductance estimation technique is verified by simulation and experimental results.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제14권4호
• /
• pp.305-312
• /
• 2014

This paper discusses real-time peak shaving algorithms for a large-scale battery energy storage system (BESS). Although several transmission and distribution functions could be implemented for diverse purposes in BESS applications, this paper focuses on a real-time peak shaving algorithm for an energy time shift, considering wind power generation. In a high wind penetration environment, the effective load levels obtained by subtracting the wind generation from the load time series at each long-term cycle time unit are needed for efficient peak shaving. However, errors can exist in the forecast load and wind generation levels, and the real-time peak shaving operation might require a method for wind generation that includes comparatively large forecasting errors. To effectively deal with the errors of wind generation forecasting, this paper proposes a real-time peak shaving algorithm for threshold value-based peak shaving that considers fuzzy wind power generation.

• 전기학회논문지P
• /
• 제52권3호
• /
• pp.121-126
• /
• 2003

In this paper, we propose the haptic system for the real-time virtual environment-control, which controls the sense of sight, hearing and touch. In order to maintain the stable haptic system in this study, we apply the proxy force rendering algorithm and the real-time graphic deformation algorithm based on the FEM. The applied proxy algorithm makes the system possible to be more stable and prompt with a virtual object. Moreover, the haptic rendering algorithm is applied to work out a problem that the tactual transaction-period is different from the graphic transaction- period. The graphic deformation algorithm is developed in the real-time using the deformed FEM. To apply the FEM, a deformed material-model is produced and then the graphic deformation with this model is able to force. Consequently, the graphic rendering algorithm is deduced by the real-time calculation and simplification because the purpose of this system is to transact in the real time. Applying this system to the PC, we prove that it is possible to deform the graphics and transact the haptic. Finally we suggest the variable simulation program to show the efficiency of this system.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 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.

• 대한전자공학회논문지TC
• /
• 제39권12호
• /
• pp.539-546
• /
• 2002

본 논문에서의 패킷 스케줄러는 무선 채널 환경에서 실시간 비디오 트래픽과 비실시간 인터넷 트래픽을 동시에 서비스한다. 그리고 실시간 트래픽에 대한 지연을 감소 시기키 위하여 누적카운터와 SIR값을 동시에 고려하는 새로운 패킷 스케줄링 알고리즘을 제안한다. 본 알고리즘에서는 실시간 트래픽을 비실시간 트래픽에 비하여 우선적으로 처리한다. 시뮬레이션 결과를 고찰할 때, 실시간 비디오 트래픽과 같이 지연성능에 민감한 서비스의 경우에는 AC(Accumulation Counter) 방식이 기존의 M-LWDF방식보다 더 적합한 알고리즘으로 관찰되었다. 본 논문에서는 HSDPA 시스템과 유사한 구조를 채택하여 시간 축으로는 프레임 주기를 가지며 동시에 코드 축으로는 OVSF 코드를 사용할 수 있는 구조를 채택하여 모의 실험을 수행하였다.

• 한국군사과학기술학회지
• /
• 제19권2호
• /
• pp.252-260
• /
• 2016

Unlike terrestrial transportation, marine transportation should consider environment factors in order to optimize path planning. This is because, ship's path planning is greatly influenced by real-time ocean environment-sea currents, wave and wind. Therefore, in this study, we suggest a ship path planning algorithm based on real-time ocean environment using not only $A^*$ algorithm but also path smoothing method. Moreover, in order to improve objective function value, we also consider ship's moving distance based on ship's location and real-time ocean environment data on grid map. The efficiency of the suggested algorithm is proved by comparing with $A^*$ algorithm only. This algorithm can be used as a reasonable automatics control system algorithm for unmaned ship.

• International Journal of Internet, Broadcasting and Communication
• /
• 제10권3호
• /
• pp.26-34
• /
• 2018

In this paper, we propose a scheduling scheme that can efficiently serve I/O requests having deadlines in flash storage. The I/O requests with deadlines, namely, real-time requests, are assumed to be issued for streaming services of continuous media. Since a Web-based streaming server commonly supports downloads of HTMLs or images, we also aim to quickly process non-real-time I/O requests, together with real-time ones. For this purpose, we adopt the well-known rate-reservation EDF (RR-EDF) algorithm for determining scheduling priorities among mixed I/O requests. In fact, for the use of an EDF-style algorithm, overhead of task's switching should be low and predictable, as with its application of CPU scheduling. In other words, the EDF algorithm is inherently unsuitable for scheduling I/O requests in HDD storage because of highly varying latency times of HDD. Unlike HDD, time for reading a block in flash storage is almost uniform with respect to its physical location. This is because flash storage has no mechanical component, differently from HDD. By capitalizing on this uniform block read time, we compute bandwidth utilization rates of real-time requests from streams. Then, the RR-EDF algorithm is applied for determining how much storage bandwidth can be assigned to non-real-time requests, while meeting deadlines of real-time requests. From this, we can improve the service times of non-real-time requests, which are issued for downloads of static files. Because the proposed scheme can expand flexibly the scheduling periods of streams, it can provide a full usage of slack times, thereby improving the overall throughput of flash storage significantly.

• 전자공학회논문지S
• /
• 제35S권5호
• /
• pp.48-58
• /
• 1998

In this paper, we proposed a new algorithm using characteristics of th ereconstructed phase trajectory by topological mapping developed for a real-tiem detection of the QRS complexes of ECG signals. Using fill-factor algorithm and mutual information algorithm which are in genral used to find out the chaotic characteristics of sampled signals, we inferred the proper mapping parameter, time delay, in ECG signals and investigated QRS detection rates with varying time delay in QRS complex detection. And we compared experimental time dealy with the theoretical one. As a result, it shows that the experimental time dealy which is proper in topological mapping from ECG signals is 20ms and theoretical time delays of fill-factor algorithm and mutual information algorithm are 20.+-.0.76ms and 28.+-.3.51ms, respectively. From these results, we could easily infer that the fill-factor algorithm in topological mapping from one-dimensional sampled ECG signals to two-dimensional vectors, is a useful algorithm for the detemination of the proper ECG signals to two-dimensional vectors, is a useful algorithm for the detemination of the proper time delay. Also with the proposed algorithm which is very simple and robust to low-frequency noise as like baseline wandering, we could detect QRS complex in real-time by simplifying preprocessing stages. For the evaluation, we implemented the proposed algorithm in C-language and applied the MIT/BIH arrhythmia database of 48 patients. The proposed algorithm provides a good performance, a 99.58% detection rate.