Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The KIPS Transactions:PartA
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 16A, Issue 6 - Dec 2009
Volume 16A, Issue 5 - Oct 2009
Volume 16A, Issue 4 - Aug 2009
Volume 16A, Issue 3 - Jun 2009
Volume 16A, Issue 2 - Apr 2009
Volume 16A, Issue 1 - Feb 2009
Selecting the target year
A Massively Parallel Algorithm for Fuzzy Vector Quantization
Huynh, Luong Van ; Kim, Cheol-Hong ; Kim, Jong-Myon ;
The KIPS Transactions:PartA, volume 16A, issue 6, 2009, Pages 411~418
DOI : 10.3745/KIPSTA.2009.16A.6.411
Vector quantization algorithm based on fuzzy clustering has been widely used in the field of data compression since the use of fuzzy clustering analysis in the early stages of a vector quantization process can make this process less sensitive to its initialization. However, the process of fuzzy clustering is computationally very intensive because of its complex framework for the quantitative formulation of the uncertainty involved in the training vector space. To overcome the computational burden of the process, this paper introduces an array architecture for the implementation of fuzzy vector quantization (FVQ). The arrayarchitecture, which consists of 4,096 processing elements (PEs), provides a computationally efficient solution by employing an effective vector assignment strategy during the clustering process. Experimental results indicatethat the proposed parallel implementation providessignificantly greater performance and efficiency than appropriately scaled alternative array systems. In addition, the proposed parallel implementation provides 1000x greater performance and 100x higher energy efficiency than other implementations using today`s ARMand TI DSP processors in the same 130nm technology. These results demonstrate that the proposed parallel implementation shows the potential for improved performance and energy efficiency.
Improved Trajectory Calculation on the Semi-Lagrangian Advection Computation
Park, Su-Wan ; Baek, Nak-Hoon ; Ryu, Kwan-Woo ;
The KIPS Transactions:PartA, volume 16A, issue 6, 2009, Pages 419~426
DOI : 10.3745/KIPSTA.2009.16A.6.419
To realistically simulate fluid, the Navier-Stokes equations are generally used. Solving these Navier-Stokes equations on the Eulerian framework, the non-linear advection terms invoke heavy computation and thus Semi-Lagrangian methods are used as an approximated way of solving them. In the Semi-Lagrangian methods, the locations of advection sources are traced and the physical values at the traced locations are interpolated. In the case of Stam`s method, there are relatively many chances of numerical losses, and thus there have been efforts to correct these numerical errors. In most cases, they have focused on the numerical interpolation processes, even simultaneously using particle-based methods. In this paper, we propose a new approach to reduce the numerical losses, through improving the tracing method during the advection calculations, without any modifications on the Eulerian framework itself. In our method, we trace the grids with the velocities which will let themselves to be moved to the current target position, differently from the previous approaches, where velocities of the current target positions are used. From the intuitive point of view, we adopted the simple physical observation: the physical quantities at a specific position will be moved to the new location due to the current velocity. Our method shows reasonable reduction on the numerical losses during the smoke simulations, finally to achieve real-time processing even with enhanced realities.
The Virtual Factory Layout Simulation System using Legacy Data within Mixed Reality Environment
Lee, Jong-Hwan ; Shin, Su-Chul ; Han, Soon-Hung ;
The KIPS Transactions:PartA, volume 16A, issue 6, 2009, Pages 427~436
DOI : 10.3745/KIPSTA.2009.16A.6.427
Digital virtual manufacturing is a technology that aims for the rapid development of products and the verification of production-process in ways that are more efficient by integrating digital models within the entire manufacturing process. These digital models utilize various information technologies, such as 3D CAD and simulations. Mixed reality, which represents graphical objects for only needed parts against real scene, can bring a more enriched sense of reality to an existing virtual manufacturing system that is in a pure virtual environment, and it can reduce the time and money needed for modeling the environment. This paper suggests a method for planning virtual factory layouts based on mixed reality using legacy datathat are already constructed in the real field. To do this, we developed the method to acquire simulation data from legacy data and process this acquired data for visualization based on mixed reality. And then we construct display system based on mixed reality, which can simulate virtual factory layout with processed data. Developed system can reduce errors related with factory layout by verifying the location and application of equipments in advance before arrangement of real ones at the practical job site.
A Laxity Based On-line Real-Time Scheduling Algorithm for Multiprocessor Systems
Cho, Kyu-Eok ; Kim, Yong-Seok ;
The KIPS Transactions:PartA, volume 16A, issue 6, 2009, Pages 437~442
DOI : 10.3745/KIPSTA.2009.16A.6.437
For multiprocessor systems, Earliest Deadline First (EDF) based on deadline and Least Laxity First (LLF) based on laxity are not suitable for practical environment since EDF has low schedulability and LLF has high context switching overhead. As a combining of EDF and LLF to improve the performance, Earliest Deadline Zero Laxity (EDZL) was proposed. EDZL is basically the same as EDF. But if the laxity of a task becomes zero, its priority is promoted to the highest level. In this paper, we propose Least Laxity Zero Laxity (LLZL) which is based on LLF. But context switching is allowed only if the laxity of a task on rady queue becomes zero. Simulation results show that LLZL has high schedulability approaching to LLF and low context switching overhead similar to EDF. In comparison with EDZL, LLZL has better performance in both of schedulability and context switching overhead.
Advanced Architecture using DIAM for Improved Performance of Embedded Processor
Youn, Jong-Hee ; Shin, Se-Chul ; Baek, You-Heung ; Cho, Jeong-hun ;
The KIPS Transactions:PartA, volume 16A, issue 6, 2009, Pages 443~452
DOI : 10.3745/KIPSTA.2009.16A.6.443
Although 32-bit architectures are becoming the norm for modern microprocessors, 16-bit ones are still employed by many low-end processors, for which small size and low power consumption are of high priority. However, 16-bit architectures have a critical disadvantage for embedded processors that they do not provide enough encoding space to add special instructions coined for certain applications. To overcome this, many existing architectures adopt non-orthogonal, irregular instruction sets to accommodate a variety of unusual addressing modes. In general, these non-orthogonal architectures are regarded compiler-unfriendly as they tend to requires extremely sophisticated compiler techniques for optimal code generation. To address this issue, we proposed a compiler-friendly processor with a new addressing mode, called the dynamic implied addressing mode(DIAM). In this paper, we will demonstrate that the DIAM provides more encoding space for our 16-bit processor so that we are able to support more instructions specially customized for our applications. And we will explain the advanced architecture which has improved performance. In our experiment, the proposed architecture shows 11.6% performance increase on average, as compared to the basic architecture.
Automated Detecting and Tracing for Plagiarized Programs using Gumbel Distribution Model
Ji, Jeong-Hoon ; Woo, Gyun ; Cho, Hwan-Gue ;
The KIPS Transactions:PartA, volume 16A, issue 6, 2009, Pages 453~462
DOI : 10.3745/KIPSTA.2009.16A.6.453
Studies on software plagiarism detection, prevention and judgement have become widespread due to the growing of interest and importance for the protection and authentication of software intellectual property. Many previous studies focused on comparing all pairs of submitted codes by using attribute counting, token pattern, program parse tree, and similarity measuring algorithm. It is important to provide a clear-cut model for distinguishing plagiarism and collaboration. This paper proposes a source code clustering algorithm using a probability model on extreme value distribution. First, we propose an asymmetric distance measure pdist(
) to measure the similarity of
Then, we construct the Plagiarism Direction Graph (PDG) for a given program set using pdist(
) as edge weights. And, we transform the PDG into a Gumbel Distance Graph (GDG) model, since we found that the pdist(
) score distribution is similar to a well-known Gumbel distribution. Second, we newly define pseudo-plagiarism which is a sort of virtual plagiarism forced by a very strong functional requirement in the specification. We conducted experiments with 18 groups of programs (more than 700 source codes) collected from the ICPC (International Collegiate Programming Contest) and KOI (Korean Olympiad for Informatics) programming contests. The experiments showed that most plagiarized codes could be detected with high sensitivity and that our algorithm successfully separated real plagiarism from pseudo plagiarism.
Design and Implementation of a Temporary Priority Swapping Protocol for Solving Priority Inversion Problems in MicroC/OS-II Real-time Operating System
Jeon, Young-Sik ; Kim, Byung-Kon ; Heu, Shin ;
The KIPS Transactions:PartA, volume 16A, issue 6, 2009, Pages 463~472
DOI : 10.3745/KIPSTA.2009.16A.6.463
Real-time operating systems must have satisfying various conditions such as effective scheduling policies, minimized interrupt delay, resolved priority inversion problems, and its applications to be completed within desired deadline. The real-time operating systems, therefore, should be designed and developed to be optimal for these requirements. MicroC/OS-II, a kind of Real-time operating systems, uses the basic priority inheritance with a mutex to solve priority inversion problems. For the implementation of mutex, the kernel in an operating system should provide supports for numerous tasks with same priority. However, MicroC/OS-II does not provide this support for the numerous tasks of same priority. To solve this problem, MicroC/OS-II cannot but using priority reservation, which leads to the waste of unnecessary resources. In this study, we have dealt with new design a protocol, so called TPSP(Temporary Priority Swap Protocol), by an effective solution for above-mentioned problem, eventually enabling embedded systems with constrained resources environments to run applications.
Implementation of Image Enhancement Algorithm for Embedded System
An, Jeong-yeon ; Rhee, Sang-Burm ;
The KIPS Transactions:PartA, volume 16A, issue 6, 2009, Pages 473~480
DOI : 10.3745/KIPSTA.2009.16A.6.473
This paper is to enhance a color image running in the PXA255 ARM processor based on embedded linux environments. Retinex is one of the representative algorithm for image enhancement in the previous research. However, retinex is not suitable the run on the embedded system because of its long processing time. So, we proposed the image enhancement algorithm for embedded system, with less quantity of operation and the effect equivalent to retinex. To achieve this goal, we propose and implement the image enhancement algorithm, which utilizes the image formation model and gamma correction to be effective in a back-light and dark image. The proposed algorithm converts the color space from RGB to HSV, and then V and S channels are processed. In order to optimize the proposed method in the PXA255 ARM processor, quantity of calculation is reduced. The performance of the proposed algorithm was evaluated through qualitative method and quantitative method. The results show that brightness and contrast are improved with less quantity of operation.
Data Acquisition System Applying TMO for GIS Preventive Diagnostic System
Kim, Tae-Wan ; Kim, Yun-Gwan ; Jang, Cheon-Hyeon ;
The KIPS Transactions:PartA, volume 16A, issue 6, 2009, Pages 481~488
DOI : 10.3745/KIPSTA.2009.16A.6.481
GIS is used to isolate large power electrical equipment using SF6 gas. While GIS has simple structure, it has few break down, relatively high reliability. But it is hard to check up faults for reason of pressure. Faults of GIS should have a ripple effect on community and be hard to recovery. Consequently, GIS imports a preventive diagnostic system to find internal faults in advance. It is most important that reliability on the GIS preventive diagnostic system, because it estimates abnormality of system by analysis result of collected data. But, exist system which used central data management is low efficiency, and hard to guarantee timeliness and accuracy of data. To guarantee timeliness and accuracy, the GIS preventive diagnostic system needs accordingly to use a real-time middleware. So, in this paper, to improve reliability of the GIS preventive diagnostic system, we use a middleware based on TMO for guaranteeing timeliness of real-time distributed computing. And we propose an improved GIS preventive diagnostic system applying data acquisition, monitoring and control methods based on the TMO model. The presented system uses the Communication Control Unit(CCU) for distributed data handling which is supported by TMO. CCU can improve performance of the GIS preventive diagnostic system by guaranteeing timeliness of data handling process and increasing reliability of data through the TMO middleware. And, it has designed to take full charge of overload on a data acquisition task had been processed in an exist server. So, it could reduce overload of the server and apply distribution environment from now. Therefore, the proposed system can improve performance and reliability of the GIS preventive diagnostic system and contribute to stable operation of GIS.
Dynamic Management of Service Execution Contexts in Network-based Robots
Park, Jeong-Min ; Lee, Jung-Jae ; Yu, Beom-Jae ;
The KIPS Transactions:PartA, volume 16A, issue 6, 2009, Pages 489~500
DOI : 10.3745/KIPSTA.2009.16A.6.489
Robots have limited computing resources and robot services have different requirement such as sensors, actuators, computational capabilities and timeliness. In this paper, we propose a dynamic management method of service execution contexts to perform various services efficiently and to meet the time constraint of service in network-based robots. The proposed method is tested in the real network-based robot system. The results show that the real-time requirement for services is satisfied and the resource utilization is improved. The proposed method provides the extendability and flexibility of sensors and services by aptly modifying service execution contexts and increases the reusability of service.
Symmetry and Embedding Algorithm of Interconnection Networks Folded Hyper-Star FHS(2n,n)
Kim, Jong-Seok ; Lee, Hyeong-Ok ; Kim, Sung-Won ;
The KIPS Transactions:PartA, volume 16A, issue 6, 2009, Pages 501~508
DOI : 10.3745/KIPSTA.2009.16A.6.501
In this paper, we prove that folded hyper-star network FHS(2n,n) is node-symmetric and a bipartite network. We show that FHS(2n,n) can be embedded into odd network On+1 with dilation 2, congestion 1 and Od can be embedded into FHS(2n,n) with dilation 2 and congestion 1. Also, we show that
torus can be embedded into FHS(2n,n) with dilation 2 and congestion 2.
Mechanism for Building Approximation Edge Minimum Spanning Tree Using Portals on Input Edges
Kim, In-Bum ; Kim, Soo-In ;
The KIPS Transactions:PartA, volume 16A, issue 6, 2009, Pages 509~518
DOI : 10.3745/KIPSTA.2009.16A.6.509
In this paper, a mechanism that produces an approximation edges minimum spanning tree swiftly using virtual nodes called portals dividing given edges into same distance sub-edges. The approximation edges minimum spanning tree can be used in many useful areas as connecting communication lines, road networks and railroad systems. For 3000 random input edges, when portal distance is 0.3, tree building time decreased 29.74% while the length of the produced tree increased 1.8% comparing with optimal edge minimum spanning tree in our experiment. When portal distance is 0.75, tree building time decreased 39.96% while the tree length increased 2.96%. The result shows this mechanism might be well applied to the applications that may allow a little length overhead, but should produce an edge connecting tree in short time. And the proposed mechanism can produce an approximation edge minimum spanning tree focusing on tree length or on building time to meet user requests by adjusting portal distance or portal discard ratio as parameter.