• The Transactions of the Korea Information Processing Society
• /
• v.5 no.3
• /
• pp.671-680
• /
• 1998

Network services, such as teleconferencing, remote diagnostics and education, and CSCW require multicasting. Multicast routing methods can be divided into two categories. One is the shortest path tree method and the other is the minimal Steiner tree method. The latter has an advantage over the former in that only one Steiner tree is needed for a group. However, finding a minimal Steiner tree is an NP-complete problem and it is necessary to find an efficient heuristic algorithm. In this paper, we present an evolutionary optimization method for finding minimal Steiner trees without sacrificing too much computational efforts. In particular, we describe a tree-based genetic encoding scheme which is in sharp constast with binary string representations usually adopted in convetional genetic algorithms. Experiments have been performed to show that the presented method can find optimal Steiner trees for given vetwork configurations. Comparitivie studies have shown that the evolutionary method finds on average a better solution than other conventional heustric algorithms.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.1119-1122
• /
• 2001

XML 데이터의 스타일 편집기 시스템을 이용한 문서의 변환 방법을 소개한다. 스타일 편집을 위한 XSL 정보는 XML 데이터에서 스타일을 적용할 부분을 선택하고 적용할 스타일을 기술하는데, 적용 결과는 원본 XML 문서에서 일부를 추출하는 효과가 된다. 본 논문에서는 이 때 추출되는 XML 문서의 부분을 새로운 문서로 생성하는 XSLT 의 자동 생성 알고리즘을 제안하였다. 이 때 생성된 XSLT 코드에 의해 XML 문서를 변환한 결과가 다음과 같은 성질을 만족함을 보였다. 1) 변환된 결과 문서에 편집의 결과인 XSL 스타일을 그대로 적용할 수 있으며, 2) 결과 문서가 최소한의 노드만을 가진다. 일반적으로 스타일을 적용할 때 원본 XML 문서는 불필요하거나 공개될 수 없는 많은 정보를 포함하고 있다. 본 논문에서 제시된 모델을 실제 문서 전송 시스템에 적용하면 스타일 편집의 결과로 XML 의 필요한 부분만을 추출하는 XSLT 코드와 그 추출 문서에 적용 가능한 XSL 스타일 정보를 생성함으로써 효율적인 전송과 데이터 보호의 목적을 동시에 만족시킬 수 있다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.9-16
• /
• 2008

For the efficient routing on a Sensor Network, one may consider a deployment problem to interconnect the sensor nodes optimally. There is an analogous theoretic problem: the Steiner Tree problem of finding the tree that interconnects given points on a plane optimally. One may use the approximation algorithm for the problem to find out the deployment that interconnects the sensor nodes almost optimally. However, the Steiner Tree problem is to interconnect mathematical set of points on a Euclidean plane, and so involves particular cases that do not occur on Sensor Networks. Thus the approach of using the algorithm does not make a proper way of analysis. Differently from the randomly given locations of mathematical points on a Euclidean plane, the locations of sensors on Sensor Networks are assumed to be physically dispersed over some moderate distance with each other. By designing an approximation algorithm for the Sensor Networks in terms of that physical property, one may produce the execution time and the approximation ratio to the optimality that are appropriate for the problem of interconnecting Sensor Networks.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.597-600
• /
• 2008

스타(star) 네트워크는 노드 대칭성, 최대 고장 허용도, 계층적 분할 성질을 갖고, 하이퍼큐브보다 망 비용이 개선 된 상호 연결망이다. 본 연구에서는 상호연결망으로 널리 알려진 스타네트워크와 RFM, 버블정렬네트워크 사이의 임베딩 방법을 제안하고, 임베딩의 연장율 비용을 분석한다. 연구 결과로 버블정렬(Bubblesort) 그래프 $B_N$을 RFM 그래프 $R_N$에 연장비율 2, 버블정렬(Bubblesort) 그래프 $B_N$을 스타그래프 $S_N$에 연장율 3에 임베딩 할 수 있다.

• Journal of Korea Multimedia Society
• /
• v.13 no.5
• /
• pp.802-816
• /
• 2010

