• 제목/요약/키워드: pseudo rank

검색결과 20건 처리시간 0.018초

Ecological Attributes of Species Composition by Topographical Positions in the Natural Deciduous Forest

  • Kim, Ji-Hong;Lee, Hye-Seon;Hwang, Gwang-Mo
    • Journal of Forest and Environmental Science
    • /
    • 제27권1호
    • /
    • pp.17-22
    • /
    • 2011
  • Based upon the vegetation data of woody plants by plot sampling method in the natural deciduous forest of Mt. Jeombong, the study was carried out to examine importance value, rank abundance curve, and species abundance curve, and comparatively evaluate seven different species diversity indices for Shannon-Wiener index, Simpson index, McIntosh index, Log series, Margalef index, Berger-Parker index, and species richness, according to topographic positions. The minimal area which meant only few more species were increased was 3.48 ha in total. The dominant species of valley were Carpinus cordata, Acer pseudo-sieboldianum, Quercus mongolica, Acer mono, and Abies holophylla, and the dominant species of mid-slope were Quercus mongolica, Acer pseudo-sieboldianum, Carpinus cordata, Tilia amurensis, and Fraxinus rhynchophylla. Moreover, the dominant species of ridge were Quercus mongolica, Acer pseudo-sieboldianum, Tilia amurensis, Fraxinus rhynchophylla, and Acer mono. According to rank abundance curve and species abundance curve, species evenness was also low. All of Log series, species richness, Margalef, and Shannon-Wiener index discriminated that valley had the highest diversity, and ridge had the lowest diversity; but, Simpson index, McIntosh index, and Berger-Parker index represented that mid-slope had the highest diversity, and ridge had the lowest diversity. Uniquely, in Berger-Parker index, mid-slope was the higher value than total.

고정비용 0-1 배낭문제에 대한 크바탈-고모리 부등식의 분리문제에 관한 연구 (On the Separation of the Rank-1 Chvatal-Gomory Inequalities for the Fixed-Charge 0-1 Knapsack Problem)

  • 박경철;이경식
    • 한국경영과학회지
    • /
    • 제36권2호
    • /
    • pp.43-50
    • /
    • 2011
  • We consider the separation problem of the rank-1 Chvatal-Gomory (C-G) inequalities for the 0-1 knapsack problem with the knapsack capacity defined by an additional binary variable, which we call the fixed-charge 0-1 knapsack problem. We analyze the structural properties of the optimal solutions to the separation problem and show that the separation problem can be solved in pseudo-polynomial time. By using the result, we also show that the existence of a pseudo-polynomial time algorithm for the separation problem of the rank-1 C-G inequalities of the ordinary 0-1 knapsack problem.

Ordinal Rank 알고리즘을 이용한 자동 PIF 추출 - 변화탐지를 위한 상대방사정규화를 목적으로 (Automatic Extraction of Pseudo Invariant Features using Ordinal Rank Algorithm for Radiometric Normalization)

  • 한유경;김대성;김용일
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2008년도 춘계학술대회 논문집
    • /
    • pp.213-218
    • /
    • 2008
  • 동일 지점을 촬영한 위성영상은 위성의 센서나 영상의 취득 시기, 지형의 상태 등에 따라 그 지점에 나타나는 화소값이 일정하지 않다. 이러한 영상은 영상간 모자이크나 변화 탐지 결과에 영향을 미칠 가능성이 높으므로 방사보정(또는 방사정규화)을 통해 화소값의 차이를 최소화시킬 필요가 있다. 본 연구는 선형회귀식을 적용한 상대 방사정규화에 초점을 맞추고 있으며, 선형회귀식 구성에 필요한 PIF(Pseudo Invariant Feature)를 자동으로 추출하기 위해 Ordinal Rank 알고리즘을 적용하였다. 이 방법을 통해 각 밴드별 후보 PIF를 추출하고, 공통으로 해당되는 최종 PIF를 추출할 수 있었다. RMSE(Root Mean Square Error), Dynamic range, Coefficient of variation 등을 통해 방사보정 후의 결과를 평가해보았다. 영상회귀를 이용한 방사보정알고리즘과의 비교를 통해 제안된 알고리즘이 갖는 장점을 확인하였다.

  • PDF

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)
    • /
    • 제8권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.

A comparison of testing methods in non-inferiority clinical trials

  • Jieun Park;Jae Won Lee
    • Communications for Statistical Applications and Methods
    • /
    • 제31권6호
    • /
    • pp.613-625
    • /
    • 2024
  • A general non-inferiority (NI) clinical trial is typically conducted using parametric testing methods with large samples. However, patient recruitment challenges often hinder rare disease trials, leading to enrollment failures. In this study, we introduce current parametric and nonparametric NI trial testing methods and propose modifications to enhance the performance of the nonparametric approach. Through a comprehensive simulation study with various sample sizes, data distributions, and sample ratios, we compare empirical levels and statistical powers as criteria for evaluating performance. Our findings indicate that the modified nonparametric methods outperformed the existing methods, particularly under conditions of small sample sizes and non-normal distributions, offering valuable insights for improving the reliability and sensitivity of NI trials in the context of rare diseases.

