• Journal of the Korea Society of Computer and Information
• /
• v.22 no.10
• /
• pp.101-107
• /
• 2017

In this paper, we study the problem of parallel machine scheduling considering the moving time of multiple servers. The parallel machine scheduling is to assign jobs to parallel machines so that the total completion time(makespan) is minimized. Each job has a setup phase, a processing phase and a removal phase. 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. A server is needed to move to a parallel machine for a setup phase and a removal phase. But previous researches have been done under the assumption that the server moving time is zero. In this study we have proposed an efficient algorithm for the problem of parallel machine scheduling considering multiple server moving time. We also have investigated experimentally how the number of servers and the server moving time affect the total completion time.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.157-162
• /
• 2002

Recently, location based services, which make use of location information of moving objects, have obtained increasingly high attention. The moving objects are time-evolving spatial objects, that is, their locations are dynamically changed as time varies. Generally, GIS server stores and manages the spatial objects, of which locations are rarely changed. The traditional GIS server, however, has a difficulty to manage the moving objects, due to the fact of locations being frequently changed and the trajectory information (past locations of moving objects) being managed. In this paper, we have designed a moving object server, which stores and manages the locations in order to support various location based services. The moving object server is composed of a location acquisition component, a location storage component, and a location query component. The contribution of this paper is that we integrate the each work for location acquisition, storage, and query into a moving objects server.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.15 no.3
• /
• pp.45-53
• /
• 2019

Moving image sharing technology has developed various servers and programs for personal broadcasting. In this paper, we propose the method of transmitting the multiple moving image, including the output channel of external streaming server. It also implements and tests multiple real-time broadcast channel automatic transmission systems that assign multiple output channels to automatic output channels. As a result of the experiment, it is easy to allocate moving image to broadcast channels that are output through the external streaming server's output channels regardless of the size of the streaming server, enabling the management of efficient output channels at the time of transmission of multiple moving image. The moving image can be provided through streaming method regardless of the type of moving image from the moving image provider terminal, and the moving image transmission can be controlled in various ways, including adding and changing channels for which the moving image is sent, and sending delayed to the moving image.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.200-202
• /
• 2004

This paper deals with the real-time monitoring and control system using PC, PDA(Win CE embedded device) and PCS(based BREW platform). The camera attached to the server captures the moving target, and the captured frame of color image is encoded in JPEG for image compression at the server. The client(PC, PDA, PCS) receives the image data from the remote server and the received image is decoded from decompression. We use the TCP/IP protocol to send the image frames. The client can control the position of the camera by sending the control command to the server. Two DC servo motors for the camera are controlled in any directions, up-down and left-right, by the controller which is communicating with the server via the serial communication to get the control command. In this way, on the client we can monitor the moving images at the server and also control the position of the camera.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.9
• /
• pp.131-143
• /
• 2011

Previous alerting service based on LBS was caused severe overload problem of server by using the method to confirm the location of each moving object on server. In this paper, by loading an App on smart moving object, we proposed a novel algorithm named ADAS(Active Disaster Alert Service) for accessing to the server site with oneself location information as needed and implemented the disaster alerting service system with visualization for user. In the proposed method, running App access to the server periodically with the present location coordinate gained from GPS module or network module and the ID of moving object. Then, the server compare the present location coordinate of moving object and the coordinates of disasters registered in DIDB and transmit the n NDIs existed in near distance orderly from the coordinate of present moving object to the client. The App compares the coordinate of present location for moving object and the coordinates of NDI is transmitted from server by real time and executes the service with classifying levels of alert into three steps such as danger, carefulness and safety. And new NDIs are gained by accessing DIDB on Server periodically during running App. Therefore, this will be become a novel method for reducing fundamentally the server overload problem in comparison with previous alerting service that the career of moving object is managed on server.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.283-298
• /
• 2006