To create gesture from a new text input is an important problem in computer games and virtual reality. Recently, there is increasing interest in gesture stylization to imitate the gestures of celebrities, such as announcer. However, no attempt has been made so far to stylize a gestures using emotion such as happiness and sadness. Previous researches have not focused on real-time algorithm. In this paper, we present a system to automatically make gesture animation from SMS text and stylize the gesture from emotion. A key feature of this system is a real-time algorithm to combine gestures with emotion. Because the system's platform is a mobile phone, we distribute much works on the server and client. Therefore, the system guarantees real-time performance of 15 or more frames per second. At first, we extract words to express feelings and its corresponding gesture from Disney video and model the gesture statistically. And then, we introduce the theory of Laban Movement Analysis to combine gesture and emotion. In order to evaluate our system, we analyze user survey responses.

• Journal of the military operations research society of Korea
• /
• v.32 no.2
• /
• pp.114-130
• /
• 2006

This paper deals with complexity theory to describe amphibious warfare situation using EINSTein (Enhanced ISAAC Neural Simulation Tool) simulation model. EINSTein model is an agent-based artificial "laboratory" for exploring self-organized emergent behavior in land combat. Many studies have shown that existing Lanchester equations used in most war simulation models does not describe changes of combat. Future warfare will be information warfare with various weapon system and complex combat units. We have compared and tested combat results with Lanchester models and EINSTein model. Furthermore, the EINSTein model has been applied and analyzed to amphibious warfare model such as amphibious assault and amphibious sudden attack. The results show that the EINSTein model has a possibility to apply and analyze amphibious warfare more properly than Lanchester models.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.3
• /
• pp.109-113
• /
• 2016

In this paper, we propose efficient LED lighting control algorithm using a David star magic square. Such algorithms increases the power reduction, the heat efficiency and LED life cycle and the efficiency of the LED lighting control consumption. Lighting system using existing Magic square algorithm could be reduced to increase the heat efficiency of the LED because the LED lighting time of the reduced cross-lighting. but it has a limit to the lighting control. If should apply the this proposed algorithm, can reduces power consumption and increases LED life-cycle, heat efficiency of LED lighting module and efficiency of the lighting control of the LED. This paper proposed that algorithm is by using a David star magic square on the LED Matrix. Divided into twelve areas to move the pattern in constant time interval, to perform the cross rotation and inversion techniques to thereby light up. In this paper proposed algorithm of this paper was compared with existing Magic square approach. As a result, power consumption and heat-value and luminous flux was reduced as the conventional lighting system. And, the LED lighting control increase the efficiency.

• Journal of Broadcast Engineering
• /
• v.27 no.1
• /
• pp.104-123
• /
• 2022

Style transfer based on neural network provides very high quality results by reflecting the high level structural characteristics of images, and thereby has recently attracted great attention. This paper deals with the problem of resolution limitation due to GPU memory in performing such neural style transfer. We can expect that the gradient operation for style transfer based on partial image, with the aid of the fixed size of receptive field, can produce the same result as the gradient operation using the entire image. Based on this idea, each component of the style transfer loss function is analyzed in this paper to obtain the necessary conditions for partitioning and padding, and to identify, among the information required for gradient calculation, the one that depends on the entire input. By structuring such information for using it as auxiliary constant input for partition-based gradient calculation, this paper develops a recursive algorithm for super high-resolution image style transfer. Since the proposed method performs style transfer by partitioning input image into the size that a GPU can handle, it can perform style transfer without the limit of the input image resolution accompanied by the GPU memory size. With the aid of such super high-resolution support, the proposed method can provide a unique style characteristics of detailed area which can only be appreciated in super high-resolution style transfer.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.1
• /
• pp.22-34
• /
• 2002

In this paper, we consider ring embeding problem in faulty (n,k) star graphs which is recently proposed as an alternative interconnection network topology, By effectively utilizing such strategies as series of dimension expansions and even distribution of faulty nodes into sub-stars in graph itself. we prove that it is possible to construct a maximal fault-free ring excluding only faulty nodes when the number of faults is no more than n-3 and $n-k{\geq}2$, and also propose an algorithm which can embed the corresponding ring in (n.k)-star graphs This results will be applied into the multicasting applications that the underlying cycle properties on the multi-computer system.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.501-508
• /
• 2009

In this paper, we prove that folded hyper-star network FHS(2n,n) is node-symmetric and a bipartite network. We show that FHS(2n,n) can be embedded into odd network On+1 with dilation 2, congestion 1 and Od can be embedded into FHS(2n,n) with dilation 2 and congestion 1. Also, we show that $2n{\time}n$ torus can be embedded into FHS(2n,n) with dilation 2 and congestion 2.