• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.456-457
• /
• 2021

Recently, in order to more accurately provide indoor location-based services, technologies using Wi-Fi fingerprints and deep learning are being studied. Among the deep learning models, an RNN model that can store information from the past can store continuous movements in indoor positioning, thereby reducing positioning errors. When using an RNN model for indoor positioning, the collected training data must be continuous sequential data. However, the Wi-Fi fingerprint data collected to determine specific location information cannot be used as training data for an RNN model because only RSSI for a specific location is recorded. This paper proposes a region clustering technique for sequential input data generation of RNN models based on Wi-Fi fingerprint data.

• Korean Journal of Remote Sensing
• /
• v.27 no.1
• /
• pp.59-68
• /
• 2011

The analysis of optimal infiltration path is one of the representative fields in which the GIS technology can be useful for the military purpose. Usually the analysis of the optimal path is done with network data. However, for military purpose, it often needs to be done with raster data. Because raster data needs far more computation than network data, it is difficult to apply the methods usually used in network data, such as Dijkstra algorithm. The genetic algorithm, which has shown great outcomes in optimization problems, was applied. It was used to minimize the detection probability of infiltration route. 2D binary array genes and its crossover and mutation were suggested to solve this problem with raster data. 30 tests were performed for each population size, 500, 1000, 2000, and 3000. With each generation, more adoptable routes survived and made their children routes. Results indicate that as the generations increased, average detection probability decreased and the routes converged to the optimal path. Also, as the population size increases, more optimal routes were found. The suggested genetic algorithm successfully finds the optimal infiltration route, and it shows better performance with larger population.

• Polymer(Korea)
• /
• v.39 no.3
• /
• pp.506-513
• /
• 2015

Ethylidene norbornene (ENB) and its blends with endo-dicyclopentadiene (endo-DCPD) were prepared and reacted via the ring-opening metathesis polymerization (ROMP) reaction with the $1^{st}$ and $2^{nd}$ generation Grubbs' catalysts. Dynamic exothermic behaviors during ROMP and tensile properties after ROMP were evaluated using a differential scanning calorimeter (DSC) and a universal testing machine (UTM) for the samples, respectively. It revealed that the ROMP rate was accelerated with the less contents of endo-DCPD and under the $2^{nd}$ generation catalyst. Also, the addition of endo-DCPD and the $1^{st}$ generation catalyst resulted in higher tensile modulus and strength but lower toughness. Gel fraction measurement and fracture surface observation were made to understand the tensile properties.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.264-266
• /
• 2022

In order to apply the RNN model to the radio fingerprint-based indoor path generation technology, the data set must be continuous and sequential. However, Wi-Fi radio fingerprint data is not suitable as RNN data because continuity is not guaranteed as characteristic information about a specific location at the time of collection. Therefore, continuity information of sequential positions should be given. For this purpose, clustering is possible through classification of each region based on signal data. At this time, the continuity information between the clusters does not contain information on whether actual movement is possible due to the limitation of radio signals. Therefore, correlation information on whether movement between adjacent clusters is possible is required. In this paper, a deep learning network, a recurrent neural network (RNN) model, is used to predict the path of a moving object, and it reduces errors that may occur when predicting the path of an object by generating continuous location information for path generation in an indoor environment. We propose a method of giving correlation between clustering for generating an improved moving path that can avoid erroneous path prediction that cannot move on the predicted path.

• Aerospace Engineering and Technology
• /
• v.13 no.2
• /
• pp.185-193
• /
• 2014

In this study, development process of a design program for Instrument Flight Procedure (IFP) is briefly described. Survey results and corresponding analysis are shown to enhance a market competence of the deliverables. Standards and regulations for IFP design are analyzed to derive the system requirements. Detail development processes and test procedures are explained.

• Journal of Information Processing Systems
• /
• v.11 no.2
• /
• pp.280-294
• /
• 2015

This paper presents the infectious watermarking model (IWM) for the protection of video contents that are based on biological virus modeling by the infectious route and procedure. Our infectious watermarking is designed as a new paradigm protection for video contents, regarding the hidden watermark for video protection as an infectious virus, video content as host, and codec as contagion medium. We used pathogen, mutant, and contagion as the infectious watermark and defined the techniques of infectious watermark generation and authentication, kernel-based infectious watermarking, and content-based infectious watermarking. We experimented with our watermarking model by using existing watermarking methods as kernel-based infectious watermarking and content-based infectious watermarking medium, and verified the practical applications of our model based on these experiments.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.459-463
• /
• 2007

Overlay multicast is an emerging technology for next generation Internet service to various groups of multicast members. It will take the place of traditional IP multicast which is not widely deployed due to the complex nature of its technology. The overlay multicast which effectively reduces processing at IP routers can be easily deployed on top of a densely connected IP network. An end-to-end delay problem is considered which is serious in the multicast service. To periodically optimize the route in the overlay network and to minimize the maximum end-to-end delay, overlay multicast tree is investigated with genetic Algorithm. Outstanding experimental results are obtained which is comparable to the optimal solution and the tabu search.

• IE interfaces
• /
• v.24 no.2
• /
• pp.164-172
• /
• 2011

H maritime company in Korea had a long history of difficulty in obtaining enough empty containers to transport its commodities. Despite efforts to resolve the problem, the repositioning of empty containers between depots was still planned manually, which consumed much worker time. To automate the generation of reposition plans, we developed a planning system to optimize the company's reposition of empty containers between global depots with a linear programming model functioning as a key decision engine in the system. The model determines the route, volume and mode of transportation for repositioning empty containers from depots with surplus containers to those requiring containers, as well as the empty space of ships generated from the unloading or loading of full and empty containers. The system has been in operation in the company's global network since March 2008.

• IE interfaces
• /
• v.23 no.2
• /
• pp.139-146
• /
• 2010

In this paper, we present the study of a real passenger transportation system. Passenger transportation problem aims to transport passengers from bus stops to their destinations by a fleet of vehicles while satisfying various constraints such as vehicle capacity, maximum allowable riding time in a bus, and time windows at destinations. Our problem also has special issues such as mixed loading, consideration of afternoon problem together with morning problem, and transferring passengers between vehicles. Our solution approach consists of three serial procedures: bus route generation, bus scheduling, and post optimization. Efficient heuristic algorithms were developed and implemented for the procedures. The proposed solution approach has been successfully applied to several real world problem instances and could reduce about 10% to 15% of buses.

• Journal of Communications and Networks
• /
• v.3 no.4
• /
• pp.374-382
• /
• 2001

Nowadays, the commonly used table lookup scheme for IP routing is based on the sc-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching prefix (BMP) for IP packets forwarding, this complicates the IP lookup. Currently, this process is mainly performed in software and several schemes hale been proposed for hardware implementation. Since the IP lookup performance is a major design issue for the new generation routers, in this article we investigate the properties of the routing table and present a new approach for IP lookups, our approach is not based Gn BMP and significantly reduces the complexity, thus the computation cast of existing schemes can be significantly reduced. We also propose an efficient IP lookup algorithm, with which we improve the binary search on prefixes to 30 millions of packets per second (MPPS) and 5,000 route updates/s under the same experiment setup with an even larger routing table.