• Title/Summary/Keyword: ART Algorithm

Search Result 579, Processing Time 0.024 seconds

Parameter-setting-free algorithm to determine the individual sound power levels of noise sources (적응형 파라미터 알고리즘을 이용한 개별 소음원의 음향파워 예측 연구)

  • Mun, Sungho
    • International Journal of Highway Engineering
    • /
    • v.20 no.3
    • /
    • pp.59-64
    • /
    • 2018
  • PURPOSES : We propose a parameter-setting-free harmony-search (PSF-HS) algorithm to determine the individual sound power levels of noise sources in the cases of industrial or road noise environment. METHODS :In terms of using methods, we use PSF-HS algorithm because the optimization parameters cannot be fixed through finding the global minimum. RESULTS:We found that the main advantage of the PSF-HS heuristic algorithm is its ability to find the best global solution of individual sound power levels through a nonlinear complex function, even though the parameters of the original harmony-search (HS) algorithm are not fixed. In an industrial and road environment, high noise exposure is harmful, and can cause nonauditory effects that endanger worker and passenger safety. This study proposes the PSF-HS algorithm for determining the PWL of an individual machine (or vehicle), which is a useful technique for industrial (or road) engineers to identify the dominant noise source in the workplace (or road field testing case). CONCLUSIONS : This study focuses on providing an efficient method to determine sound power levels (PWLs) and the dominant noise source while multiple machines (or vehicles) are operating, for comparison with the results of previous research. This paper can extend the state-of-the-art in a heuristic search algorithm to determine the individual PWLs of machines as well as loud machines (or vehicles), based on the parameter-setting-free harmony-search (PSF-HS) algorithm. This algorithm can be applied into determining the dominant noise sources of several vehicles in the cases of road cross sections and congested housing complex.

Development of a Fast Alignment Method of Micro-Optic Parts Using Multi Dimension Vision and Optical Feedback

  • Han, Seung-Hyun;Kim, Jin-Oh;Park, Joong-Wan;Kim, Jong-Han
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.273-277
    • /
    • 2003
  • A general process of electronic assembly is composed of a series of geometric alignments and bonding/screwing processes. After assembly, the function is tested in a following process of inspection. However, assembly of micro-optic devices requires both processes to be performed in equipment. Coarse geometric alignment is made by using vision and optical function is improved by the following fine motion based on feedback of tunable laser interferometer. The general system is composed of a precision robot system for 3D assembly, a 3D vision guided system for geometric alignment and an optical feedback system with a tunable laser. In this study, we propose a new fast alignment algorithm of micro-optic devices for both of visual and optical alignments. The main goal is to find a fastest alignment process and algorithms with state-of-the-art technology. We propose a new approach with an optimal sequence of processes, a visual alignment algorithm and a search algorithm for an optimal optical alignment. A system is designed to show the effectiveness and efficiency of the proposed method.

  • PDF

Fast Image Splicing Detection Algorithm Using Markov Features (마코프 특징을 이용하는 고속 위조 영상 검출 알고리즘)

  • Kim, Soo-min;Park, Chun-Su
    • Journal of IKEEE
    • /
    • v.22 no.2
    • /
    • pp.227-232
    • /
    • 2018
  • Nowadays, image manipulation is enormously popular and easier than ever with tons of convenient images editing tools. After several simple operations, users can get visually attractive images which easily trick viewers. In this paper, we propose a fast algorithm which can detect the image splicing using the Markov features. The proposed algorithm reduces the computational complexity by removing unnecessary Markov features which are not used in the image splicing detection process. The performance of the proposed algorithm is evaluated using a famous image splicing dataset which is publicly available. The experimental results show that the proposed technique outperforms the state-of-the-art splicing detection methods.

Three-Dimensional Shape Recognition and Classification Using Local Features of Model Views and Sparse Representation of Shape Descriptors

  • Kanaan, Hussein;Behrad, Alireza
    • Journal of Information Processing Systems
    • /
    • v.16 no.2
    • /
    • pp.343-359
    • /
    • 2020
  • In this paper, a new algorithm is proposed for three-dimensional (3D) shape recognition using local features of model views and its sparse representation. The algorithm starts with the normalization of 3D models and the extraction of 2D views from uniformly distributed viewpoints. Consequently, the 2D views are stacked over each other to from view cubes. The algorithm employs the descriptors of 3D local features in the view cubes after applying Gabor filters in various directions as the initial features for 3D shape recognition. In the training stage, we store some 3D local features to build the prototype dictionary of local features. To extract an intermediate feature vector, we measure the similarity between the local descriptors of a shape model and the local features of the prototype dictionary. We represent the intermediate feature vectors of 3D models in the sparse domain to obtain the final descriptors of the models. Finally, support vector machine classifiers are used to recognize the 3D models. Experimental results using the Princeton Shape Benchmark database showed the average recognition rate of 89.7% using 20 views. We compared the proposed approach with state-of-the-art approaches and the results showed the effectiveness of the proposed algorithm.

