• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.457-464
• /
• 2005

This paper describes an Adaptive Context-aware Service (ACS) using Model Driven Architecture (MDA)-based Service Creation Environment (SCE) on PARLAY X based service delivery platform in ubiquitous computing environments. It can be expected that both the context-awareness and adaptation in ubiquitous computing environments will be deployed. But the existing context-aware middleware lacks in considering adaptation. Therefore, the object of this paper is to support the architecture and the Application Programming Interface (API) of the network service for both the context-awareness and adaptation in ubiquitous computing environment. ACS is to provide users with the adaptive network service to the changing context constraints as well as detecting the changing context. For instance, ACS can provide users with QoS in network according to the detected context, after detecting the context such as location and speed. The architecture of ACS is comprised of a Service Creation Environment (SCE), Adaptive Context Broker and PARLAY gateway. SCE is to use Context-based Constraint Language (CCL) for an expression of context-awareness and adaptation. Adaptive Context Broker is to make a role of the broker between SCE and PARLAY G/W. PARLAY G/W is to support API for PARLAY X-based service delivery platform.

• Journal of Korea Water Resources Association
• /
• v.36 no.1
• /
• pp.45-59
• /
• 2003

The method in this study, which is more efficiency than the existing method, propose the optimal rehabilitation model based on the deterioration prediction of the laying pipe by using the deterioration survey method of the water distribution system. The deterioration prediction model divides the deterioration degree of each pipe into 5 degree by using the probabilistic neural network. Also, the optimal residual durability is estimated by the calculated deterioration degree in each pipe and pipe diameter. The optimal rehabilitation model by integer programming base on the shortest path can calculate a time and cost of maintenance, rehabilitation, and replacement. Also, the model is divided into budget constraint and no budget constraint. Consequently, the model proposed by the study can be utilized as the quantitative method for the management of the water distribution system.

• Structural Engineering and Mechanics
• /
• v.56 no.5
• /
• pp.707-726
• /
• 2015

There is a growing trend of considering uncertainty in optimization process since last few decades. In this regard, Robust Design Optimization (RDO) scheme has gained increasing momentum because of its virtue of improving performance of structure by minimizing the variation of performance and ensuring necessary safety and feasibility of constraint under uncertainty. In the present study, RDO of reinforced concrete folded plate and shell structure has been carried out incorporating uncertainty in the relevant parameters by Monte Carlo Simulation. Folded plate and shell structures are among the new generation popular structures often used in aesthetically appealing constructions. However, RDO study of such important structures is observed to be scarce. The optimization problem is formulated as cost minimization problem subjected to the force and displacements constraints considering dead, live and wind load. Then, the RDO is framed by simultaneously optimizing the expected value and the variation of the performance function using weighted sum approach. The robustness in constraint is ensured by adding suitable penalty term and through a target reliability index. The RDO problem is solved by Sequential Quadratic Programming. Subsequently, the results of the RDO are compared with conventional deterministic design approach. The parametric study implies that robust designs can be achieved by sacrificing only small increment in initial cost, but at the same time, considerable quality and guarantee of the structural behaviour can be ensured by the RDO solutions.

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

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.13 no.2
• /
• pp.73-84
• /
• 1993

In this research, configuration design optimization of plane truss structure has been tested by using decomposition technique. In the first level, the problem of transferring the nonlinear programming problem to linear programming problem has been effectively solved and the number of the structural analysis necessary for doing the sensitivity analysis can be decreased by developing stress constraint into member stress approximation according to the design space approach which has been proved to be efficient to the sensitivity analysis. And the weight function has been adopted as cost function in order to minimize structures. For the design constraint, allowable stress, buckling stress, displacement constraint under multi-condition and upper and lower constraints of the design variable are considered. In the second level, the nodal point coordinates of the truss structure are used as coordinating variable and the objective function has been taken as the weight function. By treating the nodal point coordinates as design variable, unconstrained optimal design problems are easy to solve. The decomposition method which optimize the section areas in the first level and optimize configuration variables in the second level was applied to the plane truss structures. The numerical comparisons with results which are obtained from numerical test for several truss structures with various shapes and any design criteria show that convergence rate is very fast regardless of constraint types and configuration of truss structures. And the optimal configuration of the truss structures obtained in this study is almost the identical one from other results. The total weight couldbe decreased by 5.4% - 15.4% when optimal configuration was accomplished, though there is some difference.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.1
• /
• pp.98-104
• /
• 2016

