• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1145-1148
• /
• 2003

We show the mixed finite element method which induces solutions that has the same order of errors for both the gradient of the solution and the solution itself. The technique to construct an efficient reusable matrix is suggested. Two families of mixed finite element methods are introduced with an automatic generating technique for matrix with my order of basis. The generated matrix by this technique has more accurate values and is a sparse matrix. This new technique is applied to solve a minimal surface problem.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.12 no.1
• /
• pp.596-604
• /
• 2020

Previous studies on pipe auto-routing algorithms generally used such algorithms as A*, Dijkstra, Genetic Algorithm, Particle Swarm Optimization, and Ant Colony Optimization, to satisfy the relevant constraints of its own field and improve the output quality. On the other hand, this study aimed to significantly improve path-finding speed by applying the Jump Point Search (JPS) algorithm, which requires lower search cost than the abovementioned algorithms, for pipe routing. The existing JPS, however, is limited to two-dimensional spaces and can only find the shortest path. Thus, it requires several improvements to be applied to pipe routing. Pipe routing is performed in a three-dimensional space, and the path of piping must be parallel to the axis to minimize its interference with other facilities. In addition, the number of elbows must be reduced to the maximum from an economic perspective, and preferred spaces in the path must also be included. The existing JPS was improved for the pipe routing problem such that it can consider the above-mentioned problem. The fast path-finding speed of the proposed algorithm was verified by comparing it with the conventional A* algorithm in terms of resolution.

• Journal of the Korean Society of Safety
• /
• v.10 no.3
• /
• pp.96-105
• /
• 1995

The better industry develops, the more spaces need but in the limited area. Most building become larger and more complicated if the more spaces need in the constant area. And this leads to do underground work in long period generally six(6) months for 6 basement stories due to the selection of TOP DOWN technique. Working environment in this underground area can be problems and should not be overlooked, because air quality in underground spaces become quickly worse. Recently, department name to control construction safety has been changed to ENVIRONMENT & SAFETY TEAM from SAFETY TEAM. This means that it is very important to control against environmental condition at site so much. Overall construction work as well as underground work should conform to the requirement of working environment, particularly against inhabitants around the construction area. Strut protection, one of earth protection method, in case to 40m long strut may become weaker due to thermal stress or its longitudinally compressive strain and the another one, earth anchor protection may not be applied to the site In case of encroaching on vertical underground borderline because of regulation to prohibit it. It is necessary that TOP DOWN technique should be introduced in order to solve the external and internal problem of the site such as difficulty level of the work, potential danger with excavating depth, and shortening workperiod. It is needed that improving way of working condition should be shown and simplified computer simulation program should be also provided for checking pollution level & ventilation, excluding of lighting problem here. Results measured with conformance to the Regulation for Working Environment Measurement, enforced by Ministry of Labor have been applied to the computer program developed here. Sample air taken at unit workplace which was considered as exposing condition of pollutant at breathing point and within a range of behavior of the workers, Identified exposing group in underground work, using Moded Flow Life Finally, three types of ventilation system, type I with blower & ventilator, type II natural supply with mechanical ventilation system, and type I mechanical ventilation with Drivent Fan Unit System are selected for this study.

• Korean Journal of Mathematics
• /
• v.24 no.2
• /
• pp.199-213
• /
• 2016

The resolvent operator approach of [2] is applied to solve a set-valued variational inclusion problem in ordered Hilbert spaces. The resolvent operator under consideration is called relaxed resolvent operator and we demonstrate some of its properties. To obtain the solution of a set-valued variational inclusion problem, an iterative algorithm is developed and weak-RRD set-valued mapping is used. The problem as well as main result of this paper are more general than many previous problems and results available in the literature.

• Journal of the Korean Society of Industry Convergence
• /
• v.16 no.2
• /
• pp.53-59
• /
• 2013

The purpose of this study is recognized the problems of parking and parking demand, supply and operation of the control etc. It is to provide an alternative for the overall parking problem. Parking problem occurs because there is not enough parking spaces. In order to solve the parking problem of Chil-gok 1 residential development district, this study propose making use of a road parking lot establishment and the school playground and the public facilities construction parking lot. But it is the methods which are short-term. A fundamental solution method is Levying garage option on car buyers. It is system to apply a law for establishing garages to all of vehicles.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.62
• /
• pp.21-32
• /
• 2001

