• Kyungpook Mathematical Journal
• /
• v.49 no.1
• /
• pp.183-193
• /
• 2009

Pseudo-rank functions on Rickart *-rings are introduced and their properties are studied.

• Journal of Forest and Environmental Science
• /
• v.27 no.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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.36 no.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.

• Proceedings of the KSRS Conference
• /
• 2008.03a
• /
• pp.213-218
• /
• 2008

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

• 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.

• Communications for Statistical Applications and Methods
• /
• v.31 no.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.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.2
• /
• pp.69-80
• /
• 2002

In this paper, signed-rank based nonparametric detectors are used for direct sequence code division multiple access pseudo-noise code acquisition systems in frequency-selective Rician fading channels. We first derive the locally optimum rank detector, and then propose the locally suboptimum rank (LSR) and k-th order modified signed-rank (MSRk) detectors using approximate score functions. We compare the serial and hybrid parallel double-dwell schemes using the LSR and MSRk detectors with those using the conventional squared-sum (SS) using the cell averaging constant false alarm rate processor and modified sign detectors. From the simulation results, it is shown that the LSR and MSRk detectors perform better than the SS detector using the cell averaging constant false alarm rate processor.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.2
• /
• pp.137-142
• /
• 2012

Snippet is a summaries information of representing web pages which search engine provides user. Snippet and page rank in search engine abundantly influence user for visiting web pages. User sometime visits the wrong page with respect to user intention when uses snippet. The snippet extraction method is difficult to accurate comprehending user intention. In order to solve above problem, this paper proposes a new snippet extraction method using fuzzy association and pseudo relevance feedback. The proposed method uses pseudo relevance feedback to expand the use's query. It uses the fuzzy association between the expanded query and the web pages to extract snippet to be well reflected semantic user's intention. The experimental results demonstrate that the proposed method can achieve better snippet extraction performance than the other methods.

• The Journal of Korea Robotics Society
• /
• v.12 no.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.

• Archives of Pharmacal Research
• /
• v.27 no.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.