• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.6
• /
• pp.62-68
• /
• 1983

We suggest a Quasi- dual graph model in consideration of dynamic module assignment and relocation to assign task optimally to two processors that have different processing abilities. An optimal module partitioning and allocation to minimize total processing cost can be achieved by applying shortest-path algorithm with time complexity 0(n2) on this graph model.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.437-438
• /
• 2014

본 논문에서는 동적 API 콜 그래프를 기반으로 하는 버스마킹 기법을 제안한다. API 콜 그래프를 이용함으로써 기존 방법들에 비해 프로그램의 정보를 보다 많이 반영하였다. 상용 Windows 프로그램들을 대상으로 실험을 수행하였으며, 실제로 기존의 유사성 분석 기법들에 비해 신뢰성과 강인성 측면에서 모두 성능 향상을 보였다.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.5
• /
• pp.177-188
• /
• 2018

The scale of graph data has been increased rapidly because of the growth of mobile Internet applications and the proliferation of social network services. This brings upon the imminent necessity of efficient distributed and parallel graph processing approach since the size of these large-scale graphs are easily over a capacity of a single machine. Currently, there are two popular parallel graph processing approaches, vertex-centric graph processing and block centric processing. While a vertex-centric graph processing approach can easily be applied to the parallel processing system, a block-centric graph processing approach is proposed to compensate the drawbacks of the vertex-centric approach. In these systems, the initial quality of graph partition affects to the overall performance significantly. However, it is a very difficult problem to divide the graph into optimal states at the initial phase. Thus, several dynamic load balancing techniques have been studied that suggest the progressive partitioning during the graph processing time. In this paper, we present a load balancing algorithms for the block-centric graph processing approach where most of dynamic load balancing techniques are focused on vertex-centric systems. Our proposed algorithm focus on an improvement of the graph partition quality by dynamically reassigning blocks in runtime, and suggests block split strategy for escaping local optimum solution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.4
• /
• pp.257-265
• /
• 2013

In this paper, we proposed a Dynamic Channel Assignment (DCA) scheme called Graph Coloring based DCA (GC-DCA) to improve system performance for downlink femtocell networks with high density femto Access Point (AP) deployments. The proposed scheme consists of two steps: one is a femto AP grouping step considering interference and the other is a DCA step considering Signal to Interference plus Noise Ratio (SINR) for femto User Equipments (UEs). Simulation results show that the proposed GC-DCA outperforms other schemes in terms of the mean femto UE capacity and probability of femto UEs which have capacities less than a given transmit rate.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2567-2574
• /
• 1998

Many software engineering tools and techniques rely on fraphic representations of software, such as control flow graphs, program dependene graphs, or system dependence graphs. Existing graphic representations for object-oriented programs are compkicated, reduplicated. We thus propose a new graphic representation for object-oriented programs. Object-oriented Program Dependency Graph (OPDG). An OPDG consists of class dependence graph, class hierarchy graph and procedure dependence graph. Other features of OPDG are (1) the representation is compact; (2) the representation is easy to extend for the incremental development of a program; and (3) the repreesentation can be extended to provide dynamic information.

• Journal of IKEEE
• /
• v.27 no.1
• /
• pp.93-102
• /
• 2023

As one of the techniques for analyzing malicious code, techniques creating a sequence or a graph of function call relationships in an executable program and then analyzing the result are proposed. Such methods generally study function calling in the executable program code through static analysis and organize function call relationships into a sequence or a graph. However, in the case of an obfuscated executable program, it is difficult to analyze the function call relationship only with static analysis because the structure/content of the executable program file is different from the standard structure/content. In this paper, we propose a dynamic analysis method to analyze the function call relationship of an obfuscated execution program. We suggest constructing a function call relationship as a graph using the proposed technique.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.13-16
• /
• 2007

본 논문에서는 동적 추천 기능이 있는 자바 기반 음악 추천 서버를 소개한다. 본 논문에서 소개하는 추천 서버는 각 음악 사이의 유사도를 그래프로 저장하는 그래프 기반 협동적 여과 방식을 사용하며, 독립된 서버로 구성되어 클라이언트와 정해진 프로토콜에 따라 통신하도록 구현되었다. 또한 이 추천 서버는 특정 사용자나 특정 음악의 정적인(static) 성향뿐 아니라 시간에 따라 달라지는 동적인(dynamic) 성향에 맞는 추천도 가능하도록 설계되었다. 정적 성향이란 어떤 사용자가 가지고 있는 음악에 대한 기본적인 취향을 나타내고, 동적 성향이란 특정한 상황이나 분위기에 따라 유동적으로 변하는 성향을 의미한다. 본 논문에서 소개하는 추천 서버는 정적 성향과 동적 성향에 대하여 각각 추천할 수 있는 기능을 가지고 있으며, 이러한 기능을 바탕으로 실제 사용자들의 음악 다운로드 데이터를 이용하여 추천 데모 사이트를 구축하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.800-802
• /
• 2003

이 논문에서는 웹 기반의 하이퍼미디어 교육시스템에서 이산 확률 분포 함수와 사용자 프로파일 기반의 동적 적응 모델을 제안하였다. 이 모델은 응용 영역을 동적 적응 객체의 가중치 방향성 그래프로 표현하며 사용자 행위를 이산 확률 함수를 동적으로 구축하는 접근 방식을 이용하여 모델링 한다. 제안한 확률적 해석은 웹 미디어 구조에서 사용자의 탐색 행위를 추적하여 사용자 행위에 대한 잠재적 속성을 나타내는데 사용될 수 있다. 이러한 접근 방식은 사용자에게 가장 알맞은 프로파일을 동적으로 할당할 수 있다.

• Journal of the Korean Society for Railway
• /
• v.17 no.3
• /
• pp.157-164
• /
• 2014

The contact force between the pantograph and the catenary is a key factor determining the current collection quality, as they can ensure stable electrical power to the train. In this study, we analyzed the dynamic contact force for HEMU-430X depending on the train speed. It was confirmed through the results that the standard deviation of the contact force increases with an increase in the train speed. It was also verified that the span of the catenary system is a very important factor with regard to the contact force when analyzed with frequency analysis. To secure stable power in speed that exceeds 400km/h, the statistical variation of the contact force should be minimized. To realize this, the catenary tension was increased and the mass of the pan-head was decreased. The ensuing effects were then quantitatively analyzed in terms of the contact force. In addition, the differences in the contact force between a tunnel and an open field were analyzed based on a frequency analysis.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.36 no.3
• /
• pp.339-346
• /
• 2012

The pre-evaluation of the current-collection performance is an important issue for high-speed railway vehicles. In this paper, using flexible multibody dynamic analysis techniques, a simulation model of the dynamic interaction between the catenary and pantograph is developed. In the analysis model, the pantograph is modeled as a rigid body, and the catenary wire is developed using the absolute nodal coordinate formulation, which can analyze large deformable parts effectively. Moreover, for the representation of the dynamic interaction between these parts, their relative motions are constrained by a sliding joint. Using this analysis model, the contact force and loss of contact can be calculated for a given vehicle speed. The results are evaluated by EN 50318, which is the international standard with regard to analysis model validation. This analysis model may contribute to the evaluation of high-speed railway vehicles that are under development.