• Title/Summary/Keyword: weighted algorithm

Search Result 1,105, Processing Time 0.025 seconds

Neuro-Fuzzy Network-based Depression Diagnosis Algorithm Using Optimal Features of HRV (뉴로-퍼지 신경망 기반 최적의 HRV특징을 이용한 우울증진단 알고리즘)

  • Zhang, Zhen-Xing;Tian, Xue-Wei;Lim, Joon-S.
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.2
    • /
    • pp.1-9
    • /
    • 2012
  • This paper presents an algorithm for depression diagnosis using the Neural Network with Weighted Fuzzy Membership functions (NEWFM) and heart rate variability (HRV). In the algorithm, 22 different features were initially extracted from the HRV signal by frequency domain, time domain, wavelet transformed, and Poincar$\acute{e}$ transformed feature extraction methods; of these 6 optimal features were selected by significance evaluation using Non-overlap Area Distribution Measurement (NADM) based on NEWFM. The proposed algorithm uses these 6 optimal features to diagnose depression with an accuracy of 95.83%.

A Reserved Band-Based Probabilistic Cell Scheduling Algorithm for Input Buffered ATM Switches (입력 단 저장 방식 ATM 스위치의 예약 대역폭에 기반 한 셀 스케쥴링 알고리듬)

  • 이영근;김진상;김진상
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.1A
    • /
    • pp.114-121
    • /
    • 2000
  • The problem of an input-buffered switch is the HOL(head-of-line) blocking which limits the maximum throughput but it is easy to implement in hardware. However, HOL blocking can be eliminated using aVOQ(virtual-output-queueing) technique. 0 this paper, we propose a new cell-scheduling algorithm for aninput-buffered ATM switch. The proposed algorithm, called PPIM(Probabilistic Parallel Iterative Matching), imposesa weight to every request based on the reserved bandwidth. It is shown that the input-buffered ATM switch withthe proposed PPIM algorithm not only provides high throughput and low delay but it also reduces the jitter,compared with the existing WPIM(Weighted PIM).

  • PDF

Improvement of COMS Land Surface Temperature Retrieval Algorithm

  • Hong, Ki-Ok;Suh, Myoung-Seok;Kang, Jeon-Ho
    • Korean Journal of Remote Sensing
    • /
    • v.25 no.6
    • /
    • pp.507-515
    • /
    • 2009
  • Land surface temperature (LST) is a key environmental variable in a wide range of applications, such as weather, climate, hydrology, and ecology. However, LST is one of the most difficult surface variables to observe regularly due to the strong spatio-temporal variations. So, we have developed the LST retrieval algorithm from COMS (Communication, Ocean and Meteorological Satellite) data through the radiative transfer simulations under various atmospheric profiles (TIGR data), satellite zenith angle (SZA), spectral emissivity, and surface lapse rate conditions using MODTRAN 4. However, the LST retrieval algorithm has a tendency to overestimate and underestimate the LST for surface inversion and superadiabatic conditions, respectively. To minimize the overestimation and underestimation of LST, we also developed day/night LST algorithms separately based on the surface lapse rate (local time) and recalculated the final LST by using the weighted sum of day/night LST. The analysis results showed that the quality of weighted LST of day/night algorithms is greatly improved compared to that of LST estimated by original algorithm regardless of the surface lapse rate, spectral emissivity difference (${\Delta}{\varepsilon}$) SZA, and atmospheric conditions. In general, the improvements are greatest when the surface lapse rate and ${\Delta}{\varepsilon}$ are negatively large (strong inversion conditions and less vegetated surface).

A Study on the Effective Arc Sensing by the Use of the Weighted-Arc-Current in Flux-Cored Arc Welding for Fillet Joints (가중용접전류를 이용한 FCAW 필릿용접용 아크센싱 알고리즘 연구)

  • 권순창;최재성
    • Journal of Welding and Joining
    • /
    • v.18 no.1
    • /
    • pp.83-90
    • /
    • 2000
  • It was attempted to improve seam-tracking performance by applying a new arc-sensing algorithm for FCAW(flux-cored arc welding) process in fillet joints. For this study the authors have introduced three different weight factors: $\circled1$ arc currents at the weaving end are more weighted, $\circled2$ arc currents are evenly weighted along the weaving, and $\circled3$ arc currents at the weaving center are more weighted. To evaluate the 3 factors the values of signal-to-noise(S/N) ratio has been measured. The values were obtained for various welding conditions with different gaps in horizontal and vertical fillet joints. The test results showed that the S/N ratio of the 1st case was highest which resulted in the best of seam tracking performance. In addition, the comparison between the seam tracking performance in horizontal fillet joints and that in vertical ones has been done, and the result showed that tracking performance in vertical joints was relatively better than that in horizontal joints.

  • PDF

