• The Journal of the Korea Contents Association
• /
• v.5 no.3
• /
• pp.217-225
• /
• 2005

Currently the research on input-queued ATM switches is one of the most active research fields. Many achievements have been made in the research on scheduling algorithms for input-queued ATM switches and also applied in commerce. The scheduling algorithms have the characteristics of improving throughput, satisfying QoS requirements and providing service fairly. In this paper, we studied on an implementation of scheduler which arbitrates the input-queued ATM switches efficiently and swiftly. The proposed scheduler approximately provides $100\%$ throughput for scheduling. The proposed algorithm completes the arbitration for N-port VOQ switch with 4-iterative matching. Also the proposed algorithm has a merit for implementing the scheduling algorithm with 1/2 area compared to that of iSLIP scheduling algorithm which is widely used. The performance of the proposed scheduling algorithm is superior to that of iSLIP in 4-iterative matching.

• Journal of Korea Multimedia Society
• /
• v.16 no.12
• /
• pp.1427-1438
• /
• 2013

We have developed a 128-bit stream cipher algorithm composed of the 5-stage pipeline, capable of real-time processing, confidentiality and integrity. The developed stream cipher is a stream cipher algorithm that makes the final 128-bit ciphers through a whitening process after making the ASR 277 bit and SHACAL-2 and applying them to the CFB mode. We have verified the hardware performance of the proposed stream cipher algorithm with Modelsim 6.5d and Quartus II 12.0, and the result shows that the hardware runs at 33.34Mhz(4.27Gbps) at worst case. According to the result, the new cipher algorithm has fully satisfied the speed requirement of wireless Internet and sensor networks, and DRM environment. Therefore, the proposed algorithm with satisfaction of both confidentiality and integrity provides a very useful ideas.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.5
• /
• pp.31-37
• /
• 2010

This study was developed the home network system for the home stay care by bio-sensor system to translate the physical signal algorithm. The composition algorithm has five functions for a input function, frequency variable, displacement point input function, axial Variable, axial Sway Displacement to search a max and min point with adjustment of 0.01 unit in the reference level. There were checked physical condition of body balance to compounded a measurement such as a heart rate, temperature, weight. The algorithm of home network system can be used to support health care management system through health assistants in health care center and central health care system. It was expected to monitor a physical parameter for health management system.

• Journal of Korean Society of Rural Planning
• /
• v.21 no.4
• /
• pp.177-186
• /
• 2015

The main objective of this study was to assess the applicability of IoT (Internet of Things)-based flood management under climate change by developing intelligent water level monitoring platform based on IoT. In this study, Arduino Uno was selected as the development board, which is an open-source electronic platform. Arduino Uno was designed to connect the ultrasonic sensor, temperature sensor, and data logger shield for implementing IoT. Arduino IDE (Integrated Development Environment) was selected as the Arduino software and used to develop the intelligent algorithm to measure and calibrate the real-time water level automatically. The intelligent water level monitoring platform consists of water level measurement, temperature calibration, data calibration, stage-discharge relationship, and data logger algorithms. Water level measurement and temperature calibration algorithm corrected the bias inherent in the ultrasonic sensor. Data calibration algorithm analyzed and corrected the outliers during the measurement process. The verification of the intelligent water level measurement algorithm was performed by comparing water levels using the tape and ultrasonic sensor, which was generated by measuring water levels at regular intervals up to the maximum level. The statistics of the slope of the regression line and $R^2$ were 1.00 and 0.99, respectively which were considered acceptable. The error was 0.0575 cm. The verification of data calibration algorithm was performed by analyzing water levels containing all error codes in a time series graph. The intelligent platform developed in this study may contribute to the public IoT service, which is applicable to intelligent flood management under climate change.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1C
• /
• pp.69-77
• /
• 2002

Sine digital signal processing for motion pictures requires huge amount of data computation to store, manipulate and transmit, more effective data compression is necessary. Therefore, the ITU-T recommended H.26x as data compression standards for digital motion pictures. The data compression method that eliminates time redundancies by motion estimation using relationship between picture frames has been widely used. Most video conding systems employ block matching algorithm for the motion estimation and compensation, and the algorithm is based on the minimun value of cast functions. Therefore, fast search algorithm rather than full search algorithm is more effective in real time low data rates encodings such as H.26x. In this paper, motion estimation employing the Nearest-Neighbors algorithm is designed to reduce search time using FPGA, coded in VHDL, and simulated and verified using Xilink Foundation.

