• Korean Management Science Review
• /
• v.15 no.2
• /
• pp.201-210
• /
• 1998

Truck dispatching is one of the most commonly occurring problems of transprot management. We developed an interactive decision support system named IDSSTD, for the truck dispatching problem where two conflicting objectives are treated and travel speed varies depending on the passing areas and time of day. The IDSSTD aids the decision-making process by allowing the user to interact directly with the database, to direct data to a decision model, and to portray results in a convenient form. The IDSSTD is consisted of two major interactive phases. The pre-scheduling interactive phase is to reduce the complexity of a given problem before applying the BC-saving heuristic algorithm and the post-scheduling interactive phase is to improve practically the algorithmic solution. The IDSSTD has the capabilities of its own manipulation(analysis and recommendation) and diverse graphic features in order to facilitate a user's interaction.

• Korean Management Science Review
• /
• v.11 no.3
• /
• pp.87-102
• /
• 1994

Conceptual database design is an important activity because the performance of a DBMS heavily depends on the proper design of the database, and view integration is one of the most important phases of conceptual database design. During this phase, the individual views designed by separate user groups are integrated into a global view for the entire system. After the view integration, a database schema must be validated before it becomes a stable product of the design. In this paper, a methodology for view integration an validation is suggested. The individual views are modeled by entity-relationship model. The entities are integrated according to their name and domain information. After that, the relationships are merged by their constraints. We also present a methodology for checking redundant relationships which has an algorithmic description.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.3
• /
• pp.139-149
• /
• 1994

