• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.602-605
• /
• 2001

This paper focus on a method to use Ethernet Network for Industrial Communication Network. Ethernet use the CSMA/CD MAC(Medium Access Control) Protocol at the Data-Link Layer, Which isn't suit for Industrial Communication Network requiring Real-Time Communication, periodic data processing, critical data processing characteristics. In this paper we proposed the Virtual Polling Algorithm at the Application Layer will be solution of using the Ethernet Network for the Industrial Communication Network, Proposed Algorithm terminate the Collision in the network thus Delay Time is reduced and Real-Time Communication will be implemented.

• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.336-343
• /
• 2017

We propose a real time personalized recommendation algorithm on the mobile device. We use a unified collaborative filtering with reduced data. We use Fuzzy C-means clustering to obtain the reduced data and Konohen SOM is applied to get initial values of the cluster centers. The proposed algorithm overcomes data sparsity since it extends data to the similar users and similar items. Also, it enables real time service on the mobile device since it reduces computing time by data clustering. Applying the suggested algorithm to the MovieLens data, we show that the suggested algorithm has reasonable performance in comparison with collaborative filtering. We developed Android-based smart-phone application, which recommends restaurants with coupons and restaurant information.

• Proceedings of the KSME Conference
• /
• 2003.11a
• /
• pp.682-687
• /
• 2003

The variations of temperature and velocity fields in a Hele-Shaw convection cell (HSC) were investigated using a holographic interferometry and 2-D PIV system with varying Rayleigh number. To measure quasisteady changes of temperature field, two different measurement methods of holographic interferometry; double-exposure method and real-time method, were employed. In the double-exposure method, unwanted waves can be eliminated effectively using digital image processing technique and the reconstruction images are clear, but transient flow structure cannot be reconstructed clearly. On the other hand, transient convective flow can be reconstructed well using the real-time method. However, the fringe patterns reconstructed by the real-time method contain more noises, compared with the double-exposure method. Experimental results show a steady flow pattern at low Rayleigh numbers and a time-dependent periodic flow structure at high Rayleigh numbers. The periodic flow pattern at high Rayleigh numbers obtained by the real-time holographic interferometer method is in a good agreement with the PIV results.

• Journal of Information Processing Systems
• /
• v.12 no.4
• /
• pp.644-660
• /
• 2016

The real-time detection of malware remains an open issue, since most of the existing approaches for malware categorization focus on improving the accuracy rather than the detection time. Therefore, finding a proper balance between these two characteristics is very important, especially for such sensitive systems. In this paper, we present a fast portable executable (PE) malware detection system, which is based on the analysis of the set of Application Programming Interfaces (APIs) called by a program and some technical PE features (TPFs). We used an efficient feature selection method, which first selects the most relevant APIs and TPFs using the chi-square ($KHI^2$) measure, and then the Phi (${\varphi}$) coefficient was used to classify the features in different subsets, based on their relevance. We evaluated our method using different classifiers trained on different combinations of feature subsets. We obtained very satisfying results with more than 98% accuracy. Our system is adequate for real-time detection since it is able to categorize a file (Malware or Benign) in 0.09 seconds.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.5
• /
• pp.393-397
• /
• 2005

When a real-time image processing application is implemented with a general-purpose computer, CPU (Central Processing Unit) is usually heavily loaded and in many cases that CPU alone cannot meet the real-time requirement at all. Most modern computers are equipped with powerful Graphics Processing Units (GPUs) to accelerate graphics operations. There is a trend that the power of GPU outgrows that of CPU. If we take advantage of the powerful GPU for more general operations other than pure graphics operations, the processing time can be reduced. In this study, we will present techniques that apply GPU to general operations such as image processing procedures. Our experiment results show that significant speed-up can be achieved by using GPU.

• Proceedings of the KIEE Conference
• /
• 2008.04a
• /
• pp.59-60
• /
• 2008

In this paper, we investigate the ability of the ARM processor to implement an industrial controller with or without embedded operating system. Discrete-time PID controllers are implemented and tested under various settings e.g. cache on/off, different clock frequencies using S3C2410X chip. A method of real-time application of discrete-time PID controller in WinCE environment is proposed. Based on the test result, we provide the maximum sampling frequencies of PID controller using ARM processor.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.991-1000
• /
• 2004

This paper presents an application layer multicast tree constructing algorithm to minimize the average time delay from the sender to end-systems for the effective real-time media delivery. Simultaneously, the proposed algorithm takes into account the computing power and the network condition of each end-system as a control variable and thus avoids the undesirable case that loads are concentrated to only several end-systems. The multicast tree is constructed by clustering technique and modified Dijkstra's algorithm in two steps, i.e. tree among proxy-senders and tree in each cluster. By the experimental results, we show that the proposed algorithm can provide an effective solution.

• International Journal of Internet, Broadcasting and Communication
• /
• v.10 no.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.

• Journal of Internet Computing and Services
• /
• v.5 no.5
• /
• pp.39-48
• /
• 2004

For transporting real-time multimedia traffic, RTP is considered as one of the most promising protocols operating at application layer. In order to manage and control the real-time multimedia traffic within networks, network managers need to monitor and analyze the traffic delivering through their networks. However, conventional traffic analyzing tools can not exactly classify and analyze the real-time multimedia traffic using RTP on the basis of real-time as well as non-real-time operations. In this paper, we propose an efficient online classification method of RTP packets, which can be used on high-speed network links. The accuracy and efficiency of the proposed methodhave been tested using captured data from a KIX node with 100 Mbps links, which interconnects between domestic and overseas Internet networks and is operated by NCA.

• Journal of IKEEE
• /
• v.2 no.1 s.2
• /
• pp.42-52
• /
• 1998

This paper proposes an extended TCP/IP protocol, LAN/TCP, that can be used for the distributed soft real-time systems connected through the Ethernet-based local area network. Since LAN/TCP shows soft real-time performance with keeping compatibility and interoperability with the standard TCP/IP, the existing application software can be used without any modification. LAN/TCP also provides the periodic transmission mode(PTM) with which the periodical data collection and updating the control signals can be efficiently implemented with relatively small traffic overhead. This paper includes the computer simulation and experimental results of the proposed protocol.