• 제목/요약/키워드: Average method

검색결과 12,519건 처리시간 0.04초

자동작곡에서 조성과 반복구성을 위한 후처리 방법 및 다수 곡 학습을 위한 평균 신경망 방법 (Postprocessing for Tonality and Repeatability, and Average Neural Networks for Training Multiple Songs in Automatic Composition)

  • 김경환;정성훈
    • 한국지능시스템학회논문지
    • /
    • 제26권6호
    • /
    • pp.445-451
    • /
    • 2016
  • 본 논문에서는 기존의 인공신경망을 이용한 자동작곡에서 음악적으로 부족한 부분을 개선하기 위해 조성을 후처리하는 방법과 멜로디에 반복성을 주는 방법 그리고 다수의 곡을 학습하기 위한 평균 신경망 방법을 제안한다. 인공신경망을 이용하여 작곡된 곡의 멜로디는 인공신경망에 학습된 곡의 멜로디에 따라서 출력되는 것으로 음악적으로 특정한 조성에 맞는 곡이 출력되지 않으며 또한 반복적인 멜로디 구성이 나오기 어렵다. 본 논문에서는 이를 해결하기 위하여 인공신경망이 출력한 멜로디를 음악이론에 따라서 특정한 조성으로 후처리하는 방법과 마디구분을 반복적으로 구성하여 멜로디 진행에 반복을 주는 방법을 제안한다. 또한 기존 연구에서 사용한 다수의 곡을 학습하는 방법은 여러 가지 단점이 있었다. 이를 해결하기 위하여 다수의 곡을 학습하는 방법으로 각 곡을 학습한 인공신경망의 가중치를 평균하여 만든 평균 인공신경망을 사용하는 것을 제안한다. 제안한 방법을 적용하여 작곡한 결과 제안한 방법이 기존의 문제점을 해결하는 것을 확인할 수 있었다.

상완 신경총 손상후 주관절 근력 회복을 위한 광배근 전이술 (Latissimus Dorsi Transfer in Brachial Plexus Injury for the Elbow Flexion)

  • 한정수;정덕환;소재호
    • Archives of Reconstructive Microsurgery
    • /
    • 제7권1호
    • /
    • pp.35-40
    • /
    • 1998
  • The incidence of brachial plexus injury is increasing because of the development of motor vehicle but the the results of treatment was reported poor due to its complex anatomical structure and changes of function and sensory during the recovery after trauma. But the results of treatment has been improved by the recently introduced high sensitive diagnostic method that can evaluate accurately the site and extent of the injury and treatment method. Restoration of the elbow flexion is the most important goal of treatment after brachial plexus injury and nerve graft, neurotization and muscle transfer were used for methods of treatment. From December 1992 to May 1994, the author performed 6 cases of latissimus dorsi transfer at the same side for the improvement of elbow flexion in the patients of brachial plexus injury. There were 5 cases of male, one case of female and average age was 22 years old. The causes of injury were traffic accident in 3 cases, gun shot injury, falldown and birth injury in each one case and in all cases, the type of injury were upper arm type. The average follow up period were 1 year 5 months ranging from 12 months to 4 years 5 months. In all cases, active elbow flexion was impossible before operation and average muscle power was grade I. We analysed the active range of motion, muscle power and the functional results. At the last follow up, range of active elbow flexion was average $124^{\circ}$ and flexion contracture was average 11 degrees and the average of muscle power was grade IV. In the functional analysis, there were two cases of excellent, three cases of good and 1 case of fair. There was no complications including wound infection, vascular compromise and donor site problem. The results of latissimus dorsi transfer for improvement elbow flexion in the patients of brachial plexus injury is one of the useful mettled for the restoration of elbow flexion.

  • PDF

USING TABU SEARCH IN CSPS

  • Gupta, D.K.
    • Journal of applied mathematics & informatics
    • /
    • 제8권1호
    • /
    • pp.181-197
    • /
    • 2001
  • A heuristic method TABU-CSP using Tabu Search (TS) is described for solving Constraint Satisfaction Problems (CSPs). The method is started with a complete but inconsistent solution of a binary CSP and obtained in prespecified number of iterations either a consistent solution or a near optimal solution with an acceptable number of conflicts. The repair in the solution at each iterative step is done by using two heuristics alternatively. The first heuristic is a min-conflicts heuristic that chooses a variable with the maximum number of conflicts and reassigns it the value which leads to the minimum number of conflicts. If the acceptable solution is not reached after the search continued for a certain number of iterations, the min-conflict heuristic is changed and the variable selected least number of times is chosen for repair. If an acceptable solution is not reached, the method switches back to the min-conflict heuristic and proceeds further. This allowed the method to explore a different region of search space space for the solution as well as to prevent cycling. The demonstration of the method is shown on a toy problem [9]which has no solution. The method is then tested on various randomly generated CSPs with different starting solutions. The performance of the proposed method in terms of the average number of consistency is checked and the average number of conflicts is conflicts is compared with that of the Branch and Bound(BB) method used to obtain the same solution. In almost all cases, the proposed method moves faster to the acceptable solution than BB.

