• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.12
• /
• pp.2555-2562
• /
• 2009

The algorithm that is proposed in this paper defined a probability function to count connection process and connection-end process to apply TRW algorithm to voice network. Set threshold to evaluate the algorithm that is proposed, Based on the type of connection attack traffic changing the probability to measure the effectiveness of the algorithm, and Attack packets based on the speed of attack detection time was measured. At the result of evaluation, proposed algorithm shows that DDoS attack starts at 10 packets per a second and it detects the attack after 1.2 seconds from the start. Moreover, it shows that the algorithm detects the attack in 0.5 second if the packets were 20 per a second.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.911-918
• /
• 2002

An important issue in the design of future Personal Communication Service (PCS) networks is the efficient management of location information. In this paper, we propose an adaptive distributed dynamic location management algorithm that stores the position of the mobile terminal in k of the n location information databases (LIDs). The proposed algorithm chooses adaptively k. replication factor according to both the space locality of LIDs in wireless mobile networks and the location query popularity to local mobile terminal from remote mobile terminals. The performance of proposed algorithm is evaluated by both an analytical model and a simulation. Based on the results of performance evaluation, we know that the performance of the proposed algorithm is better than that of Krishnamurthi's algorithm regardless of call-mobility ratio.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1128-1145
• /
• 2022

Owing to the rapid development of information science, data analysis based on machine learning has become an interdisciplinary and strategic area. Marine predators algorithm (MPA) is a novel metaheuristic algorithm inspired by the foraging strategies of marine organisms. Considering the randomness of these strategies, an improved algorithm called co-evolutionary cultural mechanism-based marine predators algorithm (CECMPA) is proposed. Through this mechanism, search agents in different spaces can share knowledge and experience to improve the performance of the native algorithm. More specifically, CECMPA has a higher probability of avoiding local optimum and can search the global optimum quickly. In this paper, it is the first to use CECMPA to perform feature subset selection and optimize hyperparameters in support vector machine (SVM) simultaneously. For performance evaluation the proposed method, it is tested on twelve datasets from the university of California Irvine (UCI) repository. Moreover, the coronavirus disease 2019 (COVID-19) can be a real-world application and is spreading in many countries. CECMPA is also applied to a COVID-19 dataset. The experimental results and statistical analysis demonstrate that CECMPA is superior to other compared methods in the literature in terms of several evaluation metrics. The proposed method has strong competitive abilities and promising prospects.

• The Journal of the Korea Contents Association
• /
• v.17 no.11
• /
• pp.183-191
• /
• 2017

In order to secure the convenience of information retrieval by users of scientific information service platforms and to reduce the time required to acquire the proper information, this study proposes an optimized content recommendation algorithm among the algorithms that currently provide service menus and content information for each service, and conducts comparative evaluation on the results. To enhance the recommendation accuracy, users' major items were added to the original algorithm, and performance evaluations on the recommendation results from the original and optimized algorithms were performed. As a result of this evaluation, we found that the relevance of the content provided to the users through the optimized algorithm was increased by 21.2%. This study proposes a method to shorten the information acquisition time and extend the life cycle of the results as valuable information by automatically computing and providing content suitable for users in the system for each service menu.

• Convergence Security Journal
• /
• v.20 no.1
• /
• pp.3-8
• /
• 2020

Blockchain can enhance data transparency and security through decentralized data management that is out of the centralized system. permissioned blockchain of the blockchain platform, only trust-based authorized nodes can participate in the distributed network. Considering the characteristics of the permissioned blockchain, it is necessary to consider the network communication speed, transaction finality agreement, and stability as a condition for selecting the consensus algorithm. The consensus algorithms of the permissioned blockchain environment are diverse such as PoA, PBFT, Raft, etc., but there are no various evaluation factors for selecting consensus algorithms. In this paper, various performance evaluation factors are proposed to analyze the characteristics of each consensus algorithm of the permissioned blockchain and to select an efficient consensus algorithm considering the characteristics of the user environment that composes the network. The proposed performance evaluation factor can consider the network speed, stability, and consensus of the finality agreement between nodes under the premise of trust. Through this, a more efficient blockchain network environment can be constructed.

• Journal of Sensor Science and Technology
• /
• v.31 no.3
• /
• pp.175-179
• /
• 2022

