• Proceedings of the Korean Geotechical Society Conference
• /
• 2008.03a
• /
• pp.1051-1060
• /
• 2008

The use of the coal ash for surcharge material, in a view of the environmental aspect, can decrease amount of the reclamation through recycling waste materials as well as prevent a destruction of the ecosystem attributed to sand picking. In addition, it can reduce both unit cost of material and construction expenses. In this study, new construction material as alternative surcharge material using coal ash, which is by-product from thermoelectric power plant, were developed. Mixing ratios of fly ash and bottom ash derived from the coal ash in Samchunpo thermoelectric power plants were determined. Furthermore, mixing conditions depending on the ratios of the cement and gypsum used for chemical additive were determined too. Uniaxial compression strength tests were conducted at different mixing conditions and Design graph of optimum mixing ratio at each required strength for economic efficiency is indicated in this paper.

• Proceedings of the Korean Society of Agricultural Engineers Conference
• /
• 1999.10c
• /
• pp.265-270
• /
• 1999

At this study, we investigated the chemical component and the mineral granular composition of sedimentary rock and others where were distributed in Taegu area and compared correlations with each data through the various physicla and mechanical characteristic test. As the result, d and E, they are kinds of granite, which contain much albite than others were proved to be strong by mechanical tests and the correlation moduli were proved to be more than 0.8 except P wave velocity-Poisson's ration relation when examined Elastic moduluous -Poisson's ration, P, wave velocity-Uniaxial compression strength, Elastic modulous -Uniaxial compression strength and Uniaxial compression strength-Poisson's ration correlation function graph.

• The Korean Journal of Food And Nutrition
• /
• v.9 no.4
• /
• pp.466-471
• /
• 1996

In order to investigate the compression characteristics on the some vegetables-cucumber, garlic, ginger, potato, and radish-compression force, distance, and time were measured with a Struct-O-Graph and correlations between them were investigated. Force-distance and distance-time curves were showed simply and reflection points were showed rarely. The time to rupture point was long of 11.7sec at the compression speed of 60mm/min and of 6.16sec at the compression speed of 120mm/min in potato, and short of 9.65, 4.55sec at the different compression speed in garlic, respectively. The rupture force was large of 16.64~20.00N at the different compression speed in potato and radish, and the sample at rupture point was showed crushing behavior under probe. These phenomena were suggested because compression strength of sample was different. In the result of regression analysis for force-time and distance-time to the rupture point, the correlation coefficients were above 0.96, and difference of among samples was small. The slopes of force-time were large of 1.772~3.385 in cucumber and small of 1.743~3.338 in potato, and the slopes of distance-time were obtained with reverse results.

• Journal of Broadcast Engineering
• /
• v.27 no.3
• /
• pp.283-294
• /
• 2022

The feature map used in the network for deep learning generally has larger data than the image and a higher compression rate than the image compression rate is required to transmit the feature map. This paper proposes a method for transmitting a pyramid feature map with high compression rate, which is used in a network with an FPN structure that has robustness to object size in deep learning-based image processing. In order to efficiently compress the pyramid feature map, this paper proposes a structure that predicts a pyramid feature map of a level that is not transmitted with pyramid feature map of some levels that transmitted through the proposed prediction network to efficiently compress the pyramid feature map and restores compression damage through the proposed reconstruction network. Suggested mAP, the performance of object detection for the COCO data set 2017 Train images of the proposed method, showed a performance improvement of 31.25% in BD-rate compared to the result of compressing the feature map through VTM12.0 in the rate-precision graph, and compared to the method of performing compression through PCA and DeepCABAC, the BD-rate improved by 57.79%.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.6 no.3
• /
• pp.34-44
• /
• 1998

It is clear that when an automobile negotiates a curve the lateral acceleration causes an increase in tire normal load for the wheels on the outside of the curve and a decrease in load for the inside wheels. However, just how the details of the suspension linkages and the parameters of the springs and shock absorbers affect the dynamics of the load transfer os not easily understood. One even encounters the false idea that since it is the compression and extension of the main suspension springs spring body role which largely determines the changes in normal load, of roll could be reduced, the load transfer would also be reduced. Using free body diagrams, one can explain quite clearly how the load is transferred for steady state cornering, and, using complex multibody models of particular vehicles one can simulate in good fidelity how load transfer occurs dynamically. Here we adopt a middle ground by using the concept of roll center and using a series of half-car bond graph models to point out main effects. Since bond graph junction structures automatically and consistently constrain geometric and force variables simultaneously, they can be used to point out hidden assumptions of other simplified vehicle models.

