• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.2
• /
• pp.89-96
• /
• 2022

This paper suggests heuristic algorithm for single-model cross-over assembly line balancing problem that is a kind of NP-hard problem. The assembly line balance problem is mainly applied with metaheuristic methods, and no algorithm has been proposed to find the exact solution of polynomial time, making it very difficult to apply in practice. The proposed bi-directional clustering algorithm computes the minimum number of worker m^* = ⌈W/c⌉ and goal cycle time c^* = ⌈W/m^*⌉ from the given total assembling time W and cycle time c. Then we assign each workstation i=1,2,…,m^* to T_i=c^* ±α≤ c using bi-directional clustering method. For 7 experimental data, this bi-directional clustering algorithm same performance as other methods.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.6
• /
• pp.99-105
• /
• 2022

This paper deals with the problem of appropriately allocating multiple processors arriving at the ready queue to the block in the user space of the main memory is divided into blocks of variable size at compilation time. The existing allocation methods, first fit(FF), best fit(BF), worst fit(WF), and next fit(NF) methods, had the disadvantage of waiting for a specific processor because they failed to allocate all processors arriving at the ready queue. The proposed algorithm in this paper is a simple block packing algorithm that allocates as many processors as possible to the largest block by sorting the size of the partitioned blocks(holes) and the size of the processor in the ready queue in descending order. The application of the proposed algorithm to nine benchmarking experimental data showed the performance of allocating all processors while having minimal internal fragment(IF) for all eight data except one data in which the weiting processor occurs due to partition errors.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.6
• /
• pp.91-97
• /
• 2022

There is hare and tortoise racing algorithm(HTA) for single-source(SS) singly linked list(SLL) with O(n) time complexity. But the fast method is unknown for general graph with multi-source, multi-destination, and multi-branch(MSMDMB). This paper suggests linear time cycle detection algorithm for given undirected and digraph with MSMDMB. The proposed method reduced the given graph G contained with unnecessary vertices(or nodes) to cycle into reduced graph G' with only necessary vertices(or nodes) to cycle based on the condition of cycle formation. For the reduced graph G', we can be find the cycle set C and cycle length λ using linear search within linear time. As a result of experiment data, the proposed algorithm can be obtained the cycle for whole data.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.5
• /
• pp.55-61
• /
• 2022

With the rapid development of information technology, Metaverse and Non-Fungible Token (hereinafter referred to as NFT) technology will not only create new supply and demand markets for digital art creators, but also for existing art writers. As interest in and trading of virtual assets and coins increases, so does the demand for digital art trading in the NFT market. This study examines the theoretical content of NFTs, blockchains, and Metaverse, and analyzes various expressions of NFT art that are currently popular. As the case study, 100 projects were selected and analyzed in the overall OpenSea ranking, which included 2D graphics, 3D graphics and motion graphics works. Then, from the perspective of creators, the graphic styles of NFT digital art are divided into 4 types: 2D graphics, 3D graphics, 2D dynamic graphics, 3D dynamic graphics, and analyzed and studied. It is hoped that in the future, this study can suggest the direction of creating graphic styles to digital art NFT creators.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.5
• /
• pp.1-6
• /
• 2022

This paper deals with the maximum cardinality matching(MCM) problem. The augmenting path technique is well known in MCM. MCM is obtained by $O({\sqrt{n}}m)$ time complexity augmenting path algorithm for the general graph, and O(m log n) algorithm for the bipartite graph. On the other hand, this paper suggests O(n) linear time algorithm. The proposed algorithm based on the basic principle of as possible as largest selected inter-vertex edges in order to obtain the MCM. This paper simply selects edge {u,𝜐} that the minimum degree vertex u and minimum degree vertex 𝜐 in N_G(u) 𝜈(G)=k times iteration. For various general and bipartite graphs experimental data, this algorithm can be get the 𝜈(G) exactly.

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

