• Journal of Korean Society of Occupational and Environmental Hygiene
• /
• v.24 no.1
• /
• pp.52-58
• /
• 2014

Objectives: Using laborers participating in the petrochemical factory turnaround process as subjects, this study aims to identify exposure to benzene in the air and examine the relationship between exposure and the excretion of urinary metabolites by measuring concentrations of urinary trans, trans-muconic acid (t,t-MA). Methods: A passive sampler was used to measure the level of benzene in the air. In order to analyze urinary metabolites, the urine of laborers participating in the turnaround process was collected twice daily, both before and after work. In addition, a survey was conducted on work factors and lifestyle habits as factors affecting the concentration of urinary metabolites. Results: During the survey period, benzene was detected in the samples from all workers, and its average concentration was $0.16{\pm}0.22ppm$. The average concentration of t,t-MA after work was $1.20{\pm}1.86mg/g$ creatinine, and the results of analyzing urinary metabolites concentration before and after work showed statistically significant differences(p=0.003). There was also a statistically significant correlation (r=0.52, p=0.002) between benzene in the air and the concentration of after-work urinary t,t-MA. Conclusions: During the turnaround process, the average benzene concentration in workers was $0.16{\pm}0.22ppm$, which was below the exposure limit. However, their average t,t-MA concentration was $1.20{\pm}1.86mg/g$ creatinine, which exceeded the exposure limit of 1mg/g creatinine. The characteristics of turnaround process work require considerations such as underestimating the passive sampler being used and the skin absorption of benzene, and there needs to be a simultaneous assessment of working environment measurements and biological monitoring.

• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.165-170
• /
• 2023

Scheduling algorithms plays a significant role in optimizing the CPU in operating system. Each scheduling algorithms schedules the processes in the ready queue with its own algorithm design and its properties. In this paper, the performance analysis of First come First serve scheduling, Non preemptive scheduling, Preemptive scheduling, Shortest Job scheduling and Round Robin algorithm has been discussed with an example and the results has been analyzed with the performance parameters such as minimum waiting time, minimum turnaround time and Response time.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.865-874
• /
• 2002

HTTP (HyperText Transfer Protocol) is a transfer protocol used by the World Wide Web distributed hypermedia system to retrieve the objects. Because HTTP is a connection oriented protocol, it uses TCP (Transmission control Protocol) as a transport layer. But it is known that HTTP interacts with TCP badly. it is discussed about factors affecting the performance or HTTP over TCP, the transaction time obtained by the per-transaction TCP connections for HTTP access and the TCP slow-start overheads, and the transaction time for T-TCP (Transaction TCP) which is one or methods improving the performance or HTTP over TCP. Average waiting time and average turnaround time are important parameters to satisfy QoS (Quality of Service) of end users. Formulas for calculating two parameters are derived. Such formulas can be used for the environment in which each TCP or T-TCP transaction time is same or different. Some experiments and computational experiences indicate that the proposed formulas are well acted, can be applied to the environment which the extension of bandwidth is necessary, and time characteristics of T-TCP are superior to that of TCP. Also, the load distribution method of web server based on the combination of bandwidths is discussed to reduce average waiting time and average turnaround time.

• Journal of Korea Multimedia Society
• /
• v.2 no.2
• /
• pp.184-194
• /
• 1999

We present a new algorithm to minimize channel contention while sending multiple messages from multiple source to overlapped destination set on Multistage Interconnection Network (MIN) which supports wormhole routed turnaround routing. The multicast tree of the U-MIN(Unicast MIN) algorithm is useful in performing messages from one source to multiple destination but gives rise to a serious channel connection in performing multiple multicast because it has been designed for only single multicast. For multiple multicast communication on MIN, we address how to implement multiple multicast services efficiently. And a SPU-MIN(Source Partitioned Unicast MIN) algorithm is proposed and shown to be superior than the U-MIN algorithm for multiple multicast. The turnaround routing algorithm based on wormhole routing technique is employed as a message sending method.

• Journal of IKEEE
• /
• v.20 no.1
• /
• pp.16-25
• /
• 2016

