• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.9
• /
• pp.49-61
• /
• 1996

Back-propagation(BP) algorithm needs a lot of time to train the artificial neural network (ANN) to get high accuracy level in classification tasks. So there have been extensive researches to process back-propagation algorithm on parallel processors. This paper prsents a linear systolic array which calculates forward-backward propagation of BP algorithm at the same time using effective space-time transformation and PE structure. First, we analyze data flow of forwared and backward propagations and then, represent the BP algorithm into data dapendency graph (DG) which shows parallelism inherent in the BP algorithm. Next, apply space-time transformation on the DG of ANN is turn with orthogonal direction projection. By doing so, we can get a snakelike systolic array. Also we calculate the interval of input for parallel processing, calculate the indices to make the right datas be used at the right PE when forward and bvackward propagations are processed in the same PE. And then verify the correctness of output when forward and backward propagations are executed at the same time. By doing so, the proposed system maximizes parallelism of BP algorithm, minimizes th enumber of PEs. And it reduces the execution time by 2 times through making idle PEs participate in forward-backward propagation at the same time.

• Journal of Advanced Navigation Technology
• /
• v.11 no.3
• /
• pp.239-251
• /
• 2007

This thesis is about the reduction of the power consumption in GPS embedded terminals with periodic position fix to improve the time delay of position determination. In order to improve time delay of position determination during the wireless terminal is powered on, it needs to be set such that it can be periodically recalibrated by the GPS and those recalibrated values need to be saved in the terminal's memory so that it can reduce the time delay from the request of location. By using the trace of the information that's been saved in the terminal's memory, it can be set so that it'll be easier to determine whether the wireless terminal has gone into buildings and have the capability of checking if it has gone into a specific building. Likewise, while the terminal is turned on, in order calibrate the location, it needs to continuously work the GPS engine which leads to a rapid decrease in terminal's idle time. This thesis proposes some solutions regarding these issues - reducing 20 ~ 30% of the battery consumption for GPS visible situation that can occur when the wireless terminal periodically calibrates its location to determine the in-building status, and extending the idle time of the terminal by flexibly using the suggested GPS calibration time method according to wireless terminal's mobility.

• Journal of the Semiconductor & Display Technology
• /
• v.21 no.2
• /
• pp.90-94
• /
• 2022

In order to minimize the picking time when the products are released from the warehouse, they should be located close to the exit when the products are released. Currently, the warehouse determines the loading location based on the order of the requirement of products, that is, the frequency of arrival and departure. Items with lower requirement ranks are loaded away from the exit, and items with higher requirement ranks are loaded closer from the exit. This is a case in which the delivery time is faster than the products located near the exit, even if the products are loaded far from the exit due to the low requirement ranking. In this case, there is a problem in that the transit time increases when the product is released. In order to solve the problem, we use the idle time of the stocker in the warehouse to rearrange the products according to the order of delivery time. Temporal difference learning method using Q_learning control, which is one of reinforcement learning types, was used when relocating items. The results of rearranging the products using the reinforcement learning method were compared and analyzed with the results of the existing method.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.3116-3123
• /
• 1999

Current disk systems are generally designed to reduce read traffic more effectively. Hence, write traffic of the I/O workload could potentially become a bottleneck of the disk system performance. In order to overcome this problem without much cost, this paper presents using outermost-zone track of multi-zoned recording disk as a secondary disk cache. The proposed disk cache improves the disk system performance by following exploitations: speed difference between block transfer and track transfer, difference in transfer rate between outermost-zone tracks and inner tracks, reduction in the seek time caused by decreasing the number of disk cache tracks, and idle period during burst accesses. In addition, it does not waste the disk space because it allocates the caching space by the cylinder unit. The simulation results show that the proposed system improves 2.54∼3.11 times better in terms of average response time for write operations than existing disk systems..

• Journal of electromagnetic engineering and science
• /
• v.12 no.1
• /
• pp.1-7
• /
• 2012

