• The Journal of Advanced Prosthodontics
• /
• v.3 no.3
• /
• pp.172-176
• /
• 2011

Surgical resection of the mandible due to presence of benign or malignant tumor is the most common cause of the mandibular deviation. Depending upon the location and extent of the tumor in the mandible, various surgical treatment modalities like marginal, segmental, hemi, subtotal, or total mandibulectomy can be performed. The clinicians must wait for extensive period of time for completion of healing and acceptance of the osseous graft before considering the definitive prosthesis. During this initial healing period prosthodontic intervention is required for preventing the mandibular deviation. This case report describes early prosthodontic management of a patient who has undergone a reconstructed hemi-mandibulectomy with modified mandibular guide flange prosthesis. The prosthesis helps patient moving the mandible normally without deviation during functions like speech and mastication.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.4 no.1
• /
• pp.51-67
• /
• 1979

This paper considers the problem of determining an optimal dynamic operating policy for a two-stage tandem queueing service system in which the service facilities (or stages) can be operated at more than one service rate. At each period of the system's operation, the system manager must specify which of the available service rates is to be employed at each stage. The cost structure includes an operating cost for running each stage and a service facility profit earned when a service completion occurs at Stage 2. We assume that the system has a finite waiting capacity in front of each station and each customer requires two services which must be done in sequence, that is, customers must pass through Stage 1 and Stage 2 in that order. Processing must be in the order of arrival at each station. The objective is to minimize the total discounted expected cost in a two-stage tandem queueing service system, which we formulate as a Discrete-Time Markov Decision Process. We present analytical and numerical results that specify the form of the optimal dynamic operating policy for a two-stage tandem queueing service system.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1998.06a
• /
• pp.33-40
• /
• 1998

In recent domestic automotive industry, applications of computer simulation to the manufacturing of stamping dies for inner and outer body panels which greatly affect durability and aesthetic quality of automobiles, have been increased. Enhancement of die quality, and reduction of total die manufacturing time and consequently manufacturing cost are the visible outcome. However, to successfully apply the result of simulation by a commercial package to the die manufacturing, development of an optimal die manufacturing process is required upon the completion of analysis of forte and shortcomings of available sheet metal forming softwares in the market. Based on the results of numerical analysis of front door outer panel forming, this paper evaluates the applicability of simulation results to the real die making for automotive body panels. Also, it attempts to select an optimal die manufacturing process including design, machining and tryout. Lastly, it discusses the expected effects by adopting the selected process in a real stamping die manufacturing facility.

• Journal of the Korea Society of Computer and Information
• /
• v.29 no.3
• /
• pp.99-106
• /
• 2024

In this paper, we design and implement the HealthSchedule app, which records exercise data based on the GPS sensor embedded in smartphones. This app utilizes the smartphone's GPS sensor to collect real-time location information of the user and displays the movement path to the designated destination. It records the user's actual path using latitude and longitude coordinates. Users register exercise activities and destination points when scheduling, and initiate the exercise. When measuring the current location, a lime green departure marker is generated, and the movement path is displayed in blue, with the destination marker and a surrounding 25-meter radius circle shown in sky blue. Using the coordinates of the starting point or the previous location and the current GPS sensor-transmitted location coordinates, it measures the distance traveled, time taken, and calculates the speed. Furthermore, it accumulates measurement data to provide information on the total distance traveled, movement path, and overall average speed. Even when reaching the destination during exercise, the movement path continues to accumulate until the completion button is clicked. The completion button is activated when the user moves into the sky blue circular area with a radius of 25 meters, centered around the initially set destination. This means that the user must reach the designated destination, and if they wish to continue exercising without clicking the completion button, they can do so. Depending on the selected exercise type, the app displays the calories burned, aiming to increase user engagement and a sense of accomplishment.

• Transactions of Materials Processing
• /
• v.7 no.6
• /
• pp.586-593
• /
• 1998

In recent automotive industries there has been significant increase in applications of computer simulation to the manufacturing of stamping dies for inner and outer body panels which greatly affect durability and aesthetic quality of automobiles. Enhancement of die quality and reduction of total die manufacturing time and consequently manufacturing cost are the visible outcome. However to successfully apply the result of simulation by a commercial package to the die manufacturing development of an optimal die manufacturing process is required upon the completion of analysis of forte and shortcoming of available sheet metal forming softwares. Based on the results of numerical analysis of front door outer panel forming. this paper evaluates the applicability of simulation results to the real die manufacturing for automotive body panels. Also it attempts to select an optimal die manufacturing process including design machining and tryout. Lastly it discusses the expected effects by adopt-ing the selected process in a real stamping die manufacturing facility.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5252-5268
• /
• 2018

To support a large-scale Hadoop cluster, Hadoop heartbeat messages are designed to deliver the significant messages, including task scheduling and completion messages, via piggybacking to reduce the number of messages received by the NameNode. Although Hadoop is designed and optimized for high-throughput computing via batch processing, the real-time processing of large amounts of data in Hadoop is increasingly important. This paper evaluates Hadoop's performance and costs when the heartbeat period is controlled to support latency sensitive applications. Through an empirical study based on Hadoop 2.0 (YARN) architecture, we improve Hadoop's I/O performance as well as application performance by up to 13 percent compared to the default configuration. We offer a guideline that predicts the performance, costs and limitations of the total system by controlling the heartbeat period using simple equations. We show that Hive performance can be improved by tuning Hadoop's heartbeat periods through extensive experiments.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.1
• /
• pp.140-146
• /
• 2005

This study presents the new dispatching rules of job shop scheduling with auxiliary resource constraint to improve the schedule performance measures related to completion time and due dates. The proposed dispatching rules consider the information of total work remaining and machine utilization to decrease mean flowtime and mean tardiness. The results of computer experiments show that those schedule performances are significantly improved by using the new dispatching rules. The results provide guidance for the researchers and practitioners of auxiliary resource constrained job shop scheduling to decrease mean flowtime and mean tardiness.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.4
• /
• pp.45-57
• /
• 2010

This paper considers a 2-stage assembly flowshop scheduling problem where each job is completed by assembling multiple components. The problem has the objective measure of minimizing total completion time. The problem is shown to be NP-complete in the strong sense. Thus, we derive some solution properties and propose three heuristic algorithms. Also, a mixed-integer programming model is developed and used to generate a lower bound for evaluating the performance of proposed heuristics. Numerical experiments demonstrate that the proposed heuristics are superior over those of previous research.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.4
• /
• pp.141-146
• /
• 2004

This research considers the problem of scheduling jobs on unrelated parallel machines with a common due date. The objective is to minimize the total absolute deviation of job completion times about the common due date. This problem is motivated by the fact that a certain phase of printed circuit board manufacturing and other production systems is bottleneck and the processing speeds of parallel machines in this phase are different for each job. A zero-one integer programming formulation is presented and two dominance properties are proved. By these dominance properties, it is shown that the problem is reduced to asymmetric assignment problem and is solvable in polynomial time.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.39 no.3
• /
• pp.83-91
• /
• 2014

We consider the problem of scheduling identical jobs with sequence-independent setup times on parallel machines. The objective is to minimize total completion times. We present the pseudopolynomial-time algorithm for the case with a fixed number of machines and an efficient approximation algorithm for our problem with identical setup times, which is known to be NP-hard even for the two-machine case.