• Title/Summary/Keyword: Rank system

Search Result 672, Processing Time 0.027 seconds

A Study on the Rank System of Official Uniforms of Qing Dynasty (청조 관복제도의 등급체계에 관한 연구 (제1보))

  • 박현정
    • Journal of the Korean Society of Costume
    • /
    • v.53 no.1
    • /
    • pp.17-34
    • /
    • 2003
  • This paper investigates the rank system of official uniforms of Qing dynasty to analyze ethnic characteristics of the official uniforms. As a research document, Qing Huidian Tu(청회전도) has been used. The official uniforms of Qing dynasty were chao-fu(조복), ji-fu(길복), chang-fu(상복), hang-fu(행복), and yu-fu(우복), which were used in different occasions. Each of the five official uniforms had distinct items. For example, chao-fu(조복) consisted of four items: chao-guan(조관), chao-fu(조복), chao-dai(조대), and chao-zhu(조주), and ji-fu(길복) consisted of four items: ji-fu-guan(길복관), long-pao(용포), ji-fu-dai(길복대), and chao-zhu(조주). Each of these items had elements that made distinction between ranks. This research shows that the important elements to make distinction between ranks were textiles, precious stones, patterns and colors, and additionally the number of Bo(보) and the types of Bo(보) were used.

Design of a Fixed-Structure H$_{\infty}$ Power System Stabilizer (고정 구조를 가지는$H_\infty$ 전력계통 안정화 장치 설계)

  • Kim Seog-Joo;Lee Jong-Moo;Kwon Soonman;Moon Young-Hyun
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.53 no.12
    • /
    • pp.655-660
    • /
    • 2004
  • This paper deals with the design of a fixed-structure $H_\infty$ power system stabilizer (PSS) by using an iterative linear matrix inequality (LMI) method. The fixed-structure $H_\infty$ controller is represented in terms of LMIs with a rank condition. To solve the non-convex rank-constrained LMI problem, a linear penalty function is incorporated into the objective function so that minimizing the penalized objective function subject to LMIs amounts to a convex optimization problem. With an increasing sequence of the penalty parameter, the solution of the penalized optimization problem moves towards the feasible region of the original non-convex problem. The proposed algorithm is, therefore, convergent. Numerical experiments show the practical applicability of the proposed algorithm.

