• Communications of Mathematical Education
• /
• v.24 no.1
• /
• pp.145-158
• /
• 2010

In this paper we study tetrahedron's properties related with center of inscribed sphere using the center of mass. We show that the center of mass of four mass points (A,a), (B,b), (C,c), (D,d) coincide with center of tetrahedron's inscribed sphere, suggest equalities and inequalities related with center of inscribed sphere, and prove theses using the center of mass. Our results can be used in research and education programs, various types of gifted student education.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.15 no.11 s.104
• /
• pp.1255-1261
• /
• 2005

The dynamic contact model of a beam that contacts to a rigid wall in a reactor core was studied. The gap between the beam and contact wall results in dynamic contact accompanying inequality constraints. The inequality constraints can be relieved to an equality constraint problem by introducing a convex Penalty function. In this work, a beam with contact condition is formulated using quasi-convex penalty function and numerically solved. General coordinate solution is adopted to raise computational efficiency. Also nonlinearity is examined In the beam contacting to a rigid wall.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2006.11a
• /
• pp.279-282
• /
• 2006

본 논문은 시간지연을 갖는 이산 비선형 시스템에 대한 점근적 안정화 및 $H_{\infty}$ 성능을 갖는 퍼지 제어기 설계 방법을 제안한다. 시간지연을 갖는 이산 Takagi-Sugeno 퍼지 모델에 대한 점근적 안정화 및 $H_{\infty}$ 성능을 만족하는 제어기 존재조건을 선형행렬부등식으로 나타낸다. 리아프노프 함수에 조정파라미터를 도입함으로써 제어기 존재조건을 조정파라미터를 포함하는 선형행렬 부등식으로 나타낸다. 선형행렬부등식에 있는 조정 파라미터를 조정함으로써 시스템의 응답속도 및 오버슈트 등의 동적 성능을 개선시킬 수 있다.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.9
• /
• pp.116-123
• /
• 1997

We have already presented the constraint satisfaction algorithm which could solve the closed loop porblem in constraint network by using local constraint propagation, variable elimination and constraint modularization. With this algorithm, we have implemented a knowledge-based system (intelligent CAD) for supporting machine design interactively. In this paper, we present newer constraint satisfaction algorithm which can solve inequalities or under-constrained problems in constraint network, interactively and effi- ciently. This algorithm is a hybrid type of using both declarative description (constraint representation) and optimization algorithm (Simulated Annealing), simultaneously. The under-constrained problems are represented by constraint networks and satisfied completely with this algorithm. The usefulness of our algorithm will be illustrated by the application to a gear design.

• Proceedings of the Korea Concrete Institute Conference
• /
• 2008.11a
• /
• pp.709-712
• /
• 2008

RC super tall buildings are planned and constructed recently in domestic area. Concrete is characterized by time dependant material such as creep and shrinkage. For this properties of concrete, differential shortening is one of the main issues on super tall buildings construction. This study includes material research, which is performing as a pre design stage to solve differential shortening on Lotte Super Tower Jamsil core structure(50, 60, & 70 MPa). The major part of this study is composed with comparison and analysis between experimental data and predicted data on total shrinkage and total compliance which were used on design stage. Four models, ACI209R Model, Ba${\check{z}}$ant-Baweja B3 Model, CEB MC99 Model, & GL2000 Model, were employed to predict them. It also tries to seek a proper model for high strength and high performance concrete in the case of no concrete test.

• Journal of the Korean Geotechnical Society
• /
• v.23 no.3
• /
• pp.25-40
• /
• 2007

Excessive earth pressure is one of the major mechanical factors in the deformation and damage of Cut-and-Cover Tunnel lining in shallow tunnels and portals of mountain tunnels (Kim, 2000). Excessive earth pressure may be attributed to insufficient compaction and consolidation of backfill material due to self-weight, precipitation and vibration caused by traffic (Komiya et al., 2000; Taylor et al., 1984; Yoo, 1997). Even though there were a lot of tests performed to determine the earth pressure acting on the tunnel lining, unfortunately there were almost no case histories of studies performed to determine remedial measures that reduce differential settlement and excessive earth pressure. In this study the installation of geotextile mat was selected to reduce the differential settlement and excessive earth pressure acting on the cut-and-cover tunnel lining. In order to determine settlement and earth pressure reduction effect (reinforcement effect) of geotextile mat reinforcement, laboratory tunnel model tests were performed. This study was limited to the modeling of rigid circular cut-and-cover tunnel constructed at a depth of $1.0D\sim1.5D$ in loose sandy ground and subjected to a vibration frequency of 100 Hz. Model tests with varying soil cover, mat reinforcement scheme and slope roughness were performed to determine the most effective mat reinforcement scheme. Slope roughness was adjusted by attaching sandpaper #100, #400 and acetate on the cut slope surface. Mat reinforcement effect of each mat reinforcement scheme were presented by the comparison of earth pressure obtained from the unreinforced and mat reinforced model tests. Soil settlement reduction was analyzed and presented using the Picture Analysis Method (Park, 2003).

