• Journal of Korea Society of Industrial Information Systems
• /
• v.24 no.2
• /
• pp.1-14
• /
• 2019

Since most documents used in web, XML, office applications are tree-structured, diff, merge, and version control for tree-structured documents in multi-user environments are crucial tasks. However research on edit scripts which is a basis for them is in primitive stage. In this paper, we present a document model for understanding the change of tree-structured documents as edit scripts are executed, and propose a method of switching adjacent edit operations on tree-structured documents based on the analysis of the effects of edit operations. Mostly, edit scripts which are produced as the results of diff on tree-structured documents only consist of basic operations such as update, insert, delete. However, when move and copy are included in edit scripts, because of the characteristics of their complex operation, it is often that edit scripts are generated to execute in two passes. In this paper, using the proposed method of switching edit operations, we present an algorithm of transforming the edit scripts of X-treeESgen, which are designed to execute in two passes, into the ones that can be executed in one pass.

• Journal of The Korean Association of Information Education
• /
• v.1 no.1
• /
• pp.49-59
• /
• 1997

In this thesis, To provide the base of effective data access methods, performance of some indexing techniques used gent-Tally are compared. They are classified as primary key and multikey. For primary key method, made a comparative analysis on Static index. Dynamic index and Hashing. For multikey indexing method K-d tree, K-d-B tree, Inverted file and Grid file of which characteristics are compared. In many applications, multikey indexings are more requested, but are not supplied enough. So, to satisfy users' request - more fast, more exact and to be applied according to the trend of being huge database systems, it is requested more study about multikey data access methods.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.5
• /
• pp.171-177
• /
• 2018

Recently there are many image datasets which has variety of data class and point to extract general features. But in order to this variety data class and point, deep learning model trained this dataset has not good performance in heterogeneous data feature local area. In this paper, we propose the structure which use sub-category and openset object detection methods to train more robust model, named multi-branch tree using ASSL. By using this structure, we can have more robust object detection deep learning model in heterogeneous data feature environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1C
• /
• pp.37-47
• /
• 2011

In this paper, we propose a novel ML decoding scheme based on the combination of depth- and breadth-first search methods on a partitioned tree for multiple input multiple output systems. The proposed scheme first partitions the searching tree into several stages, each of which is then searched by a depth- or breadth-first search method, possibly exploiting the advantages of both the depth- and breadth-first search methods in an organized way. Numerical results indicate that, when the depth- and breadth-first search algorithms are adopted appropriately, the proposed scheme exhibits substantially lower computational complexity than conventional ML decoders while maintaining the ML bit error performance.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.9
• /
• pp.1145-1157
• /
• 1999

본 논문에서는 RFC 2022에서 제안한 MARS 모델을 기반으로 하여 단일 대규모 클러스터를 가지는 ATM 망에서 다중의 멀티캐스팅 서버(MCS)를 이용한 멀티캐스팅 방안을 제안하고 그 성능을 평가하였다. 클러스터 내의 한 ATM 호스트가 특정 IP 멀티캐스트 그룹에 가입할 경우 ATM 호스트의 위치와 이미 존재하는 멀티캐스팅 서버들 사이의 전송 지연을 고려하여 가능한 한 종단간 전송 지연을 최소화하는 멀티캐스팅 서버를 선택하는 방안을 기술하였다. 이 방안은 최단거리 경로 알고리즘(shortest path algorithm)에 기반하여 최적의 MCS를 선정하고 송수신자 사이의 최소 지연을 가지는 멀티캐스트 트리를 구성한다. 다양한 망 위상에서 MCS의 분포 패턴을 다르게 할 경우에도 이 방안은 멀티캐스트 트리의 평균 전달 지연을 줄이는 것을 시뮬레이션을 통하여 확인하였다.Abstract In this paper, we proposed a scheme to support multiple MCSs over a single and large cluster in ATM networks, evaluated its performance by simulation. When an ATM host requests joining into a specific multicast group, the MARS designate a proper MCS among the multiple MCSs for the group member to minimize the average path delay between the sender and the group members. This scheme constructs a multicast tree through 2-phase partial multicast tree construction based upon the shortest path algorithm.We reduced the average path delay in multicast tree using our scheme under various cluster topologies and MCS distribution scenarios.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9A
• /
• pp.874-881
• /
• 2010

Acoustic signal, which is a main carrier of underwater communication, attenuates along the traveled path heavily depending on the frequency as well as inter-node distance. In addition, since it has a long propagation delay, the conventional medium access control (MAC) schemes requiring complex signaling procedures and accordingly heavy overhead messages would not be appropriate in underwater communications. In this paper, we propose a code division multiple access (CDMA) scheme as a solution for MAC of underwater communication and evaluate the performance. A hierarchical data-gathering tree topology is considered and a staggered wake-up pattern is employed for the purpose of energy saving. As a performance measure, the data rate at each level of hierarchical topology is derived.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.1
• /
• pp.149-154
• /
• 2024

This paper proposes an algorithm that remedy Floyd's the tortoise and the hare algorithm (THA) shortcomings which is specialized in singly linked list (SLL), so this algorithm fails to detect the cycle in undirected graph, digraph, and tree with multiple inputs or outputs. The proposed algorithm simply pruning the source and sink with only one edge using cycle detection of single edge node pruning. As a result of the experimental of various list, undirected graph, digraph, and tree, the proposed algorithm can be successively detect the cycle all of them. Thus, the proposed algorithm has the simplest and fastest advantage in the field of cycle detection.

• Journal of Korea Game Society
• /
• v.15 no.5
• /
• pp.109-118
• /
• 2015

The game of Go originated from ancient China is regarded as one of the most difficult challenges in the filed of AI. Over the past few years, the top computer Go programs based on MCTS have surprisingly beaten professional players with handicap. MCTS is an approach that simulates a random sequence of legal moves until the game is ended, and replaced the traditional knowledge-based approach. We applied the UCT algorithm which is a MCTS variant to the game of Tic-Tac-Toe for finding the best first move, and compared it with the result generated by a pure MCTS. Furthermore, we introduced and compared the performances of epsilon-Greedy algorithm and UCB algorithm for solving the Multi-Armed Bandit problem to understand the UCB.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.732-741
• /
• 2001

In the relational database systems the join operation is one of the most time-consuming query operations. Many parallel join algorithms have been developed 개 reduce the execution time Multiple hash join algorithm using allocation tree is one of the most efficient ones. However, it may have some delay on the processing each node of allocation tree, which is occurred in tuple-probing phase by the difference between one page reading time of outer relation and the processing time of already read one. This delay problem was solved by using the concept of synchronization of page execution time with we had proposed In this paper the effects of the performance improvements in each node of the allocation tree are extended to the whole allocation tree and the performance evaluation about that is processed. In addition we propose an efficient algorithm for multiple hash joins in limited number of processor environments according to the relationship between the number of input relations in the allocation tree and the number of processors allocated to the tree. Finally. we analyze the performance by building the analytical cost model and verify the validity of it by various performance comparison with previous method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.8
• /
• pp.1176-1189
• /
• 1993

This paper presents the Multiple Keyword Retrieval Method under the Object-Oriented Multimedia Database Model. The multiple keyword registration and retrieval algorithms are developed to reduce the partial matching problem in multimedia data retrieval. For this, proper storage structures of the lookup tables are designed. And also, in order to maintain the constant retrieval time, media data files are organized with B+ tree structure.