• Journal of IKEEE
• /
• v.22 no.2
• /
• pp.266-273
• /
• 2018

Smart surveillance system obtains the positional information of users using GPS receivers embedded in smart devices, and provide them with services of tracking, monitoring, and protecting by controlling CCTVs nearby them. In order to apply and operate these systems to new environment, the overall setup process of the system is increased proportionally to the number of CCTVs. Therefore if there is a large number of CCTVs, the amount of time required during the setup process is very lengthy, and the operation of them becomes inoperable. In this paper, we propose a method to reduce these setting process. As the result of applying and simulation the proposed method, the setup method is simple, and as the CCTV increases, it consumes less time the previous system, and the system can be operated during setup.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.6
• /
• pp.101-108
• /
• 2014

The parallel machine scheduling is to schedule each job to exactly one parallel machine so that the total completion time is minimized. It is used in various manufacturing system areas such as steel industries, semiconductor manufacturing and plastic industries. Each job has a setup phase and a processing phase. A removal phase is needed in some application areas. A processing phase is performed by a parallel machine alone while a setup phase and a removal phase are performed by both a server and a parallel machine simultaneously. Most of previous researches used a single server and considered only a setup phase and a processing phase. If a single server is used for scheduling, the bottleneck in the server increases the total completion time. Even though the number of parallel machines is increased, the total completion time is not reduced significantly. In this paper, we have proposed an efficient algorithm for the parallel machine scheduling using multiple servers and considering setup, processing and removal phases. We also have investigated experimentally how the number of servers and the number of parallel machines affect the total completion time.

• Journal of the Semiconductor & Display Technology
• /
• v.19 no.2
• /
• pp.11-15
• /
• 2020

In a typical initial setup of a PCB component inspection system, operators should manually input various information such as category, position, and inspection area for each component to be inspected, thus causing much inconvenience and longer setup time. Although there are many deep learning based object detectors, RetinaNet is regarded as one of best object detectors currently available. In this paper, a method using an extended RetinaNet is proposed that automatically detects its component category and position for each component mounted on PCBs from a high-resolution color input image. We extended the basic RetinaNet feature pyramid network by adding a feature pyramid layer having higher spatial resolution to the basic feature pyramid. It was demonstrated by experiments that the extended RetinaNet can detect successfully very small components that could be missed by the basic RetinaNet. Using the proposed method could enable automatic generation of inspection areas, thus considerably reducing the setup time of PCB component inspection systems.

• 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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.1
• /
• pp.27-41
• /
• 2005

This paper considers identical parallel machine scheduling problem. Each job has a processing time. due date. weight and family type. If a different type of job is followed by prior job. a family setup is incurred. A two phased heuristic is presented for minimizing the sum of weighted tardiness. In the first phase. using roiling horizon technique. group each job into same family and schedule each family. In the second phase. assign each job to machines using schedule obtained in the first phase. Extensive computational experiments and comparisons among other algorithms are carried out to show the efficiency of the proposed algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.2
• /
• pp.251-256
• /
• 2006

In this paper we consider multi-stage, multi-product production, inventory systems which have assembly-tree-structure. We propose a new mathematical model for pull type ordering systems based on JIT manufacturing systems. To apply the model to an actual automobile parts manufacturer, the objective of proposed model is to minimize the sum of inventory and setup costs. Finally, a numerical example and computational results are given to illustrate the proposed model.

• Proceedings of the KIEE Conference
• /
• 1998.11b
• /
• pp.630-632
• /
• 1998

The basic user location strategies proposed in current PCS(Personal Communication Services) Network are two-level Database strategies. These Databases which exist in the Signalling network always maintain user's current location information, and it is used in call setup process to a mobile user. As the number of PCS users are increasing, this strategies yield some problem such as concentrating signalling traffic on the Database, increasing Call setup Delay, and so on. In this paper, we proposed RCP(Reverse Connection setup Protocol) model, which apply RVC(Reverse Virtual Call setup) algorithm to PCS reference model, and CRCP(Cache algorithm in RCP) model, which adopt Caching strategies in the RCP model. When Cache-miss occur, we found that CRCP model require less miss-penalty than PCS model. Also we show that proposed models are always likely to yield better performance in terms of reduced Location Tracking Delay time.

• International Journal of Contents
• /
• v.1 no.1
• /
• pp.29-34
• /
• 2005

In this paper, we proposed an advanced authentication structure for reducing the certificate acquisition time which is one of the factors that should be improved in a conventional wireless PKI. A conventional key exchange method simply performs the key exchange setup step based on discrete algebraic subjects. But the mutual-authentication procedure of wireless PKI for reducing authentication time uses an elliptical curve for a key exchange setup step. We simulated and compared the authentication structure proposed by Sufatrio, K. Lam[4] and proposed authentication structure in terms of the authentication time. Simulation results show that the proposed method reduces the authentication time compared to the conventional wireless PKI authentication method.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.3
• /
• pp.360-368
• /
• 1999

We consider the problem of scheduling n jobs with sequence-dependent processing times on a set of parallel-identical machines. The processing time of each job consists of a pure processing time and a sequence-dependent setup time. The objective is to maximize the total remaining machine available time which can be used for other tasks. For the problem, a hybrid genetic algorithm is proposed. The algorithm combines a genetic algorithm for global search and a heuristic for local optimization to improve the speed of evolution convergence. The genetic operators are developed such that parallel machines can be handled in an efficient and effective way. For local optimization, the adjacent pairwise interchange method is used. The proposed hybrid genetic algorithm is compared with two heuristics, the nearest setup time method and the maximum penalty method. Computational results for a series of randomly generated problems demonstrate that the proposed algorithm outperforms the two heuristics.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.123-132
• /
• 2005

In this paper, a conventional key exchange method simply Performs the key exchange setup step based on discrete algebraic subjects. But the mutual-authentication procedure of wireless PKI for reducing authentication time uses an elliptical curve for a key exchange setup step. Proposed hand-over method shows reduced hand-over processing time than conventional method since it can reduce CRL retrieval time. Also, we compared proposed authentication structure and conventional algorithm, and simulation results show that proposed authentication method outperforms conventional algorithm in authentication waiting time.