To NP-complete 3-SAT problem, this paper proposes a O(nm) polynomial time algorithm, where n is the number of literals and m is the total frequency of all literals in equation f. The algorithm firstly decides a truth value of a literal in sequence of previously-set priority. The priority order is as follows: a literal whose occurrence in a clause is 1(k=1), a literal which is k≥2 and whose truth value is either 0 or 1, and a literal with the minimum frequency. Then, literals whose truth value is determined are then deleted from clause T and the remaining clauses. This process is repeated l times, the number of literals. As a result, the proposed algorithm has been successful in accurately determining the satisfiability of a given equation f and in deciding the truth value of all the literals. This paper, therefore, provides not only a linear-time algorithm as a viable solution to the SAT problem, but also a basis for solving the P versus NP problem.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.1
• /
• pp.95-101
• /
• 2022

The two-sided assembly line balancing problem is a kind of NP-hard problem. This problem primarily can be solved metaheuristic method. This paper suggests parallel clustering algorithm that each left and right-sided workstation assigned by operations with T_i = c^* ± α < c, c^* = ${\lceil}$W/m^*${\rceil}$ such that M^* = ${\lceil}$W/c${\rceil}$ for precedence diagram of two-sided assembly line with total complete time W and cycle time c. This clustering performs forward direction from left to right or reverse direction from right to left. For the 4 experimental data with 17 cycle times, the proposed algorithm can be obtain the minimum number of workstations m^* and can be reduce the cycle time to T_max < c then metaheuristic methods. Also, proposed clustering algorithm maximizes the line efficiency and minimizes the variance between workers operation times.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.99-104
• /
• 2022

In the age of convergent media, traditional media and network media are highly integrated, and benefits are shared, which promotes the increase of traditional culture communication channels, the change of communication methods, and the change of the mode of interaction with audiences. This article analyzes the difficulties of traditional culture dissemination by enumerating some excellent cultural programs in China. At the same time, combined with the current situation of convergence media, it discusses how to transform invisible traditional culture into visual digital content, and make it widely disseminated by means of convergence media. It provides reference for the development of traditional culture, and has enlightening significance for creating high-quality cultural programs and spreading mainstream culture.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.177-183
• /
• 2022

There is no known polynomial time algorithm for QAP that is a NP-complete problem. This paper suggests O(n²) polynomial time algorithm for random type quadratic assignment problem (QAP). The proposed algorithm suggests incremental augmenting matching strategy that is to set the matching set M={(l_i,f_j)} from l_i with minimum sum of distance in location matrix L and f_j with maximum sum of quantity in facility matrix F, and incremental augmenting of matching set M from M to l_i with minimum sum of distance and to f_j with maximum sum of quantity. Finally, this algorithm performs swap strategy that is to reflect the complex correlations of distances in locations and quantities in facilities. For the experimental data, this algorithm, in spite of O(n²) polynomial time algorithm, can be improve the solution than genetic algorithm a kind of metaheuristic method.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.4
• /
• pp.95-102
• /
• 2022

This paper proposed a linear time algorithm for a three-partition problem(TPP) in which a polynomial time algorithm is not known as NP-complete. This paper proposes a backtracking method that improves the problems of not being able to obtain a solution of the MM method using the sum of max-min values and third numbers, which are known polynomial algorithms in the past. In addition, the problem of MM applying the backtracking method was improved. The proposed algorithm partition the descending ordered set S into three and assigned to the forward, backward, and best-fit allocation method with maximum margin, and found an optimal solution for 50.00%, which is 5 out of 10 data in initial allocation phase. The remaining five data also showed performance to find the optimal solution by exchanging numbers between surplus boxes and shortage boxes at least once and up to seven times. The proposed algorithm that performs simple allocation and exchange optimization with less O(k) linear time performance complexity than the three-partition m=n/3 data, and it was shown that there could be a polynomial time algorithm in which TPP is a P-problem, not NP-complete.