• ETRI Journal
• /
• 제42권6호
• /
• pp.872-885
• /
• 2020

Distributed consensus requires the consent of more than half of the congress to produce irreversible results, and the performance of the consensus algorithm deteriorates with the increase in the number of nodes. This problem can be addressed by delegating the agreement to a few selected nodes. Since the selected nodes must comply with the Byzantine node ratio criteria required by the algorithm, the result selected by any decentralized node cannot be trusted. However, some trusted nodes monopolize the consensus node selection process, thereby breaking decentralization and causing a trilemma. Therefore, a consensus node selection algorithm is required that can construct a congress that can withstand Byzantine faults with the decentralized method. In this paper, an algorithm based on the Byzantine agreement among decentralized agents to facilitate agreement between decentralization nodes is proposed. It selects a group of random consensus nodes per block by applying the proposed proof of nonce algorithm. By controlling the percentage of Byzantine included in the selected nodes, it solves the trilemma when an arbitrary node selects the consensus nodes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권2호
• /
• pp.335-352
• /
• 2023

When solving multi-objective optimization problems, the blindness of the evolution direction of the population gradually emerges with the increase in the number of objectives, and there are also problems of convergence and diversity that are difficult to balance. The many- objective optimization problem makes some classic multi-objective optimization algorithms face challenges due to the huge objective space. The sine cosine algorithm is a new type of natural simulation optimization algorithm, which uses the sine and cosine mathematical model to solve the optimization problem. In this paper, a knee-driven many-objective sine-cosine algorithm (MaSCA-KD) is proposed. First, the Latin hypercube population initialization strategy is used to generate the initial population, in order to ensure that the population is evenly distributed in the decision space. Secondly, special points in the population, such as nadir point and knee points, are adopted to increase selection pressure and guide population evolution. In the process of environmental selection, the diversity of the population is promoted through diversity criteria. Through the above strategies, the balance of population convergence and diversity is achieved. Experimental research on the WFG series of benchmark problems shows that the MaSCA-KD algorithm has a certain degree of competitiveness compared with the existing algorithms. The algorithm has good performance and can be used as an alternative tool for many-objective optimization problems.

• 한국소음진동공학회논문집
• /
• 제22권1호
• /
• pp.61-73
• /
• 2012

The paper presents the novel approach to solve some problems occurred in application of the genetic algorithm to the determination of the optimal tire pattern sequence in order to reduce the tire air-pumping noise which is generated by the repeated compression and expansion of the air cavity between tire pattern and road surface. The genetic algorithm has been used to find the optimal tire pattern sequence having a low level of tire air-pumping noise using the image based air-pumping model. In the genetic algorithm used in the previous researches, there are some problems in the encoding structure and the selection of objective function. The paper proposed single encoding element with five integers, divergent objective function based on evolutionary process and the optimal evolutionary rate based on Shannon entropy to solve the problems. The results of the proposed genetic algorithm with evolutionary process are compared with those of the randomized algorithm without evolutionary process on the two-dimensional normal distribution. It is confirmed that the genetic algorithm is more effective to reduce the peak value of the predicted tire air-pumping noise and the consistency and cohesion of the obtained simulation results are also improved in terms of probability.

• 한국컴퓨터정보학회지
• /
• 제14권1호
• /
• pp.265-271
• /
• 2006

F-HMIPv6(Fast-Hierarchical Mobile IP version 6) 네트워크에서는 단말의 이동을 관리하기 위해 MAP(Mobility Anchor Point)를 사용한다. 현재는 매크로 핸드오프 발생 시 단말로부터 가장 멀리 떨어져있는 MAP을 선택하는 기법을 사용하고 있다. 그러나 이 경우 하나의 큰 MAP으로 전체 부하가 몰리는 문제와 이동 단말과 MAP간의 긴 거리로 인해 통신 비용이 증가하는 문제가 있다. 이 연구에서는 단말의 이동속도와 패킷 전송률을 고려하여 통신 비용을 최소화 하는 비용 효율적인 MAP을 선택 기법을 제안한다. 이를 위해 통신 비용을 바인딩 업데이트 비용과 데이터 패킷 전달 비용으로 구분하고 이 통신 비용을 최소화하는 MAP의 크기를 수식으로 표현한다.

• 한국CDE학회논문집
• /
• 제16권1호
• /
• pp.61-72
• /
• 2011