Multiobjective Optimal Reactive Power Flow Using Elitist Nondominated Sorting Genetic Algorithm: Comparison and Improvement

  • Li, Zhihuan;Li, Yinhong;Duan, Xianzhong
    • Journal of Electrical Engineering and Technology
    • /
    • v.5 no.1
    • /
    • pp.70-78
    • /
    • 2010
  • Elitist nondominated sorting genetic algorithm (NSGA-II) is adopted and improved for multiobjective optimal reactive power flow (ORPF) problem. Multiobjective ORPF, formulated as a multiobjective mixed integer nonlinear optimization problem, minimizes real power loss and improves voltage profile of power grid by determining reactive power control variables. NSGA-II-based ORPF is tested on standard IEEE 30-bus test system and compared with four other state-of-the-art multiobjective evolutionary algorithms (MOEAs). Pareto front and outer solutions achieved by the five MOEAs are analyzed and compared. NSGA-II obtains the best control strategy for ORPF, but it suffers from the lower convergence speed at the early stage of the optimization. Several problem-specific local search strategies (LSSs) are incorporated into NSGA-II to promote algorithm's exploiting capability and then to speed up its convergence. This enhanced version of NSGA-II (ENSGA) is examined on IEEE 30 system. Experimental results show that the use of LSSs clearly improved the performance of NSGA-II. ENSGA shows the best search efficiency and is proved to be one of the efficient potential candidates in solving reactive power optimization in the real-time operation systems.

A QoS-aware Adaptive Coloring Scheduling Algorithm for Co-located WBANs

  • Wang, Jingxian;Sun, Yongmei;Luo, Shuyun;Ji, Yuefeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.5800-5818
    • /
    • 2018
  • Interference may occur when several co-located wireless body area networks (WBANs) share the same channel simultaneously, which is compressed by resource scheduling generally. In this paper, a QoS-aware Adaptive Coloring (QAC) scheduling algorithm is proposed, which contains two components: interference sets determination and time slots assignment. The highlight of QAC is to determine the interference graph based on the relay scheme and adapted to the network QoS by multi-coloring approach. However, the frequent resource assignment brings in extra energy consumption and packet loss. Thus we come up with a launch condition for the QAC scheduling algorithm, that is if the interference duration is longer than a threshold predetermined, time slots rescheduling is activated. Furthermore, based on the relative distance and moving speed between WBANs, a prediction model for interference duration is proposed. The simulation results show that compared with the state-of-the-art approaches, the QAC scheduling algorithm has better performance in terms of network capacity, average delay and resource utility.

The Maximum Scatter Travelling Salesman Problem: A Hybrid Genetic Algorithm

  • Zakir Hussain Ahmed;Asaad Shakir Hameed;Modhi Lafta Mutar;Mohammed F. Alrifaie;Mundher Mohammed Taresh
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.6
    • /
    • pp.193-201
    • /
    • 2023
  • In this paper, we consider the maximum scatter traveling salesman problem (MSTSP), a travelling salesman problem (TSP) variant. The problem aims to maximize the minimum length edge in a salesman's tour that travels each city only once in a network. It is a very complicated NP-hard problem, and hence, exact solutions can be found for small sized problems only. For large-sized problems, heuristic algorithms must be applied, and genetic algorithms (GAs) are found to be very successfully to deal with such problems. So, this paper develops a hybrid GA (HGA) for solving the problem. Our proposed HGA uses sequential sampling algorithm along with 2-opt search for initial population generation, sequential constructive crossover, adaptive mutation, randomly selected one of three local search approaches, and the partially mapped crossover along with swap mutation for perturbation procedure to find better quality solution to the MSTSP. Finally, the suggested HGA is compared with a state-of-art algorithm by solving some TSPLIB symmetric instances of many sizes. Our computational experience reveals that the suggested HGA is better. Further, we provide solutions to some asymmetric TSPLIB instances of many sizes.

Equilibrium Points of Bimatrix Games: A State-of-the-Art (쌍행열게임의 평형점)

  • Kim, Yeo-Geun
    • Journal of the military operations research society of Korea
    • /
    • v.8 no.2
    • /
    • pp.57-68
    • /
    • 1982
  • Bimatrix games are the two-person non-zero-sum non-cooperative games. These games were studied by Mills, Lemke, Howson, Millham, Winkels, and others. This paper is a systematic and synthetic survey relevant to bimatrix games. Among the many aspects of researches on bimatrix games, emphasis in this paper is placed on the relation of the equilibrium set to Nash subsets. Topics discussed are as follows: Properties of equilibrium point; The structure of equilibrium set; Relation of Nash subsets to equilibrium set; Algorithm for finding the equilibrium points; Concepts of solutions on bimatrix games.

  • PDF

Transform Coding Based on Source Filter Model in the MDCT Domain

  • Sung, Jongmo;Ko, Yun-Ho
    • ETRI Journal
    • /
    • v.35 no.3
    • /
    • pp.542-545
    • /
    • 2013
  • State-of-the-art voice codecs have been developed to extend the input bandwidth to enhance quality while maintaining interoperability with a legacy codec. Most of them employ a modified discrete cosine transform (MDCT) for coding their extended band. We propose a source filter model-based coding algorithm of MDCT spectral coefficients, apply it to the ITU-T G.711.1 super wideband (SWB) extension codec, and subjectively test it to validate the model. A subjective test shows a better quality over the standardized SWB codec.

The State of Art of Structural Control Systems (토목 구조 제어 시스템의 현황)

  • 김기봉;홍창국
    • Journal of KSNVE
    • /
    • v.3 no.2
    • /
    • pp.127-135
    • /
    • 1993
  • The structural control systems for civil engineering structures have got considerable attention in recent years, since they become effective protective systems. The key idea behind structural control is to keep the response of a structure within certain bounds dictated by serviceability, structural safety, and reliability. Recent activities in control algorithm development and control system design and practical aspects of their applications are sumarized, followed by a discussion on prossible future directions.

  • PDF