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 8A, Issue 4 - Dec 2001
Volume 8A, Issue 3 - Sep 2001
Volume 8A, Issue 2 - Jun 2001
Volume 8A, Issue 1 - Mar 2001
Selecting the target year
The Design and Implementation of C Standard Library for RTOS Q+
Kim, Do-Hyeong ; Park, Seung-Min ;
The KIPS Transactions:PartA, volume 8A, issue 1, 2001, Pages 1~8
This paper describes the design and implementation of C standard library for real-time operating system Q+, that is being developed for the internet appliance. The C library in the real-time operating system should be defined according to the standard interface and support the concurrent execution of threads. The implemented C standard library is reentrant and follows POSIX.l standard interface. And, the C standard library functions, which are adequate to the Q+ application and commonly provided by commercial real-time operating systems, are selected among POSIX.l standard functions. The C standard library is implemented on the Q+ kernel and D-TV set-top box according to the implementation sequence, which is determined by analyzing the relation of function calls.
Parallel Processing System with combined Architecture of SIMD with MIMD
Lee, Hyeong ; Choe, Seong-Hyeok ; Kim, Jung-Bae ; Park, Jong-Won ;
The KIPS Transactions:PartA, volume 8A, issue 1, 2001, Pages 9~15
An Expanded Real-Time Scheduler Model for Supporting Aperiodic Task Servers
Shim, Jae-Hong ; Kim, Yeong-Il ; Choi, Hyung-Hee ; Jung, Gi-Hyun ; Yoo, Hae-Young ;
The KIPS Transactions:PartA, volume 8A, issue 1, 2001, Pages 16~26
This paper proposes an extended scheduler model that is an extension of the existing model proposed already in [4, 5], which consists of upper layer task scheduler and lower layer scheduling framework. However, in order to support aperiodic task scheduling, the task scheduler has been divided into two parts, such as periodic task control component and aperiodic task control component. Thus, the proposed model can support various bandwidth-preserving servers that can service aperiodic tasks. The model distinctly separates a classic monolithic kernel scheduler into several kernel components according to their functionality. This enables system developers to implement a new scheduling algorithm or aperiodic task server independent of complex low kernel mechanism, and reconfigure the system at need. In Real-Time Linux , we implemented the proposed scheduling framework representative scheduling algorithms, and server bandwidth-preserving servers on purpose to test. Throughout these implementations, we confirmed that a new algorithm or server could be developed independently without updates of complex low kernel modules. In order to verify efficiency of the proposed model, we measured the performance of several aperiodic task servers. The results showed this the performance of model, which even consisted of two hierarchical components and several modules, didnt have such high run-time overhead, and could efficiently support reconfiguration and scheduler development.
An Assignment Motion Algorithm to Suppress the Unnecessary Code Motion
Shin, Hyun-Deok ; Ahn, Heui-Hak ;
The KIPS Transactions:PartA, volume 8A, issue 1, 2001, Pages 27~35
This paper presents the assignment motion algorithm unrestricted for code optimization computationally. So, this algorithm is suppressed the unnecessary code motion in order to avoid the superfluous register pressure, we propose the assignment motion algorithm added to the final optimization phase. This paper improves an ambiguous meaning of the predicated. For mixing the basic block level analysis with the instruction level analysis, an ambiguity occurred in knoop’s algorithm. Also, we eliminate an ambiguity of it. Our proposal algorithm improves the runtime efficiency of a program by avoiding the unnecessary recomputations and reexecutions of expressions and assignment statements.
Parallel Factorization using Quadratic Sieve Algorithm on SIMD machines
Kim, Yang-Hee ;
The KIPS Transactions:PartA, volume 8A, issue 1, 2001, Pages 36~41
In this paper, we first design an parallel quadratic sieve algorithm for factoring method. We then present parallel factoring algorithm for factoring a large odd integer by repeatedly using the parallel quadratic sieve algorithm based on the divide-and-conquer strategy on SIMD machines with DMM. We show that this algorithm is optimal in view of the product of time and processor numbers.
Curve Fitting with Recursive Ball Curve
Lee, A-Ri ; Choe, Yeong-Geun ;
The KIPS Transactions:PartA, volume 8A, issue 1, 2001, Pages 42~47
In this paper, we present a curve fitting algorithm using a ball curve. Our algorithm is recursive method for fitting, which is not a traditional ball function but a continuous ball function. This algorithm consists of two steps. The first step, it is classified the composite corner points to joint points until selected from the given data set. The second step is the curve fitting. The basis function for curve fitting is use to ball function. Also, the weighted least square method, to insert knot, is an efficient method for piecewise ball curve and ball curve segments will be smoothly connected at all composit points. The proposed algorithm will be applied to represent image representation, like fonts, digital image and GIS.
A Minimization Technique for BDD based on Microcanonical Optimization
Lee, Min-Na ; Jo, Sang-Yeong ;
The KIPS Transactions:PartA, volume 8A, issue 1, 2001, Pages 48~55
Using BDD, we can represent Boolean functions uniquely and compactly, Hence, BDD have become widely used for CAD applications, such as logic synthesis, formal verification, and etc. The size of the BDD representation for a function is very sensitive to the choice of orderings on the input variables. Therefore, it is very important to find a good variable ordering which minimize the size of the BDD. Since finding an optimal ordering is NP-complete, several heuristic algorithms have been proposed to find good variable orderings. In this paper, we propose a variable ordering algorithm based on the
O consists of two distinct procedures that are alternately applied : Initialization and Sampling. The initialization phase is to executes a fast local search, the sampling phase leaves the local optimum obtained in the previous initialization while remaining close to that area of search space. The proposed algorithm has been experimented on well known benchmark circuits and shows superior performance compared to a algorithm based on simulated annealing.
Neural Network based Variable Structure Control for a Class of Nonlinear Systems
Kim, Hyeon-Ho ; Lee, Cheon-Hui ;
The KIPS Transactions:PartA, volume 8A, issue 1, 2001, Pages 56~62
This paper presents a neural network based variable structure control scheme for nonlinear systems. In this scheme, a set of local variable structure control laws are designed on the basis of the linear models about preselected representative points which cover the range of the system operation of interest. From the combination of the set of local variable structure control laws, neural networks infer the approximate control input in between the operating points. The neural network based variable structure control alleviates the effects of model uncertainties, which cannot be compensated by the control techniques using feedback linearization. It also relaxes the discontinuity in the system’s behavior that appears when the control schemes based on the family of the linear models are applied to nonlinear systems. Simulation results of a ball and beam system, to which feedback linearization cannot be applied, demonstrate the feasibility of the proposed method.
An Interactive Character Animation and Data Management Tool
Lee, Min-Geun ; Lee, Myeong-Won ;
The KIPS Transactions:PartA, volume 8A, issue 1, 2001, Pages 63~69
In this paper, we present an interactive 3D character modeling and animation including a data management tool for editing the animation. It includes an animation editor for changing animation sequences according to the modified structure of 3D object in the object structure editor. The animation tool has the feature that it can produce motion data independently of any modeling tool including our modeling tool. Differently from conventional 3D graphics tools that model objects based on geometrically calculated data, our tool models 3D geometric and animation data by approximating to the real object using 2D image interactively. There are some applications that do not need precise representation, but an easier way to obtain an approximated model looking similar to the real object. Our tool is appropriate for such applications. This paper has focused on the data management for enhancing the automatin and convenience when editing a motion or when mapping a motion to the other character.
The Synchronization of WWW Browsers between Server and Client on Web-based Real-time Remote Lecture
Lee, Jeom-Suk ; Lee, Bu-Gwon ; Seo, Yeong-Geon ;
The KIPS Transactions:PartA, volume 8A, issue 1, 2001, Pages 70~74
A general web-based remote lecture system uses video data and audio data to provide synchronize between teacher and students. This system requires high bandwidth, high speed networking, television, compression and computing technologies between server and client for remote lecture over Internet. As a result, this system can decrease an efficiency for lecturing over current Internet. So, this paper proposes a new mechanism calling as ‘Synchronization of WWW browsers between server and client’to cope with above problems and finally pursues low cost needed for real-time remote lecture over Internet. The mechanism means that every browser of teacher and students displays the same page and the action of teacher is transferred to the browser of student. And, this can be implemented by Windows hooking APIs, Memory Mapping, and DLL (Dynamic Link Library) programming technology. This paper points to the design and implementation of LAS (Lecture Assistant Server) and LAC (Lecture Assistant Client) to perform the synchronization between server and client.