Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of the Korea Society of Computer and Information
Journal Basic Information
Journal DOI :
Korean Society of Computer Information
Editor in Chief :
Volume & Issues
Volume 14, Issue 12 - Dec 2009
Volume 14, Issue 11 - Nov 2009
Volume 14, Issue 10 - Oct 2009
Volume 14, Issue 9 - Sep 2009
Volume 14, Issue 8 - Aug 2009
Volume 14, Issue 7 - Jul 2009
Volume 14, Issue 6 - Jun 2009
Volume 14, Issue 5 - May 2009
Volume 14, Issue 4 - Apr 2009
Volume 14, Issue 3 - Mar 2009
Volume 14, Issue 2 - Feb 2009
Volume 14, Issue 1 - Jan 2009
Selecting the target year
Multi-perspective User Preference Learning in a Chatting Domain
Shin, Wook-Hyun ; Jeong, Yoon-Jae ; Myaeng, Sung-Hyon ; Han, Kyoung-Soo ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 1~8
Learning user's preference is a key issue in intelligent system such as personalized service. The study on user preference model has adapted simple user preference model, which determines a set of preferred keywords or topic, and weights to each target. In this paper, we recommend multi-perspective user preference model that factors sentiment information in the model. Based on the topicality and sentimental information processed using natural language processing techniques, it learns a user's preference. To handle timc-variant nature of user preference, user preference is calculated by session, short-term and long term. User evaluation is used to validate the effect of user preference teaming and it shows 86.52%, 86.28%, 87.22% of accuracy for topic interest, keyword interest, and keyword favorableness.
Ant Colony System Considering the Iteration Search Frequency that the Global Optimal Path does not Improved
Lee, Seung-Gwan ; Lee, Dae-Ho ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 9~15
Ant Colony System is new meta heuristic for hard combinatorial optimization problem. The original ant colony system accomplishes a pheromone updating about only the global optimal path using global updating rule. But, If the global optimal path is not searched until the end condition is satisfied, only pheromone evaporation happens to no matter how a lot of iteration accomplishment. In this paper, the length of the global optimal path does not improved within the limited iterations, we evaluates this state that fall into the local optimum and selects the next node using changed parameters in the state transition rule. This method has effectiveness of the search for a path through diversifications is enhanced by decreasing the value of parameter of the state transition rules for the select of next node, and escape from the local optima is possible. Finally, the performance of Best and Average_Best of proposed algorithm outperforms original ACS.
A Software Unit Testing Tool based on The XML Test Script for Embedded Systems
Kwak, Dong-Gyu ; Yoo, Chae-Woo ; Cho, Yong-Yun ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 17~24
According to increasing requirments in embedded systems, embedded software has been more complicated then before, a software developer is required to test her/his software to make a efficient embedded system software in both time and space. This paper suggests a testing tool with which a software developer can easily test the embedded system software in cross-development environments. The suggested tool is designed based on host/target architecture, to provide an intuitive test environment in which a test case can be executed in a target board. The tool uses an XML-based test script to generate an appropriate test case. It includes a tree-based test script editor with which a developer can easily make a test case. Therefore, with the suggested tool, a develop can put down a burden on an software testing and get more productivity in software development related on embedded system.
MCL: Query Language for Metadata Registry Access Control
Hwang, Sun-Hong ; Kim, Jin-Hyung ; Jeong, Dong-Won ; Baik, Doo-Kwon ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 25~33
In various fields, ISO/IEC 11179-based MDR (Metadata Registry) systems have been developed. However, the current systems do not observe the standard, so inconsistency issue between metadata arises. Most of all, there exist several problems because ISO/IEC 11179 provides no standardized access method. SQL/MDR has been suggested to resolve those problems. SQL/MDR supports search operations, but it does not provide operations for vaild building and safe access for MDR. This paper, in the aforementioned issues, suggests MCL(Metadata Control Language) to guarantee safe and easy access control. MCL offers predefined roles and authority of user groups defined in ISO/IEC 11179 Part 6, and users are assigned to a proper user group. With such a way, MCL increases usability and security.
Design of Relational Storage Schema and Query Processing for Semantic Web Documents
Lee, Soon-Mi ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 35~45
According to the widespread use of ontology documents, a management system which store ontology data and process queries is needed for retrieving semantic information efficiently. In this paper I propose a storage schema that stores and retrieves semantic web documents based on RDF/RDFS ontology language developed by W3C in a relational databases. Specially, the proposed storage schema is designed to retrieve efficiently hierarchy information and to increase efficiency of query processing. Also, I describe a mechanism to transform RQL semantic queries to SQL relational queries and build up database using MS-ACCESS and implement in this paper. According to the result of implementation, we can blow that not only data query based on triple model but also query for schema and hierarchy information are transformed simply to SQL.
Effect of Digital Storytelling based Programming Education on Motivation and Achievement of Students in Elementary school
Kim, Kwang-Yeol ; Song, Jeong-Beom ; Lee, Tae-Wuk ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 47~55
The purpose of this study is to ermine the effect of digital storytelling as a strategy of programming education to improve students' learning motivation and achievement. To overcome the difficulty of programming education in elementary school and find teaching method which derives the students' motivation, we used a digital storytelling in programming class. Digital storytelling that is considered as an important factor of edutainment gives interest to learners with interaction and stories for programming materials. The result is that elementary school students are more interested in programming and attend actively and their motivation and achievement is improved. Therefore it can gives elementary school students a positive experience with programming that will hopefully contribute to a more positive attitude towards computer science.
Design and Implementation of Virtual Machine Monitor for Embedded Systems
Son, Sung-Hoon ; Lee, Jae-Hyeon ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 57~64
Recently virtualization has been one of the most popular research topics in system software area. While there already exist many commercial virtualization products for general-purpose computer system, little efforts are made to virtualize embedded system. In this paper, we design and implement a virtual machine monitor which divides each physical hardware resource of a embedded system into logical ones and reorganizes them into many virtual machines, which result in running several real-time operating systems concurrently on a single embedded system. We measure various performance metrics of the virtual machine monitor developed on a real embedded system. The results of the study show that our virtual machine monitor has enough potentiality of its application to real-world embedded systems.
Size Optimization Design Based on Maximum Stiffness for Structures
Shin, Soo-Mi ; Park, Hyun-Jung ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 65~72
This study presents a structural design optimizing sizes of high-rise steel plane truss members by maximizing stiffness subjected to given volume constraints. The sizing optimum design is evaluated by using a well-known optimality criteria (OC) of gradient-based optimization methods. In typical size optimization methods, truss structures are optimized with respect to minimum weight with constraints on the value of some displacement and on the member stresses. The proposed method is an inversed size optimization process in comparisons with the typical size optimization methods since it maximizes stiffness associated with stresses or displacements subjected to volume constraints related to weight. The inversed approach is another alternative to classical size optimization methods in order to optimize members' sizes in truss structures. Numerical applications of a round shape steel pipe truss structure are studied to verify that the proposed maximum stiffness-based size optimization design is suitable for optimally developing truss members's sizes.
A Study on the Detection of Similarity GPCRs by using protein Secondary structure
Ku, Ja-Hyo ; Han, Chan-Myung ; Yoon, Young-Woo ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 73~80
G protein-coupled receptors(GPCRs) family is a cell membrane protein, and plays an important role in a signaling mechanism which transmits external signals through cell membranes into cells. But, GPCRs each are known to have various complex control mechanisms and very unique signaling mechanisms. Structural features, and family and subfamily of GPCRs are well known by function. and accordingly, the most fundamental work in studies identifying the previous GPCRs is to classify the GPCRs with given protein sequences. Studies for classifying previously identified GPCRs more easily with mathematical models have been mainly going on. In this paper Considering that functions of proteins are determined by their stereoscopic structures, the present paper proposes a method to compare secondary structures of two GPCRs having different amino acid sequences, and then detect an unknown GPCRs assumed to have a same function in databases of previously identified GPCRs.
A Slope Information Based Fast Mask Generation Technique for ROI Coding
Park, Sun-Hwa ; Seo, Yeong-Geon ; Lee, Bu-Kweon ; Kang, Ki-Jun ; Kim, Ho-Yong ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 81~89
To support dynamic Region-of-Interest(ROI) in JPEG2000, a fast ROI mask generation is needed. In the existing methods of ROI coding, after scanning all the pixels in order and discriminating ROI, an ROI mask has been generated. Our method scans 4 pixels of the corners in one code block, and then based on those informations, scans the edges from the corners to get the boundaries of ROI and background. These informations are consisted of a distributed information of ROI and two coordinates of the pixels, which are the points the edges and the boundaries meet. These informations are transmitted to encoder and supported for fast ROI mask generation. There were no great differences between the proposed method and the existing methods in quality, but the proposed method showed superiority in speed.
FE-CBIRS Using Color Distribution for Cut Retrieval in IPTV
Koo, Gun-Seo ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 91~97
This paper proposes novel FE-CBIRS that finds best position of a cut to be retrieved based on color feature distribution in digital contents of IPTV. Conventional CBIRS have used a method that utilizes both color and shape information together to classify images, as well as a method that utilizes both feature information of the entire region and feature information of a partial region that is extracted by segmentation for searching. Also, in the algorithm, average, standard deviation and skewness values are used in case of color features for each hue, saturation and intensity values respectively. Furthermore, in case of using partial regions, only a few major colors are used and in case of shape features, the invariant moment is mainly used on the extracted partial regions. Due to these reasons, some problems have been issued in CBIRS in processing time and accuracy so far. Therefore, in order to tackle these problems, this paper proposes the FE-CBIRS that makes searching speed faster by classifying and indexing the extracted color information by each class and by using several cuts that are restricted in range as comparative images.
An Improved Area Edge Detection for Real-time Image Processing
Kim, Seung-Hee ; Nam, Si-Byung ; Lim, Hae-Jin ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 99~106
Though edge detection, an important stage that significantly affecting the performance of image recognition, has been given numerous researches on its execution methods, it still remains as difficult problem and it is one of the components for image recognition applications while it is not the only way to identify an object or track a specific area. This paper, unlike gradient operator using edge detection method, found out edge pixel by referring to 2 neighboring pixels information in binary image and comparing them with pre-defined 4 edge pixels pattern, and detected binary image edge by determining the direction of the next edge detection exploring pixel and proposed method to detect binary image edge by repeating step of edge detection to detect another area edge. When recognizing image, if edge is detected with the use of gradient operator, thinning process, the stage next to edge detection, can be omitted, and with the edge detection algorithm executing time reduced compared with existing area edge tracing method, the entire image recognizing time can be reduced by applying real-time image recognizing system.
A Distribution Key Management Protocol for improving Security of Inner Attack in WiMAX Environment
Jeong, Yoon-Su ; Kim, Yong-Tae ; Park, Gil-Cheol ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 107~115
The cryptological key which is used in WiMAX environment is used at regular intervals by mobile nodes (laptop computer, PDA, cell-phone) which is in the range of base station coverage. But it is very weak at local attack like man-in-the-middle when the mobile node is off the range of base station or enters into the range to communicate with base station because the communication section is activated wirelessly. This paper proposes a distribution key building protocol which can reuse security key used by nodes to reduce cryptological security attack danger and communication overhead which occurs when mobile node tries to communicate with base station. The proposed distribution key establishing protocol can reduce overhead which occurs between base station and mobile node through key reusing which occurs during the communication process and also, makes security better than IEEE 802.16 standard by creating shared key which is required for inter-certification through the random number which node itself creates.
An Efficient Location Aided Routing Protocol for Hybrid Wireless Networks
Kim, Sun-Il ; Lee, Jun-Yong ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 117~125
In hybrid wireless networks, a mobile node in MANET can communicate with other mobile nodes as well as nodes in the Internet. Hybrid mobile networks help to expand the application domains of MANET from limited areas, such as military applications to more diverse and general application areas. Previous routing protocols in hybrid wireless networks have not taken advantage of location information of nodes in a network. By using location information of nodes, a routing protocol can reduce the overhead of control messages for efficient network operations. This paper proposes a routing protocol for hybrid mobile networks, called Location-aided AODV+ (LAp) that is based on ADOV+ and takes advantage of node's location information. Performance evaluation shows that LAp performs better than ADOV+ when there are a sufficient number of nodes in a network for route establishments.
An Efficient Study of Emotion Inference in USN Computing
Yang, Dong-Il ; Kim, Young-Gyu ; Jeong, Yeon-Man ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 127~134
Recently, much research have been done on ubiquitous computing models in advanced countries as well as in Korea. Ubiquitous computing is defined as a computing environment that isn't bounded by time and space. Different kinds of computers are embedded in artifacts, devices, and environment, thus people can be connected everywhere and every time. To recognize user's emotion, facial expression, temperature, humidity, weather, and lightning factors are used for building ontology. Ontology Web Language (OWL) is adopted to implement ontology and Jena is used as an emotional inference engine. The context-awareness service infrastructure suggested in this research can be divided into several modules by their functions.
Time-optimized Color Conversion based on Multi-mode Chrominance Reconstruction and Operation Rearrangement for JPEG Image Decoding
Kim, Young-Ju ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 135~143
Recently, in the mobile device, the increase of the need for encoding and decoding of high-resolution images requires an efficient implementation of the image codec. This paper proposes a time-optimized color conversion method for the JPEG decoder, which reduces the number of calculations in the color conversion by the rearrangement of arithmetic operations being possible due to the linearity of the IDCT and the color conversion matrices and brings down the time complexity of the color conversion itself by the integer mapping replacing floating-point operations to the optimal fixed-point shift and addition operations, eventually reducing the time complexity of the JPEG decoder. And the proposed method compensates a decline of image quality incurred by the quantification error of the operation arrangement and the integer mapping by using the multi-mode chrominance reconstruction. The performance evaluation performed on the development platform of embedded systems showed that, compared to previous color conversion methods, the proposed method greatly reduces the image decoding time, minimizing the distortion of decoded images.
Implementation of a Simulation Tool for Monitoring Runtime Thermal Behavior
Choi, Jin-Hang ; Lee, Jong-Sung ; Kong, Joon-Ho ; Chung, Sung-Woo ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 145~151
There are excessively hot units of a microprocessor in today's nano-scale process technology, which are called hotspots. Hotspots' heat dissipation is not perfectly conquered by mechanical cooling techniques such as heatsink, heat spreader, and fans; Hence, an architecture-level temperature simulation of microprocessors is evident experiment so that designers can make reliable chips in high temperature environments. However, conventional thermal simulators cannot be used in temperature evaluation of real machine, since they are too slow, or too coarse-grained to estimate overall system models. This paper proposes methodology of monitoring accurate runtime temperature with Hotspot, and introduces its implementation. With this tool, it is available to track runtime thermal behavior of a microprocessor at architecture-level. Therefore, Dynamic Thermal Management such as Dynamic Voltage and Frequency Scaling technique can be verified in the real system.
Realtime Digital Information Display System based on Web Server
Lee, Se-Hoon ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 153~161
In this paper, we designed and implemented realtime DID(digital information display) system based on web server that displayed multimedia contents. The contents are weather, news information on the internet web sites and public relations or advertisements data on local systems. The DID system has client/server architecture that the server send to client that schedule informations and multimedia contents received form web server and the client displayed the contents though scheduled information. Therefore the systems overcome network fault for the mean time. Also, the system has realtime services of web page filtering function that extract the partial information of specific web pages.
A Study on Cardiac Disease Management System in Mobile Networks
Han, Kwang-Rok ; Sahn, Surg-Won ; Jang, Dong-Wook ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 163~171
Precaution is important in cardiac disease above all things. However, current developed tele-monitoring devices limit their communication distance by 100 m and have disadvantage that the device must be activated by the patients themselves. To overcome these shortcomings, we design and implement a cardiac disease management system by sending abnormal ECG signals automatically to the PC in hospital using mobile networks. Experiments show that ECG signals of the patients are transmitted to the database server in hospital without any distortion. Moreover, the amount of SMS data decreased by more than 30% using base64 method than hexadecimal one.
An Algorithm to Transform RDF Models into Colored Petri Nets
Yim, Jae-Geol ; Gwon, Ki-Young ; Joo, Jae-Hun ; Lee, Kang-Jai ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 173~181
This paper proposes an algorithm to transform RDF(Resource Description Framework) models for ontology into CPN(Colored Petri Net) models. The algorithm transforms the semantics of the RDF model into the topology of the CPN by mapping the classes and the properties of the RDF onto the places of the CPN model then reflects the RDF statements on the CPN by representing the relationships between them as token transitions on the CPN. The basic idea of reflecting the RDF statements on the CPN is to generate a token, which is an ordered pair consisting of two tokens (one from the place mapped into the subject and the other one from the place mapped into the object) and transfer it to the place mapped into the predicate. We have actually built CPN models for given RDF models on the CNPTools and inferred and extracted answers to the RDF queries on the CPNTools.
Design and Implementation of Internet Shoppping Mall Based on Software Implemented Context Aware
Yoon, Sun-Hee ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 183~190
The core technique of ubiquitous computing is the context aware computing and the context aware technique is more like software so the important research work is to develop the core engines first and the adapted device for the engines. When ubiquitous computing era comes, the current existing internet shopping mall, the form of searching the direct goods and ordering the goods by the customers evolves and develops the form of system that recommends the goods by the search engine which combined with the input data and technique of case based reasoning and intelligent agent that is based on the context aware technique. In this paper, search engine which is based on the case based reasoning and intelligent agent is designed and the prototype is implemented to be adapted to the internet fashion expert shopping mall.
Development of a Translator for Automatic Generation of Ubiquitous Metaservice Ontology
Lee, Mee-Yeon ; Lee, Jung-Won ; Park, Seung-Soo ; Cho, We-Duke ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 191~203
To provide dynamic services for users in ubiquitous computing environments by considering context in real-time, in our previous work we proposed Metaservice concept, the description specification and the process for building a Metaservice library. However, our previous process generates separated models - UML, OWL, OWL-S based models - from each step, so it did not provide the established method for translation between models. Moreover, it premises aid of experts in various ontology languages, ontology editing tools and the proposed Metaservice specification. In this paper, we design the translation process from domain ontology in OWL to Metaservice Library in OWL-S and develop a visual tool in order to enable non-experts to generate consistent models and to construct a Metaservice library. The purpose of the Metaservice Library translation process is to maintain consistency in all models and to automatically generate OWL-S code for Metaservice library by integrating existing OWL model and Metaservice model.
A Study of Systematic Implementations for the Integrated ITS call center
Chung, Sung-Hak ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 205~216
The aim of this study is to propose an integrated operation plan of information call services by multi-connecting call services which are now being serviced by each different call number services and by providing one stop service which organically links alternative transportations such as railroad, air, and bus and also related organizations as well as road traffic information. For the objective, we analyzed the current status of Korean and foreign country systems and reviewed operation technology and technical specifications of the integrated system according to 3 steps, i.e. infrastructure procurement, test bed and extended completion, stabilization and high valuable services completion. Throughout the result of this study, traffic information one stop service, convenient service, diverse related information provision service, real-time information provision, and efficient system are expected to be implemented in the traffic information call service.
Applying an Aggregate Function AVG to OLAP Cubes
Lee, Seung-Hyun ; Lee, Duck-Sung ; Choi, In-Soo ;
Journal of the Korea Society of Computer and Information, volume 14, issue 1, 2009, Pages 217~228
Data analysis applications typically aggregate data across many dimensions looking for unusual patterns in data. Even though such applications are usually possible with standard structured query language (SQL) queries, the queries may become very complex. A complex query may result in many scans of the base table, leading to poor performance. Because online analytical processing (OLAP) queries are usually complex, it is desired to define a new operator for aggregation, called the data cube or simply cube. Data cube supports OLAP tasks like aggregation and sub-totals. Many aggregate functions can be used to construct a data cube. Those functions can be classified into three categories, the distributive, the algebraic, and the holistic. It has been thought that the distributive functions such as SUM, COUNT, MAX, and MIN can be used to construct a data cube, and also the algebraic function such as AVG can be used if the function is replaced to an intermediate function. It is believed that even though AVG is not distributive, but the intermediate function (SUM, COUNT) is distributive, and AVG can certainly be computed from (SUM, COUNT). In this paper, however, it is found that the intermediate function (SUM COUNT) cannot be applied to OLAP cubes, and consequently the function leads to erroneous conclusions and decisions. The objective of this study is to identify some problems in applying aggregate function AVG to OLAP cubes, and to design a process for solving these problems.