In many project-oriented production systems, e. g., shipyards or large-scale steel products manufacturing, resource loading by an activity is flexible, and the activity duration is a function of resource allocation. For example, if one doubles the size of the crew assigned to perform an activity, it may be feasible to complete the activity in half the duration. Such flexibility has been modeled by Weglarz [13] and by Leachman, Dincerler, and Kim [7[ in extended formulations of the resource-constrained poject scheduling problem. This paper presents a new algorithmic approach to the problem that combines the ideas proposed by the aforementioned authors. The method we propose involves a two-step approach : (1) solve the resource-constrained scheduling problem using a heuristic, and (2) using this schedule as an initial feasible solution, find improved resource allocations by solving a linear programming model. We provide computational results indicating the superiority of this approach to previous methodology for the resource-constrained scheduling problem. Extensions to the model to admit overlap relationship of the activities also are presented.

• Journal of Ocean Engineering and Technology
• /
• v.26 no.4
• /
• pp.8-14
• /
• 2012

Two dimensional nesting is a common problem in industries such as the shipbuilding, automotive, clothing, shoe-making, and furniture industries, in which various parts are cut off from stock or packed in a flat space while minimizing waste or unoccupied space. Nesting is known as an NP-complete problem, which has a solution time proportional to the superpolynomial of the input size. It becomes practically impossible to find an optimal solution using algorithmic methods as the number of shapes to nest increases. Therefore, heuristic methods are commonly used to solve nesting problems. This paper presents an expert system that uses a heuristic search method based on an evaluation function for nesting problems, in which parts and stock are represented by pixels. The system is developed in CLIPS, an expert system shell, and is applied to four different kinds of example problems to verify its applicability in practical problems.

• IE interfaces
• /
• v.13 no.3
• /
• pp.320-327
• /
• 2000

In this research report, we consider multi stage supply chain optimization modeling techniques, and propose a new integrated model. The stages that are normally associated with a supply chain include procurement, production and distribution. In general, there are two distinct set of approaches which manage whole supply chain. One approach is the plant decision and subsequently distribution and inventory decision while the second approach is to address all decisions simultaneously through the integrated model. First, we present a survey of existing models that are treated by independently. And then, we propose an integrated model that is in a moderate size and easy to implement in practice. Finally, we address possible solution methodologies and present some computational test results using CPLEX to see the computational burden from which new algorithmic insight might be come up.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.3
• /
• pp.139-154
• /
• 1993

Cutter Interference(or part surface gouging) is one of the most critical problems in NC machining of sculptured surfaces. Presented in this paper is and algorithmic procedure that converts CC data obtained from a compound surface(several surfaces without topological relationship) into interference-free CL data. The interference handling procedure consists of following steps: (1) Z-map model is constructed from input surfaces. (2) Interference sources are detected using local properties of the sources. (3) Interference regions are completely identified based on global tests for neighboring CC points of the interference sources (4) Cutter paths are reconstructed after removing the CC data in interference regions, while avoiding any new interferences.

• Journal of Korea Multimedia Society
• /
• v.23 no.6
• /
• pp.756-764
• /
• 2020

A typical algorithm used for image analysis is the Convolutional Neural Network(CNN). R-CNN, Fast R-CNN, Faster R-CNN, etc. have been studied to improve the performance of the CNN, but they essentially require large amounts of data and high algorithmic complexity., making them inappropriate for small and medium-sized services. Therefore, in this paper, the image label prediction algorithm based on CNN with collaborative layer with low complexity, high accuracy, and small amount of data was proposed. The proposed algorithm was designed to replace the part of the neural network that is performed to predict the final label in the existing deep learning algorithm by implementing collaborative filtering as a layer. It is expected that the proposed algorithm can contribute greatly to small and medium-sized content services that is unsuitable to apply the existing deep learning algorithm with high complexity and high server cost.

• Journal of information and communication convergence engineering
• /
• v.9 no.5
• /
• pp.607-609
• /
• 2011

In this work, we present solutions of two problems. First, the representation of pattern recognition problem in the standard $T_{nml}$ table of the algorithm estimate calculation was considered. Second, the problem of finding the model, consisting of the optimal parameters of an algorithm was considered. Such procedure is carried out by the selection optimal values of the parameters of extreme algorithms. This serves to reduce the number of calculations in the algorithms of estimate calculation and to increase the quality of recognition process. The algorithmic data base of the developed system was based on mathematical apparatus of pattern recognition.

• Childhood Kidney Diseases
• /
• v.21 no.2
• /
• pp.53-60
• /
• 2017

Proteinuria is common in pediatric and adolescent patients. Proteinuria is defined as urinary protein excretion at levels higher than $100-150mg/m^2/day$ in children. It can be indicative of normal or benign conditions as well as numerous types of severe underlying renal or systemic disease. The school urine screening program has been conducted in Korea since 1998. Since then, numerous patients with normal or benign proteinuria as well as early stage renal diseases have been referred to the hospital. Benign proteinuria includes orthostatic proteinuria and transient proteinuria. Most causes of proteinuria can be categorized into 3 types: 1) overflow, 2) tubular, and 3) glomerular. Although treatment should be directed at the underlying cause of the proteinuria, prompt evaluation, diagnosis, and long-term monitoring of these pediatric patients can prevent potential progression of the underlying disease process. This article provides an overview of proteinuria: its causes, methods of assessment, and algorithmic suggestions to differentiate benign from pathologic renal disease.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.100-103
• /
• 1996

Presented in this study is an algorithmic procedure to obtain polyhedral model from a compound surface. The compound surface in this study denotes a collection of trimmed surfaces without topological relations. The procedure consists of two main modules: CAD data interface, and surface conversion to polyhedral model. The interface module gets geometric information from CAD databases, and makes topological information by scanning the geometric information. We are investigating CATIA system as a data source system. In the surface conversion module, a shell(compound surface with topological information) is approximated to a triangular-faceted polyhedral surface model through node sampling and triangulation steps. The obtained polyhedral model should obey the vertex-to-vertex rule and meet tolerance requirements. Since the polyhedral model has a simple data structure and geometry processing for it is very efficient and robust, the polyhedral model can be used in various applications, such as surface rendering in computer graphics, FEM model for engineering analysis, CAPP for surface machining, data generation for SLA, and NC tool path generation.