• Title/Summary/Keyword: simulated annealing algorithm

Search Result 411, Processing Time 0.024 seconds

A Study on Wireless LAN Topology Configuration for Enhancing Indoor Location-awareness and Network Performance (실내 위치 인식 및 네트워크 성능 향상을 고려한 무선 랜 토폴로지 구성 방안에 관한 연구)

  • Kim, Taehoon;Tak, Sungwoo
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.4
    • /
    • pp.472-482
    • /
    • 2013
  • This paper proposes a wireless LAN topology configuration method for enhancing indoor location-awareness and improving network performance simultaneously. We first develop four objective functions that yield objective goals significant to the optimal design of a wireless LAN topology in terms of location-awareness accuracy and network performance factors. Then, we develop metaheuristic algorithms such as simulated annealing, tabu search, and genetic algorithm that examine the proposed objective functions and generate a near-optimal solution for a given objective function. Finally, four objective functions and metaheuristic algorithms developed in this paper are exploited to evaluate and measure the performance of the proposed wireless LAN topology configuration method.

Performance Improvement on MFCM for Nonlinear Blind Channel Equalization Using Gaussian Weights (가우시안 가중치를 이용한 비선형 블라인드 채널등화를 위한 MFCM의 성능개선)

  • Han, Soo-Whan;Park, Sung-Dae;Woo, Young-Woon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.407-412
    • /
    • 2007
  • 본 논문에서는 비선형 블라인드 채널등화기의 구현을 위하여 가우시안 가중치(gaussian weights)를 이용한 개선된 퍼지 클러스터(Modified Fuzzy C-Means with Gaussian Weights: MFCM_GW) 알고리즘을 제안한다. 제안된 알고리즘은 기존 FCM 알고리즘의 유클리디언 거리(Euclidean distance) 값 대신 Bayesian Likelihood 목적함수(fitness function)와 가우시안 가중치가 적용된 멤버쉽 매트릭스(partition matrix)를 이용하여, 비선형 채널의 출력으로 수신된 데이터들로부터 최적의 채널 출력 상태 값(optimal channel output states)들을 직접 추정한다. 이렇게 추정된 채널 출력 상태 값들로 비선형 채널의 이상적 채널 상태(desired channel states) 벡터들을 구성하고, 이를 Radial Basis Function(RBF) 등화기의 중심(center)으로 활용함으로써 송신된 데이터 심볼을 찾아낸다. 실험에서는 무작위 이진 신호에 가우시안 잡음이 추가된 데이터를 사용하여 기존의 Simplex Genetic Algorithm(GA), 하이브리드 형태의 GASA(GA merged with simulated annealing (SA)), 그리고 과거에 발표되었던 MFCM 등과 그 성능을 비교 분석하였으며, 가우시안 가중치가 적용된 MFCM_GW를 이용한 채널등화기가 상대적으로 정확도와 속도 면에서 우수함을 보였다.

  • PDF

An Application of Overlap Avoidance to Augment the Production Data in Pipe Installation Drawings (배관설치도 내 생산정보 증강을 위한 겹침 회피 알고리즘의 적용)

  • Hwang, InHyuck;Ruy, WonSun;Park, InHa;Park, JungSeo
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.53 no.5
    • /
    • pp.428-434
    • /
    • 2016
  • A lot of drawings for pipe construction and installation are needed to construct plant process system on the offshore plant structures. Depending on their scale or complexity, the required number of drawings related pipes sometimes amounts to several hundreds of thousands. Most major shipyards, therefore, have their own system which can automatically depict pipes’ geometric, manufacturing, and BOM(Bill of Material) information on the drawings. However, as the complexity and absolute quantity in the isometric region on the drawings is increased, the information extraction from the customized DB and positioning at the typical locations does not get to be enough to avoid the overlap between geometric contours, labels, and symbols. For this reason, the novel methods to arrange additional annotations without overlaps are presented in the paper. This approach is expected to increase the readability and legibility of the drawing and prevent the human error, and finally decrease the time-consuming and tedious jobs which are unnecessarily required to designers.