CT Image Reconstruction of Wood Using Ultrasound Velocities II - Determination of the Initial Model Function of the SIRT Method -

  • Kim, Kwang-Mo;Lee, Jun-Jae
    • Journal of the Korean Wood Science and Technology
    • /
    • 제33권5호통권133호
    • /
    • pp.29-37
    • /
    • 2005
  • A previous study verified that the SIRT (simultaneous iterative reconstruction technique) method is more efficient than the back-projection method as a CT algorithm for wood. However, it was expected that the determination of the initial model function of the SIRT method would influence the quality of CT image. Therefore, in this study, we intended to develop a technique that could be used to determine an adequate initial model function. For this purpose, we proposed several techniques, and for each technique we examined the effects of the initial model function on the average errors and the CT image at each iteration. Through this study, it was shown that the average error was decreased and the image quality was improved using the proposed techniques. This tendency was most pronounced when the back-projection method was used to determine the initial model function. From the results of this study, we drew the following conclusions: 1) The initial model function of the SIRT method should be determined with careful attention, and 2) the back-projection method efficiently determines the initial model function of the SIRT method.

배전계통 신뢰도를 고려한 전기설비투자 우선순위 결정 기법 (An Improved Investment Priority Decision Mettled for the Electrical Facilities Considering the Reliability of Distribution Networks)

  • 박창호;채우규;장성일;김광호;김재철;박종근;최정환
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제54권4호
    • /
    • pp.177-184
    • /
    • 2005
  • This paper proposes a improved investment priority decision method of the facilities considering the reliability of distribution networks. The proposed method decides a investment order of the facilities combining, by fuzzy rules, the investment priority decision of KEPCO and the priority decision considering reliability evaluation indices. Where reliability evaluation indices are SAIFI(System Average Interruption Frequency Index) and SAIDI(System Average Interruption Duration Index), as referred to evaluation index for sustained interruption. The reliability analysis method of distribution networks applied in this paper utilizes analytic method, where the used reliability data is historical data of KEPCO. Particularly, we assumed that the failure rate increased as the equipment ages. To verify the performance of the proposed method, we applied it with the planned projects to reinforce the weak facility electrical facilities in KEPCO in 2004. The evaluation result showed that, under a limited budget, the reliability of the KEPCO in the Busan region using the proposed method can be enhanced than using the conventional KEPCO's method. Therefore, the results verify the proposed method can be efficiently used in the actual priorities method for investing the electrical facilities.

Artificial Traffic Signal Light using Fuzzy Rules

  • 김종수;홍유식
    • 한국컴퓨터산업학회논문지
    • /
    • 제5권9호
    • /
    • pp.1005-1016
    • /
    • 2004
  • 기존 교통신호등은 최적 교통신호주기기능을 상실했다. 기존 교통신호주기는 현시 교통주기와 30% -45% 가 일치하지 않고 있다. 본 논문에서는 평균 주행속도를 개선하고 평균 승용차 대기시간을 단축하기위해서 전자 교통신호등을 본 논문에서 제안한다. 본 논문에서는 실제 교통상황의 교통량, 출발 지연시간, 자동차속도 등의 40가지 센서 입력조건들을 저장하는 방법을 연구 중이다. 지능형 퍼지 기법을 이용하면, 서로 다른 10개의 교차로에 서 최 적의 녹색시간을 예측할 수 있다. 컴퓨터 모의실험 결과, 자동차 길이를 고려하지 않은 기존 교통신호등보다 . 오프셋 및 평균 자동차 대기시간을 줄일 수 있음이 입증되었다.

  • PDF

