• Magazine of the Korean Society of Agricultural Engineers
• /
• v.29 no.3
• /
• pp.125-137
• /
• 1987

The purpose of this paper is to examine some difficulties in water management of agricultural reservoirs in Korea, for there are approximately more than 15,000 reservoirs which are now being utilized for the purpose of irrigation, along with the much amount of expenses and labors to be invested against droughts and floods periodically occurred. Recently, the effective use of water resources in the agricultural reservoirs with a single purpose, is becomming multiple according to the alterable environment of water use. Therefore, the task to allocate agricultural water rationally and economically must be solved for the multiple use of agricultural reservoirs. On the basis of the above statement, this study aims at suggesting the rational method of water management by introducing an optimal technique to allocate the water in an existing agricultural reservoir rationally, for the sake of maximizing the economic effect. To achieve this objective, a reservoir, called "0-Bongje" as a sample of the case study, is selected for an agricultural water development proiect of medium scale. As a model for the optimum allocation of water in the multi-purpose use of reservoirs a linear programming model is developed and analyzed. As a result, findings of the study are as follows : First, a linear programing model is developed for the optimum allocation of water in the multi-purpose use of agricultural reservoirs. By adopting the model in the case of reservoir called "O-Bongje," the optimum solution for such various objects as irrigation area, the amount of domestic water supply, the size of power generation, and the size of reservoir storage, etc., can be obtained. Second, by comparing the net benefits in each object under the changing condition of inflow into the reservoir, the factors which can most affect the yearly total net benefit can be drawn, and they are in the order of the amount of domestic water supply, irrigation area, and power generation. Third, the sensitivity analysis for the decision variable of irrigation which may have a first priority among the objects indicate that the effective method of water management can be rapidly suggested in accordance with a condition under the decreasing area of irrigation. Fourth, in the case of decision making on the water allocation policy in an existing multi-purpose reservoir, the rapid comparison of numerous alternatives can be possible by adopting the linear programming model. Besides, as the resources can be analyed in connection with various activities, it can be concluded that the linear programing model developed in this study is more quantitative than the traditional methods of analysis. Fifth, all the possible constraint equations, in using a linear programming model for adopting a water allocation problem in the agricultural reservoirs, are presented, and the method of analysis is also suggested in this study. Finally, as the linear programming model in this study is found comprehensive, the model can be adopted in any different kind of conditions of agricultural reservoirs for the purpose of analyzing optimum water allocation, if the economic and technical coefficients are known, and the decision variable is changed in accordance with the changing condition of irrigation area.

• The Korean Journal of Applied Statistics
• /
• v.2 no.1
• /
• pp.54-64
• /
• 1989

The paper by Kurkjian and Zelen(1963) introducted the Property A which related to a structural property of concordance matrix of the column incidence matrix. On the other hand, Paik(1985) showed the property of the concordance matrix, which has multinested block circulant pattern matrix, and this structural property was termed Property C by Paik(1985). This paper classifies the incomplete block designs according to the pattern of the concordence matrix which has multi-nested block circulant pattern. The purpose of this classification simplified the solution of reduced normal equation and plan of the design.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.9
• /
• pp.2339-2348
• /
• 1994

The objective of this paper is to develop a solution method for the differential-algebraic equation(DAE) derived from constrained muti-body dynamic systems. Mechanical systems are often modeled as bodies and joints. Differential equations of motion are formulated for bodies. Since the bodies are connected by joint, the differential variables must satisfy the kinematic constraint equations that come from the joints. Difficulties are arised due to drift of the differential variables off the constraint equations. An optimization method is adopted to correct the drift of the differential variables. To demonstrate the efficiency of the proposed method a slider-crank mechanism is analyzed dynamically. Identical results are obtained as these from the commercial program DADS. Dynamic analysis of a High Mobility Multi-purpose Wheeled. Vehicle(HMMWV) is carried out to show the practicalism of the proposed method.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.7
• /
• pp.1720-1730
• /
• 1995

Finite-difference analysis was conducted to study the natural convection of a stably stratified salt-water solution in an annulus due to lateral heating. The main purpose of this study is to examine in detail the multi-layered flow structure. Calculation was thus made for R $a_{\eta}$=2*10$^{5}$ and 6.5*10$^{5}$ . Formation of layered flow structure, merging process of layers, the corresponding temperature and concentration distributions, Nusselt number variations with time are examined. Numerical results show that in each layer, the temperature profile looks 'S`-shaped and the concentration profile is uniform due to the convective mixing. The formation of the roll and the layer is governed by natural convection due to the temperature gradient and the merging process of the layer by diffusion of the concentration.ation.

• Journal of the Korean Mathematical Society
• /
• v.47 no.1
• /
• pp.135-163
• /
• 2010

