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:PartD
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 8D, Issue 6 - Oct 2001
Volume 8D, Issue 5 - Oct 2001
Volume 8D, Issue 4 - Aug 2001
Volume 8D, Issue 3 - Jun 2001
Volume 8D, Issue 2 - Apr 2001
Volume 8D, Issue 1 - Feb 2001
Selecting the target year
CS-Tree : Cell-based Signature Index Structure for Similarity Search in High-Dimensional Data
Song, Gwang-Taek ; Jang, Jae-U ;
The KIPS Transactions:PartD, volume 8D, issue 4, 2001, Pages 305~312
Recently, high-dimensional index structures have been required for similarity search in such database applications s multimedia database and data warehousing. In this paper, we propose a new cell-based signature tree, called CS-tree, which supports efficient storage and retrieval on high-dimensional feature vectors. The proposed CS-tree partitions a high-dimensional feature space into a group of cells and represents a feature vector as its corresponding cell signature. By using cell signatures rather than real feature vectors, it is possible to reduce the height of our CS-tree, leading to efficient retrieval performance. In addition, we present a similarity search algorithm for efficiently pruning the search space based on cells. Finally, we compare the performance of our CS-tree with that of the X-tree being considered as an efficient high-dimensional index structure, in terms of insertion time, retrieval time for a k-nearest neighbor query, and storage overhead. It is shown from experimental results that our CS-tree is better on retrieval performance than the X-tree.
Retrieval Scheme of XML Documents Using Link Queries
Mun, Chan-Ho ; Gang, Hyeon-Cheol ;
The KIPS Transactions:PartD, volume 8D, issue 4, 2001, Pages 313~326
The XML that was proposed as a next-generation standard for describing Web documents is widely used in various Web-based applications. In addition, XML documents on the Web link each other by hyperlinks. The current works on XML focus on the XML storage system that can efficiently store, manage, and retrieve XML documents. However, the research on the query language that supports the XML links and on the XML retrieval systems to process the XML links, is little conducted until now. In this paper, we propose an extension of an XML query language for expressing the XML link query and its processing scheme. A link query is to retrieve contents from an XML document (a query document) and from the XML documents (referenced documents) that are referred to by the links in the query document. As far as retrieving from the referenced documents is concerned, the current practice is to manually generate queries to get the partial results, and to repeat such a procedure. The purpose of link query processing in this paper is to eliminate the manual work altogether in getting the complete query result. The performance analysis shows that our link query processing strategy outperforms the conventional approach including the manual tasks. The more links to the referenced documents and the more referenced documents there are in the site storing the query document, the more query processing time decreases.
A Framework of XML Materialized Views Using Incremental Refresh
Im, Jae-Guk ; Gang, Hyeon-Cheol ; Seo, Sang-Gu ;
The KIPS Transactions:PartD, volume 8D, issue 4, 2001, Pages 327~338
The view can provide the user an appropriate portion of the database through data integration and filtering. Views can be materialized for query performance improvement, and in that cse, their consistency needs to be maintained against the updates of the underlying data. They can be either recomputed or incrementally refreshed by reflecting the relevant updates. Since XML could represent the structural information of the documents, for the XML materialized views, new techniques that differ from the previous ones for incrementally refreshing the relational views are required. In this paper, we propose a framework of XML materialized view management where the XML view derived from the underlying XML documents are materialized and incrementally refreshed against the updates of the underlying documents.
Efficient Algorithms for Mining Association Rules Under the Interactive Environments
Lee, Jae-Moon ;
The KIPS Transactions:PartD, volume 8D, issue 4, 2001, Pages 339~346
A problem for mining association rules under the interactive environments is to mine repeatedly association rules with the different minimum support. This problem includes all subproblems except on the facts that mine repeatedly association rules with the s믇 database. This paper proposed the efficient algorithms to improve the performance by using the information of the candidate large itemsets which calculate the previous association rules. The proposed algorithms were compared with the conventional algorithm with respect to the execution time. The comparisons show that the proposed algorithms achieve 10∼30% more gain than the conventional algorithm.
A Study on Task Allocation of Parallel Spatial Joins using Fixed Grids
Kim, Jin-Deok ; Seo, Yeong-Deok ; Hong, Bong-Hui ;
The KIPS Transactions:PartD, volume 8D, issue 4, 2001, Pages 347~360
The most expensive spatial operation in spatial databases is a spatial join which computes a combined table of which tuple consists of two tuples of the two tables satisfying a spatial predicate. Although the execution time of sequential processing of a spatial join has been so far considerably improved, the response time is not tolerable because of not meeting the requirements of interactive users. It is usually appropriate to use parallel processing to improve the performance of spatial join processing. However, as the number of processors increases, the efficiency of each processor decreases rapidly because of the disk bottleneck and the overhead of message passing. This paper proposes the method of task allocation to soften the disk bottleneck caused by accessing the shared disk at the same time, and to minimize message passing among processors. In order to evaluate the performance of the proposed method in terms of the number of disk accesses and message passing, we conduct experiments on the two kinds of parallel spatial join algorithms. The experimental tests on the MIMD parallel machine with shared disks show that the proposed semi-dynamic task allocation method outperforms the static and dynamic task allocation methods.
Representing and retrieving the Structured Information of XML Documents
Jo, Yun-Gi ; Jo, Jeong-Gil ; Lee, Byeong-Ryeol ; Gu, Yeon-Seol ;
The KIPS Transactions:PartD, volume 8D, issue 4, 2001, Pages 361~366
As growing the number of Webs, the total amount of accessible information has been greater than ever. To storage and retrieve the vast information on the Webs effectively, many researchers have been made utilizing XML (extensible Markup Language). In this paper, we propose an effective method of representation and retrieval mechanism for the structured retrieval of the XML documents : (1) the fixed sized LETID (Leveled Element Type ID) that contains the information of elements such as parent node, sibling nodes, and identical sibling nodes, and the hierachical information of current node, and (2) content index, structure index, attribute index model, and the information retrieval algorithm for the structured information retrieval. With our methods, we can effectively represent the structured information of XML documents, and can directly access the specific elements by simple operations to process various queries.
Dynamic Generation Methods of the Wireless Map Database using Generalization and Filtering
Kim, Mi-Ran ; Choe, Jin-O ;
The KIPS Transactions:PartD, volume 8D, issue 4, 2001, Pages 367~376
For the electronic map service by wireless, the existing map database cannot be used directly. This is because, the data volume of a map is too big to transfer by wireless and although the map is transferred successfully, the devices to display the map usually don’t have enough resources as the ones for desktop computers. It is also not acceptable to construct map database for the exclusive use of wireless service because of the vast cost. We propose new technique to generate a map for wireless service dynamically, from the existing map database. This technique includes the generalization method to reduce the map data volume and filtering method to guarantee that the data volume don’t exceed the limit of bandwidth. The generalization is performed in 3 steps :ㅁ step of merging the layers, a step of reducing the size of spatial objects, and a step of processing user interface. The filtering is performed by 2 module, counter and selector module. The counter module checks whether the data blume of generated map by generalization, exceeds the bandwidth limit. The selector module eliminates the excess objects and selects the rest, on the basis of distance.
Spatial View Materialization Technique by using R-Tree Reconstruction
Jeong, Bo-Heung ; Bae, Hae-Yeong ;
The KIPS Transactions:PartD, volume 8D, issue 4, 2001, Pages 377~386
In spatial database system, spatial view is supported for efficient access method to spatial database and is managed by materialization and non-materialization technique. In non-materialization technique, repeated execution on the same query makes problems such as the bottle-neck effect of server-side and overloads on a network. In materialization technique, view maintenance technique is very difficult and maintenance cost is too high when the base table has been changed. In this paper, the SVMT (Spatial View Materialization Technique) is proposed by using R-tree re-construction. The SVMT is a technique which constructs a spatial index according to the distribution ratio of objects in spatial view. This ratio is computed by using a SVHR (Spatial View Height in R-tree) and SVOC (Spatial View Object Count). If the ratio is higher than the average, a spatial view is materialized and the R-tree index is re-used. In this case, the root node of this index is exchanged a node which has a MBR (Minimum Boundary Rectangle) value that can contains the whole region of spatial view at a minimum size. Otherwise, a spatial view is materialized and the R-tree is re-constructed. In this technique, the information of spatial view is managed by using a SVIT (Spatial View Information Table) and is stored on the record of this table. The proposed technique increases the speed of response time through fast query processing on a materialized view and eliminates additional costs occurred from repeatable query modification on the same query. With these advantages, it can greatly minimize the network overloads and the bottle-neck effect on the server.
Software Reliability Prediction of Grouped Failure Data Using Variant Models of Cascade-Correlation Learning Algorithm
Lee, Sang-Un ; Park, Jung-Yang ;
The KIPS Transactions:PartD, volume 8D, issue 4, 2001, Pages 387~392
This Many software projects collect grouped failure data (failures in some failure interval or in variable time interval) rather than individual failure times or failure count data during the testing or operational phase. This paper presents the neural network (NN) modeling for grouped failure data that is able to predict cumulative failures in the variable future time. The two variant models of cascade-correlation learning (CasCor) algorithm are presented. Suggested models are compared with other well-known NN models and statistical software reliability growth models (SRGMs). Experimental results show that the suggested models show better predictability.
The Comparative Study for Software Reliability Models Based on NHPP
Gan, Gwang-Hyeon ; Kim, Hui-Cheol ; Lee, Byeong-Su ;
The KIPS Transactions:PartD, volume 8D, issue 4, 2001, Pages 393~400
This paper presents a stochastic model for the software failure phenomenon based on a nonhomogeneous Poisson process (NHPP). The failure process is analyzed to develop a suitable mean value function for the NHPP ; expressions are given for several performance measure. Actual software failure data are compared with generalized model by Goel dependent on the constant reflecting the quality of testing. The performance measures and parametric inferences of the new models, Rayleigh and Gumbel distributions, are discussed. The results of the new models are applied to real software failure data and compared with Goel-Okumoto and Yamada, Ohba and Osaki models. Tools of parameter inference was used method of the maximun likelihood estimate and the bisection algorithm for the computing nonlinear root. In this paper, using the sum of the squared errors, model selection was employed. The numerical example by NTDS data was illustrated.
An Object-Oriented Modeling of Object-Oriented Software Development Methods : OMOS(Object-oriented software development Method for Object-oriented software System)
Choi, Sung-Woon ;
The KIPS Transactions:PartD, volume 8D, issue 4, 2001, Pages 401~408
Object-oriented software development methods are used to develop object-oriented software systems. Object-oriented systems are believed to habe better modularity, reusability, maintainability, and extensibility than systems modeled in conventional methods. Current object-oriented software development methods, however, are modeled in terms of procedural, functional, and structural models. There models cause problems such as tight coupling among activities, and uncontrolled access to global artifacts. In this paper, were introduce OMOS(Object-oriented software development Method for Object-oriented software System), an object-oriented modeling of object-oriented software development methods. Artifacts and their related activities are modeled as classes and objects. Development lifecycles are modeled as interactions among the objects. By modeling the software development method in an object-oriented way, OMOS achieves better reusability, flexibility, extensibility, and maintainability.
A Study on Test Coverage for Software Reliability Evaluation
Park, Jung-Yang ; Park, Jae-Heung ; Park, Su-Jin ;
The KIPS Transactions:PartD, volume 8D, issue 4, 2001, Pages 409~420
Recently a new approach to evaluation of software reliability, one of important attributes of a software system, during testing has been devised. This approach utilizes test coverage information. The coverage-based software reliability growth models recently appeared in the literature are first reviewed and classified into two classes. Inherent problems of each of the two classes are then discussed and their validity is empirically investigated. In addition, a new mean value function in coverage and a heuristic procedure for selecting the best coverage are proposed.
The Conversion of a Set, a Sequence, and a Map in VDM to a Linked List in a Programming Language
Yu, Mun-Seong ;
The KIPS Transactions:PartD, volume 8D, issue 4, 2001, Pages 421~426
A formal development method is used to develop software rigorously and systematically. In a formal development method, we specify system by a formal specification language and gradually develop the system more concretely until we can implement the system. VDM is one of formal specification languages. VDM uses mathematical data structures such as sets, sequences, and maps to specify the system, but most programming languages do not have such data structures. Therefore, these data structures should be converted. We can convert mathematical data structures in VDM to a linked list, a data structure in a programming language. In this article, we propose a method to convert a set, a sequence, and a map in VDM to a linked list in a programming language and prove the correctness of this conversion mathematically.
A Study on System for Environmental Control in the Greenhouse using Internet
Kim, Dae-Eop ; Park, Heung-Bok ;
The KIPS Transactions:PartD, volume 8D, issue 4, 2001, Pages 427~438
Recently, Environmental Control Devices of Green House for Protected Cultivation is composed of on/off-type Controller to control each device using timer in equipment of intensive Labor. In case of system, it is difficult to grasp condition of the greenhouse about errors when this system has defect of a hardware, and it operates in the remote place or at night. In this paper, we developed a system that capable of replacing the existing control method of on/off with display panel in the greenhouse, monitoring data aquisition and status in the greenhouse using client computer based on internet. Also this system can communicate with each local greenhouse, and send alarm message about error. And we constructed web server to manage efficient informations for environmental control and corps cultivation in the greenhouse.
A Supply Chain Management based on Mobile Agents with Flexible Reply Scheme
Jeong, Won-Ho ; Nam, Hui-Jeong ;
The KIPS Transactions:PartD, volume 8D, issue 4, 2001, Pages 439~450
Mobile agent is one of the promising ways of overcoming network load and latency. It is also a new software paradigm including those concepts of client/server, applet/servelet, and code-on-demand. In this paper, a new mobile agent concept with flexible replay scheme is proposed, which can deal with embarrassing situation when replying results should be accomplished in various distributed applications. For example, they are 1) a burden of bulky result, 2) a need of different replay scheme dependent on work type, 3) connection failure to the target node, and 4) a need of fast migration to next node to keep the itinerary. Regarding the source node, there may be another situation that it wants to be aware of whether its wi가 is completed or not. Three kinds of reply schemes are proposed for dealing flexibly with such situations. They are based on priority reply list where nodes to be replied are stored according to their priorities. An experimental supply chain management model using the proposed reply schemes is designed and implemented. It is one of good distributed applications appropriate for our reply schemes, because it requires different reply schemes according to work types and it is important to gather required information in time.