• Title/Summary/Keyword: 시간 가중치

Search Result 791, Processing Time 0.03 seconds

An Efficient Application of XML Schema Matching Technique to Structural Calculation Document of Bridge (XML 스키마 매칭 기법의 교량 구조계산서 적용 방안)

  • Park, Sang Il;Kim, Bong-Geun;Lee, Sang-Ho
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.32 no.1D
    • /
    • pp.51-59
    • /
    • 2012
  • An efficient application method of XML schema matching technique to the document structure of structural calculation document (SCD) of bridge is proposed. With 30 case studies, a parametric study on weightings of name, sibling, child, and parent elements of XML scheme component that are used in the similarity measure of XML schema matching technique has been performed, and suitable weighting to analyze document structure of SCD is suggested. A simplified formula for quantification of similarity is also introduced to reduce computation time in huge scale document structure of SCDs. Numerical experiments show that the suggested method can increase the accuracy of XML schema matching by 10% with suitable weighting parameters, and can maintain almost the same accuracy without weighting parameters compared to previous studies. In addition, computation time can be reduced dramatically when the proposed simplified formula for the quantification of similarity is used. In the numerical experiments of testing 20 practical SCDs of bridges, the suggested method is superior to previous studies in the accuracy of analyzing document structure and 4 to 460 times faster than the previous results in computation time.

Linearization Effect of Weight Programming about Time in Memristor Bridge Synapse (신경회로망용 멤리스터 브릿지 회로에서 가중치 프로그램의 시간에 대한 선형화 효과)

  • Choi, Hyuncheol;Park, Sedong;Yang, Changju;Kim, Hyongsuk
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.4
    • /
    • pp.80-87
    • /
    • 2015
  • Memristor is a new kind of memory device whose resistance varies depending upon applied charge and whose previous resistance state is preserved even when its power is off. Ordinary memristor has a nonlinear programming characteristics about time when a constant voltage is applied. For the easiness of programming, it is desirable that resistance is programmed linearly about time. We had proposed previously a memristor bridge configuration with which weight can be programmed nicely in positive, negative or zero. In memristor bridge circuit, two memristors are connected in series with different polarity. Memristors are complementary each other and it follows that the memristance variation is linear with respect to time. In this paper, the linearization effect of weight programming of memristor bridge synapse is investigated and verified about both $TiO_2$ memristor from HP and a nonlinear memristor with a window function. Memristor bridge circuit would be helpful to conduct synaptic weight programming.

The Artificial Neural Network based Electric Power Demand Forecast using a Season and Weather Informations (계절 및 날씨 정보를 이용한 인공신경망 기반 전력수요 예측 알고리즘 개발)

  • Kim, Meekyeong;Hong, Chuleui
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.1
    • /
    • pp.71-78
    • /
    • 2016
  • This paper proposes the new electric power demand forecast model which is based on an artificial neural network and considers time and weather factors. Time factors are selected by measuring the autocorrelation coefficients of load demand in summer and winter seasons. Weather factors are selected by using Pearson correlation coefficient The important weather factors are temperature and dew point because the correlation coefficients between these factors and load demand are much higher than those of the other factors such as humidities, air pressures and wind speeds. The experimental results show that the proposed model using time and seasonal weather factors improves the load demand forecasts to a great extent.

Sliding Mode Controller Design Considering Weight (가중치를 고려한 슬라이딩 모드 제어기 설계)

  • 임동균;서병설
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.4 no.3
    • /
    • pp.223-230
    • /
    • 1999
  • A conventional sliding mode control approach is often impractical or difficult when it is applied to high order process b because the number of tuning parameters in the sliding mode controller increases with the order of the plant. C Camacho(l996) proposed a design method of a fixed structure sliding mode controller based on a first order plus dead t time approximation to the higher-order process. But, his method has such problems as chattering, over‘shoot, and c command following due to the Taylor the approximation en‘ors for the time delay term of the first order model. In this p paper, a new design technique for a sliding mode controller based on the modified Taylor approximation considered a w weight is developed to improve the Camacho's problems.

  • PDF

Accuracy Comparison of According to Method of Rainfall Analysis and Development of Transform formula (강우분석 방법에 따른 정확도 비교·분석 및 변환식 개발)

  • Kang, Bo-Seong;Yang, Sung-Kee;Kim, Yong-Seok
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2018.05a
    • /
    • pp.165-165
    • /
    • 2018
  • 이상기후로 인한 일강우량의 경신이 빈번하게 발생함에 따라 홍수피해 위험이 증가하고 있다. 최근 해안지대와 근접한 제주시와 서귀포시 도심부근에서 200 mm 이상의 일강우량이 빈번하게 발생하고 있으며, 한라산 정상 부근에서 500 mm 이상의 강우 발생빈도도 증가하고 있다. 특히, 2014년에 발생한 태풍 '나크리'는 기상청 관측 사상 최대인 1,500 mm의 일강우량을 기록하는 등 호우재해로 인한 피해 위험도가 증가하고 있다. 호우재해로 인한 홍수피해를 저감시키기 위해서는 정확한 홍수량 산정을 통한 계획수립이 매우 중요하다. 홍수량 산정 시 필수조건인 강우자료는 면적 개념의 면적평균 강우량이 필요하며 대표적 방법으로 티센다각형법이 있다. 티센다각형법은 현재 실무에서 가장 많이 사용되는 방법으로 쉽게 산정할 수 있으나 고도에 따른 강수 변화를 고려하지 못하는 단점이 있다. 이에 따라 제주도와 같은 산악지형에 적합한 방법을 고려하기 위하여 등우선법을 활용한 면적평균 강우량 산정 후 티센다각형법과 비교하였다. 티센다각형법은 관측소마다 관측된 강우량에 관측소 주위로 작도한 티센다각형의 면적 비를 가중치로 부여하는 방법으로 빠른 시간 안에 면적평균 강우량을 산정할 수 있는 반면, 등우선법은 등우선간 평균강우량에 등우선간 면적을 가중치로 부여하기 때문에 시간별 혹은 일별 등우선을 매번 작도해야 하는 점과 오랜 시간이 걸린다는 단점이 있다. 이에 따라 본 연구에서는 제주시 도심하천을 기준으로 티센다각형법과 등우선법 간 변환식을 개발하여 효율적인 면적평균 강우량 산정이 가능하도록 하였다.

  • PDF