Turnaround time (called, TAT) for imaging test, which is necessary for making a medical diagnosis, is directly related to the patient's waiting time and it is one of the important performance criteria for medical services. In this paper, we measured the TAT from major imaging tests to see it met the reference point set by the medical institutions. Prediction results from the algorithm of classification regression tree (called, CART) showed "clinics", "diagnosis", "modality", "test month" were identified as main factors for timely processing. This study had a contribution in providing means of prevention of the delay on medical services in advance.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.20 no.4
• /
• pp.369-375
• /
• 2011

Design is important in the IT, digital appliance, and auto industries. Aesthetic and art images are being applied for better quality of the products. Most image patterns are complex and much lead-time is required to implement them to the product design process. A precise reverse engineering method generating 2.5D engraving models from 2D artistic images is proposed through the image processing, NURBS interpolation and 2.5D reconstruction methods. To generate 2.5D TechArt models from the art images, boundary points of the images are extracted by using the adaptive median filter and the novel MBF (modified boundary follower) algorithm. Accurate NURBS interpolation of the points generates TechArt CAD models. Performance of the developed system has been confirmed through the quick turnaround 2.5D engraving simulation linked with the commercial CAD/CAM system.

• The KIPS Transactions:PartA
• /
• v.14A no.3 s.107
• /
• pp.141-146
• /
• 2007

In this paper, we proposed an efficient FPGA-based simulation acceleration method based on FPGA compilation avoidance, which can effectively decrease the long debugging turnaround time incurred from the every debugging process in the functional verification. The proposed method had been experimentally applied to the functional verification for a microcontroller design. It had clearly shown that the debugging turnaround time was greatly reduced while the high simulation speed of the simulation acceleration was still maintained.

• Journal of Information Processing Systems
• /
• v.13 no.4
• /
• pp.941-950
• /
• 2017

The round robin algorithm is regarded as one of the most efficient and effective CPU scheduling techniques in computing. It centres on the processing time required for a CPU to execute available jobs. Although there are other CPU scheduling algorithms based on processing time which use different criteria, the round robin algorithm has gained much popularity due to its optimal time-shared environment. The effectiveness of this algorithm depends strongly on the choice of time quantum. This paper presents a new effective round robin CPU scheduling algorithm. The effectiveness here lies in the fact that the proposed algorithm depends on a dynamically allocated time quantum in each round. Its performance is compared with both traditional and enhanced round robin algorithms, and the findings demonstrate an improved performance in terms of average waiting time, average turnaround time and context switching.

• The Journal of Korean Association of Computer Education
• /
• v.12 no.4
• /
• pp.65-75
• /
• 2009

The result verification is necessary to support a guarantee for the correctness of the task results be executed by any unspecified resources in desktop grid environments. Typically, voting-based and trust-based result verification schemes have been used in the environments. However, these suffer from two potential problems: waste of resources due to redundant replicas of each task and increase in turnaround time due to the inability to deal with a dynamic changeable execution environment. To overcome these problems, we propose a fuzzy inference-based replication scheme which can adaptively determine the number of replicas per task by using both trusty degree and result return probability of resources. Therefore our proposal can reduce waste of resources by determining the number of replicas meeting with a dynamic execution environment of desktop grids, not to mention an enhancement of turnaround time for entire asks. Simulation results show that our scheme is superior to other ones in terms of turnaround time, the waste of resources, and the number of re-replications per task.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.2
• /
• pp.183-194
• /
• 2002

The clustering environment with heterogeneous workstations provides the cost effectiveness and usability for executing applications in parallel. Load balancing is considered a necessary feature for a cluster of heterogeneous workstations to minimize the turnaround time. Previously, static load balancing that assigns a predetermined weight for the processing capability of each workstation, or dynamic approaches which execute a benchmark program to get relative processing capability of each workstation were proposed. The execution of the benchmark program, which has nothing to do with the application being executed, consumes the computation time and the overall turnaround time is delayed. In this paper, we present efficient methods for task distribution and task migration, based on the relative load index. We designed and implemented a load balancing system for the clustering environment with heterogeneous workstations. Turnaround times of our methods and the round-robin approach, as well as the load balancing method using a benchmark program, were compared. The experimental results show that our methods outperform all the other methods that we compared.