• Journal of the Korea Society of Computer and Information
• /
• v.11 no.5 s.43
• /
• pp.19-27
• /
• 2006

This paper presents a query processing model in a wrapper based on the XML view tree. The query processing in a wrapper requires view composition, query translation into local sources, and generation of XML documents from local query results. We present a query processing model based on the view tree, where the XML views and the XML query is represented by the view tree. Since the view tree keeps the structure of a virtual XML document, it is easy to navigate the path expression. The view tree is also used as a template for schema generation and XML document generation as a query result. Moreover this conceptual uniform abstraction for the XML view and the user query makes it easy to support a multi-level XML view and to implement our composition mechanism.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.377-386
• /
• 2001

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.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2001.11a
• /
• pp.270-273
• /
• 2001

Electrical tree is studied widely by manufacture state of insulating material fare and blazing fire diagnosis system of use in phenomenon of part discharge that happen for main cause of dielectric breakdown of equipment for electric power. Use process that draw tree pattern here measuring above zero to study special quality of this electricity tree, real-time processing by image processing is proposed because reproduction of tree blazing fire process drops and pattern of tree is difficult correct quantification of tree growth by existent visual observation by involution. This research presents general process that need in image processing of tree blazing fire, and that remove various noises that happen in above zero by measuring electrical tree dividing background and complete view in measured above zero taking advantage of specially proposed complete view object abstraction techniques effectively and quantification of tree becomes easy naturally, can apply to dielectric breakdown estimate because can chase growth process of tree.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2001.11b
• /
• pp.270-273
• /
• 2001

Electrical tree is studied widely by manufacture state of insulating material fare and blazing fire diagnosis system of use in phenomenon of part discharge that happen for main cause of dielectric breakdown of equipment for electric power. Use process that draw tree pattern here measuring above zero to study special quality of this electricity tree, real-time processing by image processing is proposed because reproduction of tree blazing fire process drops and pattern of tree is difficult correct quantification of tree growth by existent visual observation by involution. This research presents general process that need in image processing of tree blazing fire, and that remove various noises that happen in above zero by measuring electrical tree dividing background and complete view in measured above zero taking advantage of specially proposed complete view object abstraction techniques effectively and quantification of tree becomes easy naturally, can apply to dielectric breakdown estimate because can chase growth process of tree.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.5
• /
• pp.390-399
• /
• 2004

In this paper, we design and implement a multiple-view VoiceXML editor to improve editing efficiency of the VoiceXML. The VoiceXML multiple-view Editor uses a MVC framework to support multiple views and paradigm. Our multiple-view editor consists of Model. View and Controller using MVC framework. A model, core data structure. is constructed of abstract syntax tree and abstract grammar. A view. user interface. is formalized in unparsing rules and unparser. A controller. to control model and view. is made of command interpreter and tree handler. The VoiceXML multiple-view editor overcomes a drawbacks of existing XML editors by showing document structure and context concurrently. as well as document flows. Our VoiceXML multiple-view editor. which MVC framework has been applied, provides various editing views concurrently to users. Thereby. it supports efficient and convenient editing environments for voice-web documents to users and it guarantees transparency of editors. as various views have a same consistent model.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.43 no.12
• /
• pp.1079-1088
• /
• 2015

Parallelism and performance enhancement of calculating view factors in KSDS developed by KARI is introduced in this paper. View factor is an essential parameters of radiation thermal analysis for a spacecraft, and the amount of computation of them is not negligible. Especially, independent integration of view factors at each position of the orbit because the relative displace between solar panel and main body of a satellite varies with the position on the orbit. This paper introduces a range of parallelism of computing view factor and their performance, detection of obstructions by spatial search algorithm based on KD-Tree, and the reduction of the calculation of view factors of a satellite with relative motion between solar panel and main body, called updating fractional view factor matrix, for satellite thermal analysis.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.367-374
• /
• 2003

A mediator-wrapper system, which is one of integration methods of heterogeneous databases, preserves a virtual integrated view rather than physical movement of the contents of each database. In order for a mediator to preserve a virtual integrated view, it requires the schema manager of the wrapper which communicates with local databases. This paper presents a schema manager of a wrapper that provides a mediator with XML schema which is generated from relational database schema. The XML schema manager supports a user-defined XML view. We present the view tree model which is used for materializing the use-defined XML view to generate XML schema, and the conversion algorithm based on the proposed view tree model. This model is can be uniformly applied to all schema managers of heterogeneous information sources.

• Korean Journal of Computational Design and Engineering
• /
• v.19 no.1
• /
• pp.61-67
• /
• 2014

This paper proposes a procedure enabling the extraction of view-dependent triangular approximations from a height map. In general, procedures to approximate a height map use tree hierarchies. These methods, however, have a limitation in terms of accuracy, because they depend on tree hierarchy than terrain features. To overcome the difficult, we apply the simplification method for triangular meshes to a height map. The proposed procedure maintains full decimation procedure to support multiresolution. The maintenance of decimation procedure results in creation of the groups (trees), each of which consists of vertices that can be merged into one vertex (root node). As the groups have tolerance which is determined by some tests, they support the generation of view-dependent arbitrary triangular meshes.

• Journal of the Korea Computer Graphics Society
• /
• v.4 no.1
• /
• pp.1-10
• /
• 1998

The idea of level-of-detail based on multiresolution model is gaining popularity as a natural means of handling the complexity regarding the realtime rendering of virtual environments. To generate an effective multiresolution model, we should capture the prominent visual features in the process of simplifying original complex model. In this paper, we incorporate view dependent features such as silhouette features and backface features, to the generation process of multiresolution model. To capture the view directional parameter, we propose multiresolution view sphere. View sphere maps the directional relationship between object surface and the view. Using the view sphere, coherence in the directional space is mapped into spatial coherence in the view sphere. View sphere is generated in multiresolution fashion to simplify the object. To access multiresolution view sphere efficiently, we devise quad tree for the view sphere. We also devise a mechanism for realtime simplification process using proposed view sphere. Using proposed mechanism, regenerating simplified model in realtime is effectively done in the order of number of rendered vertices.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.4
• /
• pp.1-9
• /
• 1998

Temporal Databases store all of informations by time varying, so the temporal query processor has to process very large information. Therefore, we propose an efficient method of query processing by using the relevance checking algorithm of input query and view definition. The relevance checking algorithm of query investigates relevance between the input query of user about base relation and the execution tree of view definition stored in system catalog. And related input query with view definition have a process of the query translation to the execution tree of view. So temporal query processor is able to increase performance of query processor by reducing the number of tuple.