• 한국항공운항학회지
• /
• 제19권4호
• /
• pp.83-90
• /
• 2011

The evaluation of Conflict detection and Resolution Algorithms require the use of analytical that describe encounter flight safety and the costs and benefits of optimization maneuver. A number of such algorithms have been applied in the past to the free flight. Each algorithm has benefits and limitations, and flight safety may be facilitated by combining the best features of various techniques. This paper studied a summary of conflict detection and resolution algorithm approaches. Algorithm techniques are categorized and the fundamental assumptions, capabilities, and limitations of each approach are described. The Algorithms are evaluated and compared based on their applicability to free flight airspace conflict situations.

• Steel and Composite Structures
• /
• 제7권3호
• /
• pp.201-217
• /
• 2007

Two combinatorial optimization algorithms, tabu search and simulated annealing, are presented for the minimum-weight design of geometrically non-linear steel plane frames. The design algorithms obtain minimum weight frames by selecting suitable sections from a standard set of steel sections such as American Institute of Steel Construction (AISC) wide-flange (W) shapes. Stress constraints of AISC Load and Resistance Factor Design (LRFD) specification, maximum and interstorey drift constraints and size constraints for columns were imposed on frames. The stress constraints of AISC Allowable Stress Design (ASD) were also mounted in the two algorithms. The comparisons between AISC-LRFD and AISC-ASD specifications were also made while tabu search and simulated annealing were used separately. The algorithms were applied to the optimum design of three frame structures. The designs obtained using tabu search were compared to those where simulated annealing was considered. The comparisons showed that the tabu search algorithm yielded better designs with AISC-LRFD code specification.

• 대한산업공학회지
• /
• 제37권4호
• /
• pp.408-414
• /
• 2011

The objective of this paper is to define local optimization algorithms (LOA) to solve Resource-Constrained Project Scheduling Problem (RCPSP) and analyze the performance of these algorithms. By representing solutions with activity list, three primitive LOAs, i.e. forward and backward improvement-based, exchange-based, and relocation-based LOAs are defined. Also, combined LOAs integrating two primitive LOAs are developed. From the experiments with standard test set J120 generated using ProGen, the FBI-based LOA demonstrates to be an efficient algorithm. Moreover, algorithms combined with FBI-based LOA and other LOA generate good solutions in general. Among the considered algorithms, the combined algorithm of FBI-based and exchangebased shows best performance in terms of solution quality and computation time.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2000년도 추계종합학술대회
• /
• pp.288-291
• /
• 2000

ATM 망에서는 전송률 기반의 ABR 흐름제어를 위해 다수의 알고리즘들이 제안되고 있다. 이 알고리즘들의 주 목적은 셀 손실률을 회피하고 미사용중인 대역폭을 ABR 트래픽에 의해 사용되게 하는 것이다. 이러한 알고리즘들은 EFCI와 ER 스위치에서 동작하여 ABR 트래픽을 재어하는데 사용된다. 이전 논문에서 이러한 스위치 알고리즘들을 network에 적용하여 각 알고리즘들의 성능에 의한 대역 이용률을 도시하였다. 본 논문에서는 이의 보완을 위해 각 알고리즘들의 셀 손실률과 회선 이용률을 도시하여 그 성능을 비교, 분석하고자 한다.

• Journal of the Korean Data and Information Science Society
• /
• 제16권4호
• /
• pp.801-813
• /
• 2005

The discretization algorithms for continuous data have been actively studied in the area of data mining. These discretizations are very important in data analysis, especially for efficient model selection in data mining. So, in this paper, we introduce the principles of some mutiway discretization algorithms including KEX, 1R and CN4 algorithm and investigate the efficiency of these algorithms through numerical study. For various underlying distribution, we compare these algorithms in view of misclassification rate.

• 한국정보통신학회논문지
• /
• 제4권4호
• /
• pp.745-750
• /
• 2000

ATM 망에서는 전송률 기반의 ABR 흐름제어를 위해 다수의 알고리즘들이 제안되고 있다. 이 알고리즘들의 주 목적은 셀 손실률을 회피하고 미사용중인 대역폭을 ABR 트래픽에 의해 사용되게 하는 것이다. 이러한 알고리즘들은 EFCI와 ER 스위치에서 동작하여 ABR 트래픽을 제어하는데 사용된다. 이전 논문에서 이러한 스위치 알고리즘들을 network에 적용하여 각 알고리즘들의 성능에 의한 대역 이용률을 도시하였다. 본논문에서는 이의 보완을 위해 각 알고리즘들의 셀 손실률과 회선 이용률을 도시하여 그 성능을 비교, 분석하고자 한다.

• Journal of Information Processing Systems
• /
• 제15권5호
• /
• pp.1029-1035
• /
• 2019

In recent years, artificial intelligence (AI) services have become one of the most essential parts to extend human capabilities in various fields such as face recognition for security, weather prediction, and so on. Various learning algorithms for existing AI services are utilized, such as classification, regression, and deep learning, to increase accuracy and efficiency for humans. Nonetheless, these services face many challenges such as fake news spread on social media, stock selection, and volatility delay in stock prediction systems and inaccurate movie-based recommendation systems. In this paper, various algorithms are presented to mitigate these issues in different systems and services. Convolutional neural network algorithms are used for detecting fake news in Korean language with a Word-Embedded model. It is based on k-clique and data mining and increased accuracy in personalized recommendation-based services stock selection and volatility delay in stock prediction. Other algorithms like multi-level fusion processing address problems of lack of real-time database.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
• /
• pp.239-242
• /
• 2000

Symbiotic evolutionary algorithms are stochastic search algorithms that imitate the biological coevolution process through symbiotic interactions. In the algorithms, the fitness evaluation of an individual requires first selecting symbiotic partners of the individual. The symbiotic partner effects the change of individual's fitness and search direction. In this study we are to analyze how much partnering strategies can influence the performance of the algorithms. For this goal extensive experiments are carried out to compare the performance of partnering strategies. The NKC model and the binary string covering problem are used as the test-bed problems. The experimental results indicate that there does not exist statistically significant difference in their performance.

• 한국통신학회논문지
• /
• 제35권6C호
• /
• pp.506-515
• /
• 2010

본 논문에서는 실내 환경에서 대표적인 적응 MIMO 알고리즘들의 스펙트럼 효율을 비교, 분석한다. 먼저, MIMO 알고리즘들의 변복조 기법을 간략히 고찰하고 BPSK 와 256QAM 까지의 정방형 QAM 변조방식을 이용하여 적응 알고리즘을 구성한다. 끝으로, 실내 전파환경에서 (2$\times$2) 혹은 (4$\times$4) 안테나 어레이로 구성되는 적응 MIMO 알고리즘들의 스펙트럼 효율을 시뮬레이션을 통해 비교, 분석한다.

• International journal of advanced smart convergence
• /
• 제11권2호
• /
• pp.38-43
• /
• 2022

In this study, there are many difficulties in defining and judging creative people because there is no systematic analysis method using accurate standards or numerical values. Analyze and judge whether In the previous study, A study on the application of rule success cases through machine learning algorithm extraction, a case study was conducted to help verify or confirm the psychological personality test and aptitude test. We proposed a solution to a research problem in psychology using machine learning algorithms, Data Mining's Cross Industry Standard Process for Data Mining, and CRISP-DM, which were used in previous studies. After that, this study proposes a solution that helps to judge creative people by applying the feature selection algorithm. In this study, the accuracy was found by using seven feature selection algorithms, and by selecting the feature group classified by the feature selection algorithms, and the result of deriving the classification result with the highest feature obtained through the support vector machine algorithm was obtained.