With the development of modern science and technology, weapon systems such as tanks, submarines, combat planes, radar are also dramatically advanced. Among these weapon systems, the ballistic missile, one of the asymmetric forces, could be considered as a very economical means to attack the core facilities of the other country in order to achieve the strategic goals of the country during the war. Because of the current ballistic missile threat from the North Korea, establishing a missile defense (MD) system becomes one of the major national defense issues. This study focused on the optimization of air defense artillery units' deployment for effective ballistic missile defense. To optimize the deployment of the units, firstly this study examined the possibility of defense, according to the presence of orbital coordinates of ballistic missiles in the limited defense range of air defense artillery units. This constraint on the defense range is originated from the characteristics of anti-ballistic missiles (ABMs) such as PATRIOT. Secondly, this study proposed the optimized mathematical model considering the total covering problem of binary integer programming, as an optimal deployment of air defense artillery units for defending every core defense facility with the least number of such units. Finally, numerical experiments were conducted to show how the suggested approach works. Assuming the current state of the Korean peninsula, the study arbitrarily set ballistic missile bases of the North Korea and core defense facilities of the South Korea. Under these conditions, numerical experiments were executed by utilizing MATLAB R2010a of the MathWorks, Inc.

• Journal of the Society of Naval Architects of Korea
• /
• v.57 no.1
• /
• pp.45-51
• /
• 2020

In this study, we developed an allocation optimization system for supply chain management in the shipbuilding and offshore construction industry. Supply chain operation is a way of operating manufacturing company responsible for the procurement of outfitting parts. The method about how to allocate the manufacturing volume to each partner company includes important decisions. According to the allocation method, the stability of the material supplied to the final installation process is guaranteed. We improved the allocation method that was previously decided by the person in charge. Based on the optimization engine, a system is developed that can automatically allocate the production volume. For optimization model configuration, factors affecting the volume allocation were analyzed and modeled as constraint factors. A target function is defined to minimize the difference in the load variance of each partner company. In order to use the same type of volume allocation engine for various outfitting products, the amount of work done by the partner company was standardized. We developed an engine that can allocate the same production load of each production partner. Using this engine, the operating system was developed and applied to the actual offshore project. It has been confirmed that the work load variance of suppliers can be maintained uniformly using the optimization engine rather than manual method. By this system, we stabilize the manufacturing process of partner suppliers.

• Proceedings of the KSR Conference
• /
• 2007.11a
• /
• pp.1731-1737
• /
• 2007

This paper considers subway routing problem. Given a schedule of train to be routed by a railway stock, the routing problem determines a sequence of trains while satisfying turnaround time and maintenance restrictions. Generally, the solution of routing problem is generated from set partition formulation solved by column generation method, a typical integer programming approach for train-set. However, we find the characteristics of metropolitan subway which has a simple rail network, a few end stations and 13 departure-arrival patterns. We reflect a turn-around constraint due to spatial limitations has no existence in conventional railroad. Our objective is to minimize the number of daily train-sets. In this paper, we develop two basic techniques that solve the subway routing problem in a reasonable time. In first stage, we formulate the routing problem as a Min-cost-flow problem. Then, in the second stage, we attempt to normalize the distance covered to each routes and reduce the travel distance using our heuristic approach. Applied to the current daily timetable, we could find the subway routings, which is an approximately 14% improvement on the number of train-sets reducing 15% of maximum traveling distance and 8% of the standard deviation.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.426-436
• /
• 2000

Given a linear arrangement of n base stations which generate multiple types of traffic among themselves, we consider the problem of finding a set of disjoint clusters to cover n base statons so that a cluster is assigned a location server. Our goal is to minimize the total communication cost for the entire network where the cost of intra-cluster communication is usually lower than that of intercluster communication for each type of traffic. The optimization problem is transformed into an equivavalent problem using the concept of relative cost, which generates the difference of communication costs between intracluster and intercluster communications. Using the relative cost matrix, an efficient algorithm of O($mm^2$), where m is the number of clusters in a partition, is designed by dynamic programming. The algorithm also finds all thevalid partitions in the same polynomial time, given the size constraint on a cluster, and the total allowable communication cost for the entire network.

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