• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2001년도 추계학술대회 논문집
• /
• pp.203-206
• /
• 2001

Finding the optimal solution in the river water quality management system is very hard with the non-linearity of the water quality model. Many suggested methods for that using the linear programming, non-linear programming and dynamic programming, are failed to give an optimal solution of sufficient accuracy and satisfaction. We studied a method to find a solution optimizing the river water quality management in the aspect of the efficiency and the cost of the waste water treatment facilities satisfying the water Quality goals. In the suggested method, we use the QUAL2E water quality model and the genetic algorithm. A brief result of the project to optimize the water quality management in the Youngsan river is presented.

• 품질경영학회지
• /
• 제21권2호
• /
• pp.194-214
• /
• 1993

This paper purports to study on interactive fuzzy goal programming model which leads to the compromise solution which the decision maker satisfies through the interactive approach. We also attempted to calculate local proxy preference function from utility function of sum-of-logarithms in connection with marginal rate of substitution and interactive approach for the purpose of applying weight of multiobjective function. In an attempt to grasp compromise solution from fuzzy efficient solution, we decided to take the interactive method and presented stopping rule for this.

• Journal of applied mathematics & informatics
• /
• 제13권1_2호
• /
• pp.323-334
• /
• 2003

This paper presents a goal-programming (GP) model for management decision-making for sugarcane fertilizer mix problems. Sensitivity analysis on the priority structure of the goals has been performed to obtain all possible solutions. The study uses Euclidean distance function to measure distances of all possible solutions from the ideal solution. The optimum solution is determined from the minimum distance between the ideal solution and other possible solutions of the problem. The optimum solution corresponds to the appropriate priority structure of the problem in the decision-making context. furthermore, the results obtained from sensitivity analysis on the cost of combination of fertilizers confirm the priority structure.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2008년도 추계학술대회 및 정기총회
• /
• pp.236-246
• /
• 2008

We consider the Inventory Routing problem(IRP) for the vending machine operating system. An artificial immune system(AIS) is introduced to solve the IRP. The IPR is an rolling wave planning. The previous solution of IRP is one of good initial solution of current IRP. We introduce an Artificial Immune system with memory cell (AISM) which store previous solution in memory cell and use an initial solution for current problem. Experiment results shows that AISM reduced calculations time in relatively less demand uncertainty.

• 한국경영과학회지
• /
• 제21권1호
• /
• pp.147-161
• /
• 1996

Generally the Multiprocessor Scheduling (MPS) problem is difficult to solve because of the precedence of the tasks, and it takes a lot of time to obtain its optimal solution. Though Genetic Algorithm (GA) does not guarantee the optimal solution, it is practical and effective to solve the MPS problem in a reasonable time. The algorithm developed in this research consists of a improved GA and GP/MISF (Critical Path/Most Immediate Successors First). An efficient genetic operator is derived to make GA more efficient. It runs parallel CP/MISF with GA to complement the faults of GA. The solution by the developed algorithm is compared with that of CP/MISF, and the better is taken as a final solution. As a result of comparative analysis by using numerical examples, although this algorithm does not guarantee the optimal solution, it can obtain an approximate solution that is much closer to the optimal solution than the existing GA's.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1995년도 추계학술대회발표논문집; 서울대학교, 서울; 30 Sep. 1995
• /
• pp.220-229
• /
• 1995

Generally the Multiprocessor Scheduling(MPS) problem is difficult to solve because of the precedence of the tasks, and it takes a lot of time to obtain its optimal solution. Though Genetic Algorithm(GA) does not guarantee the optimal solution, it is practical and effective to solve the MPS problem in a reasonable time. The algorithm developed in this research consists of a improved GA and CP/MISF(Critical Path/Most Immediate Successors First). A new genetic operator is derived to make GA more efficient. It runs parallel CP/MISF with Ga to complement the faults of GA. The solution by the developed algorithm is compared with that of CP/MISF, and the better is taken as a final solution. As a result of comparative analysis by using numerical examples, although this algorithm does not guarantee the optimal solution, it can obtain an approximate solution that is much closer to the optimal solution than the existing GA's.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.24-29
• /
• 1996