• Journal of KIISE:Databases
• /
• v.29 no.3
• /
• pp.193-206
• /
• 2002

In this paper, we design and implement an efficient bulk-loading algorithm for CIR-Tree. Bulk-loading techniques increase node utilization, improve query performance and reduce index construction time. The CIR-tree has variable size of internal node entries since it only maintains minimal dimensions to decriminate child nodes. This property increases fan-out of internal nodes and improves search performance. Even though several bulk-loading algorithms for multi/high-dimensional index structures have been proposed, we cannot apple them to CIR-tree because of the variable size of internal node entries. In this paper, we propose an efficient bulk- loading algorithm for CIR-tree that improves the existing bulk-loading algorithm and accomodates the property of CIR-tree. We also implement it on a storage system MiDAS-III and show superiority of our algorithm through various experiments.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.45-50
• /
• 2003

Guaranteed Frame Rate (GFR) service category is one of the most recent ATM service categories. The GFR specification was recently finalized by the ATM Forum and is expected to become an important service category which can efficiently support TCP/IP traffic in ATM network. In GFR switch implementation, it is important to guarantee MCR (minimum cell rate) and improve fairness. In this paper, we propose a new scheduling algorithm for the GFR service. Proposed algorithm provides priority to VC (virtual circuit)s and high Priority given to a VC which has fewer untagged cells in buffer. High priority VCs are serviced before low priority VCs. Proposed algorithm can guarantee MCR and improve fair sharing of the remaining bandwidth between GFR VCs. From computer simulation results, we demonstrate the proposed scheduling algorithm provide much better performance in TCP goodput and fairness than previous schemes.

• The KIPS Transactions:PartB
• /
• v.19B no.2
• /
• pp.127-134
• /
• 2012

Video digital door lock(VDDL) system detects people who access to the door and acquires the human image. Design considerations is that current consumption must be minimized by applying fast human detection algorithm because of battery-based operation. Since the digital door lock takes an image through a fixed camera, detection of a person based on background image leads to high degree of reliability. This paper deals with a single human detection algorithm suitable for VDDL with fulfilling these requirements such that it detects a moving object in an image, then identifies whether the object is a person or not using image processing. The proposed image processing algorithm consists of two steps: Firstly, it detects the human image region using both background image and skin color information. Secondly, it identifies the person using polar histogram based on proportional information of human body. Proposed algorithm is implemented in VDDL and is verified the performance through experiments.

• Journal of Internet Computing and Services
• /
• v.19 no.2
• /
• pp.17-26
• /
• 2018

Recently, through the emergence and convergence of Internet services, the unified Internet of thing(IoT) service platform have been researched. Currently, the IoT service is constructed as an independent system according to the purpose of the service provider, so information exchange and module reuse are impossible among similar services. In this paper, we propose a operation based service classification algorithm for various services in order to provide an environment of unfied Internet platform. In implementation, we classify and cluster more than 100 commercial IoT services. Based on this, we evaluated the performance of the proposed algorithm compared with the K-means algorithm. In order to prevent a single clustering due to the lack of sample groups, we re-cluster them using K-means algorithm. In future study, we will expand existing service sample groups and use the currently implemented classification system on Apache Spark for faster and more massive data processing.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.676-686
• /
• 2005

The Internet users as well as network providers are eager to have different qualities of service among users beyond the best-effort. In this paper, we propose a scheduling algorithm that provides a differentiated service in the granularity of user sessions. The proposed algorithm is a Hierarchical Deficit Round-Robin (H-DRR) algorithm that is an extension of an existing DRR algorithm. A main advantage is that H-DRR provides service differentiation for throughput-intensive applications such as FTP as well as delay-sensitive applications such as telnet or VoIP without distinguishing the types of applications. The most importance in providing a service differentiation in term of network providers is to have controllability and predictability. We show that H-DRR is superior to DRR in terms of controllability and predictability through both mathematical analysis and simulation experiments. Nevertheless, H-DRR requires O(1) complexity for implementation.