• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.299-301
• /
• 2000

XML은 문서의 구조를 독립적으로 작성할 수 있어 문서의 체계적인 구조화가 가능하다. 이러한 이유로 최근, XML 문서를 구조화하여 데이터베이스에 저장, 관리하는 XML 문서 관리 시스템 연구가 활발하다. XML 문서 관리 시스템은 XML의 구조 정보를 효과적으로 표현하기 위해 여러 가지 기법을 사용하고 있다. 그러나, 기존의 방법들은 XML 문서 구성에 따라 저장 스키마가 유동적이거나 문서 정보 검색의 제약을 가지고 있을 뿐만 아니라, DTD의 문서 구조가 순환 관계와 같이 복잡한 형태를 지닐 때, 그 구조를 적절히 반영하지 못하거나, 구조를 반영하더라도 검색 시, 모든 요소를 순차적으로 탐색해야 하는 등의 문제점을 지니고 있다. 따라서 본 연구에서는 XML의 내용이나 구성에 영향받지 않는 저장 스키마를 설계하고 정보검색의 제약을 해결가능한 경로 정보를 제안한다. 또한 순환 관계를 갖는 DTD의 구조 정보를 비 순환 구조 부분과 순환 구조 부분으로 분리, 정의하고 질의처리 시, 입력되는 XML-QL을 SQL로 변환하기 위하여 XML-QL의 패턴을 분류하고 이에 따른 중간 단계의 SQL을 정의하여 질의어 변환기법을 제안한다.

• Journal of Korean Society of Transportation
• /
• v.14 no.4
• /
• pp.31-48
• /
• 1996

This paper develops a disaggregate model system for travel behavior of workers in a metropolitan area. We attempt to develop a set of models for predicting trip generation type, trip purpose, destination, mode choices in each trip on the way from work to home by using the concept of utility maximization of base-to-base tour. The model incorporates the concept that decisions of a trip in a trip in a travel tour depend on decisions of the trips having been made before and decisions of trip planned after of this trip, as well as on current trip conditions. As the structure of the model, the nested logit model is used to avoid a simultaneous model's complexity. The data to be used for estimating the model system are from the person trip survey which was carried out in 1981 in Nagoya metropolitan. Empirical tests of the model for Nagoya metropolitan area show encouraging results and prove the validity of the assumption of this model.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.9
• /
• pp.50-58
• /
• 1992

A new algorithm for filling the interior of contours and labelling each filled region concurrently is presented. Filling is simply accomplished by inversion method. The labelling information in every scan lines is extracted directly from current direction of chain code so that the proposed algorithm needs less comparision and is more efficient. The contours are followed by two different directions, clockwise for the outer contour and counterclockwise for the inner contour to get filling and labelling information. This algorithm can be applied in case that contours are nested or regions are continous. Simulataneously the proposed algorithm can find the structure tree of object without additional post processing.

• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• pp.163-166
• /
• 1993

This paper describes an parallell computing algorithm in Gauss elimination of Jacobian matrix to large-scale power system. The structure of Jacobian matrix becomes different according to ordering method of buses. In sequential computation buses are ordered to minimize the number of fill-in in the triangulation of the Jacobian matrix. The proposed method using ND(nested dissection) ordering develops the parallelism in the Gauss elimination to have balance of computing load among processes and each processor uses the sequential computation method to preserve the sparsity of matrix.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.6
• /
• pp.1827-1835
• /
• 1996

This paper addresses the problem of a torch path generation for the 2D laser cutting of a stock plate nested with resular or irregular parts. Under the constaint of the relative positions of parts enforced by nesting, the developed torch path algorithm generate feasible cutting path. In this paper, the basic object is a polygon( a many-slide figure) with holes. A part may be represented as a number of line segments connected end-to-end in counterclockwise order, and formed a closed contour as requied for cutting paths. The objective is to tranverse this cutting contours with a minimum path length. This paper proposes a simulated annealing based dtorch path algorithm, that is an improved version of previously suggested TSP models. Since everypiercing point of parts is not fixed in advance, the algorithm solves as relazed optimization problem for the constraint, thich is one of the main features of the proposed algorithm. For aolving the torch path optimization problem, an efficient generation mechanism of neighborhood structure and as annealing shedule were introduced. In this way, a global solution can be obtained in a reasonable time. Seveeral examples are represented to ilustrate the method.

• Proceedings of the Korea Association of Information Systems Conference
• /
• 2001.12a
• /
• pp.64-82
• /
• 2001