If the LP problem doesn't have the optimal soultion uniquely, the solution fo the primal-dual barrier method converges to the interior point of the optimal face. Therefore, when the optimal vertex solution or the optimal basis is required, we have to perform the additional procedure to recover the optimal basis from the final solution of the interior point method. In this paper the exisiting methods for recovering the optimal basis or identifying the optimal solutions are analyzed and the new methods are suggested. This paper treats the two optimal basis recovery methods. One uses the purification scheme and the simplex method, the other uses the optimal face solutions. In the method using the purification procedure and the simplex method, the basic feasible solution is obtained from the given interior solution and then simplex method is performed for recovering the optimal basis. In the method using the optimal face solutions, the optimal basis in the primal-dual barrier method is constructed by intergrating the optimal solution identification technique and the optimal basis extracting method from the primal-optimal soltion and the dual-optimal solution.

• 한국중재학회지:중재연구
• /
• 제9권1호
• /
• pp.291-322
• /
• 1999

The world of today faces a radical change, a new revolution, by the spread of the Internet. It is used not only for advertising but also for the exclusive rights in the field of information and communication, in add to the way of developing everyday our lives with world news, home-shopping, on-line education and so on. Actually, since the Internet Domain's Name(IDN) is unique over the world, the individual and the companies which provide information through the Internet have a keen competition to make a good IDN to memorize and organize all available information provided them. As a result, there are an increasing number of the cases where one company files suit against another for the validity of it's IDN so the policy to arbitrate and solute the cases is required. This paper is going to introduce the structure and the system of management for IDN. It will also discuss the efficient management of IDN, various case analysis of the dispute restraint and solutions, and the movement of improving the management procedure of IDN in WIPO. So we suggest to examine common disputes among IDN uses and solution methods for future problem at EC times. Therefore we have to establish the dispute solution system. Here are the two methods : one is that to establish a dispute solution organization. This organization which can conduct the new dispute solution procedure differs from the existing legislation system. The other is that to establish a dispute solution procedure i.e. the various dispute solution procedure for efficient dispute solution : council, inspection, mediation and arbitration. This procedure is conducted on-line due to features of the IDN disputes, also along with the current legislation system and the International dispute solution procedure. Because there is possibility the IDN disputes usually are connected with other countries. As there is no specific disputes solution procedure so far, we have to wait while development occurs that also striving to be coherent with and between the domestic and International solution procedure by helping to establish the International dispute solution procedure.

• International Journal of Computer Science & Network Security
• /
• 제21권7호
• /
• pp.331-340
• /
• 2021

The Internet of Things (IoT) is a rapidly growing physical network that depends on objects, vehicles, sensors, and smart devices. IoT has recently become an important research topic as it autonomously acquires, integrates, communicates, and shares data directly across each other. The centralized architecture of IoT makes it complex to concurrently access control them and presents a new set of technological limitations when trying to manage them globally. This paper proposes a new decentralized access control architecture to manage IoT devices using blockchain, that proposes a solution to concurrency management problems and enhances resource locking to reduce the transaction conflict and avoids deadlock problems. In addition, the proposed algorithm improves performance using a fully distributed access control system for IoT based on blockchain technology. Finally, a performance comparison is provided between the proposed solution and the existing access management solutions in IoT. Deadlock detection is evaluated with the latency of requesting in order to examine various configurations of our solution for increasing scalability. The main goal of the proposed solution is concurrency problem avoidance in decentralized access control management for IoT devices.

• 생물환경조절학회지
• /
• 제1권1호
• /
• pp.52-60
• /
• 1992

The optimum management of nutrient solution needs the effective combination of fertilizers as well as the accurate control of nutrient solution. This study was attempt to make a supporting system for effective fertilizer combination by using computer and also to develop a EC predicting equation for keeping the EC of solution within the allowable range after application of combined fertilizers. The supporting system consists of three parts : (1) data bases, (2) rules for deciding the kinds and amounts of fertilizers and (3) main control. With input data, the main control automatically constructs the network connecting the related data bases and subsequently executes the operation of searching proper fertilizers through it. For more effective searching, fertilizers are classified into two levels(level 1 and level 2) in consideration of solubility, price, and frequency in use, and searched in that order. The EC prediction equation, a extended form of the Robinson and Stroke's theoretical equation only available for a binary electrolyte, is suggested for predicting the EC of the nutrient solution containing many kinds of inorganic compounds. The comparison of predicted and measured ECs showed good agreements with the high correlation between the predicted EC decrement by ion interaction and the actual one(limiting EC minus measured EC).