Exponential Smoothing Temporal Association Rules for Recommendation of Temperal Products (시간 의존적인 상품 추천을 위한 지수 평활 시간 연관 규칙)

  • Jeong Kyeong Ja
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.1 s.33
    • /
    • pp.45-52
    • /
    • 2005
  • We proposed the product recommendation algorithm mixed the temporal association rule and the exponential smoothing method. The temporal association rule added a temporal concept in a commercial association rule In this paper. we proposed a exponential smoothing temporal association rule that is giving higher weights to recent data than past data. Through simulation and case study in temporal data sets, we confirmed that it is more Precise than existing temporal association rules but consumes running time.

  • PDF

Learning Heuristics for Tactical Path-finding in Computer Games (컴퓨터 게임에서 전술적 경로 찾기를 위한 휴리스틱 학습)

  • Yu, Kyeon-Ah
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.9
    • /
    • pp.1333-1341
    • /
    • 2009
  • Tactical path-finding in computer games is path-finding where a path is selected by considering not only basic elements such as the shortest distance or the minimum time spend but also tactical information of surroundings when deciding character's moving trajectory. One way to include tactical information in path-finding is to represent a heuristic function as a sum of tactical quality multiplied by a weighting factor which is.. determined based on the degree of its importance. The choice of weighting factors for tactics is very important because it controls search performance and the characteristic of paths found. In this paper. we propose a method for improving a heuristic function by adjusting weights based on the difference between paths on examples given by a level designer and paths found during the search process based on the CUITent weighting factors. The proposed method includes the search algorithm modified to detect search errors and learn heuristics and the perceptron-like weight updating formular. Through simulations it is demonstrated how different paths found by tactical path-finding are from those by traditional path-finding. We analyze the factors that affect the performance of learning and show the example applied to the real game environments.

  • PDF

Particle Motion Interpolation Method for Mitigating the Occurrence of Unnatural Wave Breaking in Fluid Simulation (유체 시뮬레이션에서 부자연스러운 쇄파의 발생을 완화하기 위한 파티클 움직임 보간 방법)

  • Sung, Su-Kyung;Lee, Eun-Seok;Shin, Byeong-Seok
    • Journal of Korea Game Society
    • /
    • v.14 no.3
    • /
    • pp.55-62
    • /
    • 2014
  • In particle-based fluid simulation, applying sudden power to particle raise unnatural flow when wave is breaking. To solve this problem, we have used an linear interpolation technique that interpolate between fluid particle by subdividing the time interval in the previous work. Acceleration vector of the particle with increased pressure in boundary could change smoothly. However, particle looks like flow with viscosity because the number of the minimum samples to interpolate increases. We propose an weighted-interpolation technique to represent the realistic movement of fluid. it is accumulating that has added and assigned different weights to the previous acceleration vector and current one repeatedly. weighted-interpolation technique using less minium samples to flow than linear interpolation, so it can solve the problem which particle looks like flow with viscosity.

Improvements of pursuit performance using episodic parameter optimization in probabilistic games (에피소드 매개변수 최적화를 이용한 확률게임에서의 추적정책 성능 향상)

  • Kwak, Dong-Jun;Kim, H.-Jin
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.40 no.3
    • /
    • pp.215-221
    • /
    • 2012
  • In this paper, we introduce an optimization method to improve pursuit performance of a pursuer in a pursuit-evasion game (PEG). Pursuers build a probability map and employ a hybrid pursuit policy which combines the merits of local-max and global-max pursuit policies to search and capture evaders as soon as possible in a 2-dimensional space. We propose an episodic parameter optimization (EPO) algorithm to learn good values for the weighting parameters of a hybrid pursuit policy. The EPO algorithm is performed while many episodes of the PEG are run repeatedly and the reward of each episode is accumulated using reinforcement learning, and the candidate weighting parameter is selected in a way that maximizes the total averaged reward by using the golden section search method. We found the best pursuit policy in various situations which are the different number of evaders and the different size of spaces and analyzed results.

An Empirical Study on Improving the Performance of Text Categorization Considering the Relationships between Feature Selection Criteria and Weighting Methods (자질 선정 기준과 가중치 할당 방식간의 관계를 고려한 문서 자동분류의 개선에 대한 연구)

  • Lee Jae-Yun
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.39 no.2
    • /
    • pp.123-146
    • /
    • 2005
  • This study aims to find consistent strategies for feature selection and feature weighting methods, which can improve the effectiveness and efficiency of kNN text classifier. Feature selection criteria and feature weighting methods are as important factor as classification algorithms to achieve good performance of text categorization systems. Most of the former studies chose conflicting strategies for feature selection criteria and weighting methods. In this study, the performance of several feature selection criteria are measured considering the storage space for inverted index records and the classification time. The classification experiments in this study are conducted to examine the performance of IDF as feature selection criteria and the performance of conventional feature selection criteria, e.g. mutual information, as feature weighting methods. The results of these experiments suggest that using those measures which prefer low-frequency features as feature selection criterion and also as feature weighting method. we can increase the classification speed up to three or five times without loosing classification accuracy.