• Title/Summary/Keyword: Rank Algorithm

Search Result 283, Processing Time 0.029 seconds

Online Parameter Estimation of SPMSM using Affine Projection Algorithm (Affine Projection 알고리즘을 이용한 표면 부착형 영구자석 전동기의 온라인 파라미터 추정)

  • Moon, Byung-Hun;Kim, Hyoung-Woo;Choi, Joon-Young
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.23 no.1
    • /
    • pp.66-71
    • /
    • 2018
  • We propose an online parameter estimation method for surface-mounted permanent-magnet synchronous motor (SPMSM) using an affine projection algorithm (APA). The proposed method estimates parameters with two APAs based on the discrete-time model equation of SPMSM during motor operation. The first APA is designed to estimate inductance, and the second APA is designed to estimate resistance and flux linkage. However, in case when the d-axis current is controlled to 0A, the second APA cannot estimate resistance and flux linkage simultaneously because the matrix rank in APA becomes deficient. To overcome this problem, we temporarily inject a negative reference current input to the d-axis control loop, and the matrix in the APA then becomes full rank, which enables the simultaneous estimation of resistance and flux linkage. The proposed method is verified by PSIM simulation and an actual experiment, and the results reveal that SPMSM parameters can be estimated online during motor operation.

Analyzing the Main Paths and Intellectual Structure of the Data Literacy Research Domain (데이터 리터러시 연구 분야의 주경로와 지적구조 분석)

  • Jae Yun Lee
    • Journal of the Korean Society for information Management
    • /
    • v.40 no.4
    • /
    • pp.403-428
    • /
    • 2023
  • This study investigates the development path and intellectual structure of data literacy research, aiming to identify emerging topics in the field. A comprehensive search for data literacy-related articles on the Web of Science reveals that the field is primarily concentrated in Education & Educational Research and Information Science & Library Science, accounting for nearly 60% of the total. Citation network analysis, employing the PageRank algorithm, identifies key papers with high citation impact across various topics. To accurately trace the development path of data literacy research, an enhanced PageRank main path algorithm is developed, which overcomes the limitations of existing methods confined to the Education & Educational Research field. Keyword bibliographic coupling analysis is employed to unravel the intellectual structure of data literacy research. Utilizing the PNNC algorithm, the detailed structure and clusters of the derived keyword bibliographic coupling network are revealed, including two large clusters, one with two smaller clusters and the other with five smaller clusters. The growth index and mean publishing year of each keyword and cluster are measured to pinpoint emerging topics. The analysis highlights the emergence of critical data literacy for social justice in higher education amidst the ongoing pandemic and the rise of AI chatbots. The enhanced PageRank main path algorithm, developed in this study, demonstrates its effectiveness in identifying parallel research streams developing across different fields.

