• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.9
• /
• pp.202-209
• /
• 2000

In recent years the concern of designing multi-stage gear drives increases with the more application of gear drives in high-speed and high-load. until now however research on the gear drive design has been focused on single gear pairs and the design has been depended on experiences and know-how of designers and carried out commonly by trial and error. We propose the automation of the dimensional design of gears and the configuration design for gear arrangement of two-and three-stage cylindrical gear drives. The dimensional design is divided into two types of design processes to determine the dimensions of gears. The first design process(Process I) uses the total volume of gears to determine gear ratio and uses K factor unit load and aspect ratio to determine gear dimensions. The second one(Process II) makes use of Niemann's formula and center distance to calculate gear ratio and dimensions. Process I and II employ material data from AGMA and ISO standards respectively. The configuration design determines the positions of gears to minimize the volume of gearbox by simulated annealing algorithm. Finally the availability of the design algorithm is validated by the design examples of two-and three-stage gear drives.

• ETRI Journal
• /
• v.22 no.2
• /
• pp.32-42
• /
• 2000

The existing multi-dimensional index structures are not adequate for indexing higher-dimensional data sets. Although conceptually they can be extended to higher dimensionalities, they usually require time and space that grow exponentially with the dimensionality. In this paper, we analyze the existing index structures and derive some requirements of an index structure for content-based image retrieval. We also propose a new structure, for indexing large amount of point data in a high-dimensional space that satisfies the requirements. in order to justify the performance of the proposed structure, we compare the proposed structure with the existing index structures in various environments. We show, through experiments, that our proposed structure outperforms the existing structures in terms of retrieval time and storage overhead.

• Transactions of Materials Processing
• /
• v.12 no.6
• /
• pp.542-549
• /
• 2003

Three-dimensional forging analysis becomes an inevitable tool to make design process more reliable and more producible. In this study, in order to make the investigation for three-dimensional forging analysis more conveniently and accurately, a new post processor was developed. For post-processing of multi-stage forging simulation, efficient data structure was proposed and applied by using STL. New file architecture was developed to handle successive and huge data efficiently, common in three-dimensional forging analysis. Since sectioning and flow tracing plays an important role in the investigation of analysis result, we developed an algorithm suitable for 4-node and 10-node tetrahedron. This flow tracing algorithm can trace and reverse-trace flow through remeshing. Developed program shows good performance and functionality. Especially, a big size problem can be handled easily due to proposed data structure and file architecture.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.1-11
• /
• 2000

Up to the present, many GIS logical data models have been proposed to incorporate time dimension into traditional 2-dimensional (2D space) GIS databases. However, these models are difficult to implementation of multi-dimensional GIS and have problems of significant data redundancy and search performance. This paper proposes a new storage strategy and a separate storage structure, that is composed of current database and past database, in order to reduce data redundancy and improve search performance of temporal query. Also we design moving algorithm for migration from current database to past database, and design efficient search algorithm for temporal query.

• The KSFM Journal of Fluid Machinery
• /
• v.3 no.1 s.6
• /
• pp.19-27
• /
• 2000

A numerical study is presented for analysis of three-dimensional incompressible turbulent flows in a multi-blade centrifugal fan. Reynolds-averaged Navier-Stokes equations with a standard $k-{\espilon}$ turbulence model are discretized with finite volume approximations. The computational area is divided into three blocks; inlet core, impeller and scroll parts, which are linked by a multi-block method. The flow inside of the fan is regarded as steady flow, and the mathematical models for the impeller forces were established from a cascade theory and measured data. Empirical coefficients are obtained comparing between computational and experimental results for the case without scroll, and are employed to simulate the flow through the impeller with scroll. In comparisons with experimental data, the validity of the mathematical models for the impeller forces was examined. The characteristics of the flow in the scroll were also discussed.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.3
• /
• pp.1-20
• /
• 2001

