• Title/Summary/Keyword: Local Search Methods

Search Result 218, Processing Time 0.025 seconds

A Study on the Support location Optimizations of the Beams using the Genetic Algorithm and the Sensitivity Analysis. (민감도가 고려된 유전 알고리듬을 이용한 보 구조물의 지지점 최적화에 관한 연구)

  • 이재관;신효철
    • Journal of KSNVE
    • /
    • v.10 no.5
    • /
    • pp.783-791
    • /
    • 2000
  • This describes a study on the support location optimizations of the beams using the genetic algorithm and the sensitivity analysis. The genetic algorithm is a probabilistic method searching the optimum at several points simultaneously and requiring only the values of the object and constraint functions. It has therefore more chances to find the global solution and can be applied to the various problems. Nevertheless, it has such a shortcoming that it takes too many calculations, because it is ineffective in local search. While the traditional method using sensitivity analysis is of great advantage in searching the near optimum. thus the combination of the two techniques will make use of the individual advantages, that is, the superiority in global searching form the genetic algorithm and that in local searching form the sensitivity analysis. In this thesis, for the practical applications, the analysis is conducted by FEB ; and as the shapes of structures are taken as the design variation, it requires re-meshing for every analysis. So if it is not properly controlled, the result of the analysis is affected and the optimized solution amy not be the real one. the method is efficiently applied to the problems which the traditional methods are not working properly.

  • PDF

Local Context based Feature Extraction for Efficient Face Detection (효율적인 얼굴 검출을 위한 지역적 켄텍스트 기반의 특징 추출)

  • Rhee, Phill-Kyu;Xu, Yong Zhe;Shin, Hak-Chul;Shen, Yan
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.1
    • /
    • pp.185-191
    • /
    • 2011
  • Recently, the surveillance system is highly being attention. Various Technologies as detecting object from image than determining and recognizing if the object are person are universally being used. Therefore, In this paper shows detecting on this kind of object and local context based facial feather detection algorithm is being advocated. Detect using Gabor Bunch in the same time Bayesian detection method for revision to find feather point is being described. The entire system to search for object area from image, context-based face detection, feature extraction methods applied to improve the performance of the system.

A Study on Modeling Gateway for Interworking Between Local Area Network and ISDN (근거리 통신망과 ISDN의 연동을 위한 게이트웨이 모델링에 관한 연구)

  • 전주경;허기택;이동호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.8
    • /
    • pp.823-836
    • /
    • 1992
  • Computer and communication network of the future will be the ISDN that enable various services. And now, it Is very Important to study the relevalent techniques to develop Interworking methods between existing computer network and ISDN The purpose of this paper Is to provide necessary basic He search results on the Interworkting method between local area network (LAN) and ISDN. For Interworking, we analyze the characteristic of existing LAN and ISDN and discuss considerations of Interworking and suggest the interworking method for CO and CL services. Also. we construct logical gateway for Interworking betwen LAN and ISDN and make formairnodeling of gateway using Petri net and verify the correctness of protocol with reachability tree. Research results should be helpful In designing and Implementing gateway between i()cal computer network and I SDN

  • PDF

Mithun (Bos frontalis): the neglected cattle species and their significance to ethnic communities in the Eastern Himalaya - A review

  • Dorji, Tashi;Wangdi, Jigme;Shaoliang, Yi;Chettri, Nakul;Wangchuk, Kesang
    • Animal Bioscience
    • /
    • v.34 no.11
    • /
    • pp.1727-1738
    • /
    • 2021
  • Objective: This review consolidates the available information on the socio-economic and ecological significance of Mithun in the lives of ethnic communities in the Eastern Himalaya. Methods: Standard guidelines were followed for the review and data collection was carried out at three stages; literature search, literature screening, and literature review and analysis. Results: Records indicate a long association of Mithun with the ethnic groups. Mithun serves as a symbol of pride and local currency for barter trade in the ethnic society. Its utilities range from being used as a bride price to settling legal disputes. Several cultural festivals and local ceremonies are celebrated around this bovine. Due to its semi-wild nature, this animal also has an ecological role to conserve broad leaf sub-tropical forests. However, it remains neglected and has not received policy attention, leading to a stagnated growth. The institutions for Mithun research and development are also weak. Furthermore, the species is under threat from new diseases and habitat alteration triggered by climate change. Conclusion: Founded on the current state of knowledge, there is a need for institutional development, strengthening institutional linkages, and promoting regional cooperation among Mithun rearing countries for further research and development of this unique cattle.

Improvement of Ant Colony Optimization Algorithm to Solve Traveling Salesman Problem (순회 판매원 문제 해결을 위한 개미집단 최적화 알고리즘 개선)

  • Jang, Juyoung;Kim, Minje;Lee, Jonghwan
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.42 no.3
    • /
    • pp.1-7
    • /
    • 2019
  • It is one of the known methods to obtain the optimal solution using the Ant Colony Optimization Algorithm for the Traveling Salesman Problem (TSP), which is a combination optimization problem. In this paper, we solve the TSP problem by proposing an improved new ant colony optimization algorithm that combines genetic algorithm mutations in existing ant colony optimization algorithms to solve TSP problems in many cities. The new ant colony optimization algorithm provides the opportunity to move easily fall on the issue of developing local optimum values of the existing ant colony optimization algorithm to global optimum value through a new path through mutation. The new path will update the pheromone through an ant colony optimization algorithm. The renewed new pheromone serves to derive the global optimal value from what could have fallen to the local optimal value. Experimental results show that the existing algorithms and the new algorithms are superior to those of existing algorithms in the search for optimum values of newly improved algorithms.