Weighted Prediction considering Global Brightness Variation and Local Brightness Variation in HEVC (전체적 밝기 변화와 지역적 밝기 변화를 고려한 HEVC에서의 가중치 예측)

  • Lim, Sung-won;Moon, Joo-hee
    • Journal of Broadcast Engineering
    • /
    • v.20 no.4
    • /
    • pp.489-496
    • /
    • 2015
  • In this paper, a new weighted prediction scheme is proposed to improve the coding efficiency for video scenes containing brightness variations. Conventional weighted prediction is applied by the reference picture and use only one weighted parameter set. Thus, it is only useful for GBV(Glabal Brightness Variation). In order to solve this problem, the proposed algorithm use three kind of schemes depending on situation. Experimental results show that maximum coding efficiency gain of the proposed method is up to 10.2% in luminance. Average computional time complexity is increased about 163% in encoder and about 101% in decoder.

Weighted Bayesian Automatic Document Categorization Based on Association Word Knowledge Base by Apriori Algorithm (Apriori알고리즘에 의한 연관 단어 지식 베이스에 기반한 가중치가 부여된 베이지만 자동 문서 분류)

  • 고수정;이정현
    • Journal of Korea Multimedia Society
    • /
    • v.4 no.2
    • /
    • pp.171-181
    • /
    • 2001
  • The previous Bayesian document categorization method has problems that it requires a lot of time and effort in word clustering and it hardly reflects the semantic information between words. In this paper, we propose a weighted Bayesian document categorizing method based on association word knowledge base acquired by mining technique. The proposed method constructs weighted association word knowledge base using documents in training set. Then, classifier using Bayesian probability categorizes documents based on the constructed association word knowledge base. In order to evaluate performance of the proposed method, we compare our experimental results with those of weighted Bayesian document categorizing method using vocabulary dictionary by mutual information, weighted Bayesian document categorizing method, and simple Bayesian document categorizing method. The experimental result shows that weighted Bayesian categorizing method using association word knowledge base has improved performance 0.87% and 2.77% and 5.09% over weighted Bayesian categorizing method using vocabulary dictionary by mutual information and weighted Bayesian method and simple Bayesian method, respectively.

  • PDF

A Minimum Cut Algorithm Using Maximum Adjacency Merging Method of Undirected Graph (무방향 그래프의 최대인접병합 방법을 적용한 최소절단 알고리즘)

  • Choi, Myeong-Bok;Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.1
    • /
    • pp.143-152
    • /
    • 2013
  • Given weighted graph G=(V,E), n=|V|, m=|E|, the minimum cut problem is classified with source s and sink t or without s and t. Given undirected weighted graph without s and t, Stoer-Wagner algorithm is most popular. This algorithm fixes arbitrary vertex, and arranges maximum adjacency (MA)-ordering. In the last, the sum of weights of the incident edges for last ordered vertex is computed by cut value, and the last 2 vertices are merged. Therefore, this algorithm runs $\frac{n(n-1)}{2}$ times. Given graph with s and t, Ford-Fulkerson algorithm determines the bottleneck edges in the arbitrary augmenting path from s to t. If the augmenting path is no more exist, we determine the minimum cut value by combine the all of the bottleneck edges. This paper suggests minimum cut algorithm for undirected weighted graph with s and t. This algorithm suggests MA-merging and computes cut value simultaneously. This algorithm runs n-1 times and successfully divides V into disjoint S and V sets on the basis of minimum cut, but the Stoer-Wagner is fails sometimes. The proposed algorithm runs more than Ford-Fulkerson algorithm, but finds the minimum cut value within n-1 processing times.

Fuzzy Q-learning using Weighted Eligibility (가중 기여도를 이용한 퍼지 Q-learning)

  • 정석일;이연정
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2000.11a
    • /
    • pp.163-167
    • /
    • 2000
  • The eligibility is used to solve the credit-assignment problem which is one of important problems in reinforcement learning. Conventional eligibilities which are accumulating eligibility and replacing eligibility make ineffective use of rewards acquired in learning process. Because only an executed action in a visited state is learned by these eligibilities. Thus, we propose a new eligibility, called the weighted eligibility with which not only an executed action but also neighboring actions in a visited state are to be learned. The fuzzy Q-learning algorithm using proposed eligibility is applied to a cart-pole balancing problem, which shows improvement of learning speed.

  • PDF

A weighted similarity coefficient method for manufacturing cell formation (제조셀 형성을 위한 가중치 유사성계수 방법)

  • 오수철;조규갑
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1995.04a
    • /
    • pp.122-129
    • /
    • 1995
  • This paper presents a similarity coefficient based approach to the problem of machine-part grouping for cellular manufacturing. The method uses relevant production data such as part type, production volume, routing sequence to make machine cells and part families for cell formation. A new similarity coefficient using weighted factors is introduced and an algorithm for formation of machine cells and part families is developed. A comparative study of two similarity coefficients - Gupta and seifoddini's method and proposed method - is conducted. A software program using TURBO C has been developed to verify the implementation.

  • PDF

Fuzzy c-Regression Using Weighted LS-SVM

  • Hwang, Chang-Ha
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2005.10a
    • /
    • pp.161-169
    • /
    • 2005
  • In this paper we propose a fuzzy c-regression model based on weighted least squares support vector machine(LS-SVM), which can be used to detect outliers in the switching regression model while preserving simultaneous yielding the estimates of outputs together with a fuzzy c-partitions of data. It can be applied to the nonlinear regression which does not have an explicit form of the regression function. We illustrate the new algorithm with examples which indicate how it can be used to detect outliers and fit the mixed data to the nonlinear regression models.

  • PDF