• Journal of the Korean Statistical Society
• /
• v.25 no.1
• /
• pp.145-151
• /
• 1996

The local behaviour of the surface formed by the perturbed maximum likelihood estimator of the squared Mahalanobis distance is investigated. The study of the local behaviour allows a simultaneous perturbation on the samples of interest and it is effective in identifying influential observations.

• Kyungpook Mathematical Journal
• /
• v.61 no.3
• /
• pp.671-677
• /
• 2021

For a distance-regular graph with valency k, second largest eigenvalue r and diameter D, it is known that r ≥ $min\{\frac{{\lambda}+\sqrt{{\lambda}^2+4k}}{2},\;a_3\}$ if D = 3 and r ≥ $\frac{{\lambda}+\sqrt{{\lambda}^2+4k}}{2}$ if D ≥ 4, where λ = a₁. This result can be generalized to the class of edge-regular graphs. For an edge-regular graph with parameters (v, k, λ) and diameter D ≥ 4, we compare $\frac{{\lambda}+\sqrt{{\lambda}^2+4k}}{2}$ with the local valency λ to find a relationship between the second largest eigenvalue and the local valency. For an edge-regular graph with diameter 3, we look at the number $\frac{{\lambda}-\bar{\mu}+\sqrt{({\lambda}-\bar{\mu})^2+4(k-\bar{\mu})}}{2}$, where $\bar{\mu}=\frac{k(k-1-{\lambda})}{v-k-1}$, and compare this number with the local valency λ to give a relationship between the second largest eigenvalue and the local valency. Also, we apply these relationships to distance-regular graphs.

• Communications for Statistical Applications and Methods
• /
• v.20 no.1
• /
• pp.23-28
• /
• 2013

We propose a version of Cook's distance (called local distance) in the multivariate linear model. The proposed version is a matrix, while the existing version of Cook's distance (called global distance) is a scalar. The existing Cook's distance is the trace of the proposed Cook's distance. In addition, we argue that the proposed Cook's distance has a more natural extension of the Cook's distance in the univariate linear model than the existing Cook's distance. An illustrative example based on a real data set is given.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.12
• /
• pp.1-12
• /
• 1996

A new local path planning algorithm using DPH (distance profile histogram) is suggested in this paper. The proposed method makes a grid type world map using distance values from multiple ultrasonic sensors and genrates local points through which the mobile robot can avoid obstcles safely. The DPH (distance profile historgram) represents geometrical arrangement of obstacles around the robot in the local polar coordinate system which is assumed to be atached to the robot. To control robot's navigation, a three-layered control structure is adopted. The proposed local path planning algorithm is placed on the top level. And a point-to-point translation controller takes the middle level. The bottom level consists of a velcoity servo and sonar driver modules which take charge of driving physical hardwares. The validity of the propsoed method is demonstated through several experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5474-5490
• /
• 2017

Although two-dimensional principal component analysis (2DPCA) has been shown to be successful in face recognition system, it is still very sensitive to illumination variations. To reduce the effect of these variations, texture-based techniques are used due to their robustness to these variations. In this paper, we explore several texture-based techniques and determine the most appropriate one to be used with 2DPCA-based techniques for face recognition. We also propose a new distance metric computation in 2DPCA called Row Assembled Matrix Distance (RowAMD). Experiments on Yale Face Database, Extended Yale Face Database B, AR Database and LFW Database reveal that the proposed RowAMD distance computation method outperforms other conventional distance metrics when Local Line Binary Pattern (LLBP) and Multi-scale Block Local Binary Pattern (MB-LBP) are used for face authentication and face identification, respectively. In addition to this, the results also demonstrate the robustness of the proposed RowAMD with several texture-based techniques.

• Journal of the Korean Data and Information Science Society
• /
• v.26 no.2
• /
• pp.465-474
• /
• 2015

In this paper, we study the local influence analysis of LIU type estimator in the linear mixed models. Using the method proposed by Shi (1997), the local influence of LIU type estimator in three disturbance models are investigated respectively. Furthermore, we give the generalized Cook's distance to assess the influence, and illustrate the efficiency of the proposed method by example.

• Journal of Korean Society of Rural Planning
• /
• v.19 no.2
• /
• pp.93-105
• /
• 2013

