• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10A
• /
• pp.1131-1138
• /
• 2004

In Hierarchical Mobile Ipv6 (HMIPv6) networks, the mobility anchor point (MAP) handles binding update (BU) procedures locally to reduce signaling overhead for mobility. However, as the number of mobile nodes (MNs) handled by the MAP increases, the MAP suffers from the overhead not only to handle signaling traffic but also to Process data tunneling traffic. Therefore, it is important to control the number of MNs serviced by the MAP, in order to mitigate the burden of the MAP. We propose an adaptive load control scheme, which consists of two sub-algorithms: threshold-based admission control algorithm and session-to-mobility ratio (SMR) based replacement algorithm. When the number of MNs at a MAP reaches to the full capacity, the MAP replaces an existing MN at the MAP, whose SMR is high, with an MN that just requests binding update. The replaced MN is redirected to its home agent. We analyze the proposed load control scheme using the .Markov chain model in terms of the new MN and the ongoing MN blocking probabilities. Numerical results indicate that the above probabilities are lowered significantly compared to the threshold-based admission control alone.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.5
• /
• pp.305-315
• /
• 2016

Due to the change from small volume production to small quantity batch production systems, individual companies have been attempting to produce a wide range of operating strategies, maximize their productivity, and minimize their WIP level by operating with the proper cycle time to defend their market share. In particular, using a complex workflow and process sequence in the manufacturing line has some drawbacks when it comes to designing the production strategy by applying analytical models, such as mathematical models and queueing theory. For this purpose, this paper uses three heuristic algorithms to solve the job release problem at the bottleneck workstation, product mix problem in multi-purpose machine(s), and batch size and sequence in batch machine(s). To verify the effectiveness of the proposed methods, a simulation analysis was performed. The experimental results demonstrated that the combined application of the proposed methods showed positive effects on the reduction of the cycle time and WIP level, and improvement of the throughput.

• Korean Journal of Remote Sensing
• /
• v.22 no.6
• /
• pp.621-626
• /
• 2006

Today's commercial high resolution satellite imagery such as IKONOS and QuickBird, offers the potential to extract useful spatial information for geographical database construction and GIS applications. Extraction of 3D building information from high resolution satellite imagery is one of the most active research topics. There have been many previous works to extract 3D information based on stereo analysis, including sensor modelling. Practically, it is not easy to obtain stereo high resolution satellite images. On single image performance, most studies applied the roof-bottom points or shadow length extracted manually to sensor models with DEM. It is not suitable to apply these algorithms for dense buildings. We aim to extract 3D building information from a single satellite image in a simple and practical way. To measure as many buildings as possible, in this paper, we suggested a new way to extract building height by triangular vector structure that consists of a building bottom point, its corresponding roof point and a shadow end point. The proposed method could increase the number of measurable building, and decrease the digitizing error and the computation efficiency.

• The Journal of Engineering Geology
• /
• v.31 no.3
• /
• pp.395-432
• /
• 2021

Groundwater recharge rates vary widely by location and with time. They are difficult to measure directly and are thus often estimated using simulations. This study employed frequency and regression analysis and a classification and regression tree (CART) algorithm in a machine learning method to estimate groundwater recharge. CART algorithms are considered for the distribution of precipitation by subbasin (PCP), geomorphological data, indices of the relationship between vegetation and landuse, and soil type. The considered geomorphological data were digital elevaion model (DEM), surface slope (SLOP), surface aspect (ASPT), and indices were the perpendicular vegetation index (PVI), normalized difference vegetation index (NDVI), normalized difference tillage index (NDTI), normalized difference residue index (NDRI). The spatio-temperal distribution of groundwater recharge in the SWAT-MOD-FLOW program, was classified as group 4, run in R, sampled for random and a model trained its groundwater recharge was predicted by CART condidering modified PVI, NDVI, NDTI, NDRI, PCP, and geomorphological data. To assess inter-rater reliability for group 4 groundwater recharge, the Kappa coefficient and overall accuracy and confusion matrix using K-fold cross-validation were calculated. The model obtained a Kappa coefficient of 0.3-0.6 and an overall accuracy of 0.5-0.7, indicating that the proposed model for estimating groundwater recharge with respect to soil type and vegetation cover is quite reliable.

• The Journal of Society for e-Business Studies
• /
• v.26 no.2
• /
• pp.19-43
• /
• 2021

The prediction of box office performance in performing arts institutions is an important issue in the performing arts industry and institutions. For this, traditional prediction methodology and data mining methodology using standardized data such as cast members, performance venues, and ticket prices have been proposed. However, although it is evident that audiences tend to seek out their intentions by the performance guide poster, few attempts were made to predict box office performance by analyzing poster images. Hence, the purpose of this study is to propose a deep learning application method that can predict box office success through performance-related poster images. Prediction was performed using deep learning algorithms such as Pure CNN, VGG-16, Inception-v3, and ResNet50 using poster images published on the KOPIS as learning data set. In addition, an ensemble with traditional regression analysis methodology was also attempted. As a result, it showed high discrimination performance exceeding 85% of box office prediction accuracy. This study is the first attempt to predict box office success using image data in the performing arts field, and the method proposed in this study can be applied to the areas of poster-based advertisements such as institutional promotions and corporate product advertisements.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.33 no.3
• /
• pp.499-510
• /
• 2023

