• Structural Engineering and Mechanics
• /
• v.4 no.5
• /
• pp.513-527
• /
• 1996

In this paper, both an approximate expression and an exact expression for the contribution factor of an element to the natural frequency of the finite element discretized system of a structure in general and a membrane in particular have been derived from the energy conservation principle and the finite element formulation of structural eigenvalue problems. The approximate expression for the contribution factor of an element is used to predict and determine the elements to be removed in an iteration since it depends only on the quantities associated with the old system in the iteration. The exact expression for the contribution factor of an element makes it possible to check whether the element is correctly removed at the end of an iteration because it depends on both the old system and the new system in the iteration. Thus, the combined use of the approximate expression and the exact expression allows a considerable number of elements to be removed in a single iteration so that the efficiency of the evolutionary structural optimization method can be greatly improved for solving the natural frequency optimization problem of a structure. A square membrane with different boundary supports has been chosen to investigate the general evolutionary path for the fundamental natural frequency of the structure. The related results indicated that if the objective of a structural optimization is to raise the fundamental natural frequency of the structure to an optimal value, the general evolutionary path during its optimization is that the elements are gradually removed along the direction from the area surrounded by the contour of the highest value to that surrounded by the contour of the lowest value.

• Journal of Korea Multimedia Society
• /
• v.10 no.9
• /
• pp.1093-1105
• /
• 2007

This paper presents a multidimensional type inheritance indexing technique (MD-TIX) for XML databases. We use a multidimensional file organization as the index structure. In conventional XML database indexing techniques using one-dimensional index structures, they do not efficiently handle complex queries involving both nested elements and type inheritance hierarchies. We extend a two-dimensional type hierarchy indexing technique(2D-THI) for indexing the nested elements of XML databases. 2D-THI is an indexing scheme that deals with the problem of clustering elements in a two-dimensional domain space consisting of the key value domain and the type identifier domain for indexing a simple element in a type hierarchy. In our extended scheme, we handle the clustering of the index entries in a multidimensional domain space consisting of a key value domain and multiple type identifier domains that include one type identifier domain per type hierarchy on a path expression. This scheme efficiently supports queries that involve search conditions on the nested element represented by an extended path expression. An extended path expression is a path expression in which every type hierarchy on a path can be substituted by an individual type or a subtype hierarchy.

• Journal of KIISE:Databases
• /
• v.31 no.1
• /
• pp.72-81
• /
• 2004

Theses days, a number of data over the Internet are represented using XML because of a virtue of XML. In proportion to the increase of XML data, query processing techniques are required that support quickly and efficiently the diverse queries to search the useful information on XML documents. But, up to now, the researches handling queries for XML data are methodologies focusing on how to process regular path expressions. Therefore, we have developed a new genealogy-based indexing technique to solve various queries such as not only regular path expression but also simple path expression, path expression referencing other elements, and so on. Also, we have applied this technique on object-relational model and evaluated the performance for many documents and various query types. The result shows improved performance in comparison with the other storage techniques.

• Asia Marketing Journal
• /
• v.13 no.4
• /
• pp.29-54
• /
• 2012

Recently, as film has been admitted as the artistic merit and higher value-added business, the past studies on film have been lively carried on various fields. Especially, the film business is thought to be value-added business and has explored the causes of influencing spectators. However, there are no researches enough to explain what induces the choice and diffusion of the film. The film is not only hedonic products but also typical example of experiential products. So how to process film formation plays important roles in explaining the procedures of forming preference on the film and the movies spread more widely. But the great part of study of films has been concentrated on exploring hedonic factors of influencing spectator's choice. Until now there is not enough study for the relationship between experiential information processing and film preference. To explain film's preference, our study focuses on preference fluency and processing fluency that can provide an insight for our question about the relationship. In this article, to explain the procedures of processing experiential information and forming preference on the film, our study focuses on finding the relationship between film's processing fluency and film's preference fluency and explores the factors that affect film's processing fluency. To achieve the goal of this study, we distinguish factors of film's conceptual fluency from factors of film's perceptual fluency and explore the paths from the factors to film's preference fluency. The factors which have effects on perceptual fluency are hypothesized to be distinction of image expression, distinction of sound expression, correspondence between actors' image and their role. The factors which have effect on conceptual fluency are supposed to be well-organized story, suitability of lines expression. The experiments in which students were sampled at 'C' university were conducted in 2010 (december). Data collection was proceeded through questionnaires. We test the hypothesized model by using structural equation modeling(Amos 17.0). The fit indices for the model are as follows : x²=416.266(df=213, p=0.00), GFI=0.855, AGFI=0.812, RMSEA =0.069, IFI=O.925, CFI=0.920, TLI=0.905. According to the guidelines, there is evidence that our measurement model fits data. The results of empirical study are as follows. The path from film's perceptual fluency to film's preference fluency is supported(estimate: 0.223, C.R: 2.641). The path from film's conceptual fluency to film's preference fluency is supported(estimate: 0.397, C.R: 4.863). The path from distinction of image expression to film's perceptual fluency is not supported(estimate: 0.113, C.R: 1.665). The path from distinction of sound expression to film's perceptual fluency is supported (estimate: 0.190, C.R: 2.042). The path from correspondence between actors' image and their role to film's perceptual fluency is supported(estimate: 0.686, C.R: 5.566). The path from well-organized story to film's conceptual fluency is supported(estimate: 0.396, C.R: 4.023). The path from suitability of lines expression to film's conceptual fluency is supported(estimate: 0.536, C.R: 5.441). Concludingly, our study explored the influencing factors of film's processing fluency inducing film's Preference fluency. First, film's perceptual fluency and film's conceptual fluency have positive effects on film's preference fluency. Second, distinction of image expression is not significant on film's perceptual fluency, but distinction of sound expression and image's correspondence of actors' image and their role have positive effects on film's perceptual fluency. Lastly, well-organized story and suitability of lines expression have positive effects on film's conceptual fluency.