Clinical Research Trends on Acupuncture Treatment for Trigeminal Neuralgia - Based on PubMed (삼차신경통의 침 치료에 대한 임상연구 동향 - PubMed를 중심으로)

  • Hea-Sun Chun
    • The Journal of Korean Medicine Ophthalmology and Otolaryngology and Dermatology
    • /
    • v.37 no.2
    • /
    • pp.74-94
    • /
    • 2024
  • Objectives : This study was conducted to analyze the trends of international clinical research on acupuncture treatment for trigeminal neuralgia. Methods : A total of 14 clinical researches were selected by using PubMed, an international online database, to search for clinical researches written in English and Chinese. Selected papers were analyzed according to study characteristics, study subjects, acupuncture treatment methods, treatment results, evaluation index, safety, and adverse event reports. Results : Acupuncture was mostly used in combination with other treatment methods. The most commonly used acupuncture point was the 'Xiaguan(ST7)', and 11 acupuncture points belonging to the 'Stomach meridian' were used. In most researches, selection of local points and distant points were taken simultaneously, with some researches taking acupuncture points according to trigeminal nerve branch. There were significant improvements in most outcome measures after treatment compared to pre-treatment, and most adverse events disappeared without treatment or decreased or disappeared after grand therapy. Conclusion : According to this study, acupuncture treatment for trigeminal neuralgia was performed in various ways and was found to be effective and safe. However, it is necessary to confirm more meaningful results by supplementing the limitations of existing researches in the future.

Development of Slope Stability Analysis Method Based on Discrete Element Method and Genetic Algorithm I. Estimation (개별요소법과 유전자 알고리즘에 근거한 사면안정해석기법의 개발 I. 검증)

  • Park Hyun-Il;Park Jun;Hwang Dae-Jin;Lee Seung-Rae
    • Journal of the Korean Geotechnical Society
    • /
    • v.21 no.4
    • /
    • pp.115-122
    • /
    • 2005
  • In this paper, a new method composed of discrete element method and genetic algorithm has been introduced to estimate the safety factor and search critical slip surface on slope stability analysis. In case of estimating the safety factor, conventional methods of slope analysis based on the limit equilibrium do not satisfy the overall equilibrium condition; they must make assumptions regarding the inclination and location of the interstice forces. An alternative slope analysis method based on the discrete element method, which can consider the compatibility condition between force and displacement, is presented. Real-coded genetic algorithm is applied to the search for the minimum factor of safety in proposed analysis method. This search method is shown to be more robust than simple optimization routines, which are apt to find local minimum. Examples are also shown to demonstrate the applicability of the proposed method.

An Application of k-Means Clustering to Vehicle Routing Problems (K-Means Clustering의 차량경로문제 적용연구)

  • Ha, Je-Min;Moon, Geeju
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.38 no.3
    • /
    • pp.1-7
    • /
    • 2015
  • This research is to develop a possible process to apply k-means clustering to an efficient vehicle routing process under time varying vehicle moving speeds. Time varying vehicle moving speeds are easy to find in metropolitan area. There is a big difference between the moving time requirements of two specific delivery points. Less delivery times are necessary if a delivery vehicle moves after or before rush hours. Various vehicle moving speeds make the efficient vehicle route search process extremely difficult to find even for near optimum routes due to the changes of required time between delivery points. Delivery area division is designed to simplify this complicated VRPs due to time various vehicle speeds. Certain divided area can be grouped into few adjacent divisions to assume that no vehicle speed change in each division. The vehicle speeds moving between two delivery points within this adjacent division can be assumed to be same. This indicates that it is possible to search optimum routes based upon the distance between two points as regular traveling salesman problems. This makes the complicated search process simple to attack since few local optimum routes can be found and then connects them to make a complete route. A possible method to divide area using k-means clustering is suggested and detailed examples are given with explanations in this paper. It is clear that the results obtained using the suggested process are more reasonable than other methods. The suggested area division process can be used to generate better area division promising improved vehicle route generations.

Improvement of the GA's Convergence Speed Using the Sub-Population (보조 모집단을 이용한 유전자 알고리즘의 수렴속도 개선)

  • Lee, Hong-Kyu;Lee, Jae-Oh
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.10
    • /
    • pp.6276-6281
    • /
    • 2014
  • Genetic Algorithms (GAs) are efficient methods for search and optimization problems. On the other hand, there are some problems associated with the premature convergence to local optima of the multimodal function, which has multi peaks. The problem is related to the lack of genetic diversity of the population to cover the search spaces sufficiently. A sharing and crowding method were introduced. This paper proposed strategies to improve the convergence speed and the convergence to the global optimum for solving the multimodal optimization function. These strategies included the random generated sub-population that were well-distributed and spread widely through search spaces. The results of the simulation verified the effects of the proposed method.

On the Design Technique and VLSI Structure for a Multiplierless Quincuncial Interpolation Filter (무곱셈 대각 보간 필터의 설계 및 VLSI 구현에 관한 연구)

  • 최진우;이상욱
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.8
    • /
    • pp.54-65
    • /
    • 1992
  • A huge amount of multiplications is required for 2-D filtering on the image data, making it difficult to implement a real-time quincuncial interpolator. In this paper, efficient design technique and VLSI structures for 2-D multipleierless filter are presented. In the filter design, by introducing an efficient scheme for discretizing the frequency response of the prototype filter, it is shown that a significant amount of the computational burden required in the conventional techniques, such as local search, branch and bound techniques, could be saved. In the case of 5$\times$5 filter, it is found that the design technique described in this paper could save about 80% of the computation time, compared to the conventional methods, while providing a comparable performance. For a hardware implementation, two different VLSI structures for 2-D multiplierless filter are also introduced in the paper : One is for block parallel processing and the other for scan-line parallel processing. In both structure, the AP(area-period) figure improves over Wu's structure[4].

  • PDF