A Folksonomy Ranking Framework: A Semantic Graph-based Approach (폭소노미 사이트를 위한 랭킹 프레임워크 설계: 시맨틱 그래프기반 접근)

  • Park, Hyun-Jung;Rho, Sang-Kyu
    • Asia pacific journal of information systems
    • /
    • v.21 no.2
    • /
    • pp.89-116
    • /
    • 2011
  • In collaborative tagging systems such as Delicious.com and Flickr.com, users assign keywords or tags to their uploaded resources, such as bookmarks and pictures, for their future use or sharing purposes. The collection of resources and tags generated by a user is called a personomy, and the collection of all personomies constitutes the folksonomy. The most significant need of the folksonomy users Is to efficiently find useful resources or experts on specific topics. An excellent ranking algorithm would assign higher ranking to more useful resources or experts. What resources are considered useful In a folksonomic system? Does a standard superior to frequency or freshness exist? The resource recommended by more users with mere expertise should be worthy of attention. This ranking paradigm can be implemented through a graph-based ranking algorithm. Two well-known representatives of such a paradigm are Page Rank by Google and HITS(Hypertext Induced Topic Selection) by Kleinberg. Both Page Rank and HITS assign a higher evaluation score to pages linked to more higher-scored pages. HITS differs from PageRank in that it utilizes two kinds of scores: authority and hub scores. The ranking objects of these pages are limited to Web pages, whereas the ranking objects of a folksonomic system are somewhat heterogeneous(i.e., users, resources, and tags). Therefore, uniform application of the voting notion of PageRank and HITS based on the links to a folksonomy would be unreasonable, In a folksonomic system, each link corresponding to a property can have an opposite direction, depending on whether the property is an active or a passive voice. The current research stems from the Idea that a graph-based ranking algorithm could be applied to the folksonomic system using the concept of mutual Interactions between entitles, rather than the voting notion of PageRank or HITS. The concept of mutual interactions, proposed for ranking the Semantic Web resources, enables the calculation of importance scores of various resources unaffected by link directions. The weights of a property representing the mutual interaction between classes are assigned depending on the relative significance of the property to the resource importance of each class. This class-oriented approach is based on the fact that, in the Semantic Web, there are many heterogeneous classes; thus, applying a different appraisal standard for each class is more reasonable. This is similar to the evaluation method of humans, where different items are assigned specific weights, which are then summed up to determine the weighted average. We can check for missing properties more easily with this approach than with other predicate-oriented approaches. A user of a tagging system usually assigns more than one tags to the same resource, and there can be more than one tags with the same subjectivity and objectivity. In the case that many users assign similar tags to the same resource, grading the users differently depending on the assignment order becomes necessary. This idea comes from the studies in psychology wherein expertise involves the ability to select the most relevant information for achieving a goal. An expert should be someone who not only has a large collection of documents annotated with a particular tag, but also tends to add documents of high quality to his/her collections. Such documents are identified by the number, as well as the expertise, of users who have the same documents in their collections. In other words, there is a relationship of mutual reinforcement between the expertise of a user and the quality of a document. In addition, there is a need to rank entities related more closely to a certain entity. Considering the property of social media that ensures the popularity of a topic is temporary, recent data should have more weight than old data. We propose a comprehensive folksonomy ranking framework in which all these considerations are dealt with and that can be easily customized to each folksonomy site for ranking purposes. To examine the validity of our ranking algorithm and show the mechanism of adjusting property, time, and expertise weights, we first use a dataset designed for analyzing the effect of each ranking factor independently. We then show the ranking results of a real folksonomy site, with the ranking factors combined. Because the ground truth of a given dataset is not known when it comes to ranking, we inject simulated data whose ranking results can be predicted into the real dataset and compare the ranking results of our algorithm with that of a previous HITS-based algorithm. Our semantic ranking algorithm based on the concept of mutual interaction seems to be preferable to the HITS-based algorithm as a flexible folksonomy ranking framework. Some concrete points of difference are as follows. First, with the time concept applied to the property weights, our algorithm shows superior performance in lowering the scores of older data and raising the scores of newer data. Second, applying the time concept to the expertise weights, as well as to the property weights, our algorithm controls the conflicting influence of expertise weights and enhances overall consistency of time-valued ranking. The expertise weights of the previous study can act as an obstacle to the time-valued ranking because the number of followers increases as time goes on. Third, many new properties and classes can be included in our framework. The previous HITS-based algorithm, based on the voting notion, loses ground in the situation where the domain consists of more than two classes, or where other important properties, such as "sent through twitter" or "registered as a friend," are added to the domain. Forth, there is a big difference in the calculation time and memory use between the two kinds of algorithms. While the matrix multiplication of two matrices, has to be executed twice for the previous HITS-based algorithm, this is unnecessary with our algorithm. In our ranking framework, various folksonomy ranking policies can be expressed with the ranking factors combined and our approach can work, even if the folksonomy site is not implemented with Semantic Web languages. Above all, the time weight proposed in this paper will be applicable to various domains, including social media, where time value is considered important.

Machine-part Group Formation Methodology for Flexible Manufacturing Systems (유연생산시스템(FMS)에서의 기계-부품그룹 형성기법)

  • Ro, In-Kyu;Kwon, Hyuck-Chun
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.17 no.1
    • /
    • pp.75-82
    • /
    • 1991
  • This research is concerned with Machine-Part Group Formation(MPGF) methodology for Flexible Manufacturing Systems(FMS). The purpose of the research is to develop a new heuristic algorithm for effectively solving MPGF problem. The new algorithm is proposed and evaluated by 100 machine-part incidence matrices generated. The performance measures are (1) grouping ability of mutually exclusive block-diagonal form. (2) number of unit group and exceptional elements, and (3) grouping time. The new heuristic algorithm has the following characteristics to effectively conduct MPGF : (a) The mathematical model is presented for rapid forming the proper number of unit groups and grouping mutually exclusive block-diagonal form, (b) The simple and effective mathematical analysis method of Rank Order Clustering(ROC) algorithm is applied to minimize intra-group journeys in each group and exceptional elements in the whole group. The results are compared with those from Expert System(ES) algorithm and ROC algorithm. The results show that the new algorithm always gives the group of mutually exclusive block-diagonal form and better results(85%) than ES algorithm and ROC algorithm.

  • PDF

Function Optimization Using Quadratically Convergent Algorithms With One Dimensional Search Schemes

  • Kim, Do-Il
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.14 no.2
    • /
    • pp.25-40
    • /
    • 1988
  • In this paper, a unified method to construct a quadratically convergent algorithm with one dimensional search schemes is described. With this method, a generalized algorithm is derived. As it's particular cases, three quadratically convergent algorithms are performed. They are the rank-one algorithm (Algorithm I), projection algorithm (Algorithm II) and the Fletcher-Reeves algorithm (Algorithm III). As one-dimensional search schemes, the golden-ratio method and dichotomous search are used. Additionally, their computer programming is developed for actual application. The use of this program is provided with the explanation of how to use it, the illustrative examples that are both quadratic and nonquadratic problems and their output. Finally, from the computer output, each algorithm was analyzed from the standpoint of efficiency for performance.

  • PDF