In this paper, we investigated the throughput of a cognitive radio network where two primary frequency channels (PCs) are sensed and opportunistically accessed by N secondary users. The sharing sensing member (SSM) protocol is introduced to sense both PCs simultaneously. According to the SSM protocol, N SUs (Secondary User) are divided into two groups, which allows for the simultaneous sensing of two PCs. With a frame structure, after determining whether the PCs are idle or active during a sensing slot, the SUs may use the remaining time to transmit their own data. The throughput of the network is formulated as a convex optimization problem. We then evaluated an iterative algorithm to allocate the optimal sensing time, fusion rule and the number of members in each group. The computer simulation and numerical results show that the proposed optimal allocation improves the throughput of the SU under a misdetection constraint to protect the PCs. If not, its initial date of receipt shall be nullified.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.13 no.3
• /
• pp.24-29
• /
• 2004

The grinding process plays a key role which decides the quality of a product finally. But the grinding process is very irregular, so it is very difficult to analyse the process accurately. Therefore it is very important in the aspect of precision and automation to reduce the idle time and to decide the proper dressing time by watching. In this study, we choose the method which can be observed directly by using of computer vision and then apply pattern classification technique to the method of measuring the wheel surface. Pattern classification technique is proper to analyse complicated surface image. We observe the change of the wheel surface by using of the gray level run lengths which are representative in this technique.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.16 no.2
• /
• pp.35-43
• /
• 2020

Cloud computing integrates computing resources such as servers, storage, and networks with virtualization technology to provide suitable services according to user needs. Due to the structural characteristics of sharing physical resources based on virtualization technology, threats to availability can occur, so it is essential to respond to availability threats in cloud computing. Existing over-provisioning method is not suitable because it can generate idle resources and cause under-provisioning to degrade or disconnect service. System resources must be allocated in real-time according to the system load to guarantee the cloud system's availability. Through appropriate management measures, it is necessary to reduce the system load and increase the performance of the system. This paper analyzes the work response time according to the allocation or migration of virtual machines and discusses an efficient resource management method considering the system load.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.535-537
• /
• 2004

최근 센서 네트워크에 대한 필요성이 증대되면서 센서 기술과 통신 기술 등 센서 네트워크의 기반기술에 대한 연구가 활발하게 진행되고 있다. 특히, 센서 네트워크에서 센서 노드의 수명은 센서의 배터리 전력량에 비례하므로 보다 적은 전력으로 통신을 수행하는 기술들에 관심이 집중되고 있다. 이러한 저전력 통신 프로토콜 가운데 대표적인 것이 시간 분할 다중 접속(TDMA) 기반 MAC 프로토콜이다. 지정된 시간에만 센서 노드의 통신 상태를 정지(sleep)상태에서 유휴(idle)상태로 변경하여 통신을 수행하므로 전력 소비를 최소화시키는 기술이다. 그러나 이웃한 다른 센서들 간의 통신을 간섭하지 않기 위해 센서들은 통신시 서로 다른 주파수를 사용해야 한다. 이러한 제한 사항을 충족시키기 위해서는 센서 노드들이 다양한 주파수를 청취할 수 있어야 하며. 이는 센서 노드 생산시 제조단가의 증가와 직결되어 센서 네트워크의 상용화에 주요한 문제가 될 수 있다. 따라서 본 논문에서는 시간 분할접속(TDMA) 기반 저전력 MAC 프로토콜에서 단일 주파수를 사용한 수 있도록 통신 시간(time slot)을 할당하는 알고리즘을 제안하고자 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.322-324
• /
• 2004

IEEf 802.11 Point Coordination Function (PCF) mode is defined to support time bounded traffic, such as VoIP in wireless LANs. The poll scheduling plays an important role in IEEE 802.11 PCF mode operation. This paper proposed a Multicast Polling Scheme to increase the performance of wireless LANs. Moreover, we proposed a polling schedule scheme for our proposed multipoll to serve real-time traffic. The results show that the proposed mechanism is more efficient than the original IEEE 802.11 PCF.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.3
• /
• pp.67-80
• /
• 2005

This paper deals with a container terminal where containers are discharged by quay cranes from a ship and transported by a fleet of vehicles to the terminal yard. Since container terminals are fully utilized in general, It is important to increase terminal throughput by discharging the containers out of the ship without any delay, At the operational level, it should be decided which vehicle transports which container. The vehicle dispatching decision should be carefully made since the container discharging time increases when the quay cranes wait idle for the vehicles. This paper presents vehicle dispatching heuristics with the objective of minimizing the total container discharging time. The heuristics are based on a network flow model and a look-ahead concept. Through some experiments, the performance of the dispatching methods is evaluated.