A DFT and QSAR Study of Several Sulfonamide Derivatives in Gas and Solvent

  • Abadi, Robabeh Sayyadi kord;Alizadehdakhel, Asghar;Paskiabei, Soghra Tajadodi
    • Journal of the Korean Chemical Society
    • /
    • v.60 no.4
    • /
    • pp.225-234
    • /
    • 2016
  • The activity of 34 sulfonamide derivatives has been estimated by means of multiple linear regression (MLR), artificial neural network (ANN), simulated annealing (SA) and genetic algorithm (GA) techniques. These models were also utilized to select the most efficient subsets of descriptors in a cross-validation procedure for non-linear -log (IC50) prediction. The results obtained using GA-ANN were compared with MLR-MLR, MLR-ANN, SA-ANN and GA-ANN approaches. A high predictive ability was observed for the MLR-MLR, MLR-ANN, SA-ANN and MLR-GA models, with root mean sum square errors (RMSE) of 0.3958, 0.1006, 0.0359, 0.0326 and 0.0282 in gas phase and 0.2871, 0.0475, 0.0268, 0.0376 and 0.0097 in solvent, respectively (N=34). The results obtained using the GA-ANN method indicated that the activity of derivatives of sulfonamides depends on different parameters including DP03, BID, AAC, RDF035v, JGI9, TIE, R7e+, BELM6 descriptors in gas phase and Mor 32u, ESpm03d, RDF070v, ATS8m, MATS2e and R4p, L1u and R3m in solvent. In conclusion, the comparison of the quality of the ANN with different MLR models showed that ANN has a better predictive ability.

Structural Design for a Jaw Using Metamodels

  • Bang, Il-Kwon;Kang, Dong-Heon;Han, Dong-Seop;Han, Geun-Jo;Lee, Kwon-Hee
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.2
    • /
    • pp.329-334
    • /
    • 2006
  • Rail clamps are mechanical components installed to fix the container crane to its bottoms from wind blast or slip. Rail clamps should be designed to survive the harsh wind loading condition. In this study, the jaw structure that is one part of wedge-typed rail clamp is optimized, considering strength under the severe wind loading condition. According to the classification of structural optimization, the structural optimization of a jaw belongs to shape optimization. In the conventional structural optimization methods, they have difficulties in defining complex shape design variables and preventing mesh distortions. To overcome the difficulties, the metamodel using kriging interpolation method is introduced, replacing true response by approximate one. This research presents the shape optimization of a jaw using iterative kriging interpolation models and simulated annealing algorithm. The new kriging models are iteratively constructed by refining the former kriging models. This process is continued until the convergence criteria are satisfied. The optimum results obtained by the suggested method are compared with those obtained by the DOE (design of experiments) and VT (variation technology) methods built in ANSYS WORKBENCH.

  • PDF

Matched-target Model Inversion for the Position Estimation of Moving Targets (정합-표적모델 역산을 이용한 기동 표적의 위치 추정)

  • 장덕홍;박홍배;김성일;류존하;김광태
    • The Journal of the Acoustical Society of Korea
    • /
    • v.22 no.7
    • /
    • pp.562-572
    • /
    • 2003
  • A matched-target model inversion method was developed for a passive sonar to estimate the position of moving targets. Based on the well known matched-field processing in underwater acoustics, the method finds target position by matching the measured target directions and frequencies with the corresponding values of the proposed target model. For the efficient and accurate estimations, the parameter searching was accomplished using a hybrid optimizing method, which first starts with a global optimization such as generic algorithm or simulated annealing then applies a local optimization of a simple down hill algorithm. The suggested method was testified using simulations for three different moving scenarios. The simulation results showed that the method is robust in convergence, even under the situation of over 5 times standard deviation of Gaussian distribution of measured error, and is practical in calculation time as well.

Band Selection Algorithm based on Expected Value for Pixel Classification (픽셀 분류를 위한 기댓값 기반 밴드 선택 알고리즘)

  • Chang, Duhyeuk;Jung, Byeonghyeon;Heo, Junyoung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.6
    • /
    • pp.107-112
    • /
    • 2022
  • In an embedded system such as a drone, it is difficult to store, transfer and analyze the entire hyper-spectral image to a server in real time because it takes a lot of power and time. Therefore, the hyper-spectral image data is transmitted to the server through dimension reduction or compression pre-processing. Feature selection method are used to send only the bands for analysis purpose, and these algorithms usually take a lot of processing time depending on the size of the image, even though the efficiency is high. In this paper, by improving the temporal disadvantage of the band selection algorithm, the time taken 24 hours was reduced to around 60-180 seconds based on the 40000*682 image resolution of 8GB data, and the use of 7.6GB RAM was significantly reduced to 2.3GB using 45 out of 150 bands. However, in terms of pixel classification performance, more than 98% of analysis results were derived similarly to the previous one.

