• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.1
• /
• pp.189-199
• /
• 1994

This paper considers the covering network design problem (CNDP). In the CNDP, an undirected graph is given where nodes correspond to potential facility sites and arcs to potential links connecting facilities. The objective of the CNDP is to identify the least cost connected subgraph whose nodes cover the given demand points. The problem difines a demand point to be covered if some node in the selected graph is present within an appropriate distance from the demand point. We present an integer programming formulation for the problem and develop a dual-based solution procedure. The computational results for randomly generated test problems are also shown.

• Journal of the Korea Society for Simulation
• /
• v.8 no.1
• /
• pp.35-49
• /
• 1999

The CC-NUMA based, distributed shared memory is an emerging architecture for multiprocessor computer systems because of its scalability and easy of programming. In this paper, we analyzed performance of a ring-based, CC-NUMA multiprocessor computer system using a commercial workload targeted for popular OLTP applications. Based on the traces collected from real machines, the characteristics of the commercial workload could be obtained. The simulation results showed that the bottleneck on the ring could be effectively removed by using a dual ring structure. We believe our simulation methodology and results will help us to design better multiprocessor computer systems for commercial application domains.

• IE interfaces
• /
• v.12 no.2
• /
• pp.337-345
• /
• 1999

This paper presents the optimization of a drilling operation subject to machining constraints such as power, torque, thrust, speed and feed rate. The optimization is meant to minimize the machining time required to produce a hole. For the first time, the effects of a pilot hole are included in the formulation of the machining constraints. The optimization problem is solved by using the geometric programming technique. The dual problem is simplified based on the characteristics of the problem, and the effects of machining constraints on the machining variables are identified.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.5
• /
• pp.539-545
• /
• 2016

In this paper, the use of an amplify-and-forward (AF) helper station in a cellular network with device-to-device (D2D) communication links is considered to enhance D2D rates and control the interference caused by D2D users to the cellular network. Two design criteria for the AF helper station are considered to improve the overall system quality-of-service (QoS). One is maximization of the worst D2D user rate under a constraint on interference caused by D2D users to the cellular network and the other is its dual, i.e., minimization of interference caused by D2D users to the cellular network with minimum rate guarantee for each D2D user. It is shown that the considered problems reduce to semi-definite programming (SDP) problems. Numerical results show that the proposed AF helper station significantly improves the system performance.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.2
• /
• pp.540-549
• /
• 2018

This paper proposes the method of active distribution network expansion planning considering distributed generation integration and distribution network reconfiguration. The distribution network reconfiguration is taken as the expansion planning alternative with zero investment cost of the branches. During the process of the reconfiguration in expansion planning, all the branches are taken as the alternative branches. The objective is to minimize the total costs of the distribution network in the planning period. The expansion alternatives such as active management, new lines, new substations, substation expansion and Distributed Generation (DG) installation are considered. Distribution network reconfiguration is a complex mixed-integer nonlinear programming problem, with integration of DGs and active managements, the active distribution network expansion planning considering distribution network reconfiguration becomes much more complex. This paper converts the dual-level expansion model to Second-Order Cone Programming (SOCP) model, which can be solved with commercial solver GUROBI. The proposed model and method are tested on the modified IEEE 33-bus system and Portugal 54-bus system.

• ETRI Journal
• /
• v.37 no.3
• /
• pp.471-479
• /
• 2015

Traditional designs of cognitive radio (CR) focus on maximizing system throughput. In this paper, we study the joint overlay and underlay power allocation problem for orthogonal frequency-division multiple access-based CR. Instead of maximizing system throughput, we aim to maximize system energy efficiency (EE), measured by a "bit per Joule" metric, while maintaining the minimal rate requirement of a given CR system, under the total power constraint of a secondary user and interference constraints of primary users. The formulated energy-efficient power allocation (EEPA) problem is nonconvex; to make it solvable, we first transform the original problem into a convex optimization problem via fractional programming, and then the Lagrange dual decomposition method is used to solve the equivalent convex optimization problem. Finally, an optimal EEPA allocation scheme is proposed. Numerical results show that the proposed method can achieve better EE performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.8
• /
• pp.3789-3808
• /
• 2017