The physical properties of biomaterials are important for their isolation and separation from body fluids. In particular, the precise evaluation of the multi-physical properties of single biomolecules is essential in that the correlation between physical and biological properties of specific biomolecule. However, the majority of scientific equipment, can only determine specific-physical properties of single nanoparticles, making the evaluation of the multi-physical properties difficult. The improvement of analytical techniques for the evaluation of multi-physical properties is therefore required in various research fields. In this study, we developed a motion-tracking algorithm to evaluate the multi-physical properties of single-nanoparticles by analyzing their behavior. We observed the Brownian motion and electric-field-induced drift of fluorescent nanoparticles injected in a microfluidic chip with two electrodes using confocal microscopy. The proposed algorithm is able to determine the size of the nanoparticles by i) removing the background noise from images, ii) tracking the motion of nanoparticles using the circular-Hough transform, iii) extracting the mean squared displacement (MSD) of the tracked nanoparticles, and iv) applying the MSD to the Stokes-Einstein equation. We compared the evaluated size of the nanoparticles with the size measured by SEM. We also determined the zeta-potential and surface-charge density of the nanoparticles using the extracted electrophoretic velocity and the Helmholtz-Smoluchowski equation. The proposed motion-tracking algorithm could be employed in various fields related to biomaterial analysis, such as exosome analysis.

• Journal of Korean Port Research
• /
• v.7 no.1
• /
• pp.13-24
• /
• 1993

The rapid progress of the intermodal freight transportation in recent years has induced fierce competition among the adjacent hub ports for container transport. This brings increased attention to the evaluation of the port competitive ability. But it is not easy to evaluate the port competitive ability because this belongs to ill-defined system which is composed of ambiguous interacting attributes. Paying attention to this point, this paper deals the competitive ability of container port in Far-East Asia by fuzzy integral evaluation which is adequate to interacting ambiguous attribute problem. For this, the proposed fuzzy evaluation algorithm is applied to the real problem, based on the factors such as cargo volumes, costs, services, infrastructure and geographical sites These are extracted from the precedent study of port competitive ability, etc. The results show that the port evaluation factors come in following order ; services, costs, infrastructure, geographical sites and cargo volumes. There are some interactions(interaction coefficient, ${\lambda}=-0.664$ between evaluation attributes. The port competitive ability comes in following order : Singapore, Hongkong, Kobe, Kaoshiung and Busan. According to the sensitivity analysis, the rank between Busan and Kaoshiung changes when ${\lambda}=0.7$. From the analysis of the results, we confirmed that the proposed fuzzy evaluation algorithm is very effective in the complex-fuzzy problem which is composed of hierarchical structure with interacting attributes.

• Journal of Internet Computing and Services
• /
• v.10 no.2
• /
• pp.75-84
• /
• 2009

There have been numerous researches in minimizing the total cost of program development in order to improve productivity of the programs. The incremental evaluation is the evaluation method of reevaluating only affected parts instead of reevaluating overall program when the program has been changed. Since the incremental evaluation method carries its advantage, the method itself is very important when considering the execution efficiency of the program developing environment. This paper extends the dependency chart for an imperative language and presents the extended version of dependency chart which can be applied to the Object Oriented Programming Languages such 'Java'. This paper also presents the incremental evaluation algorithm for Object Oriented Programming Languages and proves its correctness, analyzing the efficiency of incremental evaluation by the simulation.

• The Journal of Korean Association of Computer Education
• /
• v.18 no.3
• /
• pp.115-124
• /
• 2015

In this paper, we introduce a web-based scheduling toolkit(GridTool2), which can run simulation of scheduling algorithm in grid system. And we suggest new algorithms which apply additional communication costs to the existing MinMin and Suffrage scheduling algorithms. Since GridTool2 runs in web environment using server and database, it does not require a separate compiler or runtime environment. The GridTool2 allows variables such as communication costs on the web for performance evaluation, and shows simulation results on the web page. The new algorithm with communication costs was tested using GridTool2 to check for performance improvements. The results revealed that the new algorithm showed better performance as more workloads were incorporated to the system.

• The Journal of the Korea Contents Association
• /
• v.10 no.5
• /
• pp.1-9
• /
• 2010

This paper propose a novel scheme called selective evaluation to improve convergence of ACO (ant colony optimization) for feature selection. The scheme cutdown the computational load by excluding the evaluation of unnecessary or less promising candidate solutions. The scheme is realizable in ACO due to the valuable information, pheromone trail which helps identify those solutions. With the aim of checking applicability of algorithms according to problem size, we analyze the timing requirements of three popular feature selection algorithms, greedy algorithm, genetic algorithm, and ant colony optimization. For a rigorous timing analysis, we adopt the concept of atomic operation. Experimental results showed that the ACO with selective evaluation was promising both in timing requirement and recognition performance.