• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.421-426
• /
• 2001

A formal development method is used to develop software rigorously and systematically. In a formal development method, we specify system by a formal specification language and gradually develop the system more concretely until we can implement the system. VDM is one of formal specification languages. VDM uses mathematical data structures such as sets, sequences, and maps to specify the system, but most programming languages do not have such data structures. Therefore, these data structures should be converted. We can convert mathematical data structures in VDM to a linked list, a data structure in a programming language. In this article, we propose a method to convert a set, a sequence, and a map in VDM to a linked list in a programming language and prove the correctness of this conversion mathematically.

• Journal of the Korean Society for Precision Engineering
• /
• v.5 no.2
• /
• pp.56-61
• /
• 1988

For the use of computer to store, modify and retieve technical data, GT coding system has been considered as one of the effective methods. Effective data management is important for Computer Intergrated Manufacturing. Based on actual data obtained from a hand-tool maker, a die/tool coding system is developed as an example and its data base is designed susing a linked list structure. It is suggested that industries use this method to make their own data base.

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

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.627-630
• /
• 2005

This paper describes the development of a racing game with three-dimensional computer graphics as one of web-based game contents. Client user using web can access and run java applet program with download of Java Bytecode with the independence of hardware system. It consists of graphic user interface module, initial space generation module, event handler module, and thread control module. It uses 2-D linked list data structure for the 3-D graphic objects that are located in three-dimensional space for high-speed object searching and sorting. It enhances the dynamic object moving and viewing in three-dimensional space. We can use the developed racing game to inform game users of information for an advertisement like tourism information, and can apply the proposed 3-D drawing technology to 3-D game graphic engine core.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1577-1580
• /
• 1987

This paper proposes a gate and functional level logic simulator which can be run on XENIX O.S. The simulator has hierarchical structure including Hardware Description Language compiler, Waveform Description Language compiler, and Simulation Command Language compiler. The Hardware Description Language compiler generates data structure composed of gate structure, wire structure, condition structure, and event structure. Simulation algorithm is composed of selective trace and event-driven methods. To improve simulation speed, Cross Referenced Linked List Structure ia defined in building the data structure of circuits.

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

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.63-66
• /
• 1998

In the implementation of the simplex method program, the representation and the maintenance of basis matrix is very important, In the experimental study, we investigates Suhl's idea in the LU factorization and LU update of basis matrix. First, the triangularization of basis matrix is implemented and its efficiency is shown. Second, various technique in the dynamic Markowitz's ordering and threshold pivoting are presented. Third, modified Forrest-Tomlin LU update method exploiting sparsity is presented. Fourth, as a storage scheme of LU factors, Gustavson data structure is explained. Fifth, efficient timing of reinversion is developed. Finally, we show that modified Forrest-Tomlin method with Gustavson data structure is superior more than 30% to the Reid method with linked list data structure.

• Korean Management Science Review
• /
• v.15 no.1
• /
• pp.49-62
• /
• 1998

The purpose of this paper is to develope a large-scale simplex method program LPAKO. Various up-to-date techniques are argued and implemented. In LPAKO, basis matrices are stored in a LU factorized form, and Reid's method is used to update LU maintaining high sparsity and numerical stability, and further Markowitz's ordering is used in factorizing a basis matrix into a sparse LU form. As the data structures of basis matrix, Gustavson's data structure and row-column linked list structure are considered. The various criteria for reinversion are also discussed. The dynamic steepest-edge simplex algorithm is used for selection of an entering variable, and a new variation of the MINOS' perturbation technique is suggested for the resolution of degeneracy. Many preprocessing and scaling techniques are implemented. In addition, a new, effective initial basis construction method are suggested, and the criteria for optimality and infeasibility are suggested respectively. Finally, LPAKO is compared with MINOS by test results.