HTML revolutionized the way we specify the appearance of data on the Internet. Today, XML (the eXtensible Markup Language) is changing the way we specify the meaning of data. XML, lets document authors define their own markup tags and attribute names to assign meaning to the data elements in the document. Further, XML elements can be nested and include references to indicate data relationships, as Listing One. Unlike HTML, XML markup tags do not describe how to render the data. Rather, they provide descriptions of data, allowing software to understand the meaning of the data automatically For publishing, instead, XSL, the eXtensible Stylesheet Language as a separate language , is in charge of specifying the presentation of XML documents. The purpose of this study is to discover how to transform your organizations relational data into potential e-commerce, business-to-business, and web application with XML and XSL documents. For this purpose, the literature survey, first of all, was undertaken to understand the basic structures of XML documents. Second, one case implementation was performed to understand how to transform Access 2002 XML Files into HTML with XSLTand VB script. The results come out to be successful, more or less. But the limitations of it still exist. One immediate limitation is that XML documents are essentially tree structure, as dictated by the nesting of elements. However, relational database tables are two dimensional matrix structure. In addition, real-world data often is graph structured-a single data element may be referenced in multiple ways. However, this study is useful for understanding how to convert relational database into XML documents and to publish them using XSL or VB script.

• Korean Journal of Environment and Ecology
• /
• v.8 no.2
• /
• pp.150-153
• /
• 1995

A Pinus densiflora forest in Chuwangsan was studied to determine the adequate plot area of shrub stratum for investigating forest community structure. Nineteen nested plots were set up in the studied forest, and species-area curve and performance curve were established. According to species-area curve, the minimum plot area where a given percentage increase in plot area produced less than the same percentage increase in number of species was 900$m^2$. The minimum plot area where a given percentage increase in plot area produced less than the half of the percent-age increase in number of species was 1,500$m^2$. According to performance curve of the importance values of the major species, the minimum plot area where the importance value of the major species was distinguished from each other was 1,400$m^2$. According to performance curve of species diversity, the minimum plot area was 750-1,500$m^2$. Similarity indices between plot area above 900$m^2$ and total plot area were more than 90% and similarity indices between plot area above 625$m^2$ and total plot area were more than 85%. It may be given as a conclusion that minimum plot area was about 1,500$m^2$ in case of requiring more accuracy.

• Journal of the Korean Geographical Society
• /
• v.48 no.2
• /
• pp.272-287
• /
• 2013

This paper describes the importance of selecting explanatory variables(e.g. land price determinants) in hedonic pricing models employed in predicting real estate price, and explores dynamics of the land price determinants over time. The City of Junju was chosen as the study area, and repeated measured price data of standard lots over 17 years were analyzed. We applied a three-level modeling approach to this data in consideration of its nested data structure and longitudinal characteristics. Main land price determinants we focused on are primarily based on items included in the standard comparison table of land price, which is an official hedonic pricing model used by Government to estimate land price for tax levy. Our result shows that the land price fluctuation over 17 years was not uniform over the whole study area with each neighborhood revealing different price trend, and as such warrants longitudinal model components. In addition, some of determinants previously recognized as important were proved insignificant. It was also found that significant determinants at a particular time point lost its power gradually over time and vice versa. It is expected that more accurate prediction of price would be possible when taken account for this dynamics of price determinants over time in applying hedonic pricing model method.

• Korean Journal of Environment and Ecology
• /
• v.7 no.2
• /
• pp.187-191
• /
• 1994

A mixed forest community in Tokyusan was studied to determine the adequate plot area of tree stratum for investigating forest community structure. Nineteen nested plots were set up in the studied forest community, and species-area curve and performance curve were established. According to species-area curve, the minimum plot area where a given percentage increase in plot area produced less than the same percentage increase in number of species was 500$m^2$. The minimum plot area where a given percentage increase in plot area produced less than the half of the percentage increase in number of species was 1,000$m^2$. According to performance curve of the importance values of the major species, the minimum plot area where the importance value of the major species was distinguished from each other was 900$m^2$, and the minimum plot area was 500$m^2$ except for a big tree of Pinus densiflora distributed unexpectedly. According to performance curve of species diversity, the minimum plot area was 400$m^2$. Similarity indices between plot area above 900$m^2$ and total plot area were more than 90% and similarity indices between plot area above 400$m^2$ and total plot area were more than 85%. It may be as a conclusion that minimum plot area was generally about 500$m^2$ and in case of requiring more accuracy, minimum plot area was about 1,000$m^2$.

• Journal of the Korea Computer Graphics Society
• /
• v.27 no.5
• /
• pp.1-11
• /
• 2021

The purpose of our research is to efficiently deform a 3D models which is composed of a triangular mesh and a skeleton. We designed a novel inverse kinematics (IK) solver that calculates the updated positions of mesh vertices with fewer computing operations. Through our user interface, one or more markers are selected on the surface of the model and their target positions are set, then the system updates the positions of surface vertices to construct a deformed model. The IK solving process for updating vertex positions includes many computations for obtaining transformations of the markers, their affecting joints, and their parent joints. Many of these computations are often redundant. We precompute those redundant terms in advance so that the 3-nested loop computation structure was improved to a 2-nested loop structure, and thus the computation time for a deformation is greatly reduced. This novel IK solver can be adopted for efficient performance in various research fields, such as handling 3D models implemented by LBS method, or object tracking without any markers.