• Journal of KIISE:Software and Applications
• /
• v.26 no.5
• /
• pp.702-712
• /
• 1999

지연 함수형 언어를 효율적으로 구현하기 위한 한 방법으로 G-machine이 제안되었다. G-machine은 그래프 축약을 빠르게 수행하지만, 축약 과정의 그래프를 저장하기 위해 많은 기억장소를 필요로 한다. 이는 그래프 축약 방법자체의 문제점으로 생각된다. 이 논문에서는 그래프 노드의 태그를 옮김으로써 기억장소의 그래프 구조를 압축할수 있는 방법을 제안한다. 노드의 태그는 그 노드를 가리키는 포인터 자리로 옮겨지는데, 포인터 정보의 유지하기 위해 상대주소와 합쳐져 함께 옮겨진다. 태그 옮기기는 그래프 구성 노드를 힙에 동시에 할당할수 있을 때 가능하다. 그러나, 일반적으로 그래프의 일부가 전체 그래프가 생성되기 이전에 생성될 수 있으므로, 이러한 태그 옮기기가 항상 가능한 것은 아니다. 그렇지만, 태그 옮기기에 의해서 어느 정도의 힙 사용량을 줄일 수있다. 태그 옮기기에 의해 그래프를 압축했을 때 압축된 그래프를 해석하기위한 수행시간의 부담이 생기게 되는데, 이 부담정도를 알아보기 위해 몇몇 작은 프로그램에 대해서 실험결과를 보였다. 실험결과에 따르면, 태그 옮기기를 수행한 결과, 총 힙 사용량은 평균 약 305 감소하였고, 이로 인한 수행시간은 원래의 G-machine과 비슷한 수준인 것으로 나타났다.

• 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.

• 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.

• 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.

• Journal of Korea Multimedia Society
• /
• v.13 no.8
• /
• pp.1183-1193
• /
• 2010

The pyramid graph is well known in parallel processing as a interconnection network topology based on regular square mesh and tree architectures. The enhanced pyramid graph is an alternative architecture by exchanging mesh into the corresponding torus on the base for upgrading performance than the pyramid. In this paper, we adopt a strategy of classification into two disjoint groups of edges in regular square torus as a basic sub-graph constituting of each layer in the enhanced pyramid graph. Edge set in the torus graph is considered as two disjoint sub-sets called NPC(represents candidate edge for neighbor-parent) and SPC(represents candidate edge for shared-parent) whether the parents vertices adjacent to two end vertices of the corresponding edge have a relation of neighbor or sharing in the upper layer of the enhanced pyramid graph. In addition, we also introduce a notion of shrink graph to focus only on the NPC-edges by hiding SPC-edges within the shrunk super-vertex on the resulting shrink graph. In this paper, we analyze that the lower and upper bounds on the number of NPC-edges in a Hamiltonian cycle constructed on $2^n{\times}2^n$ torus is $2^{2n-2}$ and $3{\cdot}2^{2n-2}$ respectively. By expanding this result into the enhanced pyramid graph, we also prove that the maximum number of NPC-edges containable in a Hamiltonian cycle is $4^{n-1}$-2n+1 in the n-dimensional enhanced pyramid.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.22-23
• /
• 2018

본 논문에서는 그래프 간 정합을 이용한 포인트 클라우드 시퀀스 압축 기법을 제안한다. 우선, 그래프를 활용하여 포인트 클라우드 시퀀스의 시변하는 기하학적 구조를 표현하고, 그래프로부터 웨이블릿 변환을 사용하여 추출한 특징 벡터를 매칭하는 방법으로 인접 프레임 간 움직임 예측을 수행한다. 그리고 움직임 예측을 통해 얻은 움직임 벡터 중 정합 점수가 높은 소수의 움직임 벡터를 보간하여 프레임 전체의 움직임 필드를 얻는다. 최종적으로 움직임 정보를 활용하여 얻은 예측 프레임과 타겟 프레임의 차이를 선택적 엔트로피 부호화 방식으로 코딩하여 포인트 클라우드 시퀀스 압축을 수행한다. 실험 결과 제안하는 기법이 3D 포인트 클라우드 시퀀스를 효과적으로 압축함을 확인할 수 있다.

• Korean Journal of Mineralogy and Petrology
• /
• v.33 no.3
• /
• pp.273-291
• /
• 2020