• The KIPS Transactions:PartA
• /
• v.14A no.2
• /
• pp.85-90
• /
• 2007

This paper presents a facial animation and expression control method that enables the animator to select any facial frames from the facial expression space, whose expression transfer paths the system can setup automatically. Our system creates the facial expression space from approximately 2500 captured facial frames. To create the facial expression space, we get distance between pairs of feature points on the face and visualize the space of expressions in 2D space by using the Multidimensional scaling(MDS). To setup most suitable expression transfer paths, we classify the facial expression space into four field on the basis of any facial expression state. And the system determine the state of expression in the shortest distance from every field, then the system transfer from the state of any expression to the nearest state of expression among thats. To complete setup, our system continue transfer by find second, third, or fourth near state of expression until finish. If the animator selects any key frames from facial expression space, our system setup expression transfer paths automatically. We let animators use the system to create example animations or to control facial expression, and evaluate the system based on the results.

• Journal of electromagnetic engineering and science
• /
• v.10 no.4
• /
• pp.290-295
• /
• 2010

In this paper, an interference analysis method with a site-specific path loss model for a wireless personal area network (WPAN) is proposed. The site-specific path loss model is based on geometrical optics and geometric probability to consider both site-specific radio propagation characteristics and a closed-form expression to obtain the mean interference from which the uniformly distributed multiple interferers are derived. Therefore, the proposed interference analysis method can achieve more computational simplicity than the Monte-Carlo (MC) simulation, which uses the ray-tracing (RT) technique. In addition, better accuracy than the conventional interference analysis model that uses stochastic method can also be achieved. To evaluate the proposed method, a signal to the interference-noise ratio with a mean interference concept for uniformly distributed interferers is calculated and compared in two simulation scenarios. As a result, the proposed method produces not only better matched results with the MC simulation using the RT technique than the conventional interference analysis model, but also simpler and faster calculation, which is due to the site-specific path loss model and closed-form expression for interference calculation.

• Journal of Korea Multimedia Society
• /
• v.10 no.7
• /
• pp.807-816
• /
• 2007

Since W3C proposed XML in 1996, XML documents have been widely spreaded in many internet documents. Because of this, needs for research related with XML is increasing. Especially, it is being well performed to study XML management system for storage, retrieval, and management with XML Documents. Among these studies, XRel is a representative study for XML management and has been become a comparative study. In this study, we suggest XML documents management system based on Relational DataBase Management System. This system is stored not all possible path expressions such as XRel, but filtered path expression which has text value or attribute value. And by giving each node Node Expression Identifier, we try to match given Node Expression Identifier. Finally, to prove efficiency of the suggested technique, this paper shows the result of experiment that compares XPath query processing performance between suggested study and existing technique, XRel.

• Journal of Korea Society of Industrial Information Systems
• /
• v.5 no.1
• /
• pp.1-15
• /
• 2000

In this paper, an efficient system for finding answers to a given path algebra expression in a directed acylic graph is discussed more particulary, in a multimedia presentration graph. Path algebra expressions are formulated using revised versions of operators next and until of temporal logic, and the connected operator. To evaluate queries with path algebra expressions, the node code system is proposed. In the node code system, the nodes of a presentation graph are assigned binary codes (node codes) that are used to represent nodes and paths in a presentation graph. Using node codes makes it easy to find parent-child predecessor-sucessor relationships between nodes. A pair of node codes for connected nodes uniquely identifies a path, and allows efficient set-at-a-time evaluations of path algebra expressions. In this paper, the node code representation of nodes and paths in multimedia presentation graphs are provided. The efficient algorithms for the evaluation of queries with path algebra expressions are also provided.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.1
• /
• pp.12-23
• /
• 2001

Extended path expressions are used to denote multiple paths concisely by using '$\ast$' character. They are convenient for expressing OQL queries to retrieve XML data stored in OODBs. In this paper, we propose a multi-path index scheme as a new index scheme to efficiently process queries with extended path expressions. Our proposed index scheme allocates a unique path identifier for every possible single path in an extended path expression and provides functionalities of both a single path indexing and multiple path indexing through the composition of index key and path identifier while using only a index structure. The proposed index scheme provides better performance than single-path index schemes, and is practical since it can be implemented by little modification of leaf records of a B+-tree index.

• Journal of KIISE:Databases
• /
• v.29 no.4
• /
• pp.274-284
• /
• 2002

Queries on XML are based on paths in the data graph, which is represented as an edge labeled graph model. All proposed query languages for XML express queries using regular expressions to traverse arbitrary paths in the data graph. A meaningful query usually has several regular path expressions in it, but much of recent research is more concerned with optimizing a single path expression. In this paper, we present an efficient technique to process multiple path expressions in a query. We developed a data structure named as the path identifier(PID) to identify whether two given nodes lie on the fame path in the data graph or not, and utilized the PID for efficient processing of multiple path expressions. We implement our technique and present preliminary performance results.