• Journal of Korea Multimedia Society
• /
• v.15 no.2
• /
• pp.215-225
• /
• 2012

In multimedia database, a multidimensional space-based indexing has been used to increase search efficiency. However, this method is inefficient in terms of ubiquity because it uses Euclidean distance as a scale of distance calculation. On the contrary, a metric space-based indexing method, in which metric axiom is prerequisite is widely available because a metric scale other than Euclidean distance could be used. This paper is attempted to propose a way of improving VP-tree, one of the metric space indexing methods. The VP-tree calculates the distance with an object which is ultimately linked to the a leaf node depending on the node fit for the search range from a root node and examines if it is appropriate with the search range. Because search speed decreases as the number of distance calculations at the leaf node increases, however, this paper has proposed a method which uses the latest interface on query object as the base point of trigonometric inequality for improvement after focusing on the trigonometric inequality-based range compression method in a leaf node. This improvement method would be able to narrow the search range and reduce the number of distance calculations. According to a system performance test using 10,000 video data, the new method reduced search time for similar videos by 5-12%, compared to a conventional method.

• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.447-458
• /
• 2008

In this paper, we address an efficient processing scheme for k-nearest neighbor queries to retrieve k static objects in road network databases. Existing methods cannot expect a query processing speed-up by index structures in road network databases, since it is impossible to build an index by the network distance, which cannot meet the triangular inequality requirement, essential for index creation, but only possible in a totally ordered set. Thus, these previous methods suffer from a serious performance degradation in query processing. Another method using pre-computed network distances also suffers from a serious storage overhead to maintain a huge amount of pre-computed network distances. To solve these performance and storage problems at the same time, this paper proposes a novel approach that creates an index for moving objects by approximating their network distances and efficiently processes k-nearest neighbor queries by means of the approximate index. For this approach, we proposed a systematic way of mapping each moving object on a road network into the corresponding absolute position in the m-dimensional space. To meet the triangular inequality this paper proposes a new notion of average network distance, and uses FastMap to map moving objects to their corresponding points in the m-dimensional space. After then, we present an approximate indexing algorithm to build an R*-tree, a multidimensional index, on the m-dimensional points of moving objects. The proposed scheme presents a query processing algorithm capable of efficiently evaluating k-nearest neighbor queries by finding k-nearest points (i.e., k-nearest moving objects) from the m-dimensional index. Finally, a variety of extensive experiments verifies the performance enhancement of the proposed approach by performing especially for the real-life road network databases.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.643-654
• /
• 2001

This paper discusses an effective processing of similarity search that supports time warping in large sequence database. Time warping enables finding sequences with similar patterns even when they are of different length, Previous methods fail to employ multi-dimensional indexes without false dismissal since the time warping distance does not satisfy the triangular inequality. They have to scan all the database, thus suffer from serious performance degradation in large database. Another method that hires the suffix tree also shows poor performance due to the large tree size. In this paper we propose a new novel method for similarity search that supports time warping Our primary goal is to innovate on search performance in large database without false dismissal. to attain this goal ,we devise a new distance function $D_{tw-Ib}$ consistently underestimates the time warping distance and also satisfies the triangular inequality, $D_{tw-Ib}$ uses a 4-tuple feature vector extracted from each sequence and is invariant to time warping, For efficient processing, we employ a distance function, We prove that our method does not incur false dismissal. To verify the superiority of our method, we perform extensive experiments . The results reveal that our method achieves significant speedup up to 43 times with real-world S&P 500 stock data and up to 720 times with very large synthetic data.

• Journal of KIISE:Software and Applications
• /
• v.31 no.10
• /
• pp.1304-1319
• /
• 2004

We can significantly reduce the cost o# program testing by automating the process of test data generation. Test data generation usually concerns identifying input values on which a selected path is executed. Although lots of research has been done so far, there still remains a lot of issues to be addressed. One of the issues is the shape problem. The shape problem refers to the problem of figuring out a shape of the input data structure required to cause the traversal of a given path. In this paper, we introduce a new method for the shape problem. The method converts the selected path into static single assignment (SSA) form without pointer dereferences. This allows us to consider each statement in the selected path as a constraint involving equality or inequality. We solve the constraints to get a solution which will be represented in terms of the points-to relations for each input variable. Simple, but illustrative examples are given to explain the proposed method.