The strength characteristics of the three orthogonal splitting planes, known as rift, grain and hardway planes in granite quarries, were examined. R, G and H specimens were obtained from the block samples of Jurassic granites in Geochang and Hapcheon areas. The directions of the long axes of these three specimens are perpendicular to each of the three planes. First, The chart, showing the scaling characteristics of three graphs related to the uniaxial compressive strengths of R, G and H specimens, were made. The graphs for the three specimens, along with the increase of strength, are arranged in the order of H < G < R. The angles of inclination of the graphs for the three specimens, suggesting the degree of uniformity of the texture within the specimen, were compared. The above angles for H specimens(θ^H, 24.0°~37.3°) are the lowest among the three specimens. Second, the scaling characteristics related to the three graphs of RG, GH and RH specimens, representing a combination of the mean compressive strengths of the two specimens, were derived. These three graphs, taking the various N-shaped forms, are arranged in the order of GH < RH < RG. Third, the correlation chart between the strength difference(Δσ_t) and the angle of inclination(θ) was made. The above two parameters show the correlation of the exponential function with an exponent(λ) of -0.003. In both granites, the angle of inclination(θ^RH) of the RH-graph is the lowest. Fourth, the six types of charts, showing the correlations among the three kinds of compressive strengths for the three specimens and the five parameters for the two sets of microcracks aligned parallel to the compressive load applied to each specimen, were made. From these charts for Geochang and Hapcheon granites, the mean value(0.877) of the correlation coefficients(R²) for total density(Lt), along with the frequency(N, 0.872) and density(ρ, 0.874), is the highest. In addition, the mean values(0.829) of correlation coefficients associated with the mean compressive strengths are more higher than the minimum(0.768) and maximum(0.804) compression strengths of three specimens. Fifth, the distributional characteristics of the Brazilian tensile strengths measured in directions parallel to the above two sets of microcracks in the three specimens from Geochang granite were derived. From the related chart, the three graphs for these tensile strengths corresponding to the R, G and H specimens show an order of H(R1+G1) < G(R2+H1) < R(R1+G1). The order of arrangement of the three graphs for the tensile strengths and that for the compressive strengths are mutually consistent. Therefore, the compressive strengths of the three specimens are proportional to the three types of tensile strengths. Sixth, the values of correlation coefficients, among the three tensile strengths corresponding to each cumulative number(N=1~10) from the above three graphs and the five parameters corresponding to each graph, were derived. The mean values of correlation coefficients for each parameter from the 10 correlation charts increase in the order of density(0.763) < total length(0.817) < frequency(0.839) < mean length(Lm, 0.901) ≤ median length(Lmed, 0.903). Seventh, the correlation charts among the compressive strengths and tensile strengths for the three specimens were made. The above correlation charts were divided into nine types based on the three kinds of compressive strengths and the five groups(A~E) of tensile strengths. From the related charts, as the tensile strength increases with the mean and maximum compressive strengths excluding the minimum compressive strength, the value of correlation coefficient increases rapidly.

• 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.

• The Journal of the Korea Contents Association
• /
• v.9 no.12
• /
• pp.582-591
• /
• 2009

The pyramid graph is an interconnection network topology based on regular square mesh and tree structures. In this paper, we adopt a strategy of classification into two disjoint groups of edges in regular square mesh as a base sub-graph constituting of each layer in the pyramid graph. Edge set in the mesh can be divided into two disjoint sub-sets called as NPC(represents candidate edge for neighbor-parent) and SPC(represents candidate edge for shared-parent) whether the parents vertices adjacent to two end vertices of the corresponding edge have a relation of neighbor or shared in the upper layer of pyramid graph. In addition, we also introduce a notion of shrink graph to focus only on the NPC-edges by hiding SPC-edges in the original graph within the shrunk super-vertex on the resulting graph. In this paper, we analyze that the lower and upper bound on the number of NPC-edges in a Hamiltonian cycle constructed on $2^n\times2^n$ mesh is $2^{2n-2}$ and $3*(2^{2n-2}-2^{n-1})$ respectively. By expanding this result into the pyramid graph, we also prove that the maximum number of NPC-edges containable in a Hamiltonian cycle is $4^{n-1}-3*2^{n-1}$-2n+7 in the n-dimensional pyramid.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2022.06a
• /
• pp.101-104
• /
• 2022

MPEG Immersive Video (MIV) 표준화 기술은 다시점 영상 부호화 시 비디오 코덱의 부담을 최소화하기 위해 각 시점 영상의 차분 정보만을 표현하는 처리 기술을 바탕으로 하고 있다. 본 논문에서는 시점 간 중복성 제거를 진행하는 과정인 프루닝(pruning) 과정에서 복잡도 절감을 위해 병렬처리에 용이하도록 구성되는 프루닝 클러스터 그래프에 대해 서술하고, 각 클러스터 그래프 별 구성 전략에 따른 성능 분석을 진행한다. 클러스터 그래프 내에서 중복성 제거를 진행하지 않고 완전한 정보를 보존하는 바탕 시점(basic view)의 개수가 적게 포함될수록 처리할 전체 픽셀 화소율(pixel rate)은 감소하지만, 복원 화질 역시 감소하며 프루닝 복잡도는 증가하는 경향을 보인다. 실험 결과를 통해 프루닝 클러스터 그래프 구성에 따른 트레이드오프를 탐색하고, 최적화된 그래프 구성 전략에 따라 몰입형 비디오의 효율적인 전송이 가능함을 보인다.