• Management Science and Financial Engineering
• /
• v.15 no.2
• /
• pp.69-100
• /
• 2009

In this paper, we consider a relatively new two-machine flow shop scheduling problem where the unit time WIP cost increases as a job passes through various stages in the production process, and the objective is to minimize the total WIP (work-in-process) cost. Specifically, we study three special cases of the problem. First, we consider the problem where processing times on machine 1 are identical. Second, the problem with identical processing times on machine 2 is examined. The recognition version of the both problems is unary NP-complete (or NP-complete in strong sense). For each problem, we suggest two simple and intuitive heuristics and find the worst case bound on relative error. Third, we consider the problem where the processing time of a job on each machine is proportional to a base processing time. For this problem, we show that a known heuristic finds an optimal schedule.

• Journal of Information Technology Services
• /
• v.3 no.2
• /
• pp.99-104
• /
• 2004

Conventional and public-key cryptography has been widely accepted as a base technology for the design of computer security systems. D-classes have the potential for application to conventional and public-key cryptography. However, there are very few results on D-classes because the computational complexity of D-class computation is NP-complete. This paper discusses the design of algorithms for the efficient computation of D-classes and the Java implementation of them. In addition, the paper implements the same D-class computation algorithms in C and shows the performance of C and Java programming languages for the computation-intensive applications by comparing their execution results.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.911-914
• /
• 2003

The prevention of D-Dos Attack requires to install filters at As border routers. This follows that finding minimum number of filters - VC(Vertex Cover), which is NP-complete problem. So, We propose improved 'Approximate VC' which is more efficient to real AS topology using topology property. Simulation shows that our algorithm, improved 'Approximated VC' enables us to reduce 25% VC nodes in comparison with 'Approximated VC'.

• Proceedings of the KIEE Conference
• /
• 1990.07a
• /
• pp.539-541
• /
• 1990

A new neural network model, based on the Hopfield's crossbar associative network, is presented and shown to be an effective tool for the NP-Complete problems. This model is applied to a class of layer assignment problems for VLSI routing. The results indicate that this modified Hopfield model improves stability and accuracy.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.9
• /
• pp.105-111
• /
• 2015

This paper suggests O(n) linear-time algorithm for car sequencing problem (CSP) that has been classified as NP-complete because of the polynomial-time algorithm to solve the solution has been unknown yet. This algorithm applies maximum options-equiped car type first production rule to decide the car sequencing of n meet the r:s constraint. This paper verifies thirteen experimental data with the six data are infeasible. For thirteen experimental data, the proposed algorithm can be get the solution for in all cases. And to conclude, This algorithm shows that the CSP is not NP-complete but the P-problem. Also, this algorithm proposes the solving method to the known infeasible cases. Therefore, the proposed algorithm will stand car industrial area in good stead when it comes to finding a car sequencing plan.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.3
• /
• pp.119-124
• /
• 2014

Let G = (V, E) be a graph. Maximum Bipartite Subgraph Problem is to convert a graph G into a bipartite graph by removing minimum number of edges. This problem belongs to NP-complete; hence, in this research, we are suggesting a new metaheuristic algorithm which combines Tabu search and GRASP.

• The KIPS Transactions:PartA
• /
• v.18A no.2
• /
• pp.69-74
• /
• 2011

The minimum dominating set problem of a graph G is to find a smallest possible dominating set. The minimum dominating set problem is a well-known NP-complete problem such that it cannot be solved in polynomial time. Heuristic or approximation algorithm, however, will perform well in certain area of application. In this paper, we suggest three different simulated annealing algorithms and experimentally show better efficiency improvement by applying these algorithms to the graph instances developed by DIMACS.

• Journal of Microbiology and Biotechnology
• /
• v.25 no.11
• /
• pp.1827-1834
• /
• 2015

The SMG1 lipase from Malassezia globosa is a newly found mono- and diacylglycerol (DAG) lipase that has a unique lid in the loop conformation that differs from the common alpha-helix lid. In the present study, we characterized the contribution of three residues, L103 and F104 in the lid and F278 in the rim of the binding site groove, on the function of SMG1 lipase. Site-directed mutagenesis was conducted at these sites, and each of the mutants was expressed in the yeast Pichia pastoris, purified, and characterized for their activity toward DAG and p-nitrophenol (pNP) ester. Compared with wild-type SMG1, F278A retained approximately 78% of its activity toward DAG, but only 11% activity toward pNP octanoate (pNP-C8). L103G increased its activity on pNP-C8 by approximately 2-fold, whereas F104G showed an approximate 40% decrease in pNP-C8 activity, and they both showed decreased activity on the DAG emulsion. The deletion of 103-104 retained approximately 30% of its activity toward the DAG emulsion, with an almost complete loss of pNP-C8 activity. The deletion of 103-104 showed a weaker penetration ability to a soybean phosphocholine monolayer than wild-type SMG1. Based on the modulation of the specificity and activity observed, a pNP-C8 binding model for the ester (pNP-C8, N102, and F278 form a flexible bridge) and a specific lipid-anchoring mechanism for DAG (L103 and F104 serve as "anchors" to the lipid interface) were proposed.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.7
• /
• pp.377-383
• /
• 2002

The TSP(Traveling Salesman Problem) has been known as NP-complete, there have been various studies to find the near optimal solution. The nearest neighbor heuristic is more simple than the other algorithms which are to find the optimal solution. This paper designs and implements a new distributed nearest neighbor heuristic with bounding function for the TSP using the master/slave model of PVM(Parallel Virtual Machine). Distributed genetic algorithm obtains a near optimal solution and distributed nearest neighbor heuristic finds an optimal solution for the TSP using the near optimal value obtained by distributed genetic algorithm as the initial bounding value. Especially, we get more speedup using a new genetic operator in the genetic algorithm.

• The KIPS Transactions:PartA
• /
• v.14A no.5
• /
• pp.317-326
• /
• 2007

We propose more enhanced heuristic for the GOSST(Grade of Services Steiner Minimum Tree) problem in this paper. GOSST problem is a variation of Steiner Tree problem and to find a network topology satisfying the G-Condition with minimum network construction cost. GOSST problem is known as one of NP-Hard or NP-Complete problems. In previous our research, we proposed a heuristic employing Direct Steiner Point Locating strategy with Distance Preferring MST building strategy. In this paper, we propose new Steiner point locating strategy, Zigzag Steiner point Locating strategy. Through the results of out experiments, we can assert this strategy is better than our previous works. The Distance Zigzag GOSST method which hires the Distance Preferring MST building strategy and Zigzag Steiner point Locating strategy defrays the least network construction cost and brings 31.5% cost saving by comparison to G-MST, the experimental control and 2.2% enhancement by comparison to the Distance Direct GOSST method, the best GOSST method in our previous research.