The amount of financial information in sophisticated large data bases is huge and makes interfirm performance comparisons very difficult or at least very time consuming. The purpose of this paper is to investigate whether neural networks in the form of self-organizing maps (SOM) can be successfully employed to manage the complexity for competitive financial benchmarking. SOM is known to be very effective to visualize results by projecting multi-dimensional financial data into two-dimensional output space. Using the SOM, we overcome the problems of finding an appropriate underlying distribution and the functional form of data when structuring and analyzing a large data base, and show an efficient procedure of competitive financial benchmarking through clustering firms on two-dimensional visual space according to their respective financial competitiveness. For the empirical purpose, we analyze the data base of annual reports of 100 Korean listed companies over the years 1998, 1999, and 2000.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.10
• /
• pp.1291-1300
• /
• 2001

This article come to study the visualization representation technique of eye brain of person, basing on the ground of the dynamic graphics which is able to change the real time, manipulating the image as graphic factors of the multi-data. And the important thought in such realization is as follows ; corresponding the character points of human face and the parameter control value which obtains basing on the existing image recognition algorithm to the multi-dimensional data, synthesizing the image, it is to create the virtual image from the emotional expression according to the changing contraction expression. The proposed DyFIG system is realized that it as the completing module and we suggest the module of human face graphics which is able to express the emotional expression by manipulating and experimenting, resulting in realizing the emotional data expression description and technology.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10c
• /
• pp.433-438
• /
• 2007

This paper presents a distance mapping-based localization method with incomplete data which means partially observed data. We make three contributions. First, we propose the use of Multi Dimensional Scaling (MDS) for multi-robot localization. Second, we formulate the problem to accomodate partial observations common in multi-robot settings. We solve the resulting optimization problem using #Scaling by Majorizing a Complicated function (SMACOF)#, a popular algorithm fur iterative MDS. Third, we not only verify the performance of MDS-based multi-robot localization by computer simulations, but also implement a real world localization of multi-robot team. Using extensive empirical results, we show that the accuracy of the proposed method is almost similar to that of Monte Carlo Localization(MCL).

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.336-349
• /
• 2003

Histograms have been getting a lot of attention recently. Histograms are commonly utilized in commercial database systems to capture attribute value distributions for query optimization Recently, in the advent of researches on approximate query answering and stream data, the interests in histograms are widely being spread. The simplest approach assumes that the attributes in relational tables are independent by AVI(Attribute Value Independence) assumption. However, this assumption is not generally valid for real-life datasets. To alleviate the problem of approximation on multi-dimensional data with multiple one-dimensional histograms, several techniques such as wavelet, random sampling and multi-dimensional histograms are proposed. Among them, GENHIST is a multi-dimensional histogram that is designed to approximate the data distribution with real attributes. It uses overlapping buckets that allow more efficient approximation on the data distribution. In this paper, we propose a scheme, OPT that can determine the optimal frequencies of overlapped buckets that minimize the SSE(Sum Squared Error). A histogram with overlapping buckets is first generated by GENHIST and OPT can improve the histogram by calculating the optimal frequency for each bucket. Our experimental result confirms that our technique can improve the accuracy of histograms generated by GENHIST significantly.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.30 no.5D
• /
• pp.533-540
• /
• 2010

Dam is very important facility in water supply and flood control. Therefore study needs to analyze reservoir capacity accurately to manage Dam efficiently. This study compared time series reservoir capacity using multi-dimensional spatial information to Chungju Dam reservoir and major conclusions are as follows. First, LiDAR and multi beam echo sounder survey were carried out in land zone and water zone of Dam reservoir area. And calibration process was performed to enhance the accuracy of survey data and it could be constructed that multi dimensional spatial information which was clearly satisfied with the standard of tolerance error by validation with ground control points. Reservoir capacity by water level was calculated using triangle irregular network from detailed topographic data that was constructed by linked with airborne LiDAR and multi beam echo sounder data, and curve equation of reservoir capacity was developed through regression analysis in 2008. In the comparison of the reservoir capacity of 2008 with those of 1986 and 1996, the higher water level goes, total reservoir capacity of 2008 showed decrease because of the increase of sediment in reservoir. Also, erosion and sediment area could be analyzed through calculating the reservoir capacity by the range of water level. Especially the range of water level as 130.0~135.0 which is the upper part of average water level, showed the highest erosion characteristics during 1986~2008 and 1996~2008 and it is considered that the erosion of reservoir slant by heavy rainfall is major reason.