In recent years, over 100 trails were created in Korea, and Jeju Olle and Jiri Mt. Doolle trail are the most familiar and successful trails in Korea. The research aimed to find relationship between fair tourism and long distance trails. In the first step, we investigated the concept of fair tourism, and deducted 8 key-words; 1)local participation 2)resource sharing 3)provision of unique social, cultural resources 4)sovereignty of local culture 5)small_scale, low impact, eco-friendly 6)sustainable infrastructure 7)revitalize local community 8)comprehensive accommodation of a diverse tourists. Through the analysis of 3 representative sites of long distance trails, we tried to find out the distinct characteristics of fair tourism of the selected sites with evaluating criteria that was provided by UNEP and related organizations. The finding of the study could contribute to defining concept of fair tourism, and by doing so, attribute in setting up a framework of designing and planning of long distance trail under the concept of fair tourism that diverse parties could co-benefit, including local community, local government and tourists.

• Journal of The Korean Astronomical Society
• /
• v.28 no.2
• /
• pp.169-175
• /
• 1995

Deep V I CCD photometry of the Pegasus dwarf irregular galaxy shows that the tip of the red giant branch (RGB) is located at I = $21.15{\pm}0.10$ mag and (V - I) = $1.58{\pm}0.03$. Using the I magnitude of the tip of the RGB (TRGB), the distance modulus of the Pegasus galaxy is estimated to be $(m\;-\;M)_o\;=\;25.13{\pm}0.11$ mag (corresponding to a distance of d = $1060{\pm}50$ kpc). This result is in a good agreement with the recent distance estimate based on the TRGB method by Aparicio [1994, ApJ, 437, L27],$ (m\;-\;M)_o$ = 24.9 (d = 950 kpc). However, our distance estimate is much smaller than that based on the Cepheid variable candidates by Hoessel et al.[1990, AJ, 100, 1151], $(m\;-\;M)_o\;=\;26.22{\pm}0.20$ (d = $1750{\pm}160$ kpc) mag. The color-magnitude diagram illustrates that the Cepheid candidates used by Hoessel et al.are not located in the Cepheid instability strip, but in the upper part of the giant branch. This result shows that the Cepheid candidates studied by Hoessel et al.are probably not Cepheids, but other types of variable stars. Taking the average of our distance estimate and Aparicio's, the distance to the Pegasus galaxy is d= $1000{\pm}80$ kpc. Considering the distance and velocity of the Pegasus galaxy with respect to the center of the Local Group, we conclude that the Pegasus galaxy is probably a member of the Local Group.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.3
• /
• pp.932-951
• /
• 2021

The effectiveness of testing in Model-based Testing (MBT) for Software Product Line (SPL) can be achieved by considering fault detection in test case. The lack of fault consideration caused test case in test suite to be listed randomly. Test Case Prioritization (TCP) is one of regression techniques that is adaptively capable to detect faults as early as possible by reordering test cases based on fault detection rate. However, there is a lack of studies that measured faults in MBT for SPL. This paper proposes a Test Case Prioritization (TCP) approach based on dissimilarity and string based distance called Last Minimal for Local Maximal Distance (LM-LMD) with Dice-Jaro-Winkler Dissimilarity. LM-LMD with Dice-Jaro-Winkler Dissimilarity adopts Local Maximum Distance as the prioritization algorithm and Dice-Jaro-Winkler similarity measure to evaluate distance among test cases. This work is based on the test case generated from statechart in Software Product Line (SPL) domain context. Our results are promising as LM-LMD with Dice-Jaro-Winkler Dissimilarity outperformed the original Local Maximum Distance, Global Maximum Distance and Enhanced All-yes Configuration algorithm in terms of Average Fault Detection Rate (APFD) and average prioritization time.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1609-1614
• /
• 2003

This paper presents a new method driving multiple robots to their goal position without collision. To consider the movement of the robots in a work area, we adopt the concept of avoidability measure. To implement the concept in collision avoidance of multiple robots, relative distance between the robots is proposed. The relative distance is a virtual distance between robots indicating the threat of collision between the robots. Based on the relative distance, the method calculates repulsive force against a robot from the other robots. Also, attractive force toward the goal position is calculated in terms of the relative distance. The proposed method is simulated for several cases. The results show that the proposed method steers robots to open space anticipating the approach of other robots. The proposed method works as a local collision-free motion coordination method in conjunction with higher level of task planning and path planning method for multiple robots to do a collaborative job.