주파수선택적 감쇄 채널에서 부호순위 통계량을 쓴 부호 획득 방법 (A code acquisition method using signed-rank statistics in frequency-selective channels)

  • 김홍길;정창용;송익호;권형문;김용석
    • 대한전자공학회논문지TC
    • /
    • 제39권2호
    • /
    • pp.69-80
    • /
    • 2002
  • 이 논문에서는 주파수선택적 라이시안 감쇄 채널에서 부호순위를 바탕으로 한 비모수 검파기를 쓰는 직접 수열 부호분할다중접속시스템의 의사잡음 부호획득 방법을 다룬다. 먼저 국소 최적 순위 검파기를 얻고, 근사점수함수를 쓴 국소 준최적 순위 검파기와 k차 고친 부호순위 검파기를 제안한다. 직렬 두 우물기법과 혼합 병렬 두 우물기법에 평균 일정오경보확률 추정기를 쓴 제곱합 검파기, 고친 부호 검파기, 국소 준최적 순위 검파기, k차 고친 부호순위 검파기를 쓴 것을 견주어 본다. 국소 준최적 순위 검파기와 k차 고친 부호순위 검파기가 평균 일정오경보확률 추정기를 쓴 제곱합 검파기보다 성능이 더 낫다는 것을 모의 실험으로 보인다.

의사연관 피드백과 퍼지 연관을 이용한 개인화 문서 스니핏 추출 방법 (Personalized Document Snippet Extraction Method using Fuzzy Association and Pseudo Relevance Feedback)

  • 박선;조광문;양후열;이성로
    • 대한전자공학회논문지SP
    • /
    • 제49권2호
    • /
    • pp.137-142
    • /
    • 2012
  • 스니핏(snippet)이란 검색엔진이 사용자에게 제공하는 웹 페이지를 대표할 수 있는 요약된 정보이다. 스니핏은 검색엔진의 페이지 순위와 함께 사용자의 페이지 방문에 큰 영향을 준다. 스니핏을 이용시 가끔 사용자의 의도와는 다른 잘못된 웹 페이지를 방문할 수 있다. 이것은 스니핏을 추출하는 방법이 사용자의 의도를 정확히 이해하는 것이 어렵기 때문이다. 본 논문은 이러한 문제를 해결하기 위해 의사연관 피드백과 퍼지 연관을 이용한 새로운 스니핏 추출 방법을 제안한다. 제안방법은 의사연관 피드백을 이용하여 사용자의 질의를 확장학고, 확장된 질의와 웹 페이지 사이에 퍼지 연관을 이용함으로써 사용자의 의도가 의미적으로 더 잘 포함되는 스니핏을 추출할 수 있다. 실험결과 제안방법이 다른 방법에 비하여서 스니핏 추출에 더 좋은 성능을 보인다.

로봇 메니퓰레이터의 제어를 위한 특이점 회피 알고리즘의 비교 연구 (Singularity Avoidance Algorithms for Controlling Robot Manipulator: A Comparative Study)

  • 김상현;박재홍
    • 로봇학회논문지
    • /
    • 제12권1호
    • /
    • pp.42-54
    • /
    • 2017
  • Using an inverse of the geometric Jacobian matrix is one of the most popular ways to control robot manipulators, because the Jacobian matrix contains the relationship between joint space velocities and operational space velocities. However, the control algorithm based on Jacobian matrix has algorithmic singularities: The robot manipulator becomes unstable when the Jacobian matrix loses rank. To solve this problem, various methods such as damped and filtered inverse have been proposed, but comparative studies to evaluate the performance of these algorithms are insufficient. Thus, this paper deals with a comparative analysis of six representative singularity avoidance algorithms: Damped Pseudo Inverse, Error Damped Pseudo Inverse, Scaled Jacobian Transpose, Selectively Damped Inverse, Filtered Inverse, and Task Transition Method. Especially, these algorithms are verified through computer simulations with a virtual model of a humanoid robot, THORMANG, in order to evaluate tracking error, computational time, and multiple task performance. With the experimental results, this paper contains a deep discussion about the effectiveness and limitations of each algorithm.

Crystal Forms of Ketorolac

  • Sohn, Young-Taek;Seo, Hyun-Ok
    • Archives of Pharmacal Research
    • /
    • 제27권3호
    • /
    • pp.357-360
    • /
    • 2004
  • Four crystal forms of ketorolac have been obtained by recrystallization in organic solvents under variable conditions. Different ketorolac polymorphs and pseudo polymorph were characterized by X-ray powder diffraction crystallography (XRD), Differential scanning calorimetry (DSC) and thermogravimetric analysis (TGA). In the dissolution studies in water at $37{\pm}0.5^{\circ}C$ four crystal forms showed different patterns. The solubility of Form I were the highest. The solubility decreased in rank order: Form I> Form II > Form III > Form IV. Form land Form III were shown to have a good physical stability at room temperature for 60 days. However, Form II is converted to Form III and Form IV is converted to Form I after 60 days storage. Therefore, these observations indicate that crystalline polymorphism for ketorolac is readily inter-convertible and the relationship may have to taken into consideration in the formulation of the drug.