• Journal of Software Assessment and Valuation
• /
• v.15 no.1
• /
• pp.115-121
• /
• 2019

I analyzed the structure of a block-chain system and a block-chain-based service system. It is a decentralized book encryption system software technology that does not require a third party to secure trust between the two parties. Block chains are structured in a linked list structure. The block chain manage transaction information by blocking the transaction information, in conjunction with other blocks. As a result, I have discovered structural weaknesses in current block-chain systems and block-chain-based service systems. Once these possible structural problems are resolved, I expect that the block-chain-based service system will make various industrial contributions.

• The Journal of Korean Physical Therapy
• /
• v.31 no.4
• /
• pp.242-247
• /
• 2019

Purpose: This study examine the functioning level and quality of life (QoL) of people with non-specific neck pain and neck pain with radiculopathy using the neck disability index (NDI), functional rating index (FRI), and short form of health survey 36 (SF-36) and each of linked lCF code lists of those scales. Methods: Each item of the NDI, FRI, and SF-36 were linked conceptually to the ICF code, and the lCF code lists of those scales were produced as iNDI, iFRI, and iSF-36, respectively. Seventy-nine patients with neck pain filled the instruments and its linked ICF code lists. The subjects were divided into two groups based on the diagnosis, non-specific neck pain (Group1), and neck pain with radiculopathy (Group2). A group comparison was performed using an independent t-test. The Pearson correlation coefficient was also used to analyze the relationships between each scale and the linked ICF code list. Results: The participants in Group 2 experienced more difficulties in their daily activities than those in Group 2 when examined in NDI and FRI (p<0.05). This result was also found consistently in the ICF code lists, iNDI and iFRI (p=0.05). On the other hand, the QoL did not show a difference between groups (p=0.06). A strong correlation was observed between the instruments and linked ICF code lists: NDI and iNDI (r=0.90), FRI and iFRI (r=0.91), and SF-36 and iSF-36 (r=-0.61). Conclusion: These findings suggest that the concept of each item in NDI and FRI could be linked to the ICF codes when examining patients with neck pain, but the items of SF-36 were found to be linked and expressed in ICF.

• Journal of Ginseng Research
• /
• v.41 no.4
• /
• pp.534-539
• /
• 2017

Background: Ginsenosides are the main ingredients of ginseng, which, in traditional Eastern medicine, has been claimed to have therapeutic values for many diseases. In order to verify the effects of ginseng that have been empirically observed, we utilized the reverse docking method to screen for target proteins that are linked to specific diseases. Methods: We constructed a target protein database including 1,078 proteins associated with various kinds of diseases, based on the Potential Drug Target Database, with an added list of kinase proteins. We screened 26 kinds of ginsenosides of this target protein database using docking. Results: We found four potential target proteins for ginsenosides, based on docking scores. Implications of these "hit" targets are discussed. From this screening, we also found four targets linked to possible side effects and toxicities, based on docking scores. Conclusion: Our method and results can be helpful for finding new targets and developing new drugs from natural products.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.133-136
• /
• 2011

트리의 검색은 어플리케이션에서 흔하게 사용되는 연산중 하나이다. 하지만 대부분의 트리는 연결 리스트 기반으로 생성되며 연결 리스트 트리 구조는 데이터의 지역성을 가지기 힘들기 때문에 트리구조의 검색을 동반한 응용은 캐시메모리 사용효율의 제약으로 인해 성능상의 문제점이 존재한다. 본 논문에서는 연결 리스트 트리를 배열 기반의 트리로 변형하여 트리 검색 시 성능을 향상시킬 수 있는 방법을 제시한다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.9
• /
• pp.327-336
• /
• 2015

Mobile game servers usually execute frequent dynamic memory allocation for generating the buffers that deal with clients requests. It causes to deteriorate the performance of game servers since it increases system workload and memory fragmentation. In this paper, we propose fixed-sized memory pool management method. Memory pool for the proposed method has a sequential memory structure based on circular linked list data structure. It solves memory fragmentation problem and saves time for searching the memory blocks which are required for memory allocation and deallocation. We showed the efficiency of the proposed method by evaluating the performance of dynamic memory allocation, through the proposed method and the memory pool management method based on boost open source library.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.5
• /
• pp.1397-1408
• /
• 1998

Service networks for the future communication networks will be combined by the B-ISDN networks. These service networks also will use SS No.7 as the signaling transport network for the control of user requriement service. Therefore, ITU-T recommended B-ISDN signaling layers for SS No.7 as a substitute for N-ISDN MTP signaling layer. In this paper, we propose the implementation structure and describe the characteristics and functions of each signaling layer of SS No.7, which are adapted to ATM switching system, and evaluate a performance. The structure of SSCOP transmission buffer using a linked list and an unit frame length is proposed for SAAL layer and the implementation structure and internal routing method according to the ATM switching system are also proposed for MTP-3b layer. Additionally, we propose the ISUP/B-ISUP level interworking structure using only associated mode, which are presented in the first stage of B-ISDN as the effective internatworking structure of SS No.7 for the circuit related signaling network between the existing N-ISDN networks and B-ISDN networks.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.809-822
• /
• 2004

In this paper, we propose a concurrency control algorithm based on R-tree for spatial database management system. The previous proposed algorithms can't prevent problem that search operation is to be blocking during update operations. In case of multidimensional indexes like R-tree, locking of update operations may be locked to several nodes, and splitting of nodes have to lock a splitting node for a long time. Therefore search operations have to waiting a long time until update operations unlock. In this paper we propose new algorithms for lock-free search operation. First, we develop a new technique using a linked-list technique on the node. The linked-list enable lock-free search when search operations search a node. Next, we propose a new technique using a version technique. The version technique enable lock-free search on the node that update operations is to be splitting.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.8
• /
• pp.1832-1838
• /
• 2009

In this paper, we present new signal de-interleaving method for the frequency agility radar in which the carrier frequency is changed irregularly. Generally radar use a fixed carrier frequency, and it is easy for electronic warfare system to de-interleave the radar signal with respect to the frequency, pulse width(PW), and direction of signal arriving(DOA). In frequency agility radar, it is difficult to de-interleave the radar signals according to the carrier frequency because the frequency is changed irregularly. We suggest a good de-interleaving method to identify the frequency agility radar signals in comparison with PRI's of radars. First we calculate pulse repeat Interval(PRI) of radar in linked-list and queue structure and de-interleave the radar signals with PRI, PW, and DOA, then identify the frequency agility radar. When we use the proposed algorism to the frequency agility radar, we have a good de-interleaving results with electronic warfare systems.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.1
• /
• pp.163-170
• /
• 2023

This paper introduces the semantic modeling technology for autonomous control of manufacturing facilities and status definition algorithm. With the development of digital twin technology and various ICT technologies of the smart factory, a new production management model is being built in the manufacturing industry. Based on the advanced smart manufacturing technology, the status determination algorithm was presented as a methodology to quickly identify and respond to problems with autonomous control and facilities in the factory. But the existing status determination algorithm informs the user or administrator of error information through the grid map and is presented as a model for coping with it. However, the advancement and direction of smart manufacturing technology is diversifying into flexible production and production tailored to consumer needs. Accordingly, in this paper, a technology that can design and build a factory using a semantic-based Linked List data structure and provide only necessary information to users or managers through graph-based information is introduced to improve management efficiency. This methodology can be used as a structure suitable for flexible production and small-volume production of various types.

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