Implementation Techniques to Apply the PageRank Algorithm (페이지랭크 알고리즘 적용을 위한 구현 기술)

  • Kim, Sung-Jin;Lee, Sang-Ho;Bang, Ji-Hwan
    • The KIPS Transactions:PartD
    • /
    • v.9D no.5
    • /
    • pp.745-754
    • /
    • 2002
  • The Google search site (http://www.google.com), which was introduced in 1998, implemented the PageRank algorithm for the first time. PageRank is a ranking method based on the link structure of the Web pages. Even though PageRank has been implemented and being used in various commercial search engines, implementation details did not get documented well, primarily due to business reasons. Implementation techniques introduced in [4,8] are not sufficient to produce PageRank values of Web pages. This paper explains the techniques[4,8], and suggests major data structure and four implementation techniques in order to apply the PageRank algorithm. The paper helps understand the methods of applying PageRank algorithm by means of showing a real system that produces PageRank values of Web pages.

Reverberation Characterization and Suppression by Means of Low Rank Approximation (낮은 계수 근사법을 이용한 표준 잔향음 신호 획득 및 제거 기법)

  • 윤관섭;최지웅;나정열
    • The Journal of the Acoustical Society of Korea
    • /
    • v.21 no.5
    • /
    • pp.494-502
    • /
    • 2002
  • In this paper, the Low Rank Approximation (LRA) method to suppress the interference of signals from temporal fluctuations is applied. The reverberation signals and temporally fluctuating signals are separated from the measured data using the Ink. The Singular value decomposition (SVD) method is applied to extract the low rank and the temporally stable reverberation was extracted using the LRA. The reverberation suppression is performed on the LRA residual value obtained by removing the approximate reverberation signals. In overall, the method can be applied to the suppression of reververation in active sonar system as well as to the modeling of reverberation.

Efficient Link Adaptation Scheme using Precoding for LTE-Advanced Uplink MIMO (LTE-Advanced에서 프리코딩에 의한 효율적인 상향링크 적응 방식)

  • Park, Ok-Sun;Ahn, Jae-Min
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.2B
    • /
    • pp.159-167
    • /
    • 2011
  • LTE-Advanced system requires uplink multi-antenna transmission in order to achieve the peak spectral efficiency of 15bps/Hz. In this paper, the uplink MIMO system model for the LTE-Advanced is proposed and an efficient link adaptation shceme using precoding is considered providing error rate reduction and system capacity enhancement. In particular, the proposed scheme determines a transmission rank by selecting the optimal wideband precoding matrix, which is based on the derived signal-to-interference and noise ratio (SINR) for the minimum mean squared error (MMSE) receivers of $2{\times}4$ multiple input multiple output (MIMO). The proposed scheme is verified by simulation with a practical MIMO channel model. The simulation results of average block-error-rate(BLER) reflect that the gain due to the proposed rank adapted transmission over full-rank transmission is evident particularly in the case of lower modulation and coding scheme (MCS) and high mobility, which means the severe channel fading environment.

Importance Assessment of Multiple Microgrids Network Based on Modified PageRank Algorithm

  • Yeonwoo LEE
    • Korean Journal of Artificial Intelligence
    • /
    • v.11 no.2
    • /
    • pp.1-6
    • /
    • 2023
  • This paper presents a comprehensive scheme for assessing the importance of multiple microgrids (MGs) network that includes distributed energy resources (DERs), renewable energy systems (RESs), and energy storage system (ESS) facilities. Due to the uncertainty of severe weather, large-scale cascading failures are inevitable in energy networks. making the assessment of the structural vulnerability of the energy network an attractive research theme. This attention has led to the identification of the importance of measuring energy nodes. In multiple MG networks, the energy nodes are regarded as one MG. This paper presents a modified PageRank algorithm to assess the importance of MGs that include multiple DERs and ESS. With the importance rank order list of the multiple MG networks, the core MG (or node) of power production and consumption can be identified. Identifying such an MG is useful in preventing cascading failures by distributing the concentration on the core node, while increasing the effective link connection of the energy flow and energy trade. This scheme can be applied to identify the most profitable MG in the energy trade market so that the deployment operation of the MG connection can be decided to increase the effectiveness of energy usages. By identifying the important MG nodes in the network, it can help improve the resilience and robustness of the power grid system against large-scale cascading failures and other unexpected events. The proposed algorithm can point out which MG node is important in the MGs power grid network and thus, it could prevent the cascading failure by distributing the important MG node's role to other MG nodes.

A Speaker Pruning Method for Real-Time Speaker Identification System

  • Kim, Min-Joung;Suk, Soo-Young;Jeong, Jong-Hyeog
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.10 no.2
    • /
    • pp.65-71
    • /
    • 2015
  • It has been known that GMM (Gaussian Mixture Model) based speaker identification systems using ML (Maximum Likelihood) and WMR (Weighting Model Rank) demonstrate very high performances. However, such systems are not so effective under practical environments, in terms of real time processing, because of their high calculation costs. In this paper, we propose a new speaker-pruning algorithm that effectively reduces the calculation cost. In this algorithm, we select 20% of speaker models having higher likelihood with a part of input speech and apply MWMR (Modified Weighted Model Rank) to these selected speaker models to find out identified speaker. To verify the effectiveness of the proposed algorithm, we performed speaker identification experiments using TIMIT database. The proposed method shows more than 60% improvement of reduced processing time than the conventional GMM based system with no pruning, while maintaining the recognition accuracy.

SEMILOCAL CONVERGENCE OF NEWTON'S METHOD FOR SINGULAR SYSTEMS WITH CONSTANT RANK DERIVATIVES

  • Argyros, Ioannis K.;Hilout, Said
    • The Pure and Applied Mathematics
    • /
    • v.18 no.2
    • /
    • pp.97-111
    • /
    • 2011
  • We provide a semilocal convergence result for approximating a solution of a singular system with constant rank derivatives, using Newton's method in an Euclidean space setting. Our approach uses more precise estimates and a combination of two Lipschitz-type conditions leading to the following advantages over earlier works [13], [16], [17], [29]: tighter bounds on the distances involved, and a more precise information on the location of the solution. Numerical examples are also provided in this study.

Reduced Rank Eigen-Space Beamforming for Adaptive Array Systems (적응형 배열 안테나를 위한 감소 차수 고유 공간 빔형성 알고리즘)

  • Hyeon, Seung-Heon;Choi, Seung-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.4C
    • /
    • pp.336-341
    • /
    • 2008
  • In this paper, beamforming algorithm is proposed which can obtain diversity gain in beamforming system that deploy antenna elements with half-wavelength. The proposed algorithm provides beam-pattern using eigen-vectors that span received signal subspace. The criterion to decide optimal rank of eigen-space used for beamforming is also proposed. A beamforming system applied the proposed algorithm shows better performance with diversity gain as getting larger angle spread. This paper provides a description of proposed algorithm with analysis of the performance using various computer simulations.

Analysing the Combined Kerberos Timed Authentication Protocol and Frequent Key Renewal Using CSP and Rank Functions

  • Kirsal-Ever, Yoney;Eneh, Agozie;Gemikonakli, Orhan;Mostarda, Leonardo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.12
    • /
    • pp.4604-4623
    • /
    • 2014
  • Authentication mechanisms coupled with strong encryption techniques are used for network security purposes; however, given sufficient time, well-equipped intruders are successful for compromising system security. The authentication protocols often fail when they are analysed critically. Formal approaches have emerged to analyse protocol failures. In this study, Communicating Sequential Processes (CSP) which is an abstract language designed especially for the description of communication patterns is employed. Rank functions are also used for verification and analysis which are helpful to establish that some critical information is not available to the intruder. In order to establish this, by assigning a value or rank to each critical information, it is shown that all the critical information that can be generated within the network have a particular characterizing property. This paper presents an application of rank functions approach to an authentication protocol that combines delaying the decryption process with timed authentication while keys are dynamically renewed under pseudo-secure situations. The analysis and verification of authentication properties and results are presented and discussed.