• Journal of Korea Multimedia Society
• /
• v.19 no.2
• /
• pp.443-450
• /
• 2016

This paper deals with a kind of packing problem of which the goal is to compose one or more templates which will be used to produce the items of different types. Each template consists of a fixed number of slots which are assigned to the different types of items and the production of the items is accomplished by printing the template repeatedly. The objective is to minimize the total number of produced items. This problem is known to be NP-hard. We present a polynomial time approximation algorithm which has a constant approximation ratio. The proposed algorithm is based on the well-known first-fit strategy.

• Journal of Communications and Networks
• /
• v.10 no.2
• /
• pp.204-212
• /
• 2008

We study the routing problem in all-wireless networks based on cooperative transmissions. We model the minimum-energy cooperative path (MECP) problem and prove that this problem is NP-complete. We hence design an approximation algorithm called cooperative shortest path (CSP) algorithm that uses Dijkstra's algorithm as the basic building block and utilizes cooperative transmissions in the relaxation procedure. Compared with traditional non-cooperative shortest path algorithms, the CSP algorithm can achieve a higher energy saving and better balanced energy consumption among network nodes, especially when the network is in large scale. The nice features lead to a unique, scalable routing scheme that changes the high network density from the curse of congestion to the blessing of cooperative transmissions.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.181-195
• /
• 2006

Resource-constrained project scheduling problems with variant processes can be represented and solved using a logic-based terminological language called RSV (resource constrained project scheduling with variant processes). We consider three different variants for formalizing the RSV-scheduling problem, the optimizing variant, the number variant and the decision variant. Using the decision variant we show that the RSV- problem is NP-complete. Further we show that the optimizing variant (or number variant) of the RSV-problem is computable in polynomial time iff. the decision variant is computable in polynomial time.

• Asian-Australasian Journal of Animal Sciences
• /
• v.30 no.5
• /
• pp.736-742
• /
• 2017

Objective: Experiments were conducted to clone the sequence of Wild Argali short palate, lung and nasal epithelium clone 1 (SPLUNC1) cDNA, and to lay the foundation for further study the biological function of Wild Argali SPLUNC1. Methods: The complete sequence of Wild Argali SPLUNC1 cDNA was generated by rapid amplification of cDNA ends. The entire coding sequence was inserted into the pPIC9K vector and expressed in Pichia pastoris (P. pastoris) GS115. The recombinant SPLUNC1 protein was detected by Western blot and purified by $Ni^{2+}$ chelate affinity chromatography. The test of effect of the protein on Mycoplasma ovipneumoniae (MO) was performed with real-time polymerase chain reaction. Results: The Wild Argali SPLUNC1 cDNA was 1,076 bp with an open reading frame of 768 bp, which encoded a 26.49 kDa protein composed of 255 amino acids. Its amino acid sequence shared 98.4%, 96.9%, 94.5%, 90.2%, 80.8%, 78.4%, 78.3%, 72.5%, 72.3%, 68.8% identity with those of SPLUNC1 cDNA from Ovis aries (accession no. NP_001288334.1), Capra hircus (accession no. XP_005688516.1), Pantholops hodgsonii (accession no. XP_005979709.1), Bos taurus (accession no. NP_776851.1), Felis catus (accession no. XP_006929910.1), Homo sapiens (accession no. NP_001230122.1), Sus scrofa (accession no. NP_001005727.1), Chinchilla lanigera (accession no. NP_001269294.1), Mus musculus (accession no. NP_035256.2), and Rattus norvegicus (accession no. NP_742028.1), respectively. The recombinant protein corresponded to the expected molecular mass of 25.47 kDa as judged by sodium dodecyl sulfate-polyacrylamide gel electrophoresis, and it was detected in the supernatant of P. pastoris, and it could be purified. The results from the test of inhibition effect of argali recombinant SPLUNC1 protein on MO showed that the product could inhibit MO very well (p<0.01). Conclusion: The amino acid sequence of Wild Argali SPLUNC1 was different from other organisms. The recombinant SPLUNC1 protein has good biological activity.

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

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.193-206
• /
• 2005

This paper considers a new flow-shop scheduling problem where a different WIP (work-in-process) state has different weight on the duration time. For the two machine case, the recognition version is NP-Complete in the strong sense. Several special cases are solved by different polynomial time algorithms. Finally, we develop a heuristic and provide an upper-bound on relative error which is tight in limit.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.570-573
• /
• 1996

The evaluation test for the operation of rotary type surface mounters which consist of the reel axis, the index table and the X-Y table, has been performed by comparing the new method with the old one in only fields. Because the problem seeking for the optimal operation of rotary type surface mounters, is NP complete, it is almost impossible to get the optimal solutions of large problems. This paper deals with a dynamic network modeling, which can reduce the effort, the cost, and the time used for the performance test of rotary type surface mounters.

• Korean Management Science Review
• /
• v.13 no.1
• /
• pp.1-12
• /
• 1996

This paper deals with production scheduling of block assembly shop in shipbuilding company. The Objectives of the schedule are leveling of daily total workload and fair assignment of workload to each department of the shop. Optimizing the objectives, we consider some restrictions which consisit of block due dates, workability of each department, and space restriction. We formulate the problem in mathematical form. But the model is too complex to find the optimal solution (the problem is NP-complete) and we use the genetic algorithm to find a good solution.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.4
• /
• pp.37-50
• /
• 1997

We consider the channel allocation problem for the earth orbit (LEO) satellite systems. This problm is known to be NP-complete and a couple of heuristic algorithms have been developed. In this paper, we convert the problem into a simpler form through the concept of pattern. And we suggest another algorithm based on Simulated Annealing for this simplified problem. The results of performance comparison show that our method works very well. Simulation results are reported.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11a
• /
• pp.123-126
• /
• 2003

이질적인 계산자원들로 구성된 환경에서 독립적인 작업들을 스케줄링하기 위한 최적의 방법을 찾는 것은 NP-Complete 문제로 알려져 있다[3]. 현재까지 이 문제를 풀기 위한 다양한 휴리스틱 스케줄링 방법이 연구되어 왔다[l][4][5][6]. 본 논문에서는 그리드 컴퓨팅 환경을 위한 태스크 매핑 알고리즘을 제안한다. 제안한 알고리즘은 태스크의 완료시간을 계산시간과 통신시간으로 분리하여 노드의 성능과 네트워크의 상태를 감안하여 태스크를 할당하는 네트워크 적응적 매핑 알고리즘이다.