• Journal of the Semiconductor & Display Technology
• /
• v.22 no.2
• /
• pp.6-10
• /
• 2023

High-potential data can be predicted and stored in the cache to prevent cache misses, thus reducing the processor's request and wait times. As a result, the processor can work non-stop, hiding memory latency. By utilizing the temporal/spatial locality of memory access, the prefetcher introduced to improve the performance of these computers predicts the following memory address will be accessed. We propose a prefetcher that applies the GRU model, which is advantageous for handling time series data. Display the currently accessed address in binary and use it as training data to train the Gated Recurrent Unit model based on the difference (delta) between consecutive memory accesses. Finally, using a GRU model with learned memory access patterns, the proposed data prefetcher predicts the memory address to be accessed next. We have compared the model with the multi-layer perceptron, but our prefetcher showed better results than the Multi-Layer Perceptron.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.119-130
• /
• 2012

Recently, the software system is getting complicating and the customers are requiring faster development. For the traditional sequential approach can't against this problem iterative approach is used instead. For the representative iterative approach, there is RUP (Rational's Unified Process). However, RUP standard practical methods are phase, iteration, and disciplines, sequentially. As a result, there's some waste of manpower when a discipline is executed in an iteration, it has to wait till the next same discipline is executed. There are linear approach, sequential approach, overlapped iteration approach, and time-boxed iteration for the efficient execution of RUP. However, they have some problems such as waste of manpower or difficulty in the project management. This paper suggests a method about how to execute the disciplines as a concurrent type. The concurrent approach prevents the waste of manpower and solves the difficulty of project management.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.1
• /
• pp.139-150
• /
• 1997

For high-speed networks, a new ring protocal is proposed in this paper. A ring network combined with destination removal can achieve much higher network throughput than the channel transmission rate. However, such a network exhibits fairness problems. Over a past few years, global fairness algorithms such as ATMR and Metaring have been proposed to solve such problems. But the ring access time delay and fairness in such networks are sensitive to the network parameters such as network size and traffic distribution. In addition to guaranteeing fair ring access to all nodes, there are several other important performance aspects in such networks. The one is that fairness is enforced while node throughputs are kept as high as possible. And another performance measure is access delay and more specifically Head-Of-Line(HOL) delay, i.e., the amount of time the first cell in the transmission buffer of a node has to wait before it accesses the ring. HOL delay is a mijor component in the transmission jitter of the synchronous traffic transmission. A key idea of the proposed ring protocol is to find the nodes that have much more chances to access the ring than any other nodes in the independently distributed node architecture. Since destined by many cells need to share a part of the bandwidths with the next node for the fairness in as much as performance degradation does not become critical. To investigate the performance behavior of the proposed ring protocol for various network condition,s several performance parameters wuch as ring access time delay, and throughput are compared with those of the ATMR and Metaring protocols using simulation package, SIMAN.

• Journal of the Korea Society for Simulation
• /
• v.22 no.3
• /
• pp.35-41
• /
• 2013

This paper applies an active period based bottleneck detection method to flow shop manufacturing system with limited buffer size. Manufacturing systems are constrained by one or more bottlenecks which degrades the system throughput. Conventional bottleneck detection methods include the waiting time or queue length of production stations and their utilization. Due to the random events such as production time of items, machine failure and repair times, the systems may change over time, and subsequently bottlenecks shift from one station to another station. Active period of working station may cause other stations to wait for productions. Information when and where active periods occur helps to find bottlenecks in production systems. Based on these informations, we predict bottlenecks in applying AweSim simulation language. We compare the simulation results of conventional methods with those obtained from duration of active period method, and duration ratio method of both sole and shift bottleneck periods. Even though simulation results are from simple flow shop model, they are quite promising for predicting bottlenecks of production stations. We hope this study aids in decision making regarding the improving system production yield and allocation of available resources of system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.6
• /
• pp.63-68
• /
• 2022

Currently, there are a total of 68 emergency rooms based on Seoul, South Korea, and there is a portal site that allows you to inquire the location of the emergency room, but it is difficult to use in an actual emergency situation because it consists of selecting a gu and a self-governing dong. In addition, it may be more efficient to go to the emergency room directly because you may miss the golden time necessary for survival in a situation where you call 119 and wait for the rescue team. Therefore, in this paper, we propose a service that can quickly search the location of the emergency room based on a specific location through various functions supported by MongoDB. After downloading emergency room location data based on Seoul Metropolitan City, storing it in MongoDB, processing the data through various processing techniques, and applying a spatial index, you can query the emergency room based on distance from a specific location in real time.

• Journal of Practical Engineering Education
• /
• v.16 no.2
• /
• pp.185-193
• /
• 2024

With the advent of smartphones, people can access various information through the internet anytime and anywhere. Even in the vehicle environment, users can use the internet. Users interact with web and applications every day and get information. However, as the amount of data to be processed by the program increases, users inevitably receive a message to wait. User waiting is an inconvenient experience, but minimizing user waiting is the best way because there is time required for data processing. However, if the service processing time exceeds the expected time, users experience more severe boredom and pain. Therefore, various methods and researches are being conducted to alleviate the boredom of user waiting. The most commonly used method to alleviate user waiting boredom is loading. In this study, we investigated the effect of skeleton loading, the latest loading technique, on user waiting experience, and how attractive it is as a design technique in terms of UI compared to other loading techniques.