Motivated by [Science in China (Ser. A Mathematics) 36 (2006), no. 7, 721?732], this article deals with the following discrete type BVP $\LARGE\left\{{{\;{\Delta}[{\phi}({\Delta}x(n))]\;+\;f(n,\;x(n\;+\;1),{\Delta}x(n),{\Delta}x(n + 1))\;=\;0,\;n\;{\in}\;[0,N],}}\\{\;{x(0)-{\sum}^m_{i=1}{\alpha}_ix(n_i) = A,}}\\{\;{x(N+2)-\;{\sum}^m_{i=1}{\beta}_ix(n_i)\;=\;B.}}\right.$ The sufficient conditions to guarantee the existence of at least three positive solutions of the above multi-point boundary value problem are established by using a new fixed point theorem obtained in [5]. An example is presented to illustrate the main result. It is the purpose of this paper to show that the approach to get positive solutions of BVPs by using multifixed-point theorems can be extended to treat nonhomogeneous BVPs. The emphasis is put on the nonlinear term f involved with the first order delta operator ${\Delta}$x(n).

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.2
• /
• pp.57-63
• /
• 2012

Software release planning model of software product lines was formulated as a precedence-constrained multiple 0-1 knapsack problem. The purpose of the model was to maximize the total profit of an entire set of selected features in a software product line over a multi-release planning horizon. The solution approach is a dynamic programming procedure. Feasible solutions at each stage in dynamic programming are determined by using backward dynamic programming approach while dynamic programming for multi-release planning is forward approach. The pre-processing procedure with a heuristic and reduction algorithm was applied to the single-release problems corresponding to each stage in multi-release dynamic programming in order to reduce the problem size. The heuristic algorithm is used to find a lower bound to the problem. The reduction method makes use of the lower bound to fix a number of variables at either 0 or 1. Then the reduced problem can be solved easily by the dynamic programming approaches. These procedures keep on going until release t = T. A numerical example was developed to show how well the solution procedures in this research works on it. Future work in this area could include the development of a heuristic to obtain lower bounds closer to the optimal solution to the model in this article, as well as computational test of the heuristic algorithm and the exact solution approach developed in this paper. Also, more constraints reflecting the characteristics of software product lines may be added to the model. For instance, other resources such as multiple teams, each developing one product or a platform in a software product line could be added to the model.

• Korean Journal of Mathematics
• /
• v.23 no.4
• /
• pp.665-732
• /
• 2015

Existence results for multiple positive solutions of two classes of boundary value problems for bilateral difference systems are established by using a fixed point theorem under convenient assumptions. It is the purpose of this paper to show that the approach to get positive solutions of boundary value problems of finite difference equations by using multi-fixed-point theorems can be extended to treat the bilateral difference systems with one-dimensional Laplacians. As an application, the sufficient conditions are established for finding multiple positive homoclinic solutions of a bilateral difference system. The methods used in this paper may be useful for numerical simulation. An example is presented to illustrate the main theorems. Further studies are proposed at the end of the paper.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.744-748
• /
• 2003

Developing an interactive satellite multi­media system, such as a digital video broadcasting (DVB) return channel via satellite (RCS) system, is gaining popularity over the world To accommodate the increasing traffic demand we are motivated to investigate an alternative for improving return channel utilization We develop an efficient method for optimal packet scheduling in an interactive satellite multimedia system using hybrid CDMA/TDMA channels. We formulate the timeslot-code assignment problem as a binary integer programming (BIP) problem, where the throughput maximization is the objective, and decompose this BIP problem into two sub-problems for the purpose of solution efficiency. With this decomposition, we promote the computational efficiency in finding the optimal solution of the original BIP problem Since 2001, ETRI has been involved in a development project where we have successfully completed an initial system integration test on broadband mobile Internet access via Ku-band channels using the proposed resource allocation algorithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.2
• /
• pp.15-31
• /
• 2002

This research suggests an interactive methodology for multiple objective linear programming problems to help the group select a compromising solution in the World Wide Web environment. Our methodology lessens the burden of group decision makers, which is one of necessary conditions of the web environment. Only the partial weak order of variables and objectives from the group decision makers are enough for searching the best compromising solution. For such a purpose, we expand the Dror and Gass algorithm to the group decision context. And we suggest the system architecture of a web-based GDSS for the Implementation of our methodology.

• Journal of Communications and Networks
• /
• v.14 no.6
• /
• pp.710-718
• /
• 2012

The implementation of a common control channel is one of the most challenging issues in cognitive radio networks, since a fully reliable control channel cannot be created without reserving bandwidth specifically for this purpose. In this paper, we investigate a promising solution that exploits the ultra wide band (UWB) technology to let cognitive radio nodes discover each other and exchange control information for establishing a communication link. The contribution of this paper is threefold: (i) We define the communication protocol needed to let cognitive radio nodes discover each other and exchange control information for link set up, (ii) we overcome the gap in coverage, which typically exists between UWB and long-medium range technologies, by using multi-hop communication, (iii) we evaluate the performance of our approach by adopting an accurate channel model and show its benefits with respect to an in-band signaling solution.