• 한국지능시스템학회:학술대회논문집
• /
• 한국지능시스템학회 2007년도 추계학술대회 학술발표 논문집
• /
• pp.253-256
• /
• 2007

The web server for the embedded Linux system(ELS), unlike the ones for the usual Linux or Windows, has some disadvantages such as small number of installable applications, low compatibility and limited extensibility. This fact raises some problems when data are transferred in real-time via the web server, which are mainly caused by a poor performance of the processor and small-sized memory. Conventional user interfaces adopted for the usual web servers are unsuitable for the ELS because they are platform-limited and their installations are done by the form of plug-ins. If the web server for the ELS has an Ajax engine that can be utilized without any installation procedure, the advantages of usability, accessibility and quick response time can be obtained. This paper presents the Ajax interface for the ELS web server. The efficiency of the proposed technology in the real-time remote monitoring is shown through an implementation.

• International Journal of Precision Engineering and Manufacturing
• /
• 제1권1호
• /
• pp.56-61
• /
• 2000

We present a fast inspection method of machine vision for in-line quality assurance of liquid crystal displays(LCD) and plasma display panels(PDP). The method incorporates an optical spatial filter in the Fourier plane of the imaging optics to block the normal periodic pattern, extracting only defects real time without relying on intensive software image process. Special emphasis is on designing a collimated white light source to provide high degree of spatial coherence for effective real time Fourier transform. At the same time, a low level of temporal coherence is attained to improve defect detection capabilities by avoiding undesirable coherent noises. Experimental results show that the proposed inspection method offers a detection accuracy of 15% tolerance, which is sufficient for industrial applications.

• Journal of Communications and Networks
• /
• 제8권4호
• /
• pp.432-441
• /
• 2006

As the community antenna television (CATV) networks becomes ubiquitous, instead of constructing an entirely new broadband network infrastructure, it has emerged as one of the rapid and economic technologies to interconnecting heterogeneous network to provide broadband access to subscribers. How to support ubiquitous real-time multimedia applications, especially in a heavy traffic environment, becomes a critical issue in modern CATV networks. In this paper, we propose a time guaranteed and efficient upstream minislots allocation algorithm for supporting quality-of-service (QoS) traffic over data over cable service interface specification (DOCSIS) CATV networks to fulfill the needs of realtime interactive services, such as video telephony, video on demand (VOD), distance learning, and so on. The proposed adaptive fast expansion algorithm and the loading statistics with dynamic swapping algorithm have been shown to perform better than that of the multimedia cable network system (MCNS) DOCSIS.

• 동력기계공학회지
• /
• 제12권6호
• /
• pp.36-41
• /
• 2008

A crane is very important mechanical systems in industrial applications to move huge objects. Especially, in marine port terminals, it is used to place container boxes at desired position within given operating time. However, such system is faced with environmental disturbance such as wind from the sea, thus crane control system is required to cope with this nature. This paper proposed robust and adaptive control algorithm of a complicated 3D crane against the environmental disturbance. We simplify a mathematical design procedure to derive our control algorithm. We conduct real-time experiment using a crane simulator to evaluate its superiority and reliability.

• 대한임베디드공학회논문지
• /
• 제10권2호
• /
• pp.65-71
• /
• 2015

It has been known that GMM (Gaussian Mixture Model) based speaker identification systems using ML (Maximum Likelihood) and WMR (Weighting Model Rank) demonstrate very high performances. However, such systems are not so effective under practical environments, in terms of real time processing, because of their high calculation costs. In this paper, we propose a new speaker-pruning algorithm that effectively reduces the calculation cost. In this algorithm, we select 20% of speaker models having higher likelihood with a part of input speech and apply MWMR (Modified Weighted Model Rank) to these selected speaker models to find out identified speaker. To verify the effectiveness of the proposed algorithm, we performed speaker identification experiments using TIMIT database. The proposed method shows more than 60% improvement of reduced processing time than the conventional GMM based system with no pruning, while maintaining the recognition accuracy.

• Journal of Electrical Engineering and Technology
• /
• 제8권3호
• /
• pp.472-477
• /
• 2013

An internet-based, real-time GPS synchronized wide-area power system frequency monitoring network(FNET) has been monitoring wide-area power system frequency in continuous time in the United States. This paper analyzes the FNET measurement to the verified disturbances in the US eastern interconnected power system and simulates it using the dynamic system model. By comparing the frequency measurements with its simulation results to the same disturbances in detail, this paper finds that the sequence of monitoring points to detect the frequency fluctuation caused by the disturbances is matched well in the measured data and the simulation results. The similarity comparison index is also proposed to quantify the similarity of the compared cases. The dynamic model based simulation result is expected to compensate for the lack of FNET measurement in its applications.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제14권3호
• /
• pp.162-170
• /
• 2014

Appearance-based subspace models such as eigenfaces have been widely recognized as one of the most successful approaches to face recognition and tracking. The success of eigenfaces mainly has its origins in the benefits offered by principal component analysis (PCA), the representational power of the underlying generative process for high-dimensional noisy facial image data. The sparse extension of PCA (SPCA) has recently received significant attention in the research community. SPCA functions by imposing sparseness constraints on the eigenvectors, a technique that has been shown to yield more robust solutions in many applications. However, when SPCA is applied to facial images, the time and space complexity of PCA learning becomes a critical issue (e.g., real-time tracking). In this paper, we propose a very fast and scalable greedy forward selection algorithm for SPCA. Unlike a recent semidefinite program-relaxation method that suffers from complex optimization, our approach can process several thousands of data dimensions in reasonable time with little accuracy loss. The effectiveness of our proposed method was demonstrated on real-world face recognition and tracking datasets.

• ETRI Journal
• /
• 제34권3호
• /
• pp.462-465
• /
• 2012

This letter proposes a new distributed scheduling scheme combined with routing to support the quality of service of real-time applications in wireless mesh networks. Next, this letter drives average end-to-end delay of the proposed scheduling scheme that sequentially schedules the slots on a path. Finally, this letter simulates the time division multiple access network for performance comparison. From the simulation results, when the average number of hops is 2.02, 2.66, 4.1, 4.75, and 6.3, the proposed sequential scheduling scheme reduces the average end-to-end delay by about 28%, 10%, 17%, 27%, and 30%, respectively, compared to the conventional random scheduling scheme.

• 대한임베디드공학회논문지
• /
• 제5권1호
• /
• pp.18-22
• /
• 2010

In real-time embedded systems, the responsibility is the most important thing because it is related to human life. Context switching is a part of which can slow down the responsibility. We therefore should minimize the amount of state that needs to be saved during context switching. In this paper, we introduce a new architecture (Register Farm) for context switching which can exchange two contexts in one cycle time. Although it might increase the cost of MCU design and the complexity of circuit, it cannot miss any interrupt during context switching. Consequently, Register Farm architecture can make embedded systems spread out in human life because it can increase reliability and responsibility in real time embedded systems.

• 대한임베디드공학회논문지
• /
• 제6권1호
• /
• pp.41-47
• /
• 2011

The Pfair scheduling algorithm, which is an optimal scheduling algorithm in the hard real-time multiprocessor environments, propose the necessary and sufficient condition for the schedulability and is based on the fixed quantum size. Recently, several methods that determine the optimal quantum size dynamically were proposed in the mode change environments. But these methods considered only the case in which the period of a task is increased or decreased. In this paper, we also consider the case in which the execution time of a task is increased or decreased, and propose new methods that determine the optimal quantum size dynamically.