• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.25 no.5
• /
• pp.29-41
• /
• 2022

Alien species cause problems in various ecosystems, reduce biodiversity, and destroy ecosystems. Due to these problems, the problem of a management plan is increasing, and it is difficult to accurately identify each individual and calculate the number of individuals, especially when researching alien turtle species such as GPS and PIT based on capture. this study intends to conduct an individual recognition study using a UAV. Recently, UAVs can take various sensor-based photos and easily obtain high-definition image data at low altitudes. Therefore, based on previous studies, this study investigated five variables to be considered in UAV flights and produced a test paper using them. OCR was used to monitor the displayed turtles using the manufactured test paper, and this confirmed the recognition rate. As a result, the use of yellow numbers showed the highest recognition rate. In addition, the minimum threat distance was confirmed to be 3 to 6m, and turtles with a shell size of 6 to 8cm were also identified during the flight. Therefore, we tried to propose an object recognition methodology for turtle display text using OCR, and it is expected to be used as a new turtle monitoring technique.

• Journal of Advanced Navigation Technology
• /
• v.15 no.3
• /
• pp.364-371
• /
• 2011

In P2P distribution mobile networks, QoS of streaming media services are under heavy influence from overheads such as congestion, latency, and interference. The problem is further complicated by the fact that the popularity of media objects changes over time. This paper proposes a new FSMS+ (Fuzzy Similarity-based Multi-level Streaming Scheme) which minimizes performance degradation of streaming services due to overhead. We then utilize fuzzy similarity-based relevance that can dynamically stream the streaming media object with minimum overhead. The simulation result showed that the proposed scheme has better performance in retransmission rate, congestion control rate and latency rate than the other existing methods of distance method, DC (disk caching) method, and prefix method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5209-5228
• /
• 2016

Device-to-device (D2D) communication underlaying cellular networks can bring significate benefits for improving the performance of mobile services. However, it hinges on elaborate resource sharing scheme to coordinate interference between cellular users and D2D pairs. We formulate a joint mode selection, link allocation and power control optimization problem for D2D communication sharing uplink resources in a multi-user cellular network and consider the efficiency and the fairness simultaneously. Due to the non-convex difficulty, we propose a three-step scheme: firstly, we conduct mode selection for D2D pairs based on a minimum distance metric after an admission control and obtain some cellular candidates for them. And then, a cellular candidate will be paired to each D2D pair based on fairness. Finally, we use Lagrangian Algorithm to formulate a joint power control strategy for D2D pairs and their reused cellular users and a closed-form of solution is derived. Simulation results demonstrate that our proposed algorithms converge in a short time. Moreover, both the sum rate of D2D pairs and the energy efficiency of cellular users are improved.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.6
• /
• pp.77-85
• /
• 2015

This paper proposes a location algorithm that locates newly built p-facilities in the optimal area with minimum cost in a city of n districts. This problem has been classified as NP-hard, to which no polynomial time algorithm exists. The proposed algorithm improves the shortcomings of existing Myopic algorithm by constructing until p-facilities and exchanging locations of p-th facility for p=[1, n-1]. When applied to experimental data of n=5, 7, 10, 55, the proposed algorithm has obtained an approximate value nearest possible to the optimal solution take precedence of reverse-delete method. This algorithm is also simply executable using Excel.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.10
• /
• pp.2523-2529
• /
• 2014

Location estimation service can be provided outdoors using various location estimation system based on GPS. However, location estimation system is based on existing indoor resources as GPS cannot be used because of insufficient visible satellites and weak signals. The fingerprinting technique that uses WLAN signal, in particular, is good to use indoors because it uses RSSI provided by AP to estimate location. However, its accuracy may vary depending on how accurate data the offline stage used where the fingerprinting map is built. The study sampled various data at the stage that builds the fingerprinting map and suggested a location estimation system that enhances its precision by saving the data of high frequency among them to improve this problem. The suggested location estimation system based on majority sampling data estimates location by filtering RSSI data of the highest frequency at the client and server to be saved at a map, building the map and measuring a similar distance. As a result of the test, the location estimation precision stood at minimum 87.5 % and maximum 90.4% with the margin of error at minimum 0.25 to 2.72m.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.22 no.2
• /
• pp.64-79
• /
• 2023