염소화법에 의한 토양 중 Polychlorinated Biphenyls의 잔유분석 (Determination of Polychlorinated Biphenyls in the Soil by Perchlorination)

  • 문철호;최상기;김정호
    • 한국환경과학회지
    • /
    • 제4권3호
    • /
    • pp.97-97
    • /
    • 1995
  • PCBs have been measured using GC-ECD, GC-MS, GC-ELCD, HPLC, TLC, NMR and Immunoassay. The analysis of PCBs using GC-ECD include the peak pattern method as none derivatization and the Perchlorination method as derivatization. This study was conducted to establish the perchlorination method with Sbcls from PCBs to decachlorinated biphenyl(DCB). The aroclor 1242 of PCBs was chlorinated and then, converted into the DCB which showed a single peak in GC-ECD chromatogram. The detection limit of DCB was 2pg. The quantification detection concentration of PCBs extracted with soxhlet was 0.5ng/g in the soil. PCBs were not detected in the suburban soil, but 174ng/g in the soil of industrial complex. Mean PCBs concentration of Shinchun stream at Kumho river and Jinchun stream at Nakdong river was calculated average 낙ngjg in 각e sediment. PCBs concentration in the sediment of Kumho river near 2-7km from conjunction with Nakdong river was average 154ng/g. PCBs concentration in the sediment of Nakdong river near conjunction with Kumho river was average 159ng/g.

염소화법에 의한 토양 중 Polychlorinated Biphenyls의 잔유분석 (Determination of Polychlorinated Biphenyls in the Soil by Perchlorination)

  • 문철호;최상기;김정호
    • 한국환경과학회지
    • /
    • 제4권3호
    • /
    • pp.249-258
    • /
    • 1995
  • PCBs have been measured using GC-ECD, GC-MS, GC-ELCD, HPLC, TLC, NMR and Immunoassay. The analysis of PCBs using GC-ECD include the peak pattern method as none derivatization and the Perchlorination method as derivatization. This study was conducted to establish the perchlorination method with Sbcls from PCBs to decachlorinated biphenyl(DCB). The aroclor 1242 of PCBs was chlorinated and then, converted into the DCB which showed a single peak in GC-ECD chromatogram. The detection limit of DCB was 2pg. The quantification detection concentration of PCBs extracted with soxhlet was 0.5ng/g in the soil. PCBs were not detected in the suburban soil, but 174ng/g in the soil of industrial complex. Mean PCBs concentration of Shinchun stream at Kumho river and Jinchun stream at Nakdong river was calculated average 낙ngjg in 각e sediment. PCBs concentration in the sediment of Kumho river near 2-7km from conjunction with Nakdong river was average 154ng/g. PCBs concentration in the sediment of Nakdong river near conjunction with Kumho river was average 159ng/g.

  • PDF

부하변동율을 이용한 선거일의 24시간 수요예측 (The 24 Hourly Load Forecasting of the Election Day Using the Load Variation Rate)

  • 송경빈
    • 전기학회논문지
    • /
    • 제59권6호
    • /
    • pp.1041-1045
    • /
    • 2010
  • Short-term electric load forecasting of power systems is essential for the power system stability and the efficient power system operation. An accurate load forecasting scheme improves the power system security and saves some economic losses in power system operations. Due to scarcity of the historical same type of holiday load data, most big electric load forecasting errors occur on load forecasting for the holidays. The fuzzy linear regression model has showed good accuracy for the load forecasting of the holidays. However, it is not good enough to forecast the load of the election day. The concept of the load variation rate for the load forecasting of the election day is introduced. The proposed algorithm shows its good accuracy in that the average percentage error for the short-term 24 hourly loads forecasting of the election days is 2.27%. The accuracy of the proposed 24 hourly loads forecasting of the election days is compared with the fuzzy linear regression method. The proposed method gives much better forecasting accuracy with overall average error of 2.27%, which improved about average error of 2% as compared to the fuzzy linear regression method.

Low-delay Node-disjoint Multi-path Routing using Complementary Trees for Industrial Wireless Sensor Networks

  • Liu, Luming;Ling, Zhihao;Zuo, Yun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권11호
    • /
    • pp.2052-2067
    • /
    • 2011
  • Complementary trees are two spanning trees rooted at the sink node satisfying that any source node's two paths to the sink node on the two trees are node-disjoint. Complementary trees routing strategy is a special node-disjoint multi-path routing approach. Several complementary trees routing algorithms have been proposed, in which path discovery methods based on depth first search (DFS) or Dijkstra's algorithm are used to find a path for augmentation in each round of path augmentation step. In this paper, a novel path discovery method based on multi-tree-growing (MTG) is presented for the first time to our knowledge. Based on this path discovery method, a complementary trees routing algorithm is developed with objectives of low average path length on both spanning trees and low complexity. Measures are employed in our complementary trees routing algorithm to add a path with nodes near to the sink node in each round of path augmentation step. The simulation results demonstrate that our complementary trees routing algorithm can achieve low average path length on both spanning trees with low running time, suitable for wireless sensor networks in industrial scenarios.