• Journal of Information Processing Systems
• /
• v.13 no.2
• /
• pp.417-427
• /
• 2017

Power allocation is an important factor for cognitive radio networks to achieve higher communication capacity and faster equilibrium. This paper considers power allocation problem to each cognitive user to maximize capacity of the cognitive systems subject to the constraints on the total power of each cognitive user and the interference levels of the primary user. Since this power control problem can be formulated as a mixed-integer nonlinear programming (NP) equivalent to variational inequality (VI) problem in convex polyhedron which can be transformed into complementary problem (CP), we utilize modified projection method to solve this CP problem instead of finding NP solution and give a power control allocation algorithm with a subcarrier allocation scheme. Simulation results show that the proposed algorithm performs well and effectively reduces the system power consumption with almost maximum capacity while achieve Nash equilibrium.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.11
• /
• pp.1231-1238
• /
• 2015

In this paper, we proposed an efficient algorithm using Node monitoring (NM) and Piecewise Linear Function Approximation(: NP) for reducing the complexity of LDPC code decoding. Proposed NM algorithm is based on a new node-threshold method together with message passing algorithm. Piecewise linear function approximation is used to reduce the complexity of the algorithm. This new algorithm was simulated in order to verify its efficiency. Complexity of our new NM algorithm is improved to about 20% compared with well-known methods according to simulation results.

• Korean Management Science Review
• /
• v.26 no.1
• /
• pp.65-76
• /
• 2009

The undirected Steiner tree problem in graphs is known to be NP-hard. The objective of this problem is to find a shortest tree containing a subset of nodes, called terminal nodes. This paper proposes a method based on a two-step procedure to solve this problem efficiently. In the first step. graph reduction rules eliminate useless nodes and edges which do not contribute to make an optimal solution. In the second step, a max-min ant colony optimization combined with Prim's algorithm is developed to solve the reduced problem. The proposed algorithm is tested in the sets of standard test problems. The results show that the algorithm efficiently presents very correct solutions to the benchmark problems.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2011.08a
• /
• pp.360-360
• /
• 2011

We demonstrated the fabrication method of superhydrophobic nanocoating through a facile spin-coating and the chemical modification. The resulting coating showed a tremendous water repellency with a static water contact angle (CA) of 158$^{\circ}$ and a hysteresis of 1$^{\circ}$. The number of ZnO nanoparticle (NP) coating cycles affected on the surface roughness, which is key role for superhydrophobic surface, and thus the CA can be modulated by changing the ZnO NP coating cycles. The CA can be controlled by changing the carbon length of Self-Assembled Monolayers(SAM). This simple ZnO coating is substrate-independent including flexible surfaces, papers and cotton fabrics, which can effectively be used in various potential applications. We also observed the thermal and dynamic stabilities of SAM on ZnO nanoparticles. The superhydrophobicic surface maintained its superhydrophobic properties below 250$^{\circ}C$ and under dynamic conditions.

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

• Journal of the Korean Society for Railway
• /
• v.13 no.6
• /
• pp.601-607
• /
• 2010

The objective of this paper is to propose a fast and easy Binary Artificial Bee Colony (BABC) heuristic algorithm to optimize NP-hard scheduling problem of railway track maintenance considering real conditions. The optimal or best solutions can be found using proposed BABC within very short or user specified computation time. We can greatly maximize the objective value using this proposed method in 30, 60, 100 and 200 work size railway track maintenance scheduling problems for experiment and analysis.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2419-2422
• /
• 2000

A distributed real-time system that is being used now is usually divided into three level : higher level, middle level, and lower level. The higher level network is usually called an information network, the middle level is called a control network, and the lower level is called a field network or a divice network. This dissertation suggests and implements a middle level network which is called PICNET-NP (Plant Implementation and Control Network for Nuclear Power Plant). PICNET-NP is based partly on IEEE 802.4 token-passing bus access methed and partly on IEEE 802.3 physical layer. For this purpose a new interface, a physical layer service translater, is introduced. A control network using this method is implemented and applied to a distributed real-time system.

• Journal of the Semiconductor & Display Technology
• /
• v.14 no.4
• /
• pp.72-77
• /
• 2015

Three-level diode clamped multilevel inverter, generally known as neutral point clamped (NPC) inverter, has an inherent problem causing neutral point (NP) potential variation. Until now, the NP potential problem of variation has been investigated and lots of solutions have also been proposed. This paper presents a neutral point voltage control technology using the anti-windup PI controller and offset technology of PWM (Pulse Width Modulation) to control the variation of NPC 3-phase three-level inverter neutral point voltage. And the proposed algorithm is tested and verified using a PLL (Phase Locked Loop) in order to synchronize the phase voltage from the line voltage of grid. It significantly improves the voltage balancing under a solar fluctuation conditions of the inverter. Experimental results show the good performance and effectiveness of the proposed method.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2013.08a
• /
• pp.267.2-267.2
• /
• 2013

In the citrate reduction method of gold nanoparticle (AuNP) synthesis, pH of the reaction mixture can have a considerable impact on the size and size distribution of AuNPs. In this work, effects of pH variation upon the size and its distribution were examined systematically. As the initial pH was change from 5.5 to 10.5, it showed an optimal pH around 7.5. At this pH, both of the size and the size distribution showed their minimum values, which was verified by transmission electron microscopy and UV-vis spectroscopy. This occurrence of optimal pH was discussed with the results of in situ monitoring pH during the reaction of AuNP synthesis.

• Journal of the Korean Society of Safety
• /
• v.13 no.4
• /
• pp.240-247
• /
• 1998

This paper proposed a method for solving the nonlinear integer programing problem to get easily the best compromise solution while holding a nonlinear property by using the genetic algorithms. Also, this paper reported that the optimization problem of systems reliability as was solved by using the preposed method, and the numerical comparison experiments between the 0-1 LP/0-1 NP formulations were demonstrated, and from the quantitative evaluation the efficiency of the proposed method was demonstrated.