Development of a Design System for Multi-Stage Gear Drives (2nd Report: Development of a Generalized New Design Algorithm) (다단 치차장치 설계 시스템 개발에 관한 연구(제 2보: 일반화된 신설계 알고리즘의 개발))

  • Chong, Tae-Hyong;Bae, In-Ho;Park, Gyung-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.17 no.10
    • /
    • pp.192-199
    • /
    • 2000
  • The design of multi-stage gear drives is a time-consuming process because it includes more complicated problems, which are not considered in the design of single-stage gear drives. The designer has no determine the number of reduction stages and the gear ratios of each reduction stage. In addition, the design problems include not only dimensional design but also configuration design of gear drive elements. There is no definite rule or principle for these types of design problems. Thus the design practices largely depend on the sense and the experiences of the designer, and consequently result in undesirable design solution. A new and generalized design algorithm has been proposed to support the designer at the preliminary phase of the design of multi-stage gear drives. The proposed design algorithm automates the design process by integrating the dimensional design and the configuration design process. The algorithm consists of four steps. In the first step, the user determines the number of reduction stages. In the second step, gear ratios of every stage are chosen using the random search method. The values of the basic design parameters of a gear are chose in the third step by using the generate and test method. Then the values of the dimensions, such as pitch diameter, outer diameter and face width, are calculated for the configuration design in the next step. The strength and durability of each gear is guaranteed by the bending strength and the pitting resistance rating practices by using AGMA rating formulas. In the final step, the configuration design is carried out using simulated annealing algorithm. The positions of gears and shafts are determined to minimize the geometrical volume (size) of a gearbox while avoiding interferences between them. These steps are carried out iteratively until a desirable solution is acquired. The proposed design algorithm is applied to the preliminary design of four-stage gear drives in order to validate the availability. The design solution has considerably good results in both aspects of the dimensional and the configuration design.

  • PDF

Time Domain of Algorithm for The Detection of Freezing of Gait(FOG) in Patients with Parkinson's Disease (파킨슨병 환자의 보행동결 검출을 위한 시간영역 알고리즘)

  • Park, S.H.;Kwon, Y.R.;Kim, J.W.;Eom, G.M.;Lee, J.H.;Lee, J.W.;Lee, S.M.;Koh, S.B.
    • Journal of Biomedical Engineering Research
    • /
    • v.34 no.4
    • /
    • pp.182-188
    • /
    • 2013
  • This study aims to develop a practical algorithm which can detect freezing of gait(FOG) in patients with Parkinson's disease(PD). Eighteen PD patients($68.8{\pm}11.1yrs.$) participated in this study, and three($68.7{\pm}4.0yrs.$) of them showed FOG. We suggested two time-domain algorithms(with 1-axis or 3-axes acceleration signals) and compared them with the frequency-domain algorithm in the literature. We measured the acceleration of left foot with a 3-axis accelerometer inserted at the insole of a shoe. In the time-domain method, the root-mean-square(RMS) acceleration was calculated in a moving window of 4s and FOG was defined as the periods during which RMS accelerations located within FOG range. The parameters in each algorithm were optimized for each subject using the simulated annealing method. The sensitivity and specificity were same, i.e., $89{\pm}8%$ for the time-domain method with 1-axis acceleration and were $91{\pm}7%$ and $90{\pm}8%$ for the time-domain method with 3-axes acceleration, respectively. Both performances were better in the time-domain methods than in the frequency-domain method although the results were statistically insignificant. The amount of calculation in the time-domain method was much smaller than in the frequency-domain method. Therefore it is expected that the suggested time domain algorithm would be advantageous in the systematic implementation of FOG detection.

A case study on optimal location modeling of battery swapping & charging facility for the electric bus system (전기버스를 위한 배터리 자동 교환-충전인프라 배치 최적화 모형개발 및 적용 사례 분석)

  • Kim, Seung-Ji;Kim, Wonkyu;Kim, Byung Jong;Im, Hyun Seop
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.12 no.1
    • /
    • pp.121-135
    • /
    • 2013
  • This paper propose an efficient algorithm for selecting electric bus charging facility location. In nature, the optimal charging facility location problem is similar to Set Covering Problem. Set Covering Problem is the problem of covering all the rows of an $m{\times}n$ matrix of ones and zeros by a subset of columns with a minimal cost. It has many practical applications of modeling of real world problems. The Set Covering Problem has been proven to be NP-Complete. In order to overcome the computational complexity involved in seeking optimal solutions, this paper present an enhanced greedy algorithm and simulated annealing algorithm. In this paper, we apply the developed algorithm to Seoul's public bus system.