• The Journal of the Acoustical Society of Korea
• /
• v.14 no.2E
• /
• pp.50-56
• /
• 1995

This paper describes an efficient coding method for Korean characters using a three-state transition graph. To our knowledge, this is the first achievement of its kind. This new method, called the Paralle Hangul Dynamic Coding Method(PHDCM), compresses about 3.5 bits per a Korean character, which is more than 1 bit shorter than the conventional codes introduced thus far to achieve extensive code compression. When we ran the method on a MasPar machine, which is on SIMD SM (EFEW-PRAM)., it achieved a 49.314-fold speedup with 64 processors having 10 million Korean characters.

• Journal of Engineering Education Research
• /
• v.2 no.1
• /
• pp.51-58
• /
• 1999

This paper is concerned with the compression test such as compression and ring compression tests, by using virtual reality. Engineering material laboratory can be carried out on personal computer without the real expensive experiment devices. The virtual laboratory is composed of three modules as input, calculation and output module on internet. Internet user can give the material's property and other parameters to the server computer at the input module. On the calculation module, simulator cimputes the results by analysis program and store the data as a file. The output module is the program that internet user can confirm a virtual compression results by showing a table, graph, and 3D animation. This program is designed by Internet language such as HTML, CGI, VRML, JAVA. And analysis program uses the finite element method with fortran language. Since the study of virtual reality on internet is rapidly increasing, the virtual experiment of technique will substitute many real experiments in the future.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.4
• /
• pp.487-494
• /
• 2022

With the recent demand for analysis using data, the size of the knowledge graph, which is the data to be analyzed, gradually increased, reaching about 82 billion edges when extracted from the web as a knowledge graph. A lot of knowledge graphs are represented in the form of Resource Description Framework (RDF), which is a standard of W3C for representing metadata for web resources. Because of the characteristics of RDF, existing RDF storages have the limitations of processing time overhead when converting and storing large amounts of RDF data. To resolve these limitations, in this paper, we propose a method of compressing and converting large amounts of RDF data into integer IDs using MapReduce, and vertically partitioning and storing them. Our proposed method demonstrated a high performance improvement of up to 25.2 times compared to RDF-3X and up to 3.7 times compared to H2RDF+.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.1
• /
• pp.33-42
• /
• 2001

Recently, the interests in the 3D image, generated from the range data and CAD, have exceedingly increased, accordingly a various 3D image database is being constructed. The efficient and fast scheme to access the desired image data is the important issue in the application area of the Internet and digital library. However, it is difficult to manage the 3D image database because of its huge size. Therefore, a proper descriptor is necessary to manage the data efficiently, including the content-based search. In this paper, the proposed shape descriptor is based on the voxelization of the 3D image. The medial axis transform, stemming from the mathematical morphology, is performed on the voxelized 3D image and the graph, which is composed of node and edge, is generated from skeletons. The generated graph is adequate to the novel shape descriptor due to no loss of geometric information and the similarity of the insight of the human. Therefore the proposed shape descriptor would be useful for the recognition of 3D object, compression, and content-based search.

• Journal of KIISE
• /
• v.43 no.10
• /
• pp.1131-1143
• /
• 2016

How can we effectively compress big graphs composed of billions of edges? By concentrating non-zeros in the adjacency matrix through vertex rearrangement, we can compress big graphs more efficiently. Also, we can boost the performance of several graph mining algorithms such as PageRank. SlashBurn is a state-of-the-art vertex rearrangement method. It processes real-world graphs effectively by utilizing the power-law characteristic of the real-world networks. However, the original SlashBurn algorithm displays a noticeable slowdown for large-scale graphs, and cannot be used at all when graphs are too large to fit in a single machine since it is designed to run on a single machine. In this paper, we propose a distributed SlashBurn algorithm to overcome these limitations. Distributed SlashBurn processes big graphs much faster than the original SlashBurn algorithm does. In addition, it scales up well by performing the large-scale vertex rearrangement process in a distributed fashion. In our experiments using real-world big graphs, the proposed distributed SlashBurn algorithm was found to run more than 45 times faster than the single machine counterpart, and process graphs that are 16 times bigger compared to the original method.