An Improved Automated Spectral Clustering Algorithm

  • Xiaodan Lv
    • Journal of Information Processing Systems
    • /
    • v.20 no.2
    • /
    • pp.185-199
    • /
    • 2024
  • In this paper, an improved automated spectral clustering (IASC) algorithm is proposed to address the limitations of the traditional spectral clustering (TSC) algorithm, particularly its inability to automatically determine the number of clusters. Firstly, a cluster number evaluation factor based on the optimal clustering principle is proposed. By iterating through different k values, the value corresponding to the largest evaluation factor was selected as the first-rank number of clusters. Secondly, the IASC algorithm adopts a density-sensitive distance to measure the similarity between the sample points. This rendered a high similarity to the data distributed in the same high-density area. Thirdly, to improve clustering accuracy, the IASC algorithm uses the cosine angle classification method instead of K-means to classify the eigenvectors. Six algorithms-K-means, fuzzy C-means, TSC, EIGENGAP, DBSCAN, and density peak-were compared with the proposed algorithm on six datasets. The results show that the IASC algorithm not only automatically determines the number of clusters but also obtains better clustering accuracy on both synthetic and UCI datasets.

Automatic Construction of Reduced Dimensional Cluster-based Keyword Association Networks using LSI (LSI를 이용한 차원 축소 클러스터 기반 키워드 연관망 자동 구축 기법)

  • Yoo, Han-mook;Kim, Han-joon;Chang, Jae-young
    • Journal of KIISE
    • /
    • v.44 no.11
    • /
    • pp.1236-1243
    • /
    • 2017
  • In this paper, we propose a novel way of producing keyword networks, named LSI-based ClusterTextRank, which extracts significant key words from a set of clusters with a mutual information metric, and constructs an association network using latent semantic indexing (LSI). The proposed method reduces the dimension of documents through LSI, decomposes documents into multiple clusters through k-means clustering, and expresses the words within each cluster as a maximal spanning tree graph. The significant key words are identified by evaluating their mutual information within clusters. Then, the method calculates the similarities between the extracted key words using the term-concept matrix, and the results are represented as a keyword association network. To evaluate the performance of the proposed method, we used travel-related blog data and showed that the proposed method outperforms the existing TextRank algorithm by about 14% in terms of accuracy.

An Adaptive Rank-Based Reindexing Scheme for Lossless Indexed Image Compression (인덱스 이미지에서의 무손실 압축을 위한 적응적 순위 기반 재인덱싱 기법)

  • You Kang-Soo;Lee Bong-Ju;Jang Euee S.;Kwak Hoon-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.7C
    • /
    • pp.658-665
    • /
    • 2005
  • Re-assignment scheme of index in index image is called reindexing. It has been well known that index image can be reindexed without losslessness. In this paper, we introduces an adaptive rank based reindexing scheme using co-occurrence frequency between neighboring pixels. Original index image can be converted into rank image by the proposed scheme. Using the proposed scheme, a better compression efficiency can be expected because most of the reindexed values(rank) get distributed with a smaller variance than the original index image. Experinental results show that the proposed scheme achieves a much better compression performance over GIF, arithmetic coding, Zeng's algorithm and RIAC scheme.

An Efficient List Scheduling Algorithm in Distributed Heterogeneous Computing System (분산 이기종 컴퓨팅 시스템에서 효율적인 리스트 스케줄링 알고리즘)

  • Yoon, Wan-Oh;Yoon, Jung-Hee;Lee, Chang-Ho;Gim, Hyo-Gi;Choi, Sang-Bang
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.3
    • /
    • pp.86-95
    • /
    • 2009
  • Efficient DAG scheduling is critical for achieving high performance in heterogeneous computing environments. Finding an optimal solution to the problem of scheduling an application modeled by a directed acyclic graph(DAG) onto a set of heterogeneous machines is known to be an NP-complete problem. In this paper we propose a new list scheduling algorithm, called the Heterogeneous Rank-Path Scheduling(HRPS) algorithm, to exploit all of a program's available parallelism in distributed heterogeneous computing system. The primary goal of HRPS is to minimize the schedule length of applications. The performance of the algorithm has been observed by its application to some practical DAGs, and by comparing it with other existing scheduling algorithm such as CPOP, HCPT and FLB in term of the schedule length. The comparison studies show that HRPS significantly outperform CPOP, HCPT and FLB in schedule length.

Forward/Backward First Order Statistics Algorithm for the estimation of DOA in a Multipath environment (다중경로 환경에서 DOA를 추정하기 위한 Forward/Backward First Order Statistics Algorithm)

  • 김한수
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1998.06c
    • /
    • pp.221-224
    • /
    • 1998
  • 간섭신호가 원하는 신호에 coherent한 경우에는 원하는 신호와 간섭신호간의 cross correlation에 의해 공분산 행렬의 rank가 줄어들게 되어 coherent한 간섭신호의 도래각을 추정할 수 없게 된다. 이러한 문제를 해결하기 위해 발표된 기존의 방법중 대칭 어레이(Symmetric array)방법은 계산량이 많아지고 공간 스무딩(Spatial Smoothing)방법은 array aperture size에서 손해를 보게 되어 분해능이 떨어지는 단점이 있다[1,2,3].

  • PDF