The TPR-tree is the time-parameterized indexing scheme that supports the querying of the current and projected future positions of such moving objects by representing the locations of the objects with their coordinates and velocity vectors. If this index is, however, used in environments that directions and velocities of moving objects, such as vehicles, are very often changed, it increases the communication cost between the server and moving objects because moving objects report their position to the server frequently when the direction and the velocity exceed a threshold value. To preserve the communication cost regularly, there can be used a manner that moving objects report their position to the server periodically. However, the periodical position report also has a problem that lineal time functions of the TPR-tree do not guarantee the accuracy of the object's positions if moving objects change their direction and velocity between position reports. To solve this problem, we propose the query processing scheme and the data structure using road networks for predicting uncertainty positions of moving objects, which is reported to the server periodically. To reduce an uncertainty of the query region, the proposed scheme restricts moving directions of the object to directions of road network's segments. To remove an uncertainty of changing the velocity of objects, it puts a maximum speed of road network segments. Experimental results show that the proposed scheme improves the accuracy for predicting positions of moving objects than other schemes based on the TPR-tree.

• Journal of Positioning, Navigation, and Timing
• /
• v.10 no.4
• /
• pp.387-393
• /
• 2021

This paper proposes a system to synchronize the time of computers over an unmanned aerial vehicle (UAV) network. With the proposed system, the UAVs can perform missions that require precise relative time. Also, data collected by UAVs can be fused precisely with synchronized time. In the system, to synchronize the time of all computers over the UAV network, two-step synchronization is performed. In the first step, the mission computers of the UAVs are synchronized through the server of the system. After the first step, the mission computers measure time offset between the time of the mission computers and the flight computers. The offset values are delivered to the server. In the second step, virtual time is determined by the server from the collected time offset. The measured offset is compensated by moving the synchronized time of mission computers to the reasonable virtual time. Since only the time of mission computers are controlled, any flight computers that use micro air vehicle link (MAVLink) protocol can be synchronized in the proposed system.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.10
• /
• pp.25-32
• /
• 2019

In this paper, we propose a method to apply the attack surface expansion through decoy traps to a protected server network. The network consists of a large number of decoys and protected servers. In the network, each protected server dynamically mutates its IP address and port numbers based on Hidden Tunnel Networking that is a network-based moving target defense scheme. The moving target defense is a new approach to cyber security and continuously changes system's attack surface to prevent attacks. And, the attack surface expansion is an approach that uses decoys and decoy groups to protect attacks. The proposed method modifies the NAT table of the protected server with a custom chain and a RETURN target in order to make attackers waste all their time and effort in the decoy traps. We theoretically analyze the attacker success rate for the protected server network before and after applying the proposed method. The proposed method is expected to significantly reduce the probability that a protected server will be identified and compromised by attackers.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.2
• /
• pp.95-102
• /
• 2011

In this paper, a Mobile Continuous Query Processing System (MCQPS) is designed to solve problems related to database hoarding, maintenance of shared data consistency, and optimization of logging. These problems are caused by weak connectivity and disconnection of wireless networks inherent in mobile database systems under mobile client-server environments. We show the superiority of the proposed MCQPS by comparing its performance to the Client-Intercept-Server (C-I-S) model. In addition, several experimental results show the effectiveness of our proposed indexing structure and methodology for real-time continuous queries.

• The Journal of the Korea Contents Association
• /
• v.13 no.12
• /
• pp.519-529
• /
• 2013

This paper introduces a moving object tracing system using network-connected CCTV and smartphone. In an emergency situation, a smartphone of the reporter gains its GPS information and sends that to the central server. The central server stores received GPS information as a dangerous area in the database and keeps sending the order of tracing the reporter to a network-connected CCTV which can film the reporter. At the same time, the central server sends pictures of the reporter to his or her family and related organization in order to handle the emergency situation as soon as possible. In addition, when a reporter want to know the risk around destination, the central server informs dangerous areas to the reporter by using smart phone application and database of a danger spot.