This paper studies a multi-antenna wireless relay network in the presence of a jammer. In this network, the source node transmits signals to the destination node through a multi-antenna relay node which adopts the amplify-and-forward scheme, and the jammer attempts to inject additive signals on all antennas of the relay node. With the linear beamforming scheme at the relay node, this network can be modeled as an equivalent Gaussian arbitrarily varying channel (GAVC). Based on this observation, we deduce the mathematical closed-forms of the capacities for two special cases and the suboptimal achievable rate for the general case, respectively. To reduce complexity, we further propose an optimal structure of the beamforming matrix. In addition, we present a second order cone programming (SOCP)-based algorithm to efficiently compute the optimal beamforming matrix so as to maximize the transmission rate between the source and the destination when the perfect channel state information (CSI) is available. Our numerical simulations show significant improvements of our propose scheme over other baseline ones.

• Industrial Engineering and Management Systems
• /
• v.7 no.3
• /
• pp.257-265
• /
• 2008

This paper deals with the joint decisions on pricing and ordering for a monopolistic retailer who sells perishable goods with a fixed lifetime or demand period. The newsvendor-typed problem is formulated as a two-period inventory system where the first period represents the inventory of fresh or new-arrival items and the second period represents the inventory of items that are older but still usable. Demand may be for either fresh items or for somewhat older items that exhibit physical decay or deterioration. The retailer is allowed to adjust the selling price of the deteriorated items in the second period, which stimulates demand and reduces excess season-end or stale inventory. This paper develops a stochastic dynamic programming model that solves the problem of preseason decisions on ordering-pricing and a within-season decision on markdown pricing. We also develop a fixed-price model as a benchmark against the dual-price dynamic model. To illustrate the effect of the dual-price policy on expected profit, we conduct a comparative study between the two models. Extension to a generalized multi-period model is also discussed.

• Journal of the Society of Naval Architects of Korea
• /
• v.49 no.1
• /
• pp.33-44
• /
• 2012

In this study, the optimal operating conditions for the dual mixed refrigerant(DMR) cycle were determined by considering the power efficiency. The DMR cycle consists of compressors, heat exchangers, seawater coolers, valves, phase separators, tees, and common headers, and the operating conditions include the equipment's flow rate, pressure, temperature, and refrigerant composition per flow. First, a mathematical model of the DMR cycle was formulated in this study by referring to the results of a past study that formulated a mathematical model of the single mixed refrigerant(SMR) cycle, which consists of compressors, heat exchangers, seawater coolers, and valves, and by considering as well the tees, phase separators, and common headers. Finally, in this study, the optimal operating conditions from the formulated mathematical model was obtained using a hybrid optimization method that consists of the genetic algorithm(GA) and sequential quadratic programming(SQP). Moreover, the required power at the obtained conditions was decreased by 1.4% compared with the corresponding value from the past relevant study of Venkatarathnam.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.4 s.310
• /
• pp.23-30
• /
• 2006

This paper presents design andd verification of a circuit that improves the control-operation problems of Stored Program Optical Computer (SPOC), which is an optical computer using $LiNbO_3$ optical switching element. Since the memory of SPOC takes the Delay Line Memory (DLM) architecture and instructions that are needless of operands should go though memory access stages, SPOC memory have problems; it takes immoderate access time and unnecessary operations are executed in Arithmetic Logical Unit (ALU) because desired operations can't be selectively executed. In this paper, improvement on circuit has been achieved by removing the memory access of instructions that are needless of operands by decoding instructions before locating operand. Unnecessary operations have been reduced by sending operands to some specific operational units, not to all the operational units in ALD. We show that total execution time of a program is minimized by using the Dual Instruction Register(DIR) architecture.