This study reviewed the process of applying the Monte Carlo simulation technique to the traffic allocation problem of metropolitan subways. The analysis applied the assumption of a normal distribution in which the travel time information of the inter-station sample is the basis of the probit model. From this, the average and standard deviation are calculated by separating the traffic between stations. A plan was proposed to apply the simulation with the weights of the in-vehicle time of individual links and the walking and dispatch interval of transfer. Long-distance traffic with a low number of samples of 50 or fewer was evaluated as a way to analyze the characteristics of similar traffic. The research results were reviewed in two directions by applying them to the Seoul Metropolitan Subway Network. The travel time between single stations on the Seolleung-Seongsu route was verified by applying random sampling to the in-vehicle time and transfer time. The assumption of a normal distribution was accepted for sample sizes of more than 50 stations according to the inter-station traffic sample of the entire Seoul Metropolitan Subway. For long-distance traffic with samples numbering less than 50, the minimum distance between stations was 122Km. Therefore, it was judged that the sample deviation equality was achieved and the inter-station mean and standard deviation of the transport card data for stations at this distance could be applied.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.6
• /
• pp.709-717
• /
• 2002

A new multi constant modulus algorithm (MCMA) for a blind decision feedback equalizer is proposed. In order to avoid the error propagation problem in the conventional DFE structure, Feed-Back Filter coefficients are updated only after Feed-Forward Filter coefficients are sufficiently converged to the steady state. Therefore, it has the problem of slow convergence speed characteristics. To overcome this drawback, the proposed MCMA algorithm uses not only new cost function considering the minimum distance between the received signal and the representative value containing the statistical characteristics of the transmitted signal, but also adaptive step-size according to the equalizer outputs to fast convergence speed of FBF. Simulations were carried out under the certified communication channel environment to evaluate a performance of the proposed equalizer. The simulation results show that the proposed equalizer has an improved convergence and SER performance compared with previous methods. The proposed techniques offer the possibility of practical equalization for cable modem and terrestrial HDTV broadcast (using 8-VSB or 64-QAM) applications.

• Journal of Advanced Navigation Technology
• /
• v.22 no.1
• /
• pp.37-42
• /
• 2018

Recently, there have been many studies on the IoT environment in which the sensors attached to the equipment automatically transmit and process the site information in real time through the network to control the equipment. The core of such a system is a network for data transmission and reception, and a wired network with wide transmission distance is a priority. However, in the case of a wired network, there is a problem that the time and cost consumed to configure the communication is higher than that of the wireless. In this paper, we propose LPWA - based wireless data transmission system using LPWA and BLE communication to solve this problem. The proposed system collects data from equipment through BLE and transmits data to the server using LPWA. Experimental results show that the spreading factor of maximum length of LPWA is 8, and the minimum length is 9.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.2
• /
• pp.267-273
• /
• 2021

Non-orthogonal multiple access is the promised candidates in the next generation wireless networks to improve the spectral efficiency by superposing multiple signals. In general, the superposition coding is performed using the difference in channel gain between users based on the user's power allocation. However, when user pairs have the similar channel gain problem, NOMA can not be allowed in the scenario. To overcome this problem, phase rotation based NOMA is presented to increase minimum distance between superposed signals in the constellation point. This paper proposed a novel non-orthogonal multiple access based index modulation using phase rotation. The additional bits can transfer using the index bits that is allocated according to the activated state of the phase rotation. Simulation results are shown that bit error rate and achievable sum rate are better than conventional NOMA.

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

While most research focuses on the k-nearest neighbors (kNN) queries in the database community, an important type of proximity queries called k-farthest neighbors (kFN) queries has not received much attention. This paper addresses the problem of finding the k-farthest neighbors in road networks. Given a positive integer k, a query object q, and a set of data points P, a kFN query returns k data objects farthest from the query object q. Little attention has been paid to processing kFN queries in road networks. The challenge of processing kFN queries in road networks is reducing the number of network distance computations, which is the most prominent difference between a road network and a Euclidean space. In this study, we propose an efficient algorithm called FANS for k-FArthest Neighbor Search in road networks. We present a shared computation strategy to avoid redundant computation of the distances between a query object and data objects. We also present effective pruning techniques based on the maximum distance from a query object to data segments. Finally, we demonstrate the efficiency and scalability of our proposed solution with extensive experiments using real-world roadmaps.