Recently, an intelligent and advanced cyber attack attacks a computer network of a public institution using a file containing malicious code or leaks information, and the damage is increasing. Even in public institutions with various information protection systems, known attacks can be detected, but unknown dynamic and encryption attacks can be detected when existing signature-based or static analysis-based malware and ransomware file detection methods are used. vulnerable to The detection method proposed in this study extracts the detection result data of the system that can detect malicious code and ransomware among the information protection systems actually used by public institutions, derives various attributes by combining them, and uses a machine learning classification algorithm. Results are derived through experiments on how the derived properties are classified and which properties have a significant effect on the classification result and accuracy improvement. In the experimental results of this paper, although it is different for each algorithm when a specific attribute is included or not, the learning with a specific attribute shows an increase in accuracy, and later detects malicious code and ransomware files and abnormal behavior in the information protection system. It is expected that it can be used for property selection when creating algorithms.

• Korean Journal of Remote Sensing
• /
• v.39 no.6_1
• /
• pp.1195-1210
• /
• 2023

Coastal debris has emerged as a salient issue due to its adverse effects on coastal aesthetics, ecological systems, and human health. In pursuit of effective countermeasures, the present study delineated the construction of a specialized image dataset for coastal debris detection and embarked on a comparative analysis between two paramount real-time object detection algorithms, YOLOv8 and RT-DETR. Rigorous assessments of robustness under multifarious conditions were instituted, subjecting the models to assorted distortion paradigms. YOLOv8 manifested a detection accuracy with a mean Average Precision (mAP) value ranging from 0.927 to 0.945 and an operational speed between 65 and 135 Frames Per Second (FPS). Conversely, RT-DETR yielded an mAP value bracket of 0.917 to 0.918 with a detection velocity spanning 40 to 53 FPS. While RT-DETR exhibited enhanced robustness against color distortions, YOLOv8 surpassed resilience under other evaluative criteria. The implications derived from this investigation are poised to furnish pivotal directives for algorithmic selection in the practical deployment of marine debris monitoring systems.

• Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
• /
• v.4 no.1
• /
• pp.9-15
• /
• 2006

For the accurate safety assessment of potential radioactive waste disposal site which is located in the crystalline rock it is important to simulate the mass transportation through engineered and natural barrier system precisely, characterized by porous and fractured media respectively. In this work the methods to construct discrete fracture network for the analysis of flow and mass transport through fractured-porous medium are described. The probability density function is adopted in generating fracture properties for the realistic representation of real fractured rock. In order to investigate the intersection between a porous and a fractured medium described by a 2 dimensional rectangular and a cuboid grid respectively, an additional imaginary fracture is adopted at the face of a porous medium intersected by a fracture. In order to construct large scale flow paths an effective method to find interconnected fractures and algorithms of swift detecting connectivities between fractures or porous medium and fractures are proposed. These methods are expected to contribute to the development of numerical program for the simulation of radioactive nuclide transport through fractured-porous medium from radioactive waste disposal site.

• Journal of Advanced Navigation Technology
• /
• v.22 no.1
• /
• pp.20-26
• /
• 2018

In this paper, we propose a moving object detection and tracking algorithm based on multi-frame feature point tracking information to reduce false positives. However, there are problems of detection error and tracking speed in existing studies. In order to compensate for this, we first calculate the corner feature points and the optical flow of multiple frames for camera movement compensation and object tracking. Next, the tracking error of the optical flow is reduced by the multi-frame forward-backward tracking, and the traced feature points are divided into the background and the moving object candidate based on homography and RANSAC algorithm for camera movement compensation. Among the transformed corner feature points, the outlier points removed by the RANSAC are clustered and the outlier cluster of a certain size is classified as the moving object candidate. Objects classified as moving object candidates are tracked according to label tracking based data association analysis. In this paper, we prove that the proposed algorithm improves both precision and recall compared with existing algorithms by using quadrotor image - based detection and tracking performance experiments.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.3
• /
• pp.9-18
• /
• 2009

Recently, due to the advanced technologies of mobile devices and wireless communication, there are many studies on telematics and LBS(location-based service) applications. because moving objects usually move on spatial networks, their locations are updated frequently, leading to the degradation of retrieval performance. To manage the frequent updates of moving objects' locations in an efficient way, a new distributed grid scheme, called DS-GRID (distributed S-GRID), and k-NN(k-nearest neighbor) query processing algorithm was proposed[1]. However, the result of k-NN query processing technique may be invalidated as the location of query and moving objects are changed. Therefore, it is necessary to study on continuous k-NN query processing algorithm. In this paper, we propose both MCE-CKNN and MBP(Monitoring in Border Point)-CKNN algorithmss are S-GRID. The MCE-CKNN algorithm splits a query route into sub-routes based on cell and seproves retrieval performance by processing query in parallel way by. In addition, the MBP-CKNN algorithm stores POIs from the border points of each grid cells and seproves retrieval performance by decreasing the number of accesses to the adjacent cells. Finally, it is shown from the performance analysis that our CKNN algorithms achieves 15-53% better retrieval performance than the Kolahdouzan's algorithm.