As the customer's needs for diverse colors, the process of bus painting shop is becoming more and more complex. In particular, frequent changes of paint colors in each spray process require the cleaning of the painting nozzles and setting them up for the new paints, which results in increased time and cost and reduced production. This also increases environmental influences. This paper proposes, as a solution to this issue, the use of color selection field (CSF). CSF is physically a system of conveyors that are used to rearrange objects in a flow line. CSF is proposed, in this paper, to be introduced right before the spray process so that buses are better grouped according to their desired colors. Various parameters of the CSF, such as the number of conveyors and algorithms to determine the rearranged sequence of buses, have been determined by running simulations using the digital manufacturing technology, and investigating the simulation results. As an outcome of the proposed solution, the CSF system is expected to reduce approximately 30% of the nozzle cleaning cost for a Korean motor company case, which will not only benefit the company economically, but will also benefit the environment.

• The Journal of the Acoustical Society of Korea
• /
• 제17권3E호
• /
• pp.12-21
• /
• 1998

In this paper, we describe the one channel five-way, V/U/M/N/S (Voice/Unvoice/Nasal/Silent), classification algorithm for automatically classifying speech. The decision making process is viewed as a pattern viewed as a pattern recognition problem. Two aspects of the algorithm are developed: feature selection and classifier type. The feature selection procedure is studied for identifying a set of features to make V/U/M/N/S classification. The classifiers used are a vector quantization (VQ), a neural network(NN), and a decision tree method. Actual five sentences spoken by six speakers, three male and three female, are tested with proposed classifiers. From a set of measurement tests, the proposed classifiers show fairly good accuracy for V/U/M/N/S decision.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2001년도 추계학술대회 학술발표 논문집
• /
• pp.185-188
• /
• 2001

According as many people use a computer newly, damage of computer virus and hacking is rapidly increasing by the crucial users. To block hacking that is intrusion of a person's computer and the computer virus that destroys data, a study for intrusion-detection of system and virus detection using a biological immune system is in progress. In this paper, we make a model of positive selection and negative selection of self-recognition process that is ability of T-cytotoxic cell that plays an important part in biological immune system. So we embody a self-nonself distinction algorithm in computer. To prove the efficacy of self-recognition algorithm, we use simulations by a cell change and a string change of self file.

• Journal of Biosystems Engineering
• /
• 제30권5호
• /
• pp.299-305
• /
• 2005

This study was developed image processing algorithm for recognition of few teats of a cow in the image using black and white camera attached with infrared filter. Spectroscopic analysis was used for selection of a NIR filter to separate teats from udder skin in the image captured. To verify the performance of image processing algorithm was developed and NIR filter was selected, carried out an experiment with cows. NIR band-pass filter was used to pass the 975nm band of light spectrum. The image processing algorithm was developed could recognize all teats and the process time was 0.9 second to recognize the all teats and to acquire end position of teats.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권7호
• /
• pp.1773-1793
• /
• 2023

Automated machine learning, often referred to as "AutoML," is the process of automating the time-consuming and iterative procedures that are associated with the building of machine learning models. There have been significant contributions in this area across a number of different stages of accomplishing a data-mining task, including model selection, hyper-parameter optimization, and preprocessing method selection. Among them, preprocessing method selection is a relatively new and fast growing research area. The current work is focused on the recommendation of preprocessing methods, i.e., feature subset selection (FSS) algorithms. One limitation in the existing studies regarding FSS algorithm recommendation is the use of a single learner for meta-modeling, which restricts its capabilities in the metamodeling. Moreover, the meta-modeling in the existing studies is typically based on a single group of data characterization measures (DCMs). Nonetheless, there are a number of complementary DCM groups, and their combination will allow them to leverage their diversity, resulting in improved meta-modeling. This study aims to address these limitations by proposing an architecture for preprocess method selection that uses ensemble learning for meta-modeling, namely AutoFE-Sel. To evaluate the proposed method, we performed an extensive experimental evaluation involving 8 FSS algorithms, 3 groups of DCMs, and 125 datasets. Results show that the proposed method achieves better performance compared to three baseline methods. The proposed architecture can also be easily extended to other preprocessing method selections, e.g., noise-filter selection and imbalance handling method selection.

• Journal of Welding and Joining
• /
• 제17권4호
• /
• pp.39-45
• /
• 1999

The procedure of robotic Gas metal Arc (GMA) welding in order to achieve the optimized bead geometry needs the selection of suitable process parameters such as arc current, welding voltage, welding speed. It is required the relationships between process parameters and bead geometry. The objective of this paper is to develop the algorithm that enables the determination of process parameters from the optimized bead geometry for robotic GMA welding. It depends on the inversion of empirical equations derived from multiple regression analysis of the relationships between the process parameters and the bead dimensions using the least square method. The method not only directly determines those parameters which will give the desired set of bead geometry, but also avoids the need to iterate with a succession of guesses employed Finite Element Method(FEM). These results suggest that process parameter from experimental equation for robotic GMA welding may be employed to monitor and control the bead geometry in real time.