• Korean Journal of Clinical Laboratory Science
• /
• v.56 no.2
• /
• pp.147-155
• /
• 2024

Gallium-68-prostate-specific membrane antigen-11 (⁶⁸Ga-PSMA-11) is a positron emission tomography radiopharmaceutical that labels a Glu-urea-Lys-based ligand with ⁶⁸Ga, binding specifically to the PSMA. It is used widely for imaging recurrent prostate cancer and metastases. On the other hand, the preparation and quality control testing of ⁶⁸Ga-PSMA-11 in medical institutions takes over 60 minutes, limiting the daily capacity of ⁶⁸Ge/⁶⁸Ga generators. While the generator provides 1,110 MBq (30 mCi) nominally, its activity decreases over time, and the labeling yield declines irregularly. Consequently, additional preparations are needed, increasing radiation exposure for medical technicians, prolonging patient wait times, and necessitating production schedule adjustments. This study aimed to reduce the ⁶⁸Ga-PSMA-11 preparation time and optimize the automated synthesis system. By shortening the reaction time between ⁶⁸Ga and the PSMA-11 precursor and adjusting the number of purification steps, a faster and more cost-effective method was tested while maintaining quality. The final synthesis time was reduced from 30 to 20 minutes, meeting the standards for the HEPES content, residual solvent EtOH content, and radiochemical purity. This optimized procedure minimizes radiation exposure for medical technicians, reduces patient wait times, and maintains consistent production schedules, making it suitable for clinical application.

• The Journal of the Korea Contents Association
• /
• v.17 no.1
• /
• pp.270-286
• /
• 2017

Managing waiting experience is critical for providing service because waiting is an inevitable experience. We explored the factors which influence the waiting experience of the customers and the experience they face, in order to find out the meaning of waiting experience of the customer. As a result, we investigated a holistic sequence divided into four stages. When the customers wait for the service, perceived time would be increased by Zeigarnik effect. How long the customers feel when waiting is largely affected by a gap between waiting time and the perceived time, rather than the perceived time itself. Furthermore, the customers showed a tendency to have hard time immersing in the media due to considering others. Additionally, we could find that waiting time after giving an order is relatively more important than the waiting time before the order. Based on the results, the service provider should convey a feeling of completion by fitting the end point of the media to the point when the customer receives the service. In addition, high predictability needs to be offered for the customers in order to predict the exact waiting time. Finally, the customers should feel as if they take the initiative during waiting time.

• Journal of Korean Society of Transportation
• /
• v.22 no.7 s.78
• /
• pp.107-117
• /
• 2004

The growing demand for customer-response, made-to-order manufacturing and satisfactory delivery are stimulating the importance of commercial fleet management problem. Moreover, the rapid transformation to the customer-oriented multi-frequency, relatively small fleet, such as home delivery and Perishable goods, requiring prompt delivery and advanced real-time operation of vehicle fleets. In this paper we consider the vehicle routing problem(VRP) to minimize delivery completion time which is equal to the time that last customer wait for the vehicle in fleet operation. The mathematical formulation is different from those for the classical VRP which is minimizing cost/distance/time by running vehicles in manager's point of view. The key aspect of this model is not considering the return time from the last customer to depot in every vehicle path. Thereby, the vehicle dispatcher can afford to dynamically respond to customer demand and vehicle availability. The customer's position concerned with minimizing waiting time that may be applied for the delivery of product required freshness or delivery time. Extensive experiments are carried out to compare the performance of minimizing delivery completion time by using the ILOG Solver which has the advantage of solving quickly an interim solution very near an optimal solution. The experimental results show that the suggested model can easily find near optimal solution in a reasonable computational time under the various combination of customers and vehicles.

• Korean Journal of Digital Imaging in Medicine
• /
• v.13 no.4
• /
• pp.171-175
• /
• 2011

Server and Pi view management, external image and internal image Copy Import business in PACS room is through the medical assistance. Import and Copy, and in particular the number of cases is increasing the number of import is a fast growing trend. Although the increase in workload With limited human resources to increase business efficiency so Remote system is using PACS room. This remote system will want to evaluate the effectiveness of using the service. Amount of data each 437.5 MB, Copy and Import time is to compare and evaluate sees by use 1 PC. 4 PC, 4 PC+ remote system. The use of the remote system before the January 2010 to June daily average waiting time and the use of the remote system after the January 2011 to June compared to a daily average patient waiting time, evaluate. Using the remote system in January 2011 to June Find out the average remote utilization. The biggest difference on the four copy and eight continued, Were performed two times faster by use 4 PC+ remote system than use 4 PC and four times faster than use 1 PC. Before using the remote system, the daily average wait time is 14.5 minutes after using the daily average 10.2 minutes, waiting time 30% of the existing waiting time was 4.3 minutes, to reduce. Using the remote system in January 2011 to June the average daily number of cases is 107 number and The number of remote and on average 35 cases with 32% in a day remote usage. The use of the remote system to Import, CD Copy and greatly increase the efficiency of their time could be. Hours due to efficiency could also reduce customer waiting time. As a result, the manpower and the use of a remote system over time to maximize efficiency in business hours, work was evaluated by.