• Journal of information and communication convergence engineering
• /
• v.9 no.3
• /
• pp.251-255
• /
• 2011

In this paper, we investigate an adaptive cognitive radio (CR) scheme where a sensing duration and a detection threshold for spectrum sensing are adaptively determined according to the channel condition in a fading channel. We optimize the sensing duration and detection threshold of a secondary user to maximize the performance of the secondary user guaranteeing a primary user's secure communication. In addition, we analyze the effect of channel fading on the optimization of the sensing duration and detection threshold. Our numerical results show that the performance of the adaptive CR scheme can be drastically improved if a secondary user can take the advantage of channel information between primary and secondary users.

• Journal of Advanced Navigation Technology
• /
• v.12 no.5
• /
• pp.429-436
• /
• 2008

In this paper, we study an optimization which determines the optimal sensing time and the number of cooperative sensing cognitive users for cooperative spectrum sensing scheme in cognitive radio networks. In cooperative spectrum sensing, cognitive users originally in inactive status are activated and take part in spectrum sensing along with transmitting cognitive users resulting in a reduced sensing time. Tradeoff between transmission rate gain and energy consumption due to cooperative sensing is formulated as a mixed integer programming problem which is solved for the optimal values.

• Journal of information and communication convergence engineering
• /
• v.9 no.5
• /
• pp.539-544
• /
• 2011

In this paper, a parameter optimization method of RIO-DC (RED (Random Early Detection) with In and Out-De-Coupled Queues) scheme for Assured Service (AS) in Differentiated Services (DiffServ) is proposed. In order to optimize QoS (Quality of Service) performance of the RIO-DC policy for AS in terms of maximum tolerable latency, link utilization, fairness, etc., we should design router nodes with proper RIO-DC operating parameter values. Therefore, we propose a RIO-DC configuration method and the admission control criterion, considering the allocated bandwidth to each subclass and the corresponding buffer size, to increase throughput for In-profile traffic and link utilization. Simulation results show that RIO-DC with the proposed parameter values guarantees QoS performance comparable with the RIO scheme and it improves fairness between AS flows remarkably.

• Journal of Power Electronics
• /
• v.14 no.2
• /
• pp.217-225
• /
• 2014

This paper deals with the optimization of the driving techniques for the ZVT synchronous buck converter proposed in [1]. Two new gate drive circuits are proposed to allow this converter to operate by only one control signal as a 12V voltage regulator module (VRM). Voltage-driven method is applied for the synchronous rectifier. In addition, the control signal drives the main and auxiliary switches by one driving circuit. Both of the circuits are supplied by the input voltage. As a result, no supply voltage is required. This approach decreases both the complexity and cost in converter hardware implementation and is suitable for practical applications. In addition, the proposed SR driving scheme can also be used for many high frequency resonant converters and some high frequency discontinuous current mode PWM circuits. The ZVT synchronous buck converter with new gate drive circuits is analyzed and the presented experimental results confirm the theoretical analysis.

• Proceedings of the KOSOMBE Conference
• /
• v.1994 no.05
• /
• pp.85-87
• /
• 1994

This paper proposes a new inductance minimization scheme for a gradient system of arbitrarily selected shape. Although it is important to minimize the gradient coil inductance to reduce the current switching time, such minimization has been possible only for cylindrical or parallel biplanar coils. By using small current loops on arbitrarily selected surface as optimization elements, the inductance of the whole circuit can be minimized using the loop's self- and mutual-inductances. Wire positions can be easily derived from the loop current distribution. Preliminary studies for the design of x-directional surface gradient coil show the utility of tile proposed gradient coil design scheme.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.4
• /
• pp.191-198
• /
• 2003

The generalized knapsack problem or gknap is the combinatorial optimization problem of optimizing a nonnegative linear function over the integral hull of the intersection of a polynomially separable 0-1 polytope and a knapsack constraint. The knapsack, the restricted shortest path, and the constrained spanning tree problem are a partial list of gknap. More interesting1y, all the problem that are known to have a fully polynomial approximation scheme, or FPTAS are gknap. We establish some necessary and sufficient conditions for a gknap to admit an FPTAS. To do so, we recapture the standard scaling and approximate binary search techniques in the framework of gknap. This also enables us to find a weaker sufficient condition than the strong NP-hardness that a gknap does not have an FPTAS. Finally, we apply the conditions to explore the fully polynomial approximability of the constrained spanning problem whose fully polynomial approximability is still open.

• 전기의세계
• /
• v.25 no.6
• /
• pp.81-88
• /
• 1976

The present voltage-reactive power control aims at an overall coordination of reactive power sources and voltage regulation devices to keep the bus voltages within their allowable bounds on one hand and to reduce the transmission losses on the other. This paper presents an efficient computer control scheme for the real-time control of system voltage and reactive power on the basis of a simplified linear equation by using the system characteristic constant. Computational algorithm is used for the minimization of bus voltage deviation in the first phase of optimization and for the reduction of transmission losses under the constraint of vlotage settling condition in the second phase. The numerical example for sample practical system is also given. The present study on the computer control scheme will contribute to the automation of power system operation in the near future.

• Proceedings of the KIEE Conference
• /
• 2000.07a
• /
• pp.75-79
• /
• 2000

This paper proposes the optimal placement with minimum set of Phasor Measurement Units (PMU's) using tabu search and makes an alternative plan to secure the robustness of the network with PMU's. The optimal PMU Placement (OPP) problem is generally expressed as a combinatorial optimization problem subjected to the observability constraints. Thus, it is necessary to make a use of an efficient method in solving the OPP problem. In this paper, a tabu search based approach to solve efficiently this OPP problem proposed. The observability of the network with PMU's is fragile at any single PMU contingency. To overcome the fragility, an alternative scheme that makes efficient use of the existing measurement system in power system state estimation proposed. The performance of the proposed approach and the alternative scheme is evaluated with IEEE sample systems.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.19 no.2
• /
• pp.31-37
• /
• 1982

A practical and robust control scheme is suggested for MIMO disciete time processes with real simple poles. This type of control scheme, having the advantages of both the adaptiveness and optimality, maybe successfully applicable to structured dynamic controllers for plants whose paiameters are slowly timevaiying. The identiflcation of the process paiameters is undertaken in ARMA form and the optimization of the feedback gain matrix is performed in the state space representation with respect to a standard quadratic criterion.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.12
• /
• pp.3109-3120
• /
• 1996

SDL has been standardized to specify behavioral aspects of communication systems based on the formal description technique, and it is powerful and user friendly in the sense of supporting human communication and understanding, formal analysis andcomparison of behaviors, alternative implementations and design optimization, and its structural decomposition. However, SDL is not sufficient for an efficient handing of entrire system descriptions because the communication systems are generally very complex, and composed from the various interactions among sub-systems. Also, it is very difficult to explicitly verify dynamic views such as liveness and reachability. it leads the demands on analysis scheme to verify dynamic behaviros of specified systems. This paper presents modeling concepts of Petri Nets from SDL and transformation rules to Numerical Petri Nets to provide efficient technqiques for verification of dynamic behaviors, and proposes the reachability garaph that is able to trace all reachable states of a modeled system and reduce an information loss on the reachability tree.