The two-dimensional guillotine cutting problem is to maximize sum of piece profits that cut from one stock rectangle and widely applied in the industry. The branch-and-bound method for this problem uses complementarily several upper bounds(the Gilmore and Gomoryp[8]'s two-dimensional knapsack function and the Hifi and Zissimopoulos[10]'s method using one-dimensional knapsack problem, etc) to reduce the number of searched nodes. These upper bounds has a shortcoming that does not consider the bound and layout of pieces simultaneously. In this paper, we propose an efficient upper bound which can complement the shortcoming of existing upper bounds. The proposed upper bound needs less memory spaces and computing time. Computational results show that the proposed upper bound significantly contribute to reduce the computational amount of time and number of searched nodes in tree.

• Knowledge Management Research
• /
• v.6 no.2
• /
• pp.149-168
• /
• 2005

Owing to the limits of IT System-driven knowledge management(KM) for innovation processes, alternative KM methods has been suggested such as: (1) the knowledge network of experts or (2) communities-of-practice. This study analyzes two cases in terms of on-line expert knowledge networks for problem-solving, with the dimensions of analysis based on a theoretical framework. By analyzing the cases of S company's expert network and Naver's Ji-sik-iN, we found that system quality(e.g., ease of use, accessibility, and searching function), information/knowledge quality(e.g., usefulness, accuracy, and timeliness), knowledge-sharing culture, social capital and relevant reward systems are important for stimulating a Q&A-based problem-solving knowledge network. Implications of the findings and future research directions are discussed.

• Journal of the Chungcheong Mathematical Society
• /
• v.24 no.2
• /
• pp.163-169
• /
• 2011

Recently, Kazmi and Khan [7] introduced a kind of equilibrium problem called generalized system (GS) with a single-valued bi-operator F. In this note, we aim at an extension of (GS) due to Kazmi and Khan [7] into a multi-valued circumstance. We consider a fairly general problem called the multi-valued quasi-generalized system (in short, MQGS). Based on the existence of 1-person game by Ding, Kim and Tan [5], we give a generalization of (GS) in the name of (MQGS) within the framework of Hausdorff topological vector spaces. As an application, we derive an existence result of the generalized vector quasi-variational inequality problem. This result leads to a multi-valued vector quasi-variational inequality extension of the strong vector variational inequality (SVVI) due to Fang and Huang [6] in a general Hausdorff topological vector space.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.1
• /
• pp.149-167
• /
• 2022

In this paper, we propose a viscosity iterative algorithm for approximating a common solution of finite family of variational inequality problem and fixed point problem for finite family of multi-valued type-one demicontractive mappings in real Hilbert spaces. A strong convergence result of the aforementioned problems were proved and some consequences of our result was also displayed. In addition, we discuss an application of our main result to convex minimization problem. The result presented in this article complements and extends many recent results in literature.

• Journal of Korea Multimedia Society
• /
• v.11 no.5
• /
• pp.610-622
• /
• 2008

Moving object segmentation is an essential technique for various video surveillance applications. The result of moving object segmentation often contains shadow regions caused by the color difference of shadow pixels. Hence, moving object segmentation is usually followed by a shadow elimination process to remove the false detection results. The common assumption adopted in previous works is that, under the illumination variation, the value of chromaticity components are preserved while the value of intensity component is changed. Hence, color transforms which separates luminance component and chromaticity component are usually utilized to remove shadow pixels. In this paper, various color spaces (YCbCr, HSI, normalized rgb, Yxy, Lab, c1c2c3) are examined to find the most appropriate color space for shadow elimination. So far, there have been some research efforts to compare the influence of various color spaces for shadow elimination. However, previous efforts are somewhat insufficient to compare the color distortions under illumination change in diverse color spaces, since they used a specific shadow elimination scheme or different thresholds for different color spaces. In this paper, to relieve the limitations of previous works, (1) the amount of gradients in shadow boundaries drawn to uniform colored regions are examined only for chromaticity components to compare the color distortion under illumination change and (2) the accuracy of background subtraction are analyzed via RoC curves to compare different color spaces without the problem of threshold level selection. Through experiments on real video sequences, YCbCr and normalized rgb color spaces showed good results for shadow elimination among various color spaces used for the experiments.