• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.9
• /
• pp.1141-1145
• /
• 2018

Generally, in nuclear plants, distance relay (21R) has adapting to protect and to operate main protective of transmission lines and backup protective of main generator. Operation of 21R was required and based on exactly accurate calculation and criteria. But presently method of 21R setting has applied according to protection devices operation guide of KPX, excepting IEEE and ISA standards, which have a difference review directions, consider parameters and devices, also consideration factors were affected to relay operations by uncertain guides. therefore this paper proposed new protection relay setting method and unvague criteria from IEEE 741 and ANSI/ISA 67.04.01, and reviewed a different results through numerical calculation results for methods and criteria including previous and established 21r setting by IEEE, ANSI/ISA Technical standards.

• KIISE Transactions on Computing Practices
• /
• v.22 no.4
• /
• pp.189-194
• /
• 2016

A trajectory is the motion path of a moving object. The advances in IT have made it possible to collect an immeasurable amount of various type of trajectory data from a moving object using location detection devices like GPS. The trajectories of moving objects are widely used in many different fields of research, including the geographic information system (GIS) field. In the GIS field, several attempts have been made to automatically generate digital maps of roads by using the vehicle trajectory data. To achieve this goal, the method to cluster the trajectories on the same road is needed. Usually, the $Fr{\acute{e}}chet$ distance measure is used to calculate the distance between a pair of trajectories. However, the $Fr{\acute{e}}chet$ distance measure requires prolonged calculation time for a large amount of trajectories. In this paper, we presented a fast heuristic algorithm to distinguish whether the trajectories are in close distance or not using the discrete $Fr{\acute{e}}chet$ distance measure. This algorithm trades the accuracy of the resulting distance with decreased calculation time. By experiments, we showed that the algorithm could distinguish between the trajectory within 10 meters and the distant trajectory with 95% accuracy and, at worst, 65% of calculation reduction, as compared with the discrete $Fr{\acute{e}}chet$ distance.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.94.5-94
• /
• 2001

Unrestricted measurement method of three-dimensional walking distance utilizing body acceleration and terrestrial magnetism is discussed. The three-dimensional walking distance is derived by the integration of the three dimensional acceleration of foot during swing phase. Since the sensor system attached on the foot rotates during swing phase, the acceleration data measured on the foot include acceleration of gravity which causes inaccurate calculation of the velocity and the distance. Three gyros are used to compensate the rotation of the sensor system. Moreover, one geomagnetic sensor is employed to derive the heading direction of the subject Healthy volunteers performed ...

• International Journal of Advanced Culture Technology
• /
• v.9 no.3
• /
• pp.298-304
• /
• 2021

Currently, to prevent the spread of COVID-19 virus infection, gathering of more than 5 people in the same space is prohibited. The purpose of this paper is to measure the distance between objects using the Yolov5 model for processing real-time images with OpenCV in order to restrict the distance between several people in the same space. Also, Utilize Euclidean distance calculation method in DeepSORT and OpenCV to minimize occlusion. In this paper, to detect the distance between people, using the open-source COCO dataset is used for learning. The technique used here is using the YoloV5 model to measure the distance, utilizing DeepSORT and Euclidean techniques to minimize occlusion, and the method of expressing through visualization with OpenCV to measure the distance between objects is used. Because of this paper, the proposed distance measurement method showed good results for an image with perspective taken from a higher position than the object in order to calculate the distance between objects by calculating the y-axis of the image.

• Steel and Composite Structures
• /
• v.26 no.3
• /
• pp.375-386
• /
• 2018

Existing design codes for steel-concrete composite structures give only general information about the shear connection provided by headed studs in group arrangement. Grouting of the openings in prefabricated concrete slabs, where the grouped headed studs are placed in the deck pockets is alternative to cast-in-place decks to accomplish fast execution of composite structures. This paper considers the possibility to reduce the distance between the studs within the group, bellow the Eurocode limitations. This may lead to increased competitiveness of the prefabricated construction because more studs are placed in the group if negative effectives of smaller distances between studs are limited. The main purpose of this work is to investigate these limits and propose an analytical calculation model for prediction of the shear resistance of grouped stud arrangements in the deck pockets. An advanced FEA model, validated by results of push-out experiments, is used to analyze the shear behavior of the grouped stud with smaller distance between them than recommended by EN 1994-1. Calculation model for shear resistance, which is consistent with the existing Eurocode rules, is proposed based on a newly introduced equivalent diameter of the stud group, $d_G$. The new calculation model is validated by comparison to the results of FE parametric study. The distance between the studs in the longitudinal direction and the number of stud rows and columns in the group are considered as the main variables.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.4
• /
• pp.875-885
• /
• 2010

CBR (Case-Based Reasoning) is a technique to infer the relationships between existing data and case data, and the method to calculate similarity and Euclidean distance is mostly frequently being used. However, since those methods compare all the existing and case data, it also has a demerit that it takes much time for data search and filtering. Therefore, to solve this problem, various researches have been conducted. This paper suggests the method of SE(Speed Euclidean-distance) calculation that utilizes the patterns discovered in the existing process of computing similarity and Euclidean distance. Because SE calculation applies the patterns and weight found during inputting new cases and enables fast data extraction and short operation time, it can enhance computing speed for temporal or spatial restrictions and eliminate unnecessary computing operation. Through this experiment, it has been found that the proposed method improves performance in various computer environments or processing rate more efficiently than the existing method that extracts data using similarity or Euclidean method does.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.1
• /
• pp.25-31
• /
• 2017

The indoor location based service proposed in the study was assigned to target a moving user. Positioning in the outdoor environment is accurate while using GPS. However, in an indoor environment, positioning is inaccurate and difficult. In order to overcome this, studies of various techniques for positioning based on wireless communication such as Wi-Fi, Zigbee and Bluetooth are being performed. The RSSI value and the delivery signal of the bluetooth beacon are measured according to the distance, and to a database. It was applied calculating the value for the average RSSI and the RSSI filtering feedback. Filtering is used to reduce the error of the RSSI values that are measured at long distance. When average and feedback filtering coefficient are set with 0.5, irregular and highly RSSI values are decreased. As the distance increases, the range of error is confirmed to have a reduction when using a distance calculation correction algorithm. Finally, when using the RSSI measurement results filtering, it corrects an unstable signal. Also, the distance correction algorithm is used to reduce a range of errors.

• Journal of Korea Multimedia Society
• /
• v.4 no.5
• /
• pp.406-413
• /
• 2001

Ordinary high-speed block matching algorithms have a disadvantage that they need to get MAD (Mean Absolute Distance) as many as the number of search points due to comparing the MAD between the current frame's search block and the reference frame's search block. To solve such disadvantage of high-speed block matching algorithm, the proposed high-speed DS algorithm employs a MMAD calculation method using a specific characteristic that neighboring pixels have almost same values. In this thesis, we can get rid of unnecessary MAD calculation between the search point block by the new calculation method which uses the previously calculated MAD as the current search point and by breaking from the established MAD calculation method which calculates the MAD of a new search point by each search stage. Comparing with the established high-speed block matching algorithm, this new calculation's estimated movement error was shown as similar, and th total calculation amount decreased by $2FN^2Ep$.

• Journal of the Korean Society for Precision Engineering
• /
• v.24 no.9
• /
• pp.148-157
• /
• 2007

A new method which uses distance fields scheme and marching cube algorithm is proposed in order to get an accurate offset model of arbitrary shapes composed of triangular net. In the method, the space bounding the triangular net is divided into smaller cells. For the efficient calculation of distance fields, valid cells which will generate a portion of offset model are selected previously by the suggested detection algorithm. These valid cells are divided again into much smaller voxels which assure required accuracy. At each voxel distance fields are created by calculating the minimum distances between corner points of voxels and triangular net. After generating the whole distance fields, the offset surface were constructed by using the conventional marching cube algorithm together with mesh smoothing scheme. The effectiveness and validity of this new offset method was demonstrated by performing numerical experiments for the various types of triangular net.

• Journal of the Korean Magnetic Resonance Society
• /
• v.20 no.4
• /
• pp.102-108
• /
• 2016

With the rapid increase of data on protein-protein interactions, the need for delineating the 3D structures of huge protein complexes has increased. The protocols for determining nuclear magnetic resonance (NMR) structure can be applied to modeling complex structures coupled with sparse experimental restraints. In this report, I suggest the use of multiple rigid bodies for improving the efficiency of NMR-assisted structure modeling of huge complexes using CYANA. By preparing a region of known structure as a new type of residue that has no torsion angle, one can facilitate the search of the conformational spaces. This method has a distinct advantage over the rigidification of a region with synthetic distance restraints, particularly for the calculation of huge molecules. I have demonstrated the idea with calculations of decaubiquitins that are linked via Lys6, Lys11, Lys27, Lys29, Lys33, Lys48, or Lys63, or head to tail. Here, the ubiquitin region consisting of residues 1-70 was treated as a rigid body with a new residue. The efficiency of the calculation was further demonstrated in Lys48-linked decaubiquitin with ambiguous distance restraints. The approach can be readily extended to either protein-protein complexes or large proteins consisting of several domains.