• The Journal of the Korea Contents Association
• /
• v.22 no.1
• /
• pp.35-46
• /
• 2022

Recently, with the development of network technologies, as IoT and social network service applications have been actively used, a lot of graph stream data is being generated. In this paper, we propose a graph compression scheme that considers the stream graph environment by applying graph mining to the existing compression technique, which has been focused on compression rate and runtime. In this paper, we proposed Incremental frequent pattern based compression technique for graph streams. Since the proposed scheme keeps only the latest reference patterns, it increases the storage utilization and improves the query processing time. In order to show the superiority of the proposed scheme, various performance evaluations are performed in terms of compression rate and processing time compared to the existing method. The proposed scheme is faster than existing similar scheme when the number of duplicated data is large.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.04a
• /
• pp.816-819
• /
• 2017

Current graph mining algorithms suffers from performance issues when querying patterns are in increasingly massive network graphs. However, from our observation most data graphs inherently contains recurring semantic subgraphs/substructures. Most graph mining algorithms treat them as independent subgraphs and perform computations on them redundantly, which result in performance degradation when processing massive graphs. In this paper, we propose an algorithm which exploits these inherent recurring subgraphs/substructures to reduce graph sizes so that redundant computations performed by the traditional graph mining algorithms are reduced. Experimental results show that our graph compression approach achieve up to 69% reduction in graph sizes over the real datasets. Moreover, required time to construct the compressed graphs is also reasonably reduced.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2009.03a
• /
• pp.1133-1138
• /
• 2009

This study was conducted in order to know the internal application of the critical strain graph. To evaluate critical strain graph, we carried out an uniaxial compression test with some of internal rocks: sandstone, shale, weathered granite, and pink granitic. Based on the uniaxial compression test, we deduced relations among critical strain, failure strain, uniaxial compression strength and modulus of elasticity. As a result, the study has found out the rocks, which have been tested, can be possibly evaluated by critical strain graph.

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.171-180
• /
• 2002

The effective and accurate data flow problem analysis uses the dominator tree and DJ graphs. The data flow problem solving is to safely reduce the flow graph to the dominator tree. The flow graph replaces a parse tree and used to accurately reduce either reducible or irreducible flow graph to the dominator tree. In this paper, in order to utilize Tarian's path compress algorithm, the Top node finding algorithm is suggested and the existing delay reduction algorithm is improved using Path compression. The delayed reduction a1gorithm using path compression actually compresses the pathway of the dominator tree by hoisting the node while reducing to delay the DJ graph. Realty, the suggested algorithm had hoisted nodes in 22% and had compressed path in 20%. The compressed dominator tree makes it possible to analyze the effective data flow analysis and brings the improved effect for the complexity of code optimization process with the node hoisting effect of code optimization process.

• Management Science and Financial Engineering
• /
• v.22 no.1
• /
• pp.5-12
• /
• 2016

We consider a time-cost tradeoff problem with multiple milestones under a chain precedence graph. In the problem, some penalty occurs unless a milestone is completed before its appointed date. This can be avoided through compressing the processing time of the jobs with additional costs. We describe the compression cost as the convex or the concave function. The objective is to minimize the sum of the total penalty cost and the total compression cost. It has been known that the problems with the concave and the convex cost functions for the compression are NP-hard and polynomially solvable, respectively. Thus, we consider the special cases such that the cost functions or maximal compression amounts of each job are identical. When the cost functions are convex, we show that the problem with the identical costs functions can be solved in strongly polynomial time. When the cost functions are concave, we show that the problem remains NP-hard even if the cost functions are identical, and develop the strongly polynomial approach for the case with the identical maximal compression amounts.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.3
• /
• pp.85-92
• /
• 2018

We consider a project scheduling problem in which the jobs can be compressed by using additional resource to meet the corresponding due dates, referred to as a time-cost tradeoff problem. The project consists of two independent subprojects of which precedence graph is a chain. The due dates of jobs constituting the project can be interpreted as the multiple assessments in the life of project. The penalty cost occurs from the tardiness of the job, while it may be avoided through the compression of some jobs which requires an additional cost. The objective is to find the amount of compression that minimizes the total tardy penalty and compression costs. Firstly, we show that the problem can be decomposed into several subproblems whose number is bounded by the polynomial function in n, where n is the total number of jobs. Then, we prove that the problem can be solved in polynomial time by developing the efficient approach to obtain an optimal schedule for each subproblem.

• The Journal of the Korea Contents Association
• /
• v.16 no.2
• /
• pp.374-386
• /
• 2016

Provenance means the meta data that represents the history or lineage of a data in collaboration storage environments. Therefore, as provenance has been accruing over time, it takes several ten times as large as the original data. The schemes for effciently compressing huge amounts of provenance are required. In this paper, we propose a provenance compression scheme considering the RDF graph patterns. The proposed scheme represents provenance based on a standard PROV model and encodes provenance in numeric data through the text encoding. We compress provenance and RDF data using the graph patterns. Unlike conventional provenance compression techniques, we compress provenance by considering RDF documents on the semantic web. In order to show the superiority of the proposed scheme, we compare it with the existing scheme in terms of compression ratio and the processing time.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2009.09a
• /
• pp.1141-1146
• /
• 2009

The compressibility of clay has been expressed e-log p' graph. In natural clay, e-log p' graph are changed by deposition condition and chemical cementation as well as Atterberg limits, whereas in reconstituted clay, it is generally known that e-log p’ curve is varied with Atterberg limits. However, e-log p' graph is possible to change according to the reconstituting methods and test conditions. In this study, consolidation tests are performed as various test condition for reconstituted Busan clay. Test results show that the relationship e/$e_L$ and log p' is almost constant with $e_L$. And the compression index obtained from slurry method sample is larger than one obtained from kneading method sample. Intrinsic compression line (ICL) of Busan clay is identical with ICL suggested by Burland.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• v.y2004m10
• /
• pp.59-63
• /
• 2004

In recent days. it is necessary to find environment-friendly way of diposing industrial waste and reclying system. So this study will analyze the property of Porous concrete improved by concrete waste powder and recycled lightweight aggregate and then suggest the ways of reclying. The method deals with experimenting unit weight of capacity. thermal conductivity, compression and ultrasonic pluse velocity. Considering the relation between ultrasonic pluse velocity and unit weight & thermal conductivity through the graph. the result of relation between ultrasonic pluse velocity and unit weight & thermal conductivity on the graph expessed their high interaction shown as direct proportion on the graph. Recycled Porous concrete merits lightweight and adiabatic. Therefore. we will expect that the current using ALC and Recycled Porous concrete has be similar thermal conductivity.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.589-592
• /
• 2005

Molding shrinkage s variation is one of the problems to be solved in conventional injection molding. Despite many trying-out has been to solve these, intrinsic causes of shrinkage such as orientation and thermal exchange between melt and mold has yet not solved. For reducing shrinkage and residual stress on molding, injection compression molding process was invented. In this study, experiments about effect of injection compression molding's parameters on shrinkage of molding were conducted with PMMA and compared with conventional injection molding's shrinkage. Before the injection compression molding experiment, molding shrinkage rate was predicted by analyzing pvT graph and was compared with the results of experiment. The shrinkage rate of injection compression molding was lower than convention injection molding' one but was different from the predicted shrinkage. The reason was observed that experiment mold as not positive type, flowing backward of melt